Pages:
Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 50. (Read 238269 times)

hero member
Activity: 630
Merit: 731
Bitcoin g33k
Wow, Gratz to the solver of puzzle 130  Shocked  Smiley

yeah, now it really gets weird Smiley Cheesy
member
Activity: 503
Merit: 38

We Are In the Endgame Now  Grin
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
Wow, Gratz to the solver of puzzle 130  Shocked  Smiley

f-k,130 solved !!!
jr. member
Activity: 47
Merit: 13
Wow, Gratz to the solver of puzzle 130  Shocked  Smiley
newbie
Activity: 22
Merit: 1
why the founder of Puzzle was transfered coins from 120 and from 125?

Where do you get that? Without any proof this is bullshit...

Just ask your self why the author of this challenge will move 1.2 and 12.5 bitcoins, when he increase all other puzzles in x10 factor? it wen from some 100 btc to near 1000

 Roll Eyes Roll Eyes Roll Eyes Huh Huh
3Emiwzxme7Mrj4d89uqohXNncnRM15YESs https://www.blockchain.com/explorer/addresses/BTC/3Emiwzxme7Mrj4d89uqohXNncnRM15YESs
Because, likely, he wanted to make the community work on the lower bits, but without the private key. Maybe the solution provided by Kangaroo answered all the questions related to the vulnerability when revealing the pubkey... The funds from those wallets were transferred by one person to a single address. Do you really think that someone wealthy enough, who can afford not to touch the prize money from 120 and 125 bits, would bother solving the puzzle at all, let alone succeed twice?! It's nonsense to think otherwise in this case.

He also didn't even claim the Bitcoin Cash and others on that addresses... Very suspicious   Undecided
The Puzzle Creator is simply mocking the community. Supporting this is the fact that only one bot participated in the bot race! Do you really believe that everyone else on the planet turned off their bots, leaving just one, which ultimately "intercepted" the transaction? Plus, how did the original sender of the prize for Puzzle 66 know that the next block would be mined a minute after the prize was sent? Clearly, Puzzle 66 was exposed by the creator, who then intercepted it himself. After the revelation about Mara Pool, interest in the puzzle and creating bots significantly declined. As well as the absence of any victim on this forum who would be shouting that their winning bitcoins were intercepted! After all, if there were such a person, we could request their Twitter, and knowing their identity, it wouldn't be hard to establish a connection with the creator. There's also a bunch of defenders of the Puzzle Creator, probably hoping to get his favor and a few crumbs from him. Even AlbertoBSD reacts very painfully to any criticism directed at the Puzzle Creator... Don’t waste your money, time, and most importantly, your nerves on searching for something that doesn’t belong to you. We are like a donkey with a carrot dangling on a stick in front of its nose.
member
Activity: 503
Merit: 38
what processor do you have, this speed is for 1 core
and with bitcoin addresses that rust generates how many addresses per second

Rayon crate is designed to automatically utilize all available CPU cores  


processor       : 0
vendor_id       : AuthenticAMD
cpu family      : 23
model           : 113
model name      : AMD Ryzen 5 3600 6-Core Processor

For BTC, about 3600000 addresses/second on all cores.

Bottleneck.
jr. member
Activity: 67
Merit: 1
what processor do you have, this speed is for 1 core
and with bitcoin addresses that rust generates how many addresses per second
member
Activity: 503
Merit: 38

Bro, can you make example of a scrypt with your super fast RNG generator on rust ?

please



Code:
use rand::prelude::*;
use rand::rngs::SmallRng;
use rand::seq::SliceRandom;
use rand::SeedableRng;
use rayon::prelude::*;
use std::time::Instant;

fn generate_samples(iterations: usize) {
    (0..iterations).into_par_iter().for_each(|_| {
        let mut rng = SmallRng::from_entropy();  
        let mut b: Vec = (2..=39).rev().collect();
        let k = rng.gen_range(1..=b.len());
        let mut c: Vec = b.as_mut_slice().choose_multiple(&mut rng, k).cloned().collect();
        c.sort_by(|a, b| b.cmp(a));  
        //println!("{:?}", c);
    });
}

fn main() {
    let iterations = 100_000_000;  
    let start_time = Instant::now();
    
    generate_samples(iterations);  

    let duration = start_time.elapsed();
    println!("Generated {} samples in {:?}", iterations, duration);

    let samples_per_second = iterations as f64 / duration.as_secs_f64();
    println!("Samples per second: {}", samples_per_second);
}


Code:
[package]
name = "small_rng_test"
version = "0.1.0"
edition = "2021"

[dependencies]
rand = { version = "0.8", features = ["small_rng"] }  
rayon = "1.6"  

[profile.release]
opt-level = 3  

This is test without printing any results.

./small_rng_test
Generated 100000000 samples in 7.973001363s
Samples per second: 12542328.220846185

The beast... Grin
hero member
Activity: 630
Merit: 731
Bitcoin g33k
@digaran: stop talking to yourself and please visit the doctor
jr. member
Activity: 79
Merit: 1

For me ny code make AI, Im use duck duck go ai


https://duckduckgo.com/?q=DuckDuckGo+AI+Chat&ia=chat&duckai=1

Llama 3.1 70B

But I have very little experience of cuda coding with AI, but python to c++  multythread he make good

okay.. nice information then, i'll try bro.. thanks a lot.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk


Im rent a adt servers, for 0.08$/h for 1-20 code tasks, for this dcrypt I thin they will be ok.Tmux comnand for continue work scrypt then you close avast  jupitirnotebook terminal. https://vast.ai/

I see, already use vast ai, just for backtest the code for search.
i'm use 128 thread instances, but nearly nothing for bruteforce, for bruteforce is good when you use GPU.., but since lack of coding and not pros, idk how to deal make code with GPU implementation...


For me ny code make AI, Im use duck duck go ai


https://duckduckgo.com/?q=DuckDuckGo+AI+Chat&ia=chat&duckai=1

Llama 3.1 70B

But I have very little experience of cuda coding with AI, but python to c++  multythread he make good
jr. member
Activity: 79
Merit: 1


Im rent a adt servers, for 0.08$/h for 1-20 code tasks, for this dcrypt I thin they will be ok.Tmux comnand for continue work scrypt then you close avast  jupitirnotebook terminal. https://vast.ai/

I see, already use vast ai, just for backtest the code for search.
i'm use 128 thread instances, but nearly nothing for bruteforce, for bruteforce is good when you use GPU.., but since lack of coding and not pros, idk how to deal make code with GPU implementation...
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

Grat, Im waiting what you find privkey in 1 hour



yeah, i try push my luck on this, but it's impossible in hour, i use cheap laptop, i just figure out how to deal with ranges of bit, for me
"Under these software and hardware conditions, I can completely scan a range of 30 - 53 bits." -- IT'S STILL HARD, AND NEARLY IMPOSSIBLE  Tongue

2 years following this journey of search of puzzle it's fun, i learn everything about bitcoin rightnow.

thankyou  Wink

Im rent a adt servers, for 0.08$/h for 1-20 code tasks, for this dcrypt I thin they will be ok.Tmux comnand for continue work scrypt then you close avast  jupitirnotebook terminal. https://vast.ai/
jr. member
Activity: 79
Merit: 1

Grat, Im waiting what you find privkey in 1 hour



yeah, i try push my luck on this, but it's impossible in hour, i use cheap laptop, i just figure out how to deal with ranges of bit, for me
"Under these software and hardware conditions, I can completely scan a range of 30 - 53 bits." -- IT'S STILL HARD, AND NEARLY IMPOSSIBLE  Tongue

2 years following this journey of search of puzzle it's fun, i learn everything about bitcoin rightnow.

thankyou  Wink
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

go and brute this, lloks like this in not so hard. replace firts X to number from 1 to 9 in dec or to 1 to f in hex, you get ranges. from  46346217550346335726 to f000.0008929167990784  to 8929167990784.etc.

X is used for censorship, i got precise 4 letter of hex on that range, the rest is need to be brute-forced.


[EDIT]

let's see...

XXXXXXXXXX

  • Puzzle search
  • Script started at:2024-09-23 10:21:08
  • Thread:6
  • range:XXXXXXXXXX929167990784 to:XXXXXXXXXX581819002880
  • target:1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
  • --------------------------------------------------------------------------------
  • 2024-09-23 10:21:10
  • XXXXXXXXXX498399202730
  • 0256c1cb3cb333262596a93c000c21d0defe3b777de58296eda9aa600e921ad0ce
  • 1BY8U5dkJ9STJkZAR8aKMvqapo4chGjZVw
  • --------------------------------------------------------------------------------
Grat, Im waiting what you find privkey in 1 hour

member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

go and brute this, lloks like this in not so hard. replace firts X to number from 1 to 9 in dec or to 1 to f in hex, you get ranges. from  46346217550346335726 to f000.0008929167990784  to 8929167990784.etc.

X is used for censorship, i got precise 4 letter of hex on that range, the rest is need to be brute-forced.


[EDIT]

let's see...

