Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 41. (Read 230559 times)
Wow. Two in a row.
Wow, Gratz to the solver of puzzle 130 
yeah, now it really gets weird
We Are In the Endgame Now
Wow, Gratz to the solver of puzzle 130
f-k,130 solved !!!
Wow, Gratz to the solver of puzzle 130
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
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
what processor do you have, this speed is for 1 core
and with bitcoin addresses that rust generates how many addresses per second
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.
what processor do you have, this speed is for 1 core
and with bitcoin addresses that rust generates how many addresses per second
and with bitcoin addresses that rust generates how many addresses per second
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);
}
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
let k = rng.gen_range(1..=b.len());
let mut c: Vec
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
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...
@digaran: stop talking to yourself and please visit the doctor
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.
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
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...
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
2 years following this journey of search of puzzle it's fun, i learn everything about bitcoin rightnow.
thankyou
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/
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
2 years following this journey of search of puzzle it's fun, i learn everything about bitcoin rightnow.
thankyou
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
- --------------------------------------------------------------------------------
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
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
- --------------------------------------------------------------------------------
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.
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 |
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... ??
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.
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 |
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."
Jump to: