Bitcoin puzzle transaction ~32 BTC prize to who solves it

[kTimesG]

What the f*** is a probabilistic brute force method? Is it brute force, or is it not? Is it more efficient or is it not better than something else? Make up your mind. So many freaking things that smell so badly of logical non-sense, when a normal person is trying to read and understand your posts.

Maybe you're a genius, who knows. Those people are never understood by the rational people, since they function on a totally different frequence.

This thread may give a normal person a brain aneurysm once they see fellow people failing to see plain out contradictions when they are being drawn right under their nose more times than there are keys in Puzzle 256. We don't need a freaking diploma in rocket science to have some common sense... I give up.

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.

[Bram24732]

I’ll clarify then. Of course your method works, you’re checking all keys eventually.
I’m saying there is no speed boost doing it this way instead of doing it in sequence, only drawbacks because of gap management.Those drawbacks are also minimal if the ranges are big enough, but then you’re only adding complexity to the brute force process for no good reason.

My point is not that it is necessarily better, but that it is the most efficient probabilistic search for brute force in the "homemade" context, because you are trying your luck with the few resources you might have, based on probabilistic expectation. In your "pool" context, a "full random" search is the best option, because it is the easiest way to deal with the problem.

However, in the context of someone who only has a single GPU, a search like this would be better than yours, as they could spend years searching within just a few sub-ranges.

In other words, the optimal strategy depends directly on the resources available and the time horizon at hand.

Nope, still not. Even with a single GPU the odds of both methods are EXACTLY the same. You have 1/(2**67 - nbKeysAlreadyChecked) chance for every key you check, no matter the order. Trying to use probabilities in arbitrary defined ranges does not improve odds because just like with a coin flip, each event is independent.

[mcdouglasx]

What the f*** is a probabilistic brute force method? Is it brute force, or is it not? Is it more efficient or is it not better than something else? Make up your mind. So many freaking things that smell so badly of logical non-sense, when a normal person is trying to read and understand your posts.

Maybe you're a genius, who knows. Those people are never understood by the rational people, since they function on a totally different frequence.

This thread may give a normal person a brain aneurysm once they see fellow people failing to see plain out contradictions when they are being drawn right under their nose more times than there are keys in Puzzle 256. We don't need a freaking diploma in rocket science to have some common sense... I give up.

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.

Your problem is that you take all opinions that differ from yours as a call to war, and that says more about you than about me.

Nope, still not. Even with a single GPU the odds of both methods are EXACTLY the same. You have 1/(2**67 - nbKeysAlreadyChecked) chance for every key you check, no matter the order. Trying to use probabilities in arbitrary defined ranges does not improve odds because just like with a coin flip, each event is independent.

I disagree because I replicate your scenario and mine (as it should be done before giving an opinion), and in mine, I always end up obtaining the key first. Although I could be wrong, these are the data I obtain in each test, within a friendly range for my limited resources.

[Bram24732]

What the f*** is a probabilistic brute force method? Is it brute force, or is it not? Is it more efficient or is it not better than something else? Make up your mind. So many freaking things that smell so badly of logical non-sense, when a normal person is trying to read and understand your posts.

Maybe you're a genius, who knows. Those people are never understood by the rational people, since they function on a totally different frequence.

This thread may give a normal person a brain aneurysm once they see fellow people failing to see plain out contradictions when they are being drawn right under their nose more times than there are keys in Puzzle 256. We don't need a freaking diploma in rocket science to have some common sense... I give up.

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.

Your problem is that you take all opinions that differ from yours as a call to war, and that says more about you than about me.

Nope, still not. Even with a single GPU the odds of both methods are EXACTLY the same. You have 1/(2**67 - nbKeysAlreadyChecked) chance for every key you check, no matter the order. Trying to use probabilities in arbitrary defined ranges does not improve odds because just like with a coin flip, each event is independent.

I disagree because I replicate your scenario and mine (as it should be done before giving an opinion), and in mine, I always end up obtaining the key first. Although I could be wrong, these are the data I obtain in each test, within a friendly range for my limited resources.

The reason you get this is because the prefix is small enough when compared to the range size.
This is of no use when the prefix size becomes closer to the range size. Like when the prefix is 67 bits and the range also is 67 bits, like for any of those puzzles.

[mcdouglasx]

What the f*** is a probabilistic brute force method? Is it brute force, or is it not? Is it more efficient or is it not better than something else? Make up your mind. So many freaking things that smell so badly of logical non-sense, when a normal person is trying to read and understand your posts.

Maybe you're a genius, who knows. Those people are never understood by the rational people, since they function on a totally different frequence.

This thread may give a normal person a brain aneurysm once they see fellow people failing to see plain out contradictions when they are being drawn right under their nose more times than there are keys in Puzzle 256. We don't need a freaking diploma in rocket science to have some common sense... I give up.

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.

Your problem is that you take all opinions that differ from yours as a call to war, and that says more about you than about me.

Nope, still not. Even with a single GPU the odds of both methods are EXACTLY the same. You have 1/(2**67 - nbKeysAlreadyChecked) chance for every key you check, no matter the order. Trying to use probabilities in arbitrary defined ranges does not improve odds because just like with a coin flip, each event is independent.

I disagree because I replicate your scenario and mine (as it should be done before giving an opinion), and in mine, I always end up obtaining the key first. Although I could be wrong, these are the data I obtain in each test, within a friendly range for my limited resources.

The reason you get this is because the prefix is small enough when compared to the range size.
This is of no use when the prefix size becomes closer to the range size. Like when the prefix is 67 bits and the range also is 67 bits, like for any of those puzzles.

As the prefixes become smaller, you actually introduce a greater margin of error because the probability of collision or selecting an incorrect value increases.



A good interpretation, teaching us about humility in mathematics and probabilities.

https://priceonomics.com/the-time-everyone-corrected-the-worlds-smartest/

[Bram24732]

As the prefixes become smaller, you actually introduce a greater margin of error because the probability of collision or selecting an incorrect value increases.

I don't get what you mean

[kTimesG]

What the f*** is a probabilistic brute force method? Is it brute force, or is it not? Is it more efficient or is it not better than something else? Make up your mind. So many freaking things that smell so badly of logical non-sense, when a normal person is trying to read and understand your posts.

Maybe you're a genius, who knows. Those people are never understood by the rational people, since they function on a totally different frequence.

This thread may give a normal person a brain aneurysm once they see fellow people failing to see plain out contradictions when they are being drawn right under their nose more times than there are keys in Puzzle 256. We don't need a freaking diploma in rocket science to have some common sense... I give up.

In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.

Your problem is that you take all opinions that differ from yours as a call to war, and that says more about you than about me.

No, my problem is that my eyes start to bleed out while I'm reading your posts, and my non-genius intelligence is yelling "why are you doing this to me again".

Don't know what yours is, though. I'm not of specialty. You seem to be revolutionizing whole paradigms every day, and when your arguments are obliterated as starting from invalid premises in the first place, you start off stronger than ever the next day. Maybe in that multiverse from where you traveled here to us mortals, logical contradictions like "slower is more efficient" are the basis on how things work. Not here, though.

[Akito S. M. Hosana]

...Need to debug and fix this..

Have you made any progress?   

[mcdouglasx]

No, my problem is that my eyes start to bleed out while I'm reading your posts, and my non-genius intelligence is yelling "why are you doing this to me again".

Don't know what yours is, though. I'm not of specialty. You seem to be revolutionizing whole paradigms every day, and when your arguments are obliterated as starting from invalid premises in the first place, you start off stronger than ever the next day. Maybe in that multiverse from where you traveled here to us mortals, logical contradictions like "slower is more efficient" are the basis on how things work. Not here, though.

Bro, did you know there's an ignore button? If you can't handle my ideas or anyone else's here, then just don't look at them, go for it! But I have my own opinion; I know it works. Maybe you'll say it's not the fastest, but it works! And I'm not going to change it just because you're acting like the 'Karen' of the thread—this isn't 'X'.

[nomachine]

...Need to debug and fix this..

Have you made any progress?  

./Cyclone -h e0b8a2baee1b77fc703455f39d51477451fc8cfc -r AF6E3791FC0000000:AF6E3791FCfffffff -t 1 -b 5 -S

================= WORK IN PROGRESS =================
Puzzle/Bits   : 29
Target Hash160: e0b8a2baee1b77fc703455f39d51477451fc8cfc
Prefix length : 5 bytes
Mode          : Sequential
CPU Threads   : 1
Mkeys/s       : 4.41
Total Checked : 264354304
Elapsed Time  : 00:01:00
Range         : af6e3791fc0000000:af6e3791fcfffffff
Progress      : 98.479652 %
Progress Save : 0
Stride        : 1
================= NO MATCH FOUND =================
No match found in range: AF6E3791FC0000000:AF6E3791FCfffffff
Total Checked : 268961280
Elapsed Time  : 00:01:01
Speed         : 4.41 Mkeys/s
No match found after processing all ranges.

https://github.com/NoMachine1/Cyclone

[Akito S. M. Hosana]

================= NO MATCH FOUND =================
No match found in range: AF6E3791FC0000000:AF6E3791FCfffffff
Total Checked : 268961280
Elapsed Time  : 00:01:01
Speed         : 4.41 Mkeys/s
No match found after processing all ranges.

https://github.com/NoMachine1/Cyclone

I see that the printing method has also changed. Better. Thank you.  

[ronin445]

I don't know why but i also search 68 mostly in this range.. lol

  Puzzle started with "E0" two times  (8 and 44)
     

 

[Dom1nic]

Hello everyone,
I'm ~ new to this thread and didn't have 59 sats to pay for the proxyban so I could post.
First things first, my skills on a scale of 1 to 10
Math 0
Code 0
Dumb luck 11
Yes, I'm here for the magical way to solve the puzzle.

So, what is the latest magical way to find the key?

[Denevron]

Hello everyone,
I'm ~ new to this thread and didn't have 59 sats to pay for the proxyban so I could post.
First things first, my skills on a scale of 1 to 10
Math 0
Code 0
Dumb luck 11
Yes, I'm here for the magical way to solve the puzzle.

So, what is the latest magical way to find the key?

you can tell fortunes on coffee grounds

[Menowa*]

I don't know why but i also search 68 mostly in this range.. lol

  Puzzle started with "E0" two times  (8 and 44)
     

 

U guys are grabbing into whatever nonsense theories ur brain makes up to beleieve ur getting closer to solve it

[Dom1nic]

So, what is the latest magical way to find the key?

you can tell fortunes on coffee grounds

Coffee is only magical when you drink it, the rest is fake!

[papiro08]

Hello everyone,
I'm ~ new to this thread and didn't have 59 sats to pay for the proxyban so I could post.
First things first, my skills on a scale of 1 to 10
Math 0
Code 0
Dumb luck 11
Yes, I'm here for the magical way to solve the puzzle.

So, what is the latest magical way to find the key?

Grab a keyboard you have lying around—if it's missing keys, it doesn't matter—and start typing on everything you can press. With a lot of luck, you'll have figured out all 17 digits of the key.

[Akito S. M. Hosana]

I don't know why but i also search 68 mostly in this range.. lol

  Puzzle started with "E0" two times  (8 and 44)
     

 

This fortune teller told me that puzzle 68 starts with E0. He also thinks the creator of the puzzle is Freemson and is probably Egyptian. Additionally, he mentioned something about having an illegitimate child with a neighbor

[nomachine]

the creator of the puzzle is Freemson and is probably Egyptian.

hahahahaha this one really make me laugh 

[brainless]

One more features should be inside cyclone
Example
./Cyclone -h 1234567890abcdef -p 68  - comb file1.txt file2.txt file3.txt

-comb files are contain hex char and generate sequence combination for check
This feature will also make product more better