Bitcoin Forum
October 18, 2025, 02:16:43 PM *
News: Latest Bitcoin Core release: 30.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: « 1 [2]  All
  Print  
Author Topic: overview of key cracking tools for 32BTC puzzle  (Read 3316 times)
seoincorporation
Legendary
*
Offline Offline

Activity: 3584
Merit: 3301


View Profile
June 18, 2024, 09:00:56 PM
 #21

Do you know if there is any tool/code already available to make this break in quantum computers like Azure Quantum? And is there any difference in making this break in relation to conventional computers?

I recall quantum computer on Azure Quantum isn't real quantum computer since it either perform conventional using classic computer or use quantum annealing which have limited usage and capability. CMIIW.

All these tools were made for binary systems, i haven't seen a tool like this that works with qubits, or even an OS for Qubits. Even if quantum computers are real nowadays, the software for them is still in an early phase.

And another thing is the pricing, for the money that you will pay for a quantum server, you should consider renting that on Video cards to get the right hashing power for the brute force attack.
Hoesis.USA
Jr. Member
*
Offline Offline

Activity: 54
Merit: 1


View Profile WWW
December 15, 2024, 07:28:08 PM
 #22

EDIT:
Due to multiple requests, I try to link the tools in each case. I try to link to the original author's github repository when possible. If I have linked incorrectly or made a mistake in the author, please correct me - I am very grateful for corrections. I have also added few entries and info to the list.

Hi all,

there are dozens of tools available out there and I am not sure if I listed them all. Please add them if they're worth to mention. I am trying to find out which tools are preferable and mostly used out there. This list is focused on GPU capable tools, because using CPU only is kinda useless (except BSGS) for puzzle solving above #66. I thought I'd create an overview from which we can all benefit. I want to define the areas of application, which tool is suitable for which purpose, etc. Perhaps the developers of these tools can also get in touch and add the missing information or correct the information found here if something should be wrong. Please forgive me if I have described something wrong.

keyhunt (+BSGS) (github link, forum link)
- as far as I know, this is CPU version only. Keyhunt is memory-bound and makes use of lots of it in order to find keys.

keyhunt-cuda (github link 1, github link 2)
- this is the modified version of Albertos' original keyhunt which now is capable of CUDA. What's the main difference between keyhunt-cuda and bitcrack? both support CUDA

Bitcrack github link, forum link)
- supports GPU, but not really multi-gpu capable as described in its readme. You need to open one window and access gpu1 on your system (first bitcrack process running), open an additional new window and run another copy of bitcrack (second bitcrack process running) and so on.
- does not support random mode
- no progress status, you never know how much of the keyspace you already have scanned.
- in my findings so far the keyrate achieved with Bitcrack or Bitcrack2 is always about 30% lower than when using keyhunt-cuda for searching the same keyspace. Your mileage may vary.

Bitcrack2 (github link 1, cannot find forum link)
- as far as I can tell the only addition in BitCrack2 is, that you can run it in random mode. It will then search randomly through the range search space.
- has progress status, you see how many % of the keyspace search is completed and you also see what was the last keys that were tested so you get an idea where the search currently is located at
- in my case the keyrate achieved with Bitcrack or Bitcrack2 is always about 30% lower than when using keyhunt-cuda for searching the same keyspace.  Your mileage may vary.

VanBitCracken(Random) (github link, forum link)
VanBitCrakcenS (github link, forum link)
- VanBitKracken family of software was developed very recently in 2020-2021 by WanderingPhilosipher I have no idea how old and useful this tool might be and what the main differences to the other tools here presented are. Any information?
EDIT: As the autor said in the forum link for this tool, this is Windows only edition, does not work on Linux. This is a mixed tool, something like between VanitySearch and BitCrack, especially made for supporting the Nvidia 3070 cards. As there are no source code files available on his github repository, only a windows .exe (which is highly dangerous to execute! no trust), I removed this tool from the list.

Kangaroo (github link, forum link)
This tool can be only used when the pubkey of an adress is known. That means that there must have been minimum one outgoing transaction from this address or a message that was signed by this address or the pubkey has been revealed otherwise.

BSGS (github link )

BSGS-Cuda (github link)
- runs on CPU only and cannot make use of GPU. As far as I know there is a CUDA-capable modification available, however I was not able to install and run it. Is there anyone out there who can provide a download link for the old and free version of purebasic v5.3 ? Without purebasic it's impossible to run this tool which was made by Etayson. The user was online hear about 1-2years ago for the last time, no reaction at all. Any clues?

Rotor-CUDA (github link)
- was that a tool that was created and published before or after Bitcrack2, Kangaroo, etc... ? I have no idea how old and useful this tool might be and what the main differences to the other tools here presented are. Any information? As I understand Rotor-CUDA can use random search but Bitcrack2 is also capable of random searches as well as keyhunt-cuda. Did I miss any important feauture info ? What's that tool good for in comparison to the other mentioned ?

Brainflayer (github link, source)
that tool allow use to brute force the hex privatekeys in order to find the hash160 of an address. Basically it hunts for brainwallets. You feed it with a word list of phrases and try to find matches to valid and funded bitcoin addresses.

Looking forward to hear your comments, what tool is best-suited for which purpose and case and which tools you puzzle-hunters out there are using.


you can add https://github.com/RetiredC/RCKangaroo puzzle 120-125-130 solved with this program. but the programmer did not included some parts in this code.

https://github.com/ufodia
seoincorporation
Legendary
*
Offline Offline

Activity: 3584
Merit: 3301


View Profile
December 17, 2024, 02:19:40 PM
Last edit: December 18, 2024, 02:05:09 PM by seoincorporation
Merited by d5000 (10), ABCbits (2)
 #23

BTW: What is crunch, is this another tool I never heard of before ?

Better late than never.

Sorry for the delay on the answer, Crunch is a bruteforce password generator, a good example is the next command line:

Code:
crunch 52 52 ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789abcdefghijklmnopqrstuvwxyz -t 5KMWmYkn5YWkJnUDG4utD9L1HXQv3DBseqqCGsQXmthcEerbA@@@ -o pks.txt

That command will make bruteforce on the last 3 digits form that privatekey, starting with AAA, ending with zzz, and trying with A-Z, 1-9 and a-z.

That's why i think there is a way to work with Brainflyer and crunch, while crunch generates the new private key, BF verifies it.
OdinBit
Newbie
*
Offline Offline

Activity: 2
Merit: 0


View Profile
January 25, 2025, 07:55:06 AM
 #24

EDIT:
Due to multiple requests, I try to link the tools in each case. I try to link to the original author's github repository when possible. If I have linked incorrectly or made a mistake in the author, please correct me - I am very grateful for corrections. I have also added few entries and info to the list.

Hi all,

there are dozens of tools available out there and I am not sure if I listed them all. Please add them if they're worth to mention. I am trying to find out which tools are preferable and mostly used out there. This list is focused on GPU capable tools, because using CPU only is kinda useless (except BSGS) for puzzle solving above #66. I thought I'd create an overview from which we can all benefit. I want to define the areas of application, which tool is suitable for which purpose, etc. Perhaps the developers of these tools can also get in touch and add the missing information or correct the information found here if something should be wrong. Please forgive me if I have described something wrong.

keyhunt (+BSGS) (github link, forum link)
- as far as I know, this is CPU version only. Keyhunt is memory-bound and makes use of lots of it in order to find keys.

keyhunt-cuda (github link 1, github link 2)
- this is the modified version of Albertos' original keyhunt which now is capable of CUDA. What's the main difference between keyhunt-cuda and bitcrack? both support CUDA

Bitcrack github link, forum link)
- supports GPU, but not really multi-gpu capable as described in its readme. You need to open one window and access gpu1 on your system (first bitcrack process running), open an additional new window and run another copy of bitcrack (second bitcrack process running) and so on.
- does not support random mode
- no progress status, you never know how much of the keyspace you already have scanned.
- in my findings so far the keyrate achieved with Bitcrack or Bitcrack2 is always about 30% lower than when using keyhunt-cuda for searching the same keyspace. Your mileage may vary.

Bitcrack2 (github link 1, cannot find forum link)
- as far as I can tell the only addition in BitCrack2 is, that you can run it in random mode. It will then search randomly through the range search space.
- has progress status, you see how many % of the keyspace search is completed and you also see what was the last keys that were tested so you get an idea where the search currently is located at
- in my case the keyrate achieved with Bitcrack or Bitcrack2 is always about 30% lower than when using keyhunt-cuda for searching the same keyspace.  Your mileage may vary.

VanBitCracken(Random) (github link, forum link)
VanBitCrakcenS (github link, forum link)
- VanBitKracken family of software was developed very recently in 2020-2021 by WanderingPhilosipher I have no idea how old and useful this tool might be and what the main differences to the other tools here presented are. Any information?
EDIT: As the autor said in the forum link for this tool, this is Windows only edition, does not work on Linux. This is a mixed tool, something like between VanitySearch and BitCrack, especially made for supporting the Nvidia 3070 cards. As there are no source code files available on his github repository, only a windows .exe (which is highly dangerous to execute! no trust), I removed this tool from the list.

Kangaroo (github link, forum link)
This tool can be only used when the pubkey of an adress is known. That means that there must have been minimum one outgoing transaction from this address or a message that was signed by this address or the pubkey has been revealed otherwise.

BSGS (github link )

BSGS-Cuda (github link)
- runs on CPU only and cannot make use of GPU. As far as I know there is a CUDA-capable modification available, however I was not able to install and run it. Is there anyone out there who can provide a download link for the old and free version of purebasic v5.3 ? Without purebasic it's impossible to run this tool which was made by Etayson. The user was online hear about 1-2years ago for the last time, no reaction at all. Any clues?

Rotor-CUDA (github link)
- was that a tool that was created and published before or after Bitcrack2, Kangaroo, etc... ? I have no idea how old and useful this tool might be and what the main differences to the other tools here presented are. Any information? As I understand Rotor-CUDA can use random search but Bitcrack2 is also capable of random searches as well as keyhunt-cuda. Did I miss any important feauture info ? What's that tool good for in comparison to the other mentioned ?

Brainflayer (github link, source)
that tool allow use to brute force the hex privatekeys in order to find the hash160 of an address. Basically it hunts for brainwallets. You feed it with a word list of phrases and try to find matches to valid and funded bitcoin addresses.

Looking forward to hear your comments, what tool is best-suited for which purpose and case and which tools you puzzle-hunters out there are using.


is there no save feature for Keyhunt cuda? i've been searching for a couple of days now and unfortunately have found no save feature
nUm81
Member
**
Offline Offline

Activity: 139
Merit: 15


View Profile WWW
January 27, 2025, 05:47:07 AM
 #25


is there no save feature for Keyhunt cuda? i've been searching for a couple of days now and unfortunately have found no save feature


No, this is pretty much the reason I decided to make a pool so that I could be sure that I wasn't wasting search power on the same keys over and over.

OdinBit
Newbie
*
Offline Offline

Activity: 2
Merit: 0


View Profile
January 29, 2025, 03:19:52 AM
 #26


No, this is pretty much the reason I decided to make a pool so that I could be sure that I wasn't wasting search power on the same keys over and over.

I saw your site, how many GPUs are working on puzzle 67?
pbies
Full Member
***
Offline Offline

Activity: 396
Merit: 212



View Profile
March 18, 2025, 08:32:44 PM
 #27

One thing about Brainflayer - it is just CLI for bloom filter.

Many people make mistake with it: you feed it with hex pvks but in the end you compare with bloom filter that consists of addresses (for example, or hash160).

The problem here is Brainflayer is just searching in bloom filter and it does not convert anything. You can't hit with it if the data provided is in different formats!

BTC: bc1qmrexlspd24kevspp42uvjg7sjwm8xcf9w86h5k
MelonousHeadous
Copper Member
Newbie
*
Offline Offline

Activity: 81
Merit: 0


View Profile
April 19, 2025, 01:37:26 AM
 #28

I'll link one I made that is open source(I guess I'll upload it now)

Also, since my foot is out right now, I got bored and made a simple high low game under HIGHsnake under the same github account. one second. going to leave this open as I make and upload a masterkey program for the puzzles.

https://github.com/mrwhalebones/MasterKeyProgram

I'm currently debugging what I just built today after seeing the posts. This should allow easier generation of attempts at the puzzles using generated hex ranges, converted to WIFs. I am working on the output generation currently but have a few inferior working models. I've been going through multiple builds an hour and am only really updating when it seems key.

Also, I am including an automated search function that compares converted hex to wif and converted wif to address, so there isn't a need for gigs worth of private keys and it stops people from easily stealing other people's well earned (assumed) funds.

Not gonna lie, if you wanted to donate there is an address in the readme, but don't feel it necessary. If you feel like you want to reach out to have a program built specifically for you, I have a business line at +1(406)344-4432. I honestly can't wait until my node is fully synced....... lol, papa needs to pay his rent. Once I have a working miner up, I'll post a link for the SEGWIT miner written in pure python and open-script.
nomachine
Full Member
***
Offline Offline

Activity: 742
Merit: 114


View Profile
April 22, 2025, 03:40:56 AM
Last edit: April 22, 2025, 03:51:07 AM by nomachine
 #29

This should allow easier generation of attempts at the puzzles using generated hex ranges, converted to WIFs. I am working on the output generation currently but have a few inferior working models. I've been going through multiple builds an hour and am only really updating when it seems key.


In Python? You need the fastest hashlib and Base58 implementation in the world—written in C or CUDA C—capable of achieving 35 million WIFs per second using AVX2 and SHA-NI, or up to 3.5 billion WIFs per second with GPU acceleration. Anything else is child’s play when it comes to WIFs, my dear businessman...

BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
Akito S. M. Hosana
Jr. Member
*
Offline Offline

Activity: 392
Merit: 8


View Profile
April 22, 2025, 04:08:50 AM
 #30

achieving 35 million WIFs per second using AVX2 and SHA-NI

I'm getting 25 MWIFs/s (WIFHunter) on an AMD Ryzen 5 3600 6-core processor.  Tongue
ytrezq
Member
**
Offline Offline

Activity: 288
Merit: 27


View Profile
August 12, 2025, 09:21:35 AM
Last edit: August 12, 2025, 10:08:26 AM by ytrezq
 #31

A completely new class of method for computing discrete logarithms

This paper seems to be about a specific case http://web.archive.org/web/20250725043122/https://cr.yp.to/dlog/cuberoot-20120919.pdf but in reality, the method is generic. They talk about small discrete logarithms in the same vein that pollard rho has a complexity too high to handle large discrete logarithms…

Victor Shoup theorized that no generic discrete logarithm solving method could perform better than x½. This is indeed the complexity of Pollard Kangaroo and Pollard rho. But he also theorized than an algorithm with precomputation can yield at best a complexity of x which means the lower bound to break full sized secp256k1 is far less than the 2128 estimated security. Though in the case of this paper, the required memory or storage would be 264×256bits

This paper is indeed diving in that class of faster speed at the expense of memory storage.

Anyone to turn it’s mathematical description into an implementation ?
silentpredator
Newbie
*
Offline Offline

Activity: 1
Merit: 0


View Profile
October 12, 2025, 12:13:13 PM
 #32

I have read now a lot of topics about the bitcoin puzzle from satoshi rising and I wonder, which of the open source keyhunt programms are now the best and especially virus/malware-free. I tried Albertos keyhunt, it works well, but I would like to speed up the search with a cuda version.

which program do you guys use for the puzzle or are u even searching in a pool like btcpuzzle.info? I would like to participate, but can't figure out, if it's save to use and what opinions others have about these programms. I just don't want to be scammed by malicious software.
Pages: « 1 [2]  All
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!