Here's a variation of your idea that is more backwards compatible and, IMHO, more elegant: You require that the most significant bits (25, following your example) of the public key y = gx be 0. This, in itself, is a proof of work, as one needs to try approx. 224x's in order to find such a y.
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png)
timeasmymeasure
Re: Zooko's triangle
Date: 2007-03-09 06:39 pm (UTC)You require that the most significant bits (25, following your example) of the public key y = gx be 0. This, in itself, is a proof of work, as one needs to try approx. 224 x's in order to find such a y.