Title: bitcoin mining range Post by: kzsy on May 20, 2021, 10:42:45 AM has anyone ever tried to write a bitcoin miner in C or assembler using functional programming?
a hash-check should be based on simple arithmetic, cutting out all the corners might make it more efficient. optimizing the compiler for such operations should also be an option. i don't know much about programming myself, but it puzzles me that its getting so hard to mine bitcoins when the amount of viable hashes drecases over time. cant just make the target range smaller? kind regards, Kat Title: Re: bitcoin mining range Post by: NotFuzzyWarm on May 20, 2021, 12:29:33 PM Quote cant just make the target range smaller? NO!Try doing a search such as "How does Bitcoin work?" and you will find that the algorithm was designed as Proof Of Work aka PoW (https://en.bitcoin.it/wiki/Proof_of_work). You cannot cheat by cutting corners as that would (attempt) to defeat the whole point of POW. Title: Re: bitcoin mining range Post by: kano on May 21, 2021, 02:24:17 AM It already did do the 3% corner cutting back in 2011
Oddly enough I also thought about how to do that corner cutting myself back then, and asked about it specifically on the forum (Aug 2011), until I found out it was already being done. But that 'corner cutting' is irrelevant when you consider that a new miner, mines literally at about 3000000 times faster than a CPU doing the same corner cutting and only uses about 10-20 times the power ... Consider that a hash is about 1600 CPU instructions, so if you could make it only 1 instruction (which you can't), that's only a 1600 times speed up :P |