Search content
Sort by
Showing 17 of 17 results by Raj Lassi
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
Which program can iterate bitwise but not in direct order?
Example.
We have start number in dec
223549943504745960712268251712
And have map position bits
0->10, 1->25, 2->8, 3->51 and etc
In this variants next number not
223549943504745960712268251713
convert to bin
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000010 01000000
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000110 01000000
in dec 223549943504745960712268252736
next
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000110 01000000
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000010 01000000
in dec 223549943504745960712301806144
next
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000010 01000000
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000110 01000000
dec 223549943504745960712301807168
next
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000110 01000000
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
dec 223549943504745960712268251968
and etc for all position.
Well, its understandable to apply the obtained values as a private key to check for matches.
It is also desirable that the key is cut to the desired value in bits and the first bit is set to the left. According to the specified lengths.
Example.
In programm seeted values 70,71,72,73,74
App calculate next priv sample in bin
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
and try get key from next data
Example.
We have start number in dec
223549943504745960712268251712
And have map position bits
0->10, 1->25, 2->8, 3->51 and etc
In this variants next number not
223549943504745960712268251713
convert to bin
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000010 01000000
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000110 01000000
in dec 223549943504745960712268252736
next
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000110 01000000
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000010 01000000
in dec 223549943504745960712301806144
next
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000010 01000000
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000110 01000000
dec 223549943504745960712301807168
next
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000010 01100101 10000110 01000000
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
dec 223549943504745960712268251968
and etc for all position.
Well, its understandable to apply the obtained values as a private key to check for matches.
It is also desirable that the key is cut to the desired value in bits and the first bit is set to the left. According to the specified lengths.
Example.
In programm seeted values 70,71,72,73,74
App calculate next priv sample in bin
00000010 11010010 01010100 00101101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
and try get key from next data
Code:
orig :...101 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
74bits: 11 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
73bits: 1 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
72bits: 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
71bits: 1100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
70bits: 100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
69bits: 10000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
Which app can make this? Kango, vanity, hashcat? And nead calcualte on GPU. On CPU i have realisation on php.74bits: 11 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
73bits: 1 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
72bits: 11100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
71bits: 1100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
70bits: 100000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
69bits: 10000 01010111 11000110 00101011 10001001 11000000 01100101 10000011 01000000
I am pretty dumb, so after 20 minutes, i still could not figure out what you are trying to do.
I especially do not understand this part:
"And have map position bits
0->10, 1->25, 2->8, 3->51 and etc"
decimal confuses me, so i converted to hex and got these numbers (and spaces to visually separate the part that changes):
2D2542DE057C62B89 C06582 40
2D2542DE057C62B89 C06586 40
2D2542DE057C62B89 C26582 40
2D2542DE057C62B89 C26586 40
2D2542DE057C62B89 C06583 40
i still don't get it.
Bitcrack is easily modified to create whatever starting points you want. Look at CudaKeySearchDevice.cpp.
You can write functions to play all sorts of bit games, shifting, rotating, random XOR, using digits of pi, etc.
I have made my Bitcrack spin the top 2 bytes from 0000-FFFF for each random 3 bytes (15 of them per run). Then it spins the last 2 bytes 0000-FFFF and restarts. It can also read 3-byte numbers from a text file every time it restarts. The few million leftover starting points are random.
The interesting thing is, i have not run any of my bitcoin hacking programs for a few weeks and still achieve the exact same results!
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
⭐ Merited by itod (1)
can anyony told me how to use --continue to save a result of scan private and addr?
or mb show a command?
or mb show a command?
use first time - xxBitCrack -c -u -i target.txt -o finish.txt --keyspace 1:FFFFFFFFFFF -continue step.txt
and after - xxBitCrack -c -u -i target.txt -o finish.txt -continue step.txt
How do u guys convert hex to wif? offline?
this converts lots of stuff. save and run offline.
https://www.mobilefish.com/services/cryptocurrency/cryptocurrency.html
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
found an old Radeon 5770 in my junk pile. should have left it there.
hot-glued the fan back on.
bought a 6-pin power cable and everything. 2 day delivery.
thought i would run some openCL.
but legacy ATI + linux don't mix.
hot-glued the fan back on.
bought a 6-pin power cable and everything. 2 day delivery.
thought i would run some openCL.
but legacy ATI + linux don't mix.
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
Distributed Random Brute Force
I don't have the GPU power to make any progress with sequential brute force.
I also found, by experiment, that guessing random numbers can take much longer.
So, to maximize the fun, I am doing both.
I distribute the scan over the 20-3F keyspace, pick 3 random bytes, and brute force the rest.
My ranges look like this: (where XXXXXX is 3 random bytes)
[20-3F][XXXXXX]00000000 - [20-3F][XXXXXX]FFFFFFFF
My old card can try fifteen 3-byte randoms per scan, every 13 hours, at 44Mkey/s. Plus about 2 million really random randoms with the leftover starting points.
What does that get me?
15 random blocks of 4.3 billion keys in each of 32 sub-ranges [20-3F] per scan = 2 trillion. 4T/day. Pffft.
so, every 26-hour day, scanning the following:
128 B keys in 20XXXXXX00000000-20XXXXXXFFFFFFFF
128 B keys in 21XXXXXX00000000-21XXXXXXFFFFFFFF
128 B keys in 22XXXXXX00000000-22XXXXXXFFFFFFFF
.
.
.
128 B keys in 3DXXXXXX00000000-3DXXXXXXFFFFFFFF
128 B keys in 3EXXXXXX00000000-3EXXXXXXFFFFFFFF
128 B keys in 3FXXXXXX00000000-3FXXXXXXFFFFFFFF
i just need to get lucky with 3 bytes. how hard can that be?
or, get lucky with 2 bytes, but wait a week to find out. that shouldn't take much more than 65535 weeks.
I don't have the GPU power to make any progress with sequential brute force.
I also found, by experiment, that guessing random numbers can take much longer.
So, to maximize the fun, I am doing both.
I distribute the scan over the 20-3F keyspace, pick 3 random bytes, and brute force the rest.
My ranges look like this: (where XXXXXX is 3 random bytes)
[20-3F][XXXXXX]00000000 - [20-3F][XXXXXX]FFFFFFFF
My old card can try fifteen 3-byte randoms per scan, every 13 hours, at 44Mkey/s. Plus about 2 million really random randoms with the leftover starting points.
What does that get me?
15 random blocks of 4.3 billion keys in each of 32 sub-ranges [20-3F] per scan = 2 trillion. 4T/day. Pffft.
so, every 26-hour day, scanning the following:
128 B keys in 20XXXXXX00000000-20XXXXXXFFFFFFFF
128 B keys in 21XXXXXX00000000-21XXXXXXFFFFFFFF
128 B keys in 22XXXXXX00000000-22XXXXXXFFFFFFFF
.
.
.
128 B keys in 3DXXXXXX00000000-3DXXXXXXFFFFFFFF
128 B keys in 3EXXXXXX00000000-3EXXXXXXFFFFFFFF
128 B keys in 3FXXXXXX00000000-3FXXXXXXFFFFFFFF
i just need to get lucky with 3 bytes. how hard can that be?
or, get lucky with 2 bytes, but wait a week to find out. that shouldn't take much more than 65535 weeks.
................
So, speaking of case 61:
In my case, what I do is mix randomness with full range scan. I keep the range small enough to get reasonable waiting time (say 10 min) .
This is an example:
1) generate all possibles 5 bits number: 10 11 12 13 14 15 16 17 18 19 1A 1B 1C 1D 1E 1F
2) pick a random 5 hex digit number (20bit) : for instance CADE9
we have now 16 possibles header for our key
10CADE9
11CADE9
12CADE9
13CADE9
14CADE9
15CADE9
16CADE9
17CADE9
18CADE9
19CADE9
1ACADE9
1BCADE9
1CCADE9
1DCADE9
1ECADE9
1FCADE9
3) call 16 instances of Bitcrack fully scanning following 16 ranges
10CADE9000000000:10CADE9FFFFFFFFF
11CADE9000000000:11CADE9FFFFFFFFF
12CADE9000000000:12CADE9FFFFFFFFF
13CADE9000000000:13CADE9FFFFFFFFF
14CADE9000000000:14CADE9FFFFFFFFF
15CADE9000000000:15CADE9FFFFFFFFF
16CADE9000000000:16CADE9FFFFFFFFF
17CADE9000000000:17CADE9FFFFFFFFF
18CADE9000000000:18CADE9FFFFFFFFF
19CADE9000000000:19CADE9FFFFFFFFF
1ACADE9000000000:1ACADE9FFFFFFFFF
1BCADE9000000000:1BCADE9FFFFFFFFF
1CCADE9000000000:1CCADE9FFFFFFFFF
1DCADE9000000000:1DCADE9FFFFFFFFF
1ECADE9000000000:1ECADE9FFFFFFFFF
1FCADE9000000000:1FCADE9FFFFFFFFF
goto step 2 and repeat.
each cycle will take 16*10min = 160 min if you have one GPU.
This trick will increase your likelihood in finding the key as times increases and not wait 180 years (1GPU) or 5 years (36GPUs). LOL
a random 5 hex digit is one of 1,048,575 if you get it right, you have the key in 160 min with only one GPU
This looks like a suggestion I've made a while ago
hahaha cool. i made some tweaks to BitCrack so i can set whatever starting points i want. I have it count to FFFF and restart with a new batch of points. it writes everything it has tried to a file. It has not picked the same random 3 bytes yet, nor has any scan overlapped any ranges posted here. i will be lazy and wait until it does before coding anything to prevent that.
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
Distributed Random Brute Force
I don't have the GPU power to make any progress with sequential brute force.
I also found, by experiment, that guessing random numbers can take much longer.
So, to maximize the fun, I am doing both.
I distribute the scan over the 20-3F keyspace, pick 3 random bytes, and brute force the rest.
My ranges look like this: (where XXXXXX is 3 random bytes)
[20-3F][XXXXXX]00000000 - [20-3F][XXXXXX]FFFFFFFF
My old card can try fifteen 3-byte randoms per scan, every 13 hours, at 44Mkey/s. Plus about 2 million really random randoms with the leftover starting points.
What does that get me?
15 random blocks of 4.3 billion keys in each of 32 sub-ranges [20-3F] per scan = 2 trillion. 4T/day. Pffft.
so, every 26-hour day, scanning the following:
128 B keys in 20XXXXXX00000000-20XXXXXXFFFFFFFF
128 B keys in 21XXXXXX00000000-21XXXXXXFFFFFFFF
128 B keys in 22XXXXXX00000000-22XXXXXXFFFFFFFF
.
.
.
128 B keys in 3DXXXXXX00000000-3DXXXXXXFFFFFFFF
128 B keys in 3EXXXXXX00000000-3EXXXXXXFFFFFFFF
128 B keys in 3FXXXXXX00000000-3FXXXXXXFFFFFFFF
i just need to get lucky with 3 bytes. how hard can that be?
or, get lucky with 2 bytes, but wait a week to find out. that shouldn't take much more than 65535 weeks.
I don't have the GPU power to make any progress with sequential brute force.
I also found, by experiment, that guessing random numbers can take much longer.
So, to maximize the fun, I am doing both.
I distribute the scan over the 20-3F keyspace, pick 3 random bytes, and brute force the rest.
My ranges look like this: (where XXXXXX is 3 random bytes)
[20-3F][XXXXXX]00000000 - [20-3F][XXXXXX]FFFFFFFF
My old card can try fifteen 3-byte randoms per scan, every 13 hours, at 44Mkey/s. Plus about 2 million really random randoms with the leftover starting points.
What does that get me?
15 random blocks of 4.3 billion keys in each of 32 sub-ranges [20-3F] per scan = 2 trillion. 4T/day. Pffft.
so, every 26-hour day, scanning the following:
128 B keys in 20XXXXXX00000000-20XXXXXXFFFFFFFF
128 B keys in 21XXXXXX00000000-21XXXXXXFFFFFFFF
128 B keys in 22XXXXXX00000000-22XXXXXXFFFFFFFF
.
.
.
128 B keys in 3DXXXXXX00000000-3DXXXXXXFFFFFFFF
128 B keys in 3EXXXXXX00000000-3EXXXXXXFFFFFFFF
128 B keys in 3FXXXXXX00000000-3FXXXXXXFFFFFFFF
i just need to get lucky with 3 bytes. how hard can that be?
or, get lucky with 2 bytes, but wait a week to find out. that shouldn't take much more than 65535 weeks.
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
IMHO
ranges should go from blah...blah...00000000 to blah...blah...FFFFFFFF
just to keep things neat and tidy. maybe i am OCD.
why are all these bizarre ranges being scanned?
like 2b87eefd01e43a40 - 2b87f0798ea43a40
it makes no sense to me.
ranges should go from blah...blah...00000000 to blah...blah...FFFFFFFF
just to keep things neat and tidy. maybe i am OCD.
why are all these bizarre ranges being scanned?
like 2b87eefd01e43a40 - 2b87f0798ea43a40
it makes no sense to me.
is something being converted from decimal?
that makes even less sense.
i just don't get it. enlighten me.
Yeah so that range is within the 62-bit range, what is the problem?
i am just saying that, for me, for reasons of accounting and clarity, in my messed up mind (and probably in the perfectly good minds of others), i prefer a block to start on a 00 and end on FF.
for example:
A600000000 - A6FFFFFFFF
3B92C70000000000 - 3B92C7FFFFFFFFFF
0000 - FFFF
like that. it makes sense to me and is easy to understand.
what i do not understand, is how people come up with these ranges with some arbitrary collection of least significant bytes.
(no example given)
and i wonder where these come from. are hands mashed down on a hex keyboard? is it somebody's birthday? their name in ascii? is it just random? is it some nice round decimal number that converts to god-awful looking hex. Why is decimal even mentioned in this forum?
just wondering why. not saying it is right or wrong. it just does not align with my thought process.
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
IMHO
ranges should go from blah...blah...00000000 to blah...blah...FFFFFFFF
just to keep things neat and tidy. maybe i am OCD.
why are all these bizarre ranges being scanned?
like 2b87eefd01e43a40 - 2b87f0798ea43a40
it makes no sense to me.
ranges should go from blah...blah...00000000 to blah...blah...FFFFFFFF
just to keep things neat and tidy. maybe i am OCD.
why are all these bizarre ranges being scanned?
like 2b87eefd01e43a40 - 2b87f0798ea43a40
it makes no sense to me.
is something being converted from decimal?
that makes even less sense.
i just don't get it. enlighten me.
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
IMHO
ranges should go from blah...blah...00000000 to blah...blah...FFFFFFFF
just to keep things neat and tidy. maybe i am OCD.
why are all these bizarre ranges being scanned?
like 2b87eefd01e43a40 - 2b87f0798ea43a40
it makes no sense to me.
ranges should go from blah...blah...00000000 to blah...blah...FFFFFFFF
just to keep things neat and tidy. maybe i am OCD.
why are all these bizarre ranges being scanned?
like 2b87eefd01e43a40 - 2b87f0798ea43a40
it makes no sense to me.
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
All friends forgot something.
@Zielar Power in one day: 32140800000000000 Decimal
45 days have passed since the day you started.
2305843009213693951 + 1446336000000000000 = 3752179009213693951
Hex Code: 34126AEDD1DBFFFF
62. The wallet is larger than this.
@Zielar Power in one day: 32140800000000000 Decimal
45 days have passed since the day you started.
2305843009213693951 + 1446336000000000000 = 3752179009213693951
Hex Code: 34126AEDD1DBFFFF
62. The wallet is larger than this.
I don't think we can assume that range has been completed...contiguously. (yet)
see zielar's post on "--share", whims, and weather:
https://bitcointalk.org/index.php?topic=1306983.msg52019795#msg52019795
I use the "--share" function for this, thanks to which I have scripts that start divided into X parts (read internal ranges).
For each space I determine X individually (based on my own whim) and based only on my mood or the weather. My whim of X's arrangements for space 63 resulted in the fact that the last set scanned the space from the value of 'Y', which was lower than the proper key, respectively, so that I needed three days to reach the key. I can not say the same about the '62' range, which did not show the right key despite the fact that all readings are already at the level BELOW of the month until the end of the full scan.
For each space I determine X individually (based on my own whim) and based only on my mood or the weather. My whim of X's arrangements for space 63 resulted in the fact that the last set scanned the space from the value of 'Y', which was lower than the proper key, respectively, so that I needed three days to reach the key. I can not say the same about the '62' range, which did not show the right key despite the fact that all readings are already at the level BELOW of the month until the end of the full scan.
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
Each interval is a different time zone. 1-3-4-5-6.. hours.
I have also scanned for 1 day.
2fast...maybe you be faster me...anyway i know range where is it but my speed is sad))
We can work together, if you want.
How are you picking the starting points? My method uses 24 random and 232 known bits. All we need to do is find the right 3 bytes. It is much like picking RGB color. Hmmm that gives me another ridiculous idea. I got this running on some old card at 44 Mkey/sec.
I can share some searched ranges, but posting them here will make a mess. Maybe i will put something together after this thing runs for a week.
A quick check shows none of my ranges overlap anything already posted here in the past few days, but some come close! Hahaha!
Are there other scanned ranges for 62-bit posted elsewhere?
How can we effectively organize and use the "done" list?
Meanwhile, the LBC has found a few in between.
Just wondering if https://lbc.cryptoguru.org/trophies will be updated with finds. Or does that not matter, or am i missing something?
Re: Are there people attempting to brute force random keys?
Does anyone know of people out there attempting to brute force random addresses (no prior information at all, just hoping for a miracle)
I throw random private keys (and brute force variants) at a known hash160. Fun, but totally psycho.
Doing about 4 billion hashes per slow CPU core per day, and usually 12 or more cores running.
Such a waste of time and energy, but I continue to senselessly tweak my code.
Greetings to all friends. I have such a problem. I am writing a term paper on cryptography analysis. I need to find at least one private key out of 10 million Bitcoin Addresses. All these Bitcoin addresses have a zero balance. My goal is not to make money. That is, do not enrich themselves at the expense of other people's money. This is a course and research work on cryptography. Now I can not explain everything in more detail. But to continue my research I need to know one or two private keys of 10 million Bitcoin addresses. For your help I will thank you with a certain amount of money. I uploaded these 10,000,000 bitcoin addresses to the Google Drive cloud service. Help me please.
How is your research and term paper coming along?
All the same, how to convert the found key into WIF format?
there is an explanation here
https://en.bitcoin.it/wiki/Wallet_import_format
and some online thing here
https://gobittest.appspot.com/PrivateKey
but you don't paste real keys into online things. maybe run javascript offline.
or find some python that does it. here is something:
https://bitcoin.stackexchange.com/questions/58114/convert-wif-to-private-key
So, no action here at all, huh?
I am looking for a "lost" privkey. Hahaha. Good luck to me!
I wrote something in C to do it, urandom style. It's pretty cute when it finds the first 4 bytes of a hash....
But matching 5 bytes? Nothing for weeks on 16 CPU cores. (maybe some weren't running).
I don't expect oclvanitygen on one GPU to spit out any results, either.
I don't check the hashtable of "addresses with balances" anymore. It takes too long. and eats too much memory.
what is the point, anyway? just burning up CPU's here for nothing.
thanks for listening.
I am looking for a "lost" privkey. Hahaha. Good luck to me!
I wrote something in C to do it, urandom style. It's pretty cute when it finds the first 4 bytes of a hash....
But matching 5 bytes? Nothing for weeks on 16 CPU cores. (maybe some weren't running).
I don't expect oclvanitygen on one GPU to spit out any results, either.
I don't check the hashtable of "addresses with balances" anymore. It takes too long. and eats too much memory.
what is the point, anyway? just burning up CPU's here for nothing.
thanks for listening.
Hello,
I have a few questions that may have been answered already,
but I can't wait 90 seconds between searches, or find by RTFM.
First of all, I love the private key database at
https://lbc.cryptoguru.org/dio
Now, we just need Google to index it. Haha
Why so many warnings on download page?
https://lbc.cryptoguru.org/download
I want to try LBC, but GPU lives in my main box.
Is it really putting my data at risk, or is this just standard disclaimer?
So, nothing found since 2017-11-15 01:25:58 UTC ?
https://lbc.cryptoguru.org/trophies
Does client automatically report collision details to LBC server?
Thanks,
Raj
I have a few questions that may have been answered already,
but I can't wait 90 seconds between searches, or find by RTFM.
First of all, I love the private key database at
https://lbc.cryptoguru.org/dio
Now, we just need Google to index it. Haha
Why so many warnings on download page?
https://lbc.cryptoguru.org/download
I want to try LBC, but GPU lives in my main box.
Is it really putting my data at risk, or is this just standard disclaimer?
So, nothing found since 2017-11-15 01:25:58 UTC ?
https://lbc.cryptoguru.org/trophies
Does client automatically report collision details to LBC server?
Thanks,
Raj