XXXXXXXXXX

  • Puzzle search
  • Script started at:2024-09-23 10:21:08
  • Thread:6
  • range:XXXXXXXXXX929167990784 to:XXXXXXXXXX581819002880
  • target:1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
  • --------------------------------------------------------------------------------
  • 2024-09-23 10:21:10
  • XXXXXXXXXX498399202730
  • 0256c1cb3cb333262596a93c000c21d0defe3b777de58296eda9aa600e921ad0ce
  • 1BY8U5dkJ9STJkZAR8aKMvqapo4chGjZVw
  • --------------------------------------------------------------------------------

not bad not bad, dont forget share your results
jr. member
Activity: 79
Merit: 1

go and brute this, lloks like this in not so hard. replace firts X to number from 1 to 9 in dec or to 1 to f in hex, you get ranges. from  46346217550346335726 to f000.0008929167990784  to 8929167990784.etc.

X is used for censorship, i got precise 4 letter of hex on that range, the rest is need to be brute-forced.


[EDIT]

let's see...

XXXXXXXXXX

  • Puzzle search
  • Script started at:2024-09-23 10:21:08
  • Thread:6
  • range:XXXXXXXXXX929167990784 to:XXXXXXXXXX581819002880
  • target:1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
  • --------------------------------------------------------------------------------
  • 2024-09-23 10:21:10
  • XXXXXXXXXX498399202730
  • 0256c1cb3cb333262596a93c000c21d0defe3b777de58296eda9aa600e921ad0ce
  • 1BY8U5dkJ9STJkZAR8aKMvqapo4chGjZVw
  • --------------------------------------------------------------------------------
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
I have range of exactly the range of #67, but i have less resource of bruteforce software/hardware.

I use math, and i have proof to clarify it's work.

this!

i try with 66 Bit.

Divide 4 from upper range, with formula!
result:

| 46337664863972737024 | 2831074afb231c000
| 46341573236515241984 | 2831e5754973d8000
| 46345481609057755136 | 2832c39f97c496000
| 46349389981600260096 | 2833a1c9e61552000

Private key located (already found) is on : 46346217550346335726 | 2832ed74f2b5e35ee

I make this formula like 90% to measure the range of search.

it work for count and make variable for measure ranges from key alread found or not.


for next 67 Bit.

67 BIT PUZZLE
46346217550346335726 | XXXXXXXXX8929167990784 | XXXXXXXX868880000 |
46346217550346335726 | XXXXXXXXX146718502912 | XXXXXXXXc12500000 |
46346217550346335726 | XXXXXXXXX364268752896 | XXXXXXXXfbc140000 |
46346217550346335726 | XXXXXXXXX581819002880 | XXXXXXXX365d80000 |

Cheesy

i already test it from 30 bit until 115 bit. and it's precisely work measure range.

go and brute this, lloks like this in not so hard. replace firts X to number from 1 to 9 in dec or to 1 to f in hex, you get ranges. from  46346217550346335726 to f000.0008929167990784  to 8929167990784.etc.

need not more then 2hours for prepare rabges and brute... ??
jr. member
Activity: 79
Merit: 1
I have range of exactly the range of #67, but i have less resource of bruteforce software/hardware.

I use math, and i have proof to clarify it's work.

this!

i try with 66 Bit.

Divide 4 from upper range, with formula!
result:

| 46337664863972737024 | 2831074afb231c000
| 46341573236515241984 | 2831e5754973d8000
| 46345481609057755136 | 2832c39f97c496000
| 46349389981600260096 | 2833a1c9e61552000

Private key located (already found) is on : 46346217550346335726 | 2832ed74f2b5e35ee

I make this formula like 90% to measure the range of search.

it work for count and make variable for measure ranges from key already found or not.


for next 67 Bit.

67 BIT PUZZLE
46346217550346335726 | XXXXXXXXX8929167990784 | XXXXXXXX868880000 |
46346217550346335726 | XXXXXXXXX146718502912 | XXXXXXXXc12500000 |
46346217550346335726 | XXXXXXXXX364268752896 | XXXXXXXXfbc140000 |
46346217550346335726 | XXXXXXXXX581819002880 | XXXXXXXX365d80000 |

Cheesy

i already test it from 30 bit until 115 bit. and it's precisely work measure range.
"Under these software and hardware conditions, I can completely scan a range of 30-53 bits."
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
I have range of exactly the range of #67, but i have less resource of bruteforce software/hardware.

I use math, and i have proof to clarify it's work.

you already have scrypt what need for this. As I understand spped of scrypt is more then 20 000 000 / sec, so, this is one of the bast scrypt , you not find faster then it
Pages:
Jump to: