Thank you for putting yourself through the working of carefully analyzing my
proposition, Boris!
1) My demonstration concludes 12 bytes is still a very conservative figure for
the hashes. I'm not sure where did you get the 14 bytes figure. This is
2*(14-12) = 4 bytes less.
2) Thank you for poi
On Tue, Dec 19, 2023 at 11:07 AM wrote:
>
> Thank you for the question, Boris. That was an easy one:
>
> Short answer is Lamport hashes are protected by long hash of key fingerprint
> an ECC (Schnorr or otherwise conventional) public-key, which is not published
> until first transaction. For cla
Hello, colleagues
Since some of you seem to be enjoying my ideas and having a better time
understanding them than most of investors I share them with, here goes a white
paper of my proposed Kerckhoffian (non-obscure) protocol for
coercion-resistance in self-(not shared-)custody
https://github.c
Thank you for the question, Boris. That was an easy one:
Short answer is Lamport hashes are protected by long hash of key fingerprint an
ECC (Schnorr or otherwise conventional) public-key, which is not published
until first transaction. For clarity:
HL(.) = serial-work- and memory-*hard* hash w
