Bitcoin Forum
May 22, 2024, 06:50:30 AM *
News: Latest Bitcoin Core release: 27.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: [1]
  Print  
Author Topic: basic probability  (Read 142 times)
ignacio_buendia (OP)
Newbie
*
Offline Offline

Activity: 12
Merit: 14


View Profile
August 04, 2020, 11:06:53 AM
Last edit: August 04, 2020, 01:07:03 PM by ignacio_buendia
 #1

Is it correct to state the following?

If the difficulty of the protocol requires a digest with 5 leading zeros, than I have the chance of ((1/16^5)+(1/16^6)+...(1/16^32)) to find a valid proof of work with 1 attempt - regardless of any variables?
j2002ba2
Full Member
***
Offline Offline

Activity: 204
Merit: 437


View Profile
August 04, 2020, 01:47:46 PM
Merited by suchmoon (4), odolvlobo (1), ABCbits (1)
 #2

No. The zeroes are independent. The probability of having 5 (hexadecimal) leading zeroes is 16-5.
BrewMaster
Legendary
*
Offline Offline

Activity: 2114
Merit: 1292


There is trouble abrewing


View Profile
August 04, 2020, 02:15:06 PM
 #3

since the difficulty is defined as an integer comparison not a "leading zero count" thing, if you want to compute the probability of finding a block at first attempt then you must find the probability of finding a number that is in range from 0 to target from a bigger range of numbers that go from 0 to 2^256.
and if i'm not mistaken that probability is calculated by dividing target by 2^256.

There is a FOMO brewing...
Pages: [1]
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!