Bitcoin puzzle transaction ~32 BTC prize to who solves it

[farou9]

Let's guess puzzle 69, how long will it take to solve this problem?Six months, one year, three years or even longer.
Regarding prefixes:Is it faster to use the birthday argument to find hash160?Has anyone paid attention to this?

I can do it in 29671 days, I only need around 10 $ every day, to keep a steady rate. I'm already at 0.003276% of the scan. Are you in?

Yes, you can definitely force the H160 values/prefixes to repeat to your liking so that birthday argument applies. It's totally wrong to think that the birthday paradox simply applies for two people sharing the same birthday, whichever birthday it may be. It of course applies to two people that share the exact birthday you want them to have. Your mentor / ocult clan leader that obliges you people to pollute this thread every time the air starts to clean itself up,  is spot on!

i dont understand how we imply the birthday paradox in kangaroo method how is a random jumps will yield the same point at some STEP

The analysis of the Kangaroo method does not use the birthday paradox. Close but not exactly. The math behind it is clearly explained in many papers.

But this has nothing to do with address-only puzzles, which are simply brute-force problems. Anything else than this, if proven, automatically implies that secp256k1, SHA, and RIPEMD are all broken, since their cryptographic guarantees would be thrown at the trash.

Terminology question : isn’t birthday paradox the search of collision of 2 subsets of size sqrt(n) ?
If so I don’t really get how kangaroo is different ? By different do you mean implementation details like DP etc… or something else ?

Is there more then one meaning for Bp , wasn't it that in every 28 people there is a probability of 2 people with the same birthday , my question was how exactly does this idea of probability being implemented in the kangaroo method ,how are we saying that there is a probability of two points moving at some diffrent  random speed tbat at some point they will land on the same point

[lmajowka]

I made a video showing how to transfer using the MARApool, in case any one finds wallet 69 before koala
https://www.youtube.com/watch?v=clmmZTrEPfo

[Bram24732]

Let's guess puzzle 69, how long will it take to solve this problem?Six months, one year, three years or even longer.
Regarding prefixes:Is it faster to use the birthday argument to find hash160?Has anyone paid attention to this?

I can do it in 29671 days, I only need around 10 $ every day, to keep a steady rate. I'm already at 0.003276% of the scan. Are you in?

Yes, you can definitely force the H160 values/prefixes to repeat to your liking so that birthday argument applies. It's totally wrong to think that the birthday paradox simply applies for two people sharing the same birthday, whichever birthday it may be. It of course applies to two people that share the exact birthday you want them to have. Your mentor / ocult clan leader that obliges you people to pollute this thread every time the air starts to clean itself up,  is spot on!

i dont understand how we imply the birthday paradox in kangaroo method how is a random jumps will yield the same point at some STEP

The analysis of the Kangaroo method does not use the birthday paradox. Close but not exactly. The math behind it is clearly explained in many papers.

But this has nothing to do with address-only puzzles, which are simply brute-force problems. Anything else than this, if proven, automatically implies that secp256k1, SHA, and RIPEMD are all broken, since their cryptographic guarantees would be thrown at the trash.

Terminology question : isn’t birthday paradox the search of collision of 2 subsets of size sqrt(n) ?
If so I don’t really get how kangaroo is different ? By different do you mean implementation details like DP etc… or something else ?

You can't know if the unknown kangaroos are inside the set, or they exited it, so you can't apply b-day paradox to that analysis. Besides, it's not like a jump can select any element with equal chances, as it only goes forward, and it also has a maximum jump size.

B-day paradox is used by Gaudry-Schost method (which uses sets), not by Kangaroo. RC's Kangaroo is not technically a Kangaroo method.

Ok I learned about GS before kangaroos hence my confusion in the terminology. Not an expert there anyway

[farou9]

Let's guess puzzle 69, how long will it take to solve this problem?Six months, one year, three years or even longer.
Regarding prefixes:Is it faster to use the birthday argument to find hash160?Has anyone paid attention to this?

I can do it in 29671 days, I only need around 10 $ every day, to keep a steady rate. I'm already at 0.003276% of the scan. Are you in?

Yes, you can definitely force the H160 values/prefixes to repeat to your liking so that birthday argument applies. It's totally wrong to think that the birthday paradox simply applies for two people sharing the same birthday, whichever birthday it may be. It of course applies to two people that share the exact birthday you want them to have. Your mentor / ocult clan leader that obliges you people to pollute this thread every time the air starts to clean itself up,  is spot on!

i dont understand how we imply the birthday paradox in kangaroo method how is a random jumps will yield the same point at some STEP

The analysis of the Kangaroo method does not use the birthday paradox. Close but not exactly. The math behind it is clearly explained in many papers.

But this has nothing to do with address-only puzzles, which are simply brute-force problems. Anything else than this, if proven, automatically implies that secp256k1, SHA, and RIPEMD are all broken, since their cryptographic guarantees would be thrown at the trash.

Terminology question : isn’t birthday paradox the search of collision of 2 subsets of size sqrt(n) ?
If so I don’t really get how kangaroo is different ? By different do you mean implementation details like DP etc… or something else ?

You can't know if the unknown kangaroos are inside the set, or they exited it, so you can't apply b-day paradox to that analysis. Besides, it's not like a jump can select any element with equal chances, as it only goes forward, and it also has a maximum jump size.

B-day paradox is used by Gaudry-Schost method (which uses sets), not by Kangaroo. RC's Kangaroo is not technically a Kangaroo method.

Ok I learned about GS before kangaroos hence my confusion in the terminology. Not an expert there anyway

what is GS or is it you mean baby-step_giant-step

[Bram24732]

what is GS or is it you mean baby-step_giant-step

Gaudry-Schost

I don't know why but I'm smelling a big scam. Because a newbie that offer more than 12 000€ to solve a following of numbers this is strange...

I completely agree with you.

Yay let's post with no context whatsoever

[farou9]

I don't know why but I'm smelling a big scam. Because a newbie that offer more than 12 000€ to solve a following of numbers this is strange...

I completely agree with you.

The decade agreement

[E36cat]

I don't know why but I'm smelling a big scam. Because a newbie that offer more than 12 000€ to solve a following of numbers this is strange...

I completely agree with you.

it took you 9 years to agree =))

[Bram24732]

I don't know why but I'm smelling a big scam. Because a newbie that offer more than 12 000€ to solve a following of numbers this is strange...

I completely agree with you.

it took you 9 years to agree =))

And to be wrong haha

[brainless]

I found this haha ​​it's a joke 
Hash160: 61eb8a50c8673cd3fd9d73ee90c733ff24b6e64f
BTC Address: 19vkiEajf1jD23km6G6DdSQXH2VhWP3kHG

I found this one:
PK:   19665F6056877D8B5B
Public Key    : 02502C2518C06231BDDACA06491E0B790DB9478B56B8DCD2E255CA7E7380E97267
Found Hash160 : 61eb8a50c8673c376c4bdb96d179afecaadbd140

I'm very curious about the distance between the 2 addresses.

I have too
Found Hash160 : 61eb8a50c86b......  1 piece
Found Hash160 : 61eb8a50c86.........  3 piece
This could help you to found distance close to key ?

---------------------------------------------
Who buy me a coffee....

[strojen1]

I found this exact prefix '19vkiEajfhu' within the 69-bit range, but from what I've read from more knowledgeable people on the forum, it may not have much significance idk. I'm just a hobbyist

[bibilgin]

I found this exact prefix '19vkiEajfhu' within the 69-bit range, but from what I've read from more knowledgeable people on the forum, it may not have much significance idk. I'm just a hobbyist

You need to prove the 19vkiEajfhu prefix you found.

Otherwise, you won't be listened to much.


Edit;

After scanning 9000 trillion keys for the actual address (the good hash) of Puzzle 69, there was still no 53 bits or larger prefix found.

61eb8a50c86b0584bb727dd65bed8d2400d6d5aa

H160 - Is the first 61eb8a50c86b0 the one you mentioned as 53 bits?

If that's what you mean, I have it.

[brainless]

you should already be rich enough to participate in this puzzle.

So, honestly speaking, this puzzle was made by a rich person for rich people—the rich will get richer, and the poor will get poorer. Right?   

Yep... Or maybe you manage to use vast.ai for free by hacking their system—exploiting 3,000 GPUs, stolen credit cards, or even the puzzle creator himself, as you’ve already written somewhere. The problem is, you could end up in prison. It’s better to just go fishing.

Have you tried to make version with load of list hash160 instead of 1 h160
And speed effects ?
If still not worked...
Could you try to develop this version for load of hash160 list

[strojen1]

I found this exact prefix '19vkiEajfhu' within the 69-bit range, but from what I've read from more knowledgeable people on the forum, it may not have much significance idk. I'm just a hobbyist

You need to prove the 19vkiEajfhu prefix you found.

Otherwise, you won't be listened to much.


Edit;

After scanning 9000 trillion keys for the actual address (the good hash) of Puzzle 69, there was still no 53 bits or larger prefix found.

61eb8a50c86b0584bb727dd65bed8d2400d6d5aa

H160 - Is the first 61eb8a50c86b0 the one you mentioned as 53 bits?

If that's what you mean, I have it.

19vkiEajfhuAsLEKoBmxpNrGpZYBbCPoPr - this is the address I found. Honestly, there are things I don't fully understand. I use FixedPaul's vanitysearch (thanks to him). I'm searching completely randomly within the 69-bit range. Normally, I don't search for prefixes but sometimes, just out of frustration from not finding anything, I’ll throw in a prefix like '19vkiEajf or 19vkiEajfh' — kind of tricking myself into thinking maybe I’m getting close. That’s actually how I came across this address. Like I said, I’m just doing this for fun, not sure if I’m doing it right or wrong, but I’m enjoying it.

[mcdouglasx]

It's easy to understand; it's better to focus on the development of probabilistic search methods, for the logical reason that we are one step away from GPU farms becoming completely unprofitable.

[Niekko]

... if continue like this, it would be advisable to open a 'Puzzle Prefix Marketplace' thread, at a fixed rate per quintal.

[kTimesG]

H160 - Is the first 61eb8a50c86b0 the one you mentioned as 53 bits?

If that's what you mean, I have it.

It's not. It's 52 bits. Do you know anything about the hexidecimal base? It's really simple: one char is exactly 4 bits.

For those who hunt vanity address prefixes:

Address A: 19vkiEajfh6SFxXEJoFEJxQm7VJucnHqn7
Address B: 19vkiEajfiE6Wwh83YH2LMV1rgx5pivsnY

If you believe address A is better because it has a longer prefix:

Please stop what you are doing and rethink about your life, maybe also learn about how numerical base conversions work.

If you still didn't get what's wrong here:

Address B is 32 times more difficult to find, and it's also 32 times closer to the correct prefix of the correct H160. Oh, and except for statistical analysis matching prefixes does not help with anything. Again - if it would, then Bitcoin itself along with several other cryptos would be broken and their value would go to 0 before you even manage to sell the reward for fiat money. Do not listen to the voodoo magicians, you will waste your time. If you still want to lose it anyway, at least understand why you can't base your search on vanity address prefixes, you will most likely find things that are way off from what you think you're searching for.

[filo1992]

H160 - Is the first 61eb8a50c86b0 the one you mentioned as 53 bits?

If that's what you mean, I have it.

It's not. It's 52 bits. Do you know anything about the hexidecimal base? It's really simple: one char is exactly 4 bits.

For those who hunt vanity address prefixes:

Address A: 19vkiEajfh6SFxXEJoFEJxQm7VJucnHqn7
Address B: 19vkiEajfiE6Wwh83YH2LMV1rgx5pivsnY

If you believe address A is better because it has a longer prefix:

Please stop what you are doing and rethink about your life, maybe also learn about how numerical base conversions work.

If you still didn't get what's wrong here:

Address B is 32 times more difficult to find, and it's also 32 times closer to the correct prefix of the correct H160. Oh, and except for statistical analysis matching prefixes does not help with anything. Again - if it would, then Bitcoin itself along with several other cryptos would be broken and their value would go to 0 before you even manage to sell the reward for fiat money. Do not listen to the voodoo magicians, you will waste your time. If you still want to lose it anyway, at least understand why you can't base your search on vanity address prefixes, you will most likely find things that are way off from what you think you're searching for.

could you explain to me how you can say that address B is closer to hash160 searched?
what can you tell me about this 19vkiEajMoXn823Bc1Cims437r8EzMJDFL

[kTimesG]

Address A: 19vkiEajfh6SFxXEJoFEJxQm7VJucnHqn7
Address B: 19vkiEajfiE6Wwh83YH2LMV1rgx5pivsnY

Address B is 32 times more difficult to find, and it's also 32 times closer to the correct prefix of the correct H160.

could you explain to me how you can say that address B is closer to hash160 searched?
what can you tell me about this 19vkiEajMoXn823Bc1Cims437r8EzMJDFL

I'm gonna let someone else explain it, because I am not your teacher, nor anyone else's. Facts are just facts. If you have doubts, but you don't want to invest the time to understand why B has a longer prefix than A, what can I say? Join the prefix hunters club and good luck.

[bibilgin]

could you explain to me how you can say that address B is closer to hash160 searched?
what can you tell me about this 19vkiEajMoXn823Bc1Cims437r8EzMJDFL

4th Wallet
19vkiEajfi9qHT4qKZaTL79KbcNEmo2R1W
(61eb8a50c86b0b742ef543cfc90f783cd4173591)

3rd Wallet
19vkiEajfi3wTwcqwda3z8YvZfq7FAVM13
(61eb8a50c86b09010812beabf6a32f0441f53660)

--19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG (69th Wallet)
-- 61eb8a50c86b0584bb727dd65bed8d2400d6d5aa

1st Wallet
19vkiEajfhqM3xBVpcUYMRiiYQpPr14Fdy
(61eb8a50c86b03c4e818ad1bef0a82a1f042fcf6)

2nd Wallet
19vkiEajfhky6tDAmvqbZGM9WLXLELnWU8
(61eb8a50c86b01f2f92f68876b8c3752a407e18d)

I listed them as 1 - 2 - 3 - 4 which are close in order.

So the important thing is not that it starts with 19vkiEajfh.

19vkiEajfhuAsLEKoBmxpNrGpZYBbCPoPr - this is the address I found. Honestly, there are things I don't fully understand. I use FixedPaul's vanitysearch (thanks to him). I'm searching completely randomly within the 69-bit range. Normally, I don't search for prefixes but sometimes, just out of frustration from not finding anything, I’ll throw in a prefix like '19vkiEajf or 19vkiEajfh' — kind of tricking myself into thinking maybe I’m getting close. That’s actually how I came across this address. Like I said, I’m just doing this for fun, not sure if I’m doing it right or wrong, but I’m enjoying it.

19vkiEajfhuAsLEKoBmxpNrGpZYBbCPoPr
If you have the address, can you share the hex code?

Or can you change the prefix?

[WanderingPhilospher]

Somebody let me know if I find the full address before Bram

t.me/puzzleprefixes

Those are coming in real-time. But I may be asleep when the real deal Holyfield address is found...so, wake me, if need be, LOL!