Search content
Sort by
Showing 12 of 12 results by modma
It's time to share your experience.
(choose one question and share your thoughts)
1. what helped you blend into this space?
2. tell us how your journey in cripto has been.
3. what would be your advice to the newbie still trying to figure things out?
4. Did you also have the "get rich quick" mindset. I bet it slowed down your learning process.
(choose one question and share your thoughts)
1. what helped you blend into this space?
2. tell us how your journey in cripto has been.
3. what would be your advice to the newbie still trying to figure things out?
4. Did you also have the "get rich quick" mindset. I bet it slowed down your learning process.
1- there was a need for cross-border payments.
2 in general, everything is fine - several times I was stolen money that was significant at that time. Had to focus on safety
3 - read first - use later.
And always remember - not your keys, not your money.
4- In general there are, but I don’t see ways to implement this thinking in the field of cryptocurrencies. Risks are always higher than returns.
As a long-term investment, as an option, in established cryptocurrencies. As for entering and exiting with ROI, the idea is 1000% stupid.
Nothing going on around these wood
We'd better start practicing crystal ball gazing to guess what the correct range of Puzzle 66 is 
Now ignore whatever you see before the dot "." Just look at whatever you see after the dot.😉 chop chop and good luck.
Ps
it was offtopic. but still. Guys, where diagran is trying to take you does not make any sense. for subtraction, division, multiplication, etc. even if it reduces the search range for a key, it proportionally increases the number of searched keys. it all makes no sense.
2**65 combination + 2**65 publick key generation + finding a match between the combinations and the generated public key = puzzle solved
you are my idol. and where will you store 2^65 combinations?The problem isn't guessing a random number, it's narrowing down the search range to more probable keys. Thank you for posting the percentages; this way we can see that after 54, none have fewer than 40% of bits as 1 or 0, nor more than 60%. I believe we can accept this as a fact.
You can see - but you cannot say that this rule will work for the next puzzle..
Try to understand it.
Literally - what happened before - does not affect what happens after. What happens after has nothing to do with what happened before.
Take it as an axiom.
Narrowing the range is so non-critical - that it will not put any pressure on the puzzle
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?
this is a mobile CPU! This does not say anything about keyrates on your CPU!
very strange argument.Next time, tell me about new mathematics right away.
Quote
Speed? No benchmark? We already have GPU enabled tools which are 20 to 30 times faster than CPU versions, I don't know what you are promising, but definitely your tool is not faster than others whatsoever, besides searching with CPU is useless.
On my slow CPU i get about 30% more speed (now i get about 2.6 million keys/s on one core), but the speedgain may be different on other CPUs - hard to say. I would be happy if some users would post keyrates of their CPUs.
what cave did you come out of?
KEYHUNT by alberto 4 million keys per stream.
bitcrack 3 million keys per stream.
I personally have GPU generation - 4 billion keys per second.
And this is in open source - which the developers provided for free.
I have developed a new tool to solve #66:
- ONLY CPU / highly optimized for speed and about 30% faster (on my CPU) than the fastest tool i know
- ONLY LINUX x86_64 / there is no and NEVER will be a WINDOWS/MAC version (DO NOT ASK!!!), but it may run on Windows Subsystem for Linux (WSL) / not tested
- SPECIAL SEARCH ALGORITHM/LOGIC that allows resuming search and has a higher chance to find the key (sucessfully tested on the solved puzzles!) / no stupid random or incremental search
- DUE TO LEGAL REASONS PRECOMPILED/PRECONFIGURED FOR #66 / i will release an update for #67 once #66 is solved
- ONLY CPU / highly optimized for speed and about 30% faster (on my CPU) than the fastest tool i know
- ONLY LINUX x86_64 / there is no and NEVER will be a WINDOWS/MAC version (DO NOT ASK!!!), but it may run on Windows Subsystem for Linux (WSL) / not tested
- SPECIAL SEARCH ALGORITHM/LOGIC that allows resuming search and has a higher chance to find the key (sucessfully tested on the solved puzzles!) / no stupid random or incremental search
- DUE TO LEGAL REASONS PRECOMPILED/PRECONFIGURED FOR #66 / i will release an update for #67 once #66 is solved
30 percent faster than what? Can I have a specific example?
you are talking about an increased chance of searching - how is this statement justified?
PS do not install code from an unknown source.