Bitcoin Forum
February 02, 2023, 11:44:37 AM *
News: Latest Bitcoin Core release: 24.0.1 [Torrent]
  Home Help Search Login Register More  
  Show Posts
Pages: [1]
1  Economy / Reputation / I have been subjected to harassment on: December 04, 2022, 04:37:13 PM
I am writing to report that I have been subjected to harassment from a member of this community through email.

The person first contacted me via email, asking for my assistance in cracking a wallet. He did not disclose which wallet it was until he began saying that I move that balance.

The person sent me two signatures values (RSZ values), but he were unable to explain the relationship between the signatures or how they were generated.

As you may know, if the relationship between two signatures for the same public key is known, it is possible to recover the nonce and, subsequently, the private key.

However, this person did not provide any information about how the signatures were generated or how they were related to each other.

Initially, I believed that the individual was challenging me to solve a puzzle, as I enjoy solving such challenges.

As the conversation progressed, it became clear that the person was not knowledgeable about the subject he was discussing. I therefore decided to stop responding to their emails and set up a rule to automatically archive any future messages from him.

A few days later, the person began sending me personal messages through this forum, demanding that I give them their share of the wallet. At this point, I was unsure of what they were referring to, as he had previously not provided any information about the wallet in question. They also told me  urging me to check my email inbox, which it have multiple consecutive emails from him. Claiming the same.

I told him that i did not move any wallet, also that i don't know what he is talking about.

He start claming that i stolen "his" wallet. Before of this point he never mentions that it was his wallet.

The person has claimed to be the owner of a well-known wallet and he thinks that I transfer the balance of that wallet

There are several key facts to consider in this situation:

  • The wallet in question was previously involved in a crypto-scandal.
  • The person has been unable to generate a signed message to prove his ownership of the wallet. This raises the question of why he claim that it is "his" wallet?
  • The wallet still has a significant balance on other blockchains (approximately 1.5 million USD). If I was motivated by greed, why would I not have taken the funds from those other chains? Becuase i didn't crack that wallet in first place.
  • It is impossible to determine whether the wallet file is genuine or fake. (This wallet also has a wallet.dat file available aroun the internet)
  • The wallet file is publicly available and is being sold on various websites. Many people was attempting to crack the wallet file using thousands of GPUs.
  • It seems impossible to change this person's mind. No matter what I say, he continue to believe that I transferred the wallet.

I have been a member of this community for over a year and a half, and I primarily engage with posts related to puzzles and challenges. I am also the developer of a CPU tool called keyhunt (For puzzles), which is widely used by many members of this community.

Due to my financial difficulties, I am barely able to make ends meet. The recent harassment I have been subjected to has made it difficult for me to sleep well, I have been depressed. I have been considering seeking legal assistance but also i heve been considering end with my life, why i should end my life if supposedly I'm already a millionaire?

I am writing this post in this community because it is home to many talented and intelligent individuals.

What should I do? Please help
2  Bitcoin / Project Development / Solving partial WIF with two missing parts on: January 19, 2022, 06:56:05 AM
Well i want to open this topic to ask and share a little of my experience with this kind of "edge/estrange" cases of WIF with missing characters.


Partial WIF: L1dU****d4NTd7******6zCyXqGyWXhXTa16dNWXZs7cpdk6en2t
Publickey: 02FEE659ACF67F63F13AB4A7D676782F89EF8C51FCC9077A8709831FCEABFE261F

With an Public key Available my approach will be the next
- Brute force all the first 4 missing characters
- Calculate the the second part (6 Missing characters) with BSGS
- Use a mixed mode (Brute force / BSGS ) to solve all parts together.

For the user PawGo maybe this will be your Hybrid method with some changes ( Not this case in specific, but maybe some ideas on it).

Question: How fast this can be solved for the public programs with CPU?

I made a small script SINGLE-thread with a lot of possible improvements, the program solve this in some 3 hours, it is not a general program it need to be adapted to each case.

Note: 10 11 and 12 Missing characters together in the same part at the beginning can be solved in minutes with CPU if you have the public key, without it is an impossible task.

Maybe I'm missing something and this specific problem/case can be solved more easily or faster but I don't know.
3  Bitcoin / Bitcoin Discussion / How 63 bit puzzle a other low puzzles were solved? on: October 11, 2021, 01:09:01 PM
Hi, i search about it but i didn't find anything specific. So that is the question:

How 63 bit puzzle a other low puzzles were solved?

I did not mean which script or program was used, i mean  what hardware was used? also ask if it was luck?

Previous puzzles where solved time ago.

Here are my calculations about the time to scan All the range of each puzzle.

Puzzle 61 @ 1 Megakeys/s  (10^6):       36558 years
Puzzle 61 @ 1 Gigakeys/s  (10^9):       36 years

Puzzle 62 @ 1 Megakeys/s  (10^6):       73117 years
Puzzle 62 @ 1 Gigakeys/s  (10^9):       73 years

Puzzle 63 @ 1 Megakeys/s  (10^6):       146235 years
Puzzle 63 @ 1 Gigakeys/s  (10^9):       146 years

Puzzle 64 @ 1 Megakeys/s  (10^6):       292471 years
Puzzle 64 @ 1 Gigakeys/s  (10^9):       292 years

Please if im wrong in those calculations let me know.

Here are the private keys
13C96A3742F64906 puzzle 61
363D541EB611ABEE puzzle 62
7CCE5EFDACCF6808 puzzle 63

By example the puzzle 63 the privatekey is near of the end of the range, so if you have some hardware to search at 100 Gkeys/s it will take 1.4 years, lets to say that you are searching it in random mode and you have luck at 25% of the range that is 4.2 months and only if you have those 100 Gkeys/s.

Somebody know the history of how much time and hardware they use?



Addresses from 1 to 50 puzzles were solved simultaneous by an uknow person/group
Addresses from 51 to 54 puzzles were solved by the the LBC project with variable speed from some 190 trillion keys per day
Addresses from 55 to 58 puzzles were solved by a Unknow person/group
Addresses from 59 to 63 puzzles were solved by Zielar with a speed of 248 Gkeys/s with bitcrack

There are interesting things in that Topic

Zielar talk about 0 costs of the electricity for him:

Speed of 248 GKeys/s are written here:

He use upto 100 GPUs Tesla

But in some previous post he only talk about 4 or 8 GPUs seems that he manage to get access to 100 GPUs at 0 cost for him

That is all that i want to know.


4  Bitcoin / Project Development / ecctools - a small collection of tools written in C on: September 22, 2021, 08:29:19 AM
I made a new repository in github ecctools

This is a small collection of tools that i've made in the past months, most of those tools only do one or two things, those task are or were useful for me in some moments.

Tool lists:

List of tools in this repository

  • keygen
  • sharedsecret
  • rehashaddress
  • calculatefromkey
  • calculatefrompublickey
  • keydivision
  • keymath
  • modmath
  • addr2rmd

I will be updating this list when i add some new codes

I start this topic just to seek ideas, improvements, bug reports, requests.

5  Bitcoin / Project Development / keysubtracter - test - development requests - bug reports on: September 18, 2021, 07:40:45 PM
Github page:

I publish this code on github in April 5, but i never update it until now, this is a small tool to make some substracted publickeys, address or hashes rmd160 from a target publickey.

This can be useful to increment our chances of hit some privatekey of the puzzles.

For example to make 100 copies of the puzzle 120 you need to execute the next command:

./keysubtracter -p 02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630 -n 100 -b 120

03f1d41da8acf0506f3bf7140b5629dd33a5cf546133479530cd8065e335a97666 # - 13292279957849158729038070602803446
022ec3a210bcb8ef6cf7b703b39539a83dc0c1318ccdb42daf48db2f0742971239 # + 13292279957849158729038070602803446
02b70ae2dcb442548570313f652b91ca093a3acac3a2441cb64614e8195505b6b8 # - 26584559915698317458076141205606892
0367dabeef20a6a8b7b5555b162cc8c8489e3134dcec624fe028573c34dbbf20f6 # + 26584559915698317458076141205606892
02a1d21298779f888cd8169f9ed59e4383219cdadbdb342ba886034ef9013b89be # - 39876839873547476187114211808410338
02ae015703cbaee9570dc648d7bce78ac7cb438630e09d69eef4f1208655e1027d # + 39876839873547476187114211808410338
(Output omitted)

but what that mean:

./keysubtracter -p <publickey to be substracted> -n <number of requested keys> -b  <bit range>

New Publickey 1 # offset from original publickey
New Publickey 2 # offset from original publickey

Windows version thank to WanderingPhilospher
6  Bitcoin / Project Development / Keyhunt - development requests - bug reports on: March 06, 2021, 02:13:56 PM
I want to open this thread to talk about the tool that i develop Keyhunt available on github.

Keyhunt use the BSGS algorimth to find privatekeys with the publickey, the program runs on CPU and make several use of RAM to boost the speed.

To try to find the privatekey from the 120 puzzle you need to add this publickey "uncompress" to a txt file:

How to use

  • Add the publickey to a file


you can run the tool agains that file:

./keyhunt -m bsgs -f 120.txt -b 120 -R


[+] Version 0.1.20210321 K*BSGS
[+] Setting mode BSGS
[+] Min range: 800000000000000000000000000000
[+] Max range: ffffffffffffffffffffffffffffff
[+] Setting random mode.
[+] Opening file 120.txt
[+] Added 1 points from file
[+] Bit Range 120
[+] Setting N up to 17592186044416.
[+] Init 1st bloom filter for 4194304 elements : 14.00 MB
[+] Init 2nd bloom filter for 209716 elements : 0.00 MB
[+] Allocating 128.0 MB for 4194304 aMP Points
[+] Precalculating 4194304 aMP points
[+] Allocating 3.00 MB for 209716 bP Points
[+] precalculating 4194304 bP points
[+] Sorting 209716 elements
[+] Thread 0: 000000000000000000000000000000000092dd2b47cff81ad94120bf853ef87f
[+] Thread 0: 0000000000000000000000000000000000f7fe7fccb98e136a97c2fa9d41de7b
[+] Thread 0: 00000000000000000000000000000000008d4882d7f596851a73ae35543c4dcd
Total 35184372088832 keys in 30 seconds: 1172812402961 keys/s
[+] Thread 0: 00000000000000000000000000000000009e80f97d3e3ff0fddbdcf02894e41d

