Does bitcoin properly handle the case of a hash collision? no - because it is
considered too unlikely. The case of I_L >= n is also astronomically unlikely,
so it's more a matter of improved performance and simpler data structures under
expected circumstances and taking that less than 1 in 2^127
> Does anyone see any concerns when it comes to security of the proposed
> change?
Yes. This proposal is less secure.
It is incompatible in theory with existing implementations of the
specification. The incompatibility is also a potentially a security
problem because it may cause users to belie
Hi all!
I would like to discuss invalidation of nodes in BIP32. Currently the
document says:
a) Public CKD
In case I_L >= n or ki = 0, the resulting key is invalid, and one should
proceed with the next value for i.
b) Private CKD
In case I_L >= n or Ki is the point at infinity, the resulting k
3 matches
Mail list logo
