Dear. Peter,
I'm not good at English, so I'm sorry for the poor explanation.
I thought that BECH32M_CONST could be created from hrp and data
instead of constants.
I thought that the error position would be the same as bech32 by
recalculating the value created from hrp and data.
If this were pos
Dear Pieter,
I read the BIP draft of Bech32m and implemented it in Go.
Let me ask you one question.
Does Checksum have to be fixed?
The 'bech32_verify_checksum' function has hrp and data as parameters,
so how about committing Checksum with these two values?
For example, calculate Checksum from h
ted key for which the
> attacker can sign alone (without requiring Alice's partial signature). The
> Schnorr BIP links to the MuSig paper which describes a secure key aggregation
> scheme. See https://eprint.iacr.org/2018/068
>
> On 8/7/18 6:35 AM, nakagat via bitcoin
Hi all,
I wrote t-of-k threshold signature procedure using bip-schnorr.
If you have time to review and give feedback, I’d really appreciate it.
Thanks in advance!
Threshold Signatures
https://gist.github.com/tnakagawa/e6cec9a89f698997dc58a09db541e1eb
Original
https://github.com/sipa/bips/blob/b
Hi all,
I wrote a multisignature procedure using bip-schnorr.
If you have time to review and give feedback, I’d really appreciate it.
Thanks in advance!
Multisignature
https://gist.github.com/tnakagawa/0c3bc74a9a44bd26af9b9248dfbe598b
Original
https://github.com/sipa/bips/blob/bip-schnorr/bip-s
