Random extraNonce approach. Does it add an Edge?

[MakerAZ]

Hello!

I am Solo mining with Futurebit Apollo II Full Node Personal BTC Miner. It mines at roughly 5TH/s. I run it mostly in ECO mode, though it can reach 10TH/s in TURBO mode.
As per the response I got from Futurebit's Support Team the miner software is in-house built, so I don't know what algorythm it follows.

I wonder if Random extraNonce approach could add an Edge to Solo mining.

So, let's quickly go over the numbers:

Total Combinations:
With a 32-bit nonce and a 32-bit extraNonce (I know it is not limited to 32-bit), the total number of combinations is 2^32 × 2^32=18,446,744,073,709,600,000 combinations.

Hashing Speed and Time:
At 5 TH/s (5 trillion hashes per second), I can compute 5 × 10^12 hashes per second.

Total Time to Exhaust Entire Range:
To exhaust the entire combined range:

Number of combinations: 18,446,744,073,709,600,000
Hashing speed: 5 × 10^12 hashes per second
Time required: 18,446,744,073,709,600,000 / 5 × 10^12 seconds = approximately 61489 minutes (around 42.5 days). (As a sidenote here - I wish I could test it. I am ready to spend all 42,5 days waiting for a valid block to be found, but I don't know how to put this into practice with the Apollo.)


Checking within 10 Minutes:
In 10 minutes, I can compute: 5 × 10^12 hashes / second × 60 seconds / minute × 10 minutes =  3,000,000,000,000,000 hashes, which is just a fraction of the total combinations.

Strategy for Random extraNonce
Given these constraints, would favoring a random extraNonce be advantageous?

Randomizing extraNonce:
Since hashing the entire space is impractical, could randomizing the extraNonce helps explore a wider variety of block headers in a shorter amount of time.

Exploring a Larger Search Space:
By randomly changing the extraNonce, do I increase the number of distinct block headers being tested? Can this help cover a broader search space in a given timeframe?

Can this approach really increase the likelihood of encountering a valid block header compared to a purely incremental extraNonce?

On the other hand, the block that I Solo mine is unique, since it has my bitcoin address in the coinbase transaction, and it is mined ONLY by me and by me ALONE.
So I am actually not racing against other miners over my unique block. Every other solo miner has its own unique block to mine. And with the uniform distribution of sha256 results, I am not sure if random approach to extraNonce can increase my chances at all...

[NotFuzzyWarm]

Various ways to 'increase your odds of finding a block' have been thought of and tried numerous times over the past decades and NONE of them change the fact that Random is Random meaning that they do not work at all. The only way to increase your odds is to run more hash rate.

[MakerAZ]

Various ways to 'increase your odds of finding a block' have been thought of and tried numerous times over the past decades and NONE of them change the fact that Random is Random meaning that they do not work at all. The only way to increase your odds is to run more hash rate.

I would disagreed. I am pretty sure that random extraNonce approach can give an Edge to Solo miners.
I will elaborate on this soon.

[MakerAZ]

The Random extraNonce approach actually guarantees that a Solo Miner will check some extraNonces before they are reached by pool miners. Unlike pools that follow a structured, incremental approach, a solo miner using a random approach explores different parts of the hash space, making it possible to find a valid block before the pools have checked those specific extraNonces. This provides a strategic edge in solo mining.

[NotFuzzyWarm]

You may want to read about how BTC mining actually works instead of making guesses based on several false assumptions you've made before falling down that rabbit hole...

For a start, ref Kano's help files https://kano.is/index.php?k=mining and https://kano.is/index.php?k=minedet
You also should read Satoshi's Whitepaper on the theory behind Bitcoin mining
BTW: Kano is the sole remaining active primary of cgminer which is what 99% of the miners in the world have been running since 2011.

For what it's worth, the core software that the Apollo's run is mining software from BitFury as it is using their chips.  BF basically copied the functions of cgminer while writing their own version of it. The BF code is performing the exact same work functions that cgminer does.

Oh - when it comes to producing work, pools and solo are doing the exact same thing. Only difference is that a pool has accounting procedures to track your work so you get get paid based on your % of the effort expended by all miners. All miners receive unique work just as if they were connected to their own private node (solo).

[Nexus9090]

This is quite helpful

https://learn.saylor.org/mod/book/view.php?id=36380&chapterid=19030

[MakerAZ]

You may want to read about how BTC mining actually works instead of making guesses based on several false assumptions you've made before falling down that rabbit hole...

For a start, ref Kano's help files https://kano.is/index.php?k=mining and https://kano.is/index.php?k=minedet
You also should read Satoshi's Whitepaper on the theory behind Bitcoin mining
BTW: Kano is the sole remaining active primary of cgminer which is what 99% of the miners in the world have been running since 2011.

For what it's worth, the core software that the Apollo's run is mining software from BitFury as it is using their chips.  BF basically copied the functions of cgminer while writing their own version of it. The BF code is performing the exact same work functions that cgminer does.

Oh - when it comes to producing work, pools and solo are doing the exact same thing. Only difference is that a pool has accounting procedures to track your work so you get get paid based on your % of the effort expended by all miners. All miners receive unique work just as if they were connected to their own private node (solo).

Thank you very much for all the references. It is indeed a rabbit hole
I will read through and come back here.

[Nexus9090]

I asked the same question a while back, it took a lot of reading and to be honest I'm still not sure I fully understand it.

AFAIK nonce+extranonce is 2^96 (79,228,162,514,264,337,593,543,950,336)

nonce being 4 bytes 2^32

extranonce being 8 bytes 2^64

and that accounts for the total adjustment range a miner can make to a header without tweeking the timestamp on each hash (which is still and option and is still done by some miners).

Theoretically extranonce can be bigger since the coinbase transaction has more space in it, but its suggested that is outside the protocol.

The mechanism I still dont have a grip on is how the nonce values are issued by a pool or bitcoind and how a pool then keeps track of nonce values to prevent overlap from different miners. There's a good chance it doesnt which means miners will overlap work.

Like you suggest, if you start at zero each time you'll never see the whole picture and have a much lower chance of ever seeing a result, which kind of explains why high hash rate miners tend to hit blocks more often as they cover a bigger range in a shorter space of time; however zero is supposed to be a random starting point in the range of 2^96. But, I'm not sure it is.

I'm assuming pools & bitcoind issue nonce + extranonce unless work is generated locally, that the part of the mystery that I've not uncovered yet.

I expect locally generated work would probably be issued to stop your miner from hammering a pool with too many requests. So your miner only fetches new work from a pool once it has found a hash with a larger difficulty than the difficulty setting of the pool. I'm not sure how that mechanism works for mining to bitcoind and if the locally generated work is contiguous from the last nonce value hashed or its a new random base.


It is a deep and complicated rabbit hole for sure.

[mikeywith]

There is no overlapping, the pool provides the blocktemplate, the miner uses different nonce, every minier is randomly hashing a block, unless the miner software is bad and for some reason one miner is duplicating the work of another miner.

You need to understand that mining is not about solvig a formula, it is not incremental, its not that you try
1
2
3
4
And 5 is a block, block could be nonce 1, so thinking you can jump here and there to hit a block faster is wrong.

Give my post a read

[philipma1957]

There is no overlapping, the pool provides the blocktemplate, the miner uses different nonce, every minier is randomly hashing a block, unless the miner software is bad and for some reason one miner is duplicating the work of another miner.

You need to understand that mining is not about solvig a formula, it is not incremental, its not that you try
1
2
3
4
And 5 is a block, block could be nonce 1, so thinking you can jump here and there to hit a block faster is wrong.

Give my post a read

The part is don't understand is if the diff is:

 90,000,000,000,000 and I need a value over 90t has does the software decide to pick a share.

I have seen really high winning shares.

say 2,000,000,000,000,000 which is 2000t

So if an asic can go way past 90t what's the top end of shares.

what limits the high share number?

and if the high share number is limited at say 20,000t which is way over the current 90t winning value.
 what makes it hard to go high. as there would be way more numbers over 90t that win then there are losing numbers under 90t.

heck 19,910t would be high enough and only 90t-1  would be too low.

there are ways to make it harder to go over 90t
but this is what always tied me up.

I have seen winning share 10x the diff.  which would mean 10x more winners possible  then losers.

[mikeywith]

The maximum difficulty would be about 2^224, that is unrealistically huge, and the current 90T diff is a tiny fraction of that.

I think it would make sense when you understand what a target is, target is what the logic is built on, we store the target in the block header and not the difficulty, the difficulty is just an easier representation of the target, so mining becomes more difficult when the target is smaller and vice versa, so as silly as it sounds, when you see difficulty goes up, it simply means target went down.

So an easy target would be infinity, which means anything that you guess below infinity would be valid, a difficult target would be 0, which means there is nothing smaller, the lower the target goes the smaller the number of valid hashes.

The current target is

Code:

00000000000000000003255b0000000000000000000000000000000000000000

in decimal (more human-readable format) that is
301319254070149585548971905645948786445483268317904896   


The target in the previous epoch was

Code:

000000000000000000033d760000000000000000000000000000000000000000

in decimal
310338180674118587457206844748640968959780028040609792

Notice that the target in the previous epoch was larger (difficulty was lower).

to make things a lot clearer, here is the target of the first block Satoshi mined

Code:

00000000ffff0000000000000000000000000000000000000000000000000000

in decimal
26959535291011309493156476344723991336010898738574164086137773096960

now since Difficulty= maximum target/given target, if you apply that on the first block it would give you  difficulty of 1 (target was too huge, difficulty was too low, you basically guess anything and get a block ), apply it for the current target and you get 89T

Now if you read the post I quoted in my previous reply, you would understand how it's easier to hash a number that has less leading zero than more, i.e, it's easier to find larger numbers than smaller ones, think of it this way, you have a box that has an infinite number of pieces of paper ranging from 1 to infinity, I tell you if you manage to pick any piece of paper that is smaller than 1000000000000000000000000000000000, I 'l give you the prize, that would certainly be easier than if I told you the number you need is smaller than 10 because then there would be only 9 chances out of the infinite numbers in the box.

I know it's easier to understand difficulty than to understand the target, but really, if you don't understand the target, there will always be missing pieces in your comprehension of how this works, now when you say high share, it's actually a small target share which then translate to a high diff share.

So if you are required to find a number smaller or equal to 1000 and you find 1, then that's a very small target which is a very high diff, so when you see blocks getting a high share they technically found a hash a lot smaller than they had to win a block, so the smallest the target can be would be a 256-bit number, which is just right above 0, so when you ask how high share can be, it can be as high as 2^224.

[philipma1957]

The maximum difficulty would be about 2^224, that is unrealistically huge, and the current 90T diff is a tiny fraction of that.

I think it would make sense when you understand what a target is, target is what the logic is built on, we store the target in the block header and not the difficulty, the difficulty is just an easier representation of the target, so mining becomes more difficult when the target is smaller and vice versa, so as silly as it sounds, when you see difficulty goes up, it simply means target went down.

So an easy target would be infinity, which means anything that you guess below infinity would be valid, a difficult target would be 0, which means there is nothing smaller, the lower the target goes the smaller the number of valid hashes.

The current target is

Code:

00000000000000000003255b0000000000000000000000000000000000000000

in decimal (more human-readable format) that is
301319254070149585548971905645948786445483268317904896   


The target in the previous epoch was

Code:

000000000000000000033d760000000000000000000000000000000000000000

in decimal
310338180674118587457206844748640968959780028040609792

Notice that the target in the previous epoch was larger (difficulty was lower).

to make things a lot clearer, here is the target of the first block Satoshi mined

Code:

00000000ffff0000000000000000000000000000000000000000000000000000

in decimal
26959535291011309493156476344723991336010898738574164086137773096960

now since Difficulty= maximum target/given target, if you apply that on the first block it would give you  difficulty of 1 (target was too huge, difficulty was too low, you basically guess anything and get a block ), apply it for the current target and you get 89T

Now if you read the post I quoted in my previous reply, you would understand how it's easier to hash a number that has less leading zero than more, i.e, it's easier to find larger numbers than smaller ones, think of it this way, you have a box that has an infinite number of pieces of paper ranging from 1 to infinity, I tell you if you manage to pick any piece of paper that is smaller than 1000000000000000000000000000000000, I 'l give you the prize, that would certainly be easier than if I told you the number you need is smaller than 10 because then there would be only 9 chances out of the infinite numbers in the box.

I know it's easier to understand difficulty than to understand the target, but really, if you don't understand the target, there will always be missing pieces in your comprehension of how this works, now when you say high share, it's actually a small target share which then translate to a high diff share.

So if you are required to find a number smaller or equal to 1000 and you find 1, then that's a very small target which is a very high diff, so when you see blocks getting a high share they technically found a hash a lot smaller than they had to win a block, so the smallest the target can be would be a 256-bit number, which is just right above 0, so when you ask how high share can be, it can be as high as 2^224.

okay makes sense. thank you