Transaction

j"1LAnZuoQdcKCkpDBKQMCgziGMoPC4VQUckM¼<div class="post">I'm not sure which random number thing you're referring to, but here is a quick outline of how the generation works:<br/><br/>Prepare a block of memory organized as a struct - certain fields like the hash of the previous block, the current time and some other housekeeeping information is filled in.&nbsp; The struct has an integer field and another 'expansion' field where the data is free form.&nbsp; This free form data is altered (simple increment of a number) and then the struct is hashed.&nbsp; The resulting hash is interpreted as a large integer.&nbsp; If it is equal to or less than the current difficulty function then the proof of work has been found and this block is added locally and broadcast to other nodes.<br/><br/>This is similar to having a 100 sided die - if you roll below 70 you win.&nbsp; To make the game harder you have to roll below 50, then 40, etc.&nbsp; Basically there is no known shortcut to go from a desired hash value to the original input, we only know how to do it quickly in the other direction, so it is simply a brute force iterative process.&nbsp; Statistically, less blocks of data will be below the target value, the lower the target value is.&nbsp; Finding a block that hashes below the difficulty value proves that you worked on the problem, or got lucky and hit it on the first try, but over a long period of time you won't keep getting lucky, you'll have to try lots and lots of different values.</div> text/html