Timeline for How can we be sure that a new block will be found?
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 19 at 15:59 | comment | added | Benjamin Grange | I'm curious about SHA-256. What properties have been proved about it (vs assumed)? Why do we feel so safe modeling it as a Poisson process? | |
| Apr 13, 2017 at 12:47 | history | edited | CommunityBot |
replaced http://bitcoin.stackexchange.com/ with https://bitcoin.stackexchange.com/
|
|
| Feb 19, 2017 at 23:47 | comment | added | Murch♦ | @NickODell: für = for, sonst = else. I.e. for natural numbers it's the upper formula, for negative values it's always zero. | |
| Feb 19, 2017 at 19:03 | comment | added | Nick ODell | What do für and sonst mean in this context? | |
| Feb 19, 2017 at 12:00 | history | edited | Murch♦ | CC BY-SA 3.0 |
added 29 characters in body
|
| Mar 4, 2014 at 14:29 | history | edited | Murch♦ | CC BY-SA 3.0 |
Formatting
|
| Mar 4, 2014 at 13:29 | history | edited | Murch♦ | CC BY-SA 3.0 |
Explanation of what one is looking at in the list of block intervals.
|
| Mar 4, 2014 at 8:39 | history | edited | Murch♦ | CC BY-SA 3.0 |
Added an explanation how to calculate probabilities in a Poisson process
|
| Mar 3, 2014 at 20:25 | history | edited | Murch♦ | CC BY-SA 3.0 |
added 71 characters in body
|
| Mar 3, 2014 at 20:08 | history | edited | Murch♦ | CC BY-SA 3.0 |
added 128 characters in body
|
| Mar 3, 2014 at 19:55 | history | edited | Murch♦ | CC BY-SA 3.0 |
Corrected my answer to accomodate the fact that the block finding is a Poisson process
|
| Mar 3, 2014 at 17:45 | history | answered | Murch♦ | CC BY-SA 3.0 |