How Difficult is Finding a Nonce with Input starting with 56 Zeros...

NotFuzzyWarm

legendary

Activity: 3822

Merit: 2703

Evil beware: We have waffles!

Quote from: kelonmusk on April 28, 2023, 08:45:48 PM

In my opinion, it's important to first understand how Bitcoin mining works and what role the hash plays in that process. You can see, miners trying to solve complex mathematical problems, and the first one to do so successfully gets to add a new block to the blockchain, earning themselves a reward in the form of new Bitcoins.

I suggest you take your own advice and learn how Bitcoin mining works. A good place to start is here.

Folks, just how many times must it be said that BTC mining is NOT "solving complex mathematical problems". Decrypting sha256 is NOT a complex problem - it is a simple and very straightforward brute-forcing of a solution by substituting values applied to the fixed mathematical process: apply a number to the process, see if works and report yes or no. If no, increment the value and try again. Repeat billions/trillions of times per second until new work is received (most often the case) or 1 core in 1 chip in your miner gets lucky and finds the correct hash.

kelonmusk

member

Activity: 198

Merit: 10

COMBO Network ex COCOS-BCX

In my opinion, it's important to first understand how Bitcoin mining works and what role the hash plays in that process. You can see, miners trying to solve complex mathematical problems, and the first one to do so successfully gets to add a new block to the blockchain, earning themselves a reward in the form of new Bitcoins.

Hash you've mentioned with all those leading zeros, it's essentially a representation of the solution the miner has found. For now, as for whether a quantum computer was responsible for finding that hash, I would say it's not necessarily the case.

While it's true that quantum computers are expected to be much more powerful than traditional computers, and they could potentially solve these problems much faster, they're still in the early stages of development, and their practical use in mining is yet to be seen. So, as more miners join the network and the combined computational power increases, the difficulty is adjusted accordingly.

kano

legendary

Activity: 4592

Merit: 1851

Linux since 1997 RedHat 4

Quantum computers have nothing to do with hashing sha256 blocks quickly.
Block solving is a brute force attempt to get leading zeros, it's not complex, it's a simple hash.

bettercrypto

sr. member

Activity: 1498

Merit: 271

DGbet.fun - Crypto Sportsbook

Quote from: memz13155n on September 19, 2021, 09:33:10 AM

A bitcoin hash for example 00000000000000000000000000000000000000000000000000000000f999be0f (illustration purpose) found my an anonymous miner. Does that means a quantum computer did it?
I know the more leading zeros are there the more exponentially difficult it gets.

A has like this is too hard hash to find due to is highly unlikely that it was found on a regular computer.
And about the leading zero in the hash might indicate a significant amount of computational power that is being
used to find it.

And quantum computers as far as I know are still in development it is not available and are being used for mining,
therefore, it is not impossible.

highswingingtombolo

newbie

Activity: 1

Merit: 0

can you explain this formula?

Quote from: kano on September 19, 2021, 07:30:59 PM

2^(N*4) chance per hash.

elsabz

newbie

Activity: 7

Merit: 0

Quote from: kano on October 21, 2021, 07:51:48 AM

He said zeros with a text string shown, not bytes.

Ok but 56 zeros are terrible Grin

kano

legendary

Activity: 4592

Merit: 1851

Linux since 1997 RedHat 4

He said zeros with a text string shown, not bytes.

elsabz

newbie

Activity: 7

Merit: 0

Hello,

This string of numbers is 64 characters long then 32 bytes, the number of zeros is 56 but as a couple of bytes makes a zero, therefore the number of zeros N is equal to 28, not 56.

kano

legendary

Activity: 4592

Merit: 1851

Linux since 1997 RedHat 4

N = number of zeros

2^(N*4) chance per hash.

A CPU can do it, a 100TH/s miner can do it.

The chance of doing it is purely dependent upon the number of times you try.
If you try once, you have a 1 in 2^(N*4) chance of getting that many zeros.

memz13155n

newbie

Activity: 1

Merit: 0

A bitcoin hash for example 00000000000000000000000000000000000000000000000000000000f999be0f (illustration purpose) found my an anonymous miner. Does that means a quantum computer did it?
I know the more leading zeros are there the more exponentially difficult it gets.

Topic: How Difficult is Finding a Nonce with Input starting with 56 Zeros... (Read 738 times)