Topic: VanitySearch (Yet another address prefix finder) - page 27. (Read 32072 times)

Wow... 1000 years of of 1000W coffee machine running 5minutes  per day ;-)
GPUs are in Poland?

You using neuronetwork ? I think neuro network is good idea for searc privkeys from pubkeys. Because system (privkey,pubkey) is static and with static energy. This is not dynamic stochastix system.

PubK are only published if the adress has been used for an outgoing transaction. Of course ~ 80% of the adresses had an outgoing transaction, but for example the big wallets like 1Feex... has never had an outgoing transaction - therefore the pubK is not "published" on the blockchain.
Once again: my goal is not to find wallets with balance. My goal is to find lyrical prefixes.

Now I started something for such an "AI". Yes, it is nonlinear, but with a big dataset and epoches the AI may could crack the whole process, because it is still static, since A -> B. I took 50k pairs of random uncompressed adresses and splitted them into 2 cvs with input and output. I started 100k epoches. If it does not work it is ok, but it is worth a try.

Power: ~94KW
For #115 it consumed 94*13*24 = 29.3 MWh and the prize was 1.15BTC (+1.15 BCH)

holy shit man.. :-)

how many kW is it consuming per hour?
20? 150?

The puzzle is also detailed in the Kangaroo readme.
https://github.com/JeanLucPons/Kangaroo#example-of-usage

search for btc puzzle on bitcoin forum...

in short someone produced a transaction where several btc are spread over 256 addresses
the first address has 1 bit private key
the secon 2 bit priv
the third 3 bit
...
the 120'th uses a priv key comprised of the lower 120 bit's
and so on until 256 bit

all leading bits are 0

it is surmised that this is as much a puzzle to solve as it is a way to see if the security of btc is compromised "suddenly and in a significant way" if the addresses all got cracked in a short time..

what is puzzle transaction? sorry for all the questions, kind of new to it

Yes that right. 256 x Tesla V100.
With the GPU kernel of kangaroo optimized for V100 we have a power of 0.5Tera group operation per second.

I'm gonna answer this as I read your question, as in: what good would it do to know the public key anyway? In order to use the "Baby Step - Giant Step"  Algorithm (https://en.wikipedia.org/wiki/Baby-step_giant-step) you need to have the public key. So that's why

what r u'r rigs like?
really 256 x v100? that would be damn impressive ;-)

then you could use the kangaroo algo and try to calculate the private key to that public key and get access to the funds
or rather to use kagaroo instead of vanity search to do it faster

Personally We (me and zielar) are searching only for puzzle transactions, we have found 2 keys together with funds and of course, we got them !

AI is not really an intelligence rather a system that is a little "smarter" than traditional algos..
imagine this..
for a neural network u use a set of data with wich u train your model and leave a bit at the end that is not used for training but testing.
the training of this model however is no magic it is most likely just a bunch of "fancy" numerical aglorithms that most likely still just try the stupidest random things.. but a lot lot lot of them
then after the first run it is determined what stupid random choices actually brought on the desired result and the model "remembers" on what grounds these positive results where based on and achieved.
all that is called an "epoch" and is repeated. in the second epoch almost the same random stupid choices run is repeated but almost all of them now factor in what randomly brought on results in the first epoch.
this goes on for however many epochs you want or maybe until another epoch can't refine or beat the results of the previous run.
at that point the learning is done and cant be improved without changes to the model.

the problem in relation to this EC task here is simply that the first epoch would never yield any result'SSSSSS if even one (most likely not) so there would never be any result from wich to learn from.
and even IF u found something:
1. it would take the same time or more TO FIND as if u just used JC's prog
2. multiple results that would be needed to "learn" something aka training the model again same or more time needed
3. the math used by the EC prevents extracting anything "learnable" by whatever model u use in the AI

at least "3." is the theory and if someone would find a way to produce or force some state in with you could "infer" some information you would have found a way to produce collisions in the prosess like some researchers a few years ago.. they found a flaw in "SHA1"?! if i remember correctly..

and if that happend btc would imedietly collapse and be worthless or some realy nice whitehat hacker would work with the team on changing the algo while keeping everything under wraps..

what exactly do you need to search a pubkey for? what's the point?
let's say you have found a pubkey with funds, so?

Note that AI can solve "smooth" problems. So it is not possible to create a neural network to try to solve ECDLP because crypto over elliptic curve is highly non linear (contrary of smooth) and this non linearity is the base of the blockchain security. Lots of tests of non linearity (unpredictablty) are performed before that a hash function or a crypto system is used.

What exactly would the AI do in your idea?

I don't know what you mean by "published" their pubK but you should know that:

• Almost all coinbase transactions (newly generated coins) in the first two years were paid out to public key (P2PK-addresses). In other words: all these public keys are known as they are "published" in the blockchain.
• For all the P2PKH-addresses the public key is not known, only the hash, unless the address has been used even a single time in an outgoing transaction. In that case the public key is known and once again "published" in the blockchain.

So instead of claiming only a fraction of addresses have published their public keys I would say most of them are known. But once again: if you think you can use the "published" public key in order to find the corresponding private key I have bad news for you. That is not going to happen..

Exactly because of what said by TheArchaeologist, 125 bit range is already very large range will require ~1 year  on 256 V100.
If you count only the energy, puzzle #110 and #115 was with benefit but #120 is not or you need to get a low cost electricity.
Anyway, the mods to do in order to increase this limit is simple.


Even considering this small faction, you will still have more odds to win with a kangaroo or rho program.

Why did you limited it to 125 bit range?
Yes, but only a fraction of all adresses have published their pubK... I think it would be best to create an AI for this task.

I know you know Jean Luc but for the "get rich fast" newbies out there: just because the public key is known doesn't mean you will be able to find the private key by bruteforcing. The only time this has been done is with specific puzzle-transactions in which along with the public key the search space is predefined.