Speed: 1 Terakeys/s

Well in that example (same in github) we can reach 1Terakeys/s with one thread.

Wan to more speed? use the "-k value" param to boots the speed

./keyhunt -m bsgs -f 120.txt -b 120 -R -k 20


[+] Version 0.1.20210321 K*BSGS
[+] Setting mode BSGS
[+] Min range: 800000000000000000000000000000
[+] Max range: ffffffffffffffffffffffffffffff
[+] Setting random mode.
[+] Setting k factor to 20
[+] Opening file 120.txt
[+] Added 1 points from file
[+] Bit Range 120
[+] Setting N up to 17592253153280.
[+] Init 1st bloom filter for 83886080 elements : 287.00 MB
[+] Init 2nd bloom filter for 4194304 elements : 14.00 MB
[+] Allocating 6.0 MB for 209716 aMP Points
[+] Precalculating 209716 aMP points
[+] Allocating 64.00 MB for 4194304 bP Points
[+] precalculating 83886080 bP points

[+] Sorting 4194304 elements
(Thread output omited....)
Total 703690126131200 keys in 30 seconds: 23456337537706 keys/s
(More thread output omited....)
Total 2814760504524800 keys in 120 seconds: 23456337537706 keys/s

Speed: ~23 Terekeys/s


  • you can quiet the thread output with -q
  • you can load the precalcutalted bPtable -p yourfile.bin

Do you still want to more speed? Well Use more RAM, the -k 128 will use some 2.5 GB of RAM

This file will take some minutes for the value -k 128, but the speed worth it!

./keyhunt -m bsgs -f 120.txt -b 120 -R -k 128 -p ./bPfile.bin


[+] Version 0.1.20210321 K*BSGS
[+] Setting mode BSGS
[+] Min range: 800000000000000000000000000000
[+] Max range: ffffffffffffffffffffffffffffff
[+] Setting random mode.
[+] Setting k factor to 128
[+] Opening file 120.txt
[+] Added 1 points from file
[+] Bit Range 120
[+] Setting N up to 17592186044416.
[+] Init 1st bloom filter for 536870912 elements : 1840.00 MB
[+] Init 2nd bloom filter for 26843546 elements : 92.00 MB
[+] Allocating 1.0 MB for 32768 aMP Points
[+] Precalculating 32768 aMP points
[+] Allocating 409.00 MB for 26843546 bP Points
[+] Reading 536870912 bP points from file ./bPfile.bin
[+] Sorting 26843546 elements
(Thread output omited....)
Total 4345269952970752 keys in 30 seconds: 144842331765691 keys/s
(More thread output omited....)
Total 17539409486282752 keys in 120 seconds: 146161745719022 keys/s

Speed: ~146 Terakeys/s one single thread

OK at this point maybe you want to use ALL your RAM memory to solve the puzzle 120, just a bigger -k value

I already tested it with some 24 GB used with -k 1024 and I get 1.16 Petakeys/s per thread.

Using the same configuration with 4 threads I get 4.5 Petakeys/s total



Q: Why the Progress is not displayed?
R: The speed depent of the number of target publickeys if you load 1000 publickeys, it will take some more time, the speed is only displayed when at least one thread finish one of his cycles

Q: Can we faster this code with Gpu?
R: Well yes, but the BSGS algo use RAM, only high end video cards have a lot of RAM, for GPU is better to use Kangaroo

Q: How long will take the scan the 120 bit range?
R: Human brain usually can't handle big numbers, the 120 bit space have 664613997892457936451903530140172287 (six hundred sixty four decillion...) and we speed is about 1000000000000 (one trillion or one terakey/s) the spected time acording with your speed is:
Puzzle 120 @ 1 Terakeys/s :     21074771622667996 years
Puzzle 120 @ 1 Petakeys/s :     21074771622667 years

Q: Why should i keep using brute force tools?
R: You should not, but people hope in luck.

Q: Is avaible for Windows?
R: Natively no, but you can install the ubuntu shell for windows and compile it from there

Q: It have dependencies?
R: Just libgmp for BigIntegers install it with

apt-get install  libgmp3-dev

Q: Why your program use alot of RAM?
R: Actuallly i keep in RAM two things (Bloomfilter and a Full bPTable ) im working in one way to remove or reduce the bPTable.

Nexts releases

  • BSGS with K factor Release in 6/March
  • Network/Pool versión
  • Pollard rho

Best regards!
Pages: [1]
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!