Rusty Russell [ARCHIVE] on Nostr: 📅 Original date posted:2016-03-08 📝 Original message: Nicolas Dorier ...
📅 Original date posted:2016-03-08
📝 Original message:
Nicolas Dorier <nicolas.dorier at gmail.com> writes:
> Great, indeed we had same idea, I don't see how it solve the hashes in
> advance.
> As Alice knows
>
> H(1000000) = <random secret seed>).
>
> If she need the hash to the first commitment she need to hash the random secret
> seed 1000000 times. I think it is exactly the same problem as it is the exact
> same idea said differently.
See:
https://github.com/rustyrussell/ccan/tree/master/ccan/crypto/shachain
Cheers,
Rusty.
📝 Original message:
Nicolas Dorier <nicolas.dorier at gmail.com> writes:
> Great, indeed we had same idea, I don't see how it solve the hashes in
> advance.
> As Alice knows
>
> H(1000000) = <random secret seed>).
>
> If she need the hash to the first commitment she need to hash the random secret
> seed 1000000 times. I think it is exactly the same problem as it is the exact
> same idea said differently.
See:
https://github.com/rustyrussell/ccan/tree/master/ccan/crypto/shachain
Cheers,
Rusty.