Alberto
I propose to have some checksum function that the user can call on request. Lets to call this new funtion `bloom_checksum` ``` int bloom_checksum(struct bloom * bloom) { return (murmurhash2(bloom->bf,...
Hi this is just an observation not a bug. I'm working with this bloom library but with with several changes. One of the problems what i notice with the currents...
I'm already using the version Two it works very well for some numer of items but I notice that the unsigned int bit limits the amount of real reserved memory....
I will open this issue to mark as pending to transform all the address to RDM and search those through the RMD160 method internally.
the new secp256k1 is not compiling in termux sorry guys i will work in that.
Hi every one, hi JLP i hope you read this. Current approach for BSGS is more o less the, example: ``` Target Key 99 known range 75-100 (Like puzzles etc...)...
input file: ``` 400 800000000000000000000000000000 8000000000000000000000001FFFFF 03af08c568fbbc8c878252b72ff8cc03101b8f5ef61611dfdc3289719c6dec7dc2 032a08f56606f16c2bc60e77e5fe333c4d0e2114dd7eb8cf77b542bbc9c15868d9 ``` Only one of those keys were found, both are in the middle of the given range Private Key: 8000000000000000000000000FFFFF Public key:...
I been testing this funtion in my keyhunt tool, and some times i get a wrong result, this is because sometimes you are working adding points in a blind way,...