[BETA] MoonWalker - Just Another Bitcoin Brute Forcer

[rosengold]

Another Brute Forcer for Puzzle #66 based on CUDA

MoonWalker is a software based on Bitcrack and VanitySearch, this tool is made to search by brute force bitcoin private keys using full CUDA calculation and search for hash160 sufix to speed up calculations.

I made it specifically to search bitcoin puzzle addresses.

This initial public version is limited from 1 to 63 bit range

test it with small ranges first ! may contain bugs !

https://github.com/ivansantosbom/MoonWalker

Benchmarks are welcome ! 
 

[modma]

Another Brute Forcer for Puzzle #66 based on CUDA

MoonWalker is a software based on Bitcrack and VanitySearch, this tool is made to search by brute force bitcoin private keys using full CUDA calculation and search for hash160 sufix to speed up calculations.

I made it specifically to search bitcoin puzzle addresses.

This initial public version is limited from 1 to 63 bit range

test it with small ranges first ! may contain bugs !

https://github.com/ivansantosbom/MoonWalker

Benchmarks are welcome ! 
 

why is the source code closed?

[rosengold]

Another Brute Forcer for Puzzle #66 based on CUDA

MoonWalker is a software based on Bitcrack and VanitySearch, this tool is made to search by brute force bitcoin private keys using full CUDA calculation and search for hash160 sufix to speed up calculations.

I made it specifically to search bitcoin puzzle addresses.

This initial public version is limited from 1 to 63 bit range

test it with small ranges first ! may contain bugs !

https://github.com/ivansantosbom/MoonWalker

Benchmarks are welcome ! 
 

why is the source code closed?

because is not public.

actually I'm running it to find #66 but I will release a version to other people try their luck too soon

[digaran]

Are you searching for #66 in 63 bit range? And why only for #66, are you incapable of developing something for higher ranges?

[rosengold]

Are you searching for #66 in 63 bit range? And why only for #66, are you incapable of developing something for higher ranges?

of course No. I have my own version for higher ranges, when this initial version become a good one I will think about sharing.

as you know, there's no sense to try brute force on higher ranges that are harder than #66.

My actual private tool is capable to try to brute force from 1 ~ 128 bits.

next days I will release a public version for 1 ~ 66 bits.

[digaran]

What is your own benchmark? I can't see it, impress us with your speed rate first, otherwise it's not better than bitcrack, while bitcrack is open source and yours is not.!

[racminer]

Another Brute Forcer for Puzzle #66 based on CUDA

MoonWalker is a software based on Bitcrack and VanitySearch, this tool is made to search by brute force bitcoin private keys using full CUDA calculation and search for hash160 sufix to speed up calculations.

I made it specifically to search bitcoin puzzle addresses.

This initial public version is limited from 1 to 63 bit range

test it with small ranges first ! may contain bugs !

https://github.com/ivansantosbom/MoonWalker

Benchmarks are welcome ! 
 

No source no try ! thanks.

[rosengold]

I Will move the project interely to linux due to facility to run it using a vast.ai instance.

Running it against #40 bit this software is able to find it in about 10 minutes using a GTX 1650

The strategy on this software was build after many years following these topics about this puzzle and I will not share the source code because I'm sure that in some moment I will find it, so sorry but no source code.

but, I'll release a public linux version to other people try to find #66 too soon. cheers.

[digaran]

I Will move the project interely to linux due to facility to run it using a vast.ai instance.

Running it against #40 bit this software is able to find it in about 10 minutes using a GTX 1650

The strategy on this software was build after many years following these topics about this puzzle and I will not share the source code because I'm sure that in some moment I will find it, so sorry but no source code.

but, I'll release a public linux version to other people try to find #66 too soon. cheers.

Yeah, only idiots download and run this! If you are afraid that people might find a puzzle by using your trojan, why are you sharing it anyways? You don't seem to be a generous person.

Irony here is, op is not sharing the source code because others might find it sooner, but he is sharing a trojan inside this tool so that other people can find it sooner, FOR HIM.😉

[rosengold]

I have no time to answer your acusations dude. let's focus on tests/development please. If you don't want to help just keep silence.

btw

https://www.virustotal.com/gui/file/b3cf6c3170ce0152c4f0812337d2de8762a1f3aef3583228bfd3bf2d237d3b98/details

[digaran]

I have no time to answer your acusations dude. let's focus on tests/development please. If you don't want to help just keep silence.

btw

https://www.virustotal.com/gui/file/b3cf6c3170ce0152c4f0812337d2de8762a1f3aef3583228bfd3bf2d237d3b98/details

First of all, if a trojan is in a program, you can't find it by scanning for trojans, it could be a simple function of the program.

Secondly, what development? There is no code for others to check and suggest improvements.

Before you were born, people around here passed these tricks and got an A+. 😉

[NotATether]

Another Brute Forcer for Puzzle #66 based on CUDA

MoonWalker is a software based on Bitcrack and VanitySearch, this tool is made to search by brute force bitcoin private keys using full CUDA calculation and search for hash160 sufix to speed up calculations.

I made it specifically to search bitcoin puzzle addresses.

This initial public version is limited from 1 to 63 bit range

test it with small ranges first ! may contain bugs !

https://github.com/ivansantosbom/MoonWalker

Benchmarks are welcome ! 
 

why is the source code closed?

because is not public.

actually I'm running it to find #66 but I will release a version to other people try their luck too soon

If the project is closed-source, why do you need to limit the range in bits? After all, #64 has already been found, so there is no point in trying to stop people from finding the key again.

Hopefully the 63 bits is not an architectural limitation like a similar one in brichard19's bitcrack (It supports only 32-bit mode, so finding keys has a significant performance penalty).

[DaCryptoRaccoon]

Opensource the code or no one will use this.

This seems like a piss poor attempt to try infect people nothing more.

Must try harder.  Or just fuck off.

[rosengold]

I have no time to answer your acusations dude. let's focus on tests/development please. If you don't want to help just keep silence.

btw

https://www.virustotal.com/gui/file/b3cf6c3170ce0152c4f0812337d2de8762a1f3aef3583228bfd3bf2d237d3b98/details

First of all, if a trojan is in a program, you can't find it by scanning for trojans, it could be a simple function of the program.

Secondly, what development? There is no code for others to check and suggest improvements.

Before you were born, people around here passed these tricks and got an A+. 😉

dude, I'm here following this puzzle since 2016 and started develop some tools in 2019, so keep calm, I know what I'm doing 

[rosengold]

Another Brute Forcer for Puzzle #66 based on CUDA

MoonWalker is a software based on Bitcrack and VanitySearch, this tool is made to search by brute force bitcoin private keys using full CUDA calculation and search for hash160 sufix to speed up calculations.

I made it specifically to search bitcoin puzzle addresses.

This initial public version is limited from 1 to 63 bit range

test it with small ranges first ! may contain bugs !

https://github.com/ivansantosbom/MoonWalker

Benchmarks are welcome ! 
 

why is the source code closed?

because is not public.

actually I'm running it to find #66 but I will release a version to other people try their luck too soon

If the project is closed-source, why do you need to limit the range in bits? After all, #64 has already been found, so there is no point in trying to stop people from finding the key again.

Hopefully the 63 bits is not an architectural limitation like a similar one in brichard19's bitcrack (It supports only 32-bit mode, so finding keys has a significant performance penalty).

you're right, actually I'm using __int128_t this is enought to find all "possible" puzzles under #128 by brute force.

I limited the range just for benchmarks purpose and to show to the community that this tool is in average 5x faster than bitcrack / vanity search.

The actual version now is ported to linux to people test it on vast.ai or WSL etc.

I'm still thinking about release a version to people look for #66

[rosengold]

Opensource the code or no one will use this.

This seems like a piss poor attempt to try infect people nothing more.

Must try harder.  Or just fuck off.

when someone find some puzzle using my tool you'll regret about this shit you wrote.

[fexkomin]

Is open source possible?