Article on the LBC in Fortune magazine. Not researched terribly well.
http://fortune.com/2017/04/15/bitcoin-collider/
"The group has successfully opened over a dozen wallets, though only three had any bitcoin in them."
http://fortune.com/2017/04/15/bitcoin-collider/
"The group has successfully opened over a dozen wallets, though only three had any bitcoin in them."
The link in the above is how I found this thread.
https://forums.khronos.org/showthread.php/13206-Need-OpenCL-program-(oclvanitygen)-modification?p=41031#post41031
Quote
Hi,
I need to modify an OpenCL programm called oclvanitygen (https://github.com/samr7/vanitygen) which is used to generate (= search for) "Vanity" Bitcoin addresses.
The modification - i believe - should be quite ease as it would mainly consist of handling the program a specific private-key offset, where oclvanitygen would start its search from.
Currently according to documentation, oclvanitygen simply chooses some offset randomly and then starts counting from that offset for 100 mio keys until it gets another offset randomly.
I tried to get a grip on the code (oclvanitygen.c), but gave up. Somehow it doesn't fit into what I consider a well structured program.
And of course I'm very inexperienced in OpenCL, so even a well structured program may not look like that to me.
In case you'd be interested to help out, we can certainly agree on some compensation for your efforts. In case you're interested simply PM me.
If the modifications are successful and you think there is more optimization potential (speed), we can of course continue the project.
Rico
I need to modify an OpenCL programm called oclvanitygen (https://github.com/samr7/vanitygen) which is used to generate (= search for) "Vanity" Bitcoin addresses.
The modification - i believe - should be quite ease as it would mainly consist of handling the program a specific private-key offset, where oclvanitygen would start its search from.
Currently according to documentation, oclvanitygen simply chooses some offset randomly and then starts counting from that offset for 100 mio keys until it gets another offset randomly.
I tried to get a grip on the code (oclvanitygen.c), but gave up. Somehow it doesn't fit into what I consider a well structured program.
And of course I'm very inexperienced in OpenCL, so even a well structured program may not look like that to me.
In case you'd be interested to help out, we can certainly agree on some compensation for your efforts. In case you're interested simply PM me.
If the modifications are successful and you think there is more optimization potential (speed), we can of course continue the project.
Rico
Akin to "I'm an expert banana split maker. Does anybody know where I can source bananas? Cavendish preferred but will entertain the dwarf variety."
How does one shut down the Large Bitcoin Collider? By proclaiming that I may or may not know the true identity of the person behind it.
Meanwhile, I'm conducting a survey to see if anybody's interested in participating in my Large Crypto Collider project capable of unlocking all known keys of past, present and future cryptocurrency wallet addresses regardless the flavor (e.g. RateCoin, NOT Quark types).
I do need help in one aspect so to build the MOAC (Mother of all Colliders): Should the following be hooked up in series or parallel?
