Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 57. (Read 245098 times)
so today's computing power is able to solve 130 bits it's getting more and more interesting
looks like this is yours rng in multycore mode.Im read docs they write what this rng is good for multycore I think you not use all yours cores, bro.
And if that’s the case, you need to predict the exact range with minimal deviation. If anyone succeeds in that, all the puzzles will be solved soon.
no, if you random you can get mach faster then brute range and not slower then fool range, agree ?
anower wey generate random from bit patters what has puzzle privkeys, add "1" and "0" for spaces in patterns this will be solve too.
looks like this is yours rng in multycore mode.Im read docs they write what this rng is good for multycore I think you not use all yours cores, bro.
And if that’s the case, you need to predict the exact range with minimal deviation. If anyone succeeds in that, all the puzzles will be solved soon.
but this is new wirld record, get DLP from 2^130 )))
Either someone has 500 GPUs or discovered some new new algorithm.
looks like this is yours rng in multycore mode.Im read docs they write what this rng is good for multycore I think you not use all yours cores, bro. and no good rng in kangaroo, rng is not brute fool range, someone in rng can get result faster(I think you understand why, and not need explain it)
500 gpu is not so many, and now 4090.... one 4090 like 50 tesla of 200 what use JLP
kangaro is not algorithm for solve 2^130 i think... ?
but this is new wirld record, get DLP from 2^130 )))
Either someone has 500 GPUs or has discovered a new algorithm.
Both scenarios are unlikely.
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
why ?
Because every next puzzle is more and more demanding.
but this is new wirld record, get DLP from 2^130 )))
bad new fool agree with you, but, need now check not in 1 pubkey, but in 2^5 pubkeys.
this is not normal 
puzzle 66 and 130 solved in the same month
puzzle 66 and 130 solved in the same month
why ?
Because every next puzzle is more and more demanding.
Next puzzle is 135
We Are In the Endgame Now
why ? Previously then I share me walket.dst 10000 btc was deained, now I share my scrypt puz 130 drained, what is going on with me
Need wait albertobsd bot info, does hi get puzle
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
Jump to: