-
Notifications
You must be signed in to change notification settings - Fork 464
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
bigger bloom file #188
Comments
Not usefully. The bloom filter implementation has a "hash function" that can't address more than 32 bits. It takes advantage of the fact that the input value is already hashed, and just combines various chunks of it rather than hashing again. This works as long as the filter size is a power of two and the inputs are both big enough and have an approximately uniform distribution. I had planned to replace it with bloomslice which generalizes the technique, but I have been working on other things. I don't really understand why anyone is still interested in brainflayer - there are people who have written their own GPU-based tools to steal everything that can be stolen, and there doesn't seem to be any further academic work going on. |
Lovely and patient conversatiioon partner, as always... |
// gcc -o random130_5_2_TEST random130_5_2_TEST.c -lgmp #include <stdio.h> #define KEY_SIZE 64 // The desired key size int main(void) {
} |
I don't really appreciate the apparent (apologies if I've misread) sarcasm. For the puzzle coins, there is Pollard's kangaroo algorithm, which is faster than brute force. If you want to try random keys in the hopes of being lucky to find things before someone doing a faster search, you would be better off doubling the keys repeatedly from a random start point and clamping them when they get too big. I pushed all my unreleased work on it to a develop branch if you want to play with it. The doubling search algorithm is in there, as is an option to stop after checking a certain number of keys. You'll have to hack it to limit leading zeros. |
No, that was not sarcasm... : ) |
Have you actually tried estimating the expected value of what you're doing? I'm really curious. |
Not sure what you mean. At the time there are several apps to try this. I belong to Iceland's and Alberto's school. Now sports: I tried to MAKE your dev branch, but got an error message after git clone --single-branch --branch develop https://github.com/ryancdotorg/brainflayer.git |
"it works on my machine" - I have Ubuntu 20.04. Don't have time to try to troubleshoot it for you. |
No problem. You've done already enough. $ make all
|
Hello Ryan,
Would it be feasible to increase
#define BLOOM_SIZE (51210241024)
to
#define BLOOM_SIZE (102410241024)
in order to get a bigger bloom file?
The text was updated successfully, but these errors were encountered: