Relation between K-size and successful proof rate #7672
Replies: 3 comments 2 replies
-
No, it just means when it doesn't find a proof, it does it 8 times harder. It just has more tables of numbers in it, the numbers are matched to have a mathematically significant relationship, and this creates the "proof". No plot will have more or less of a chance than another at having a proof, they all have a chance. |
Beta Was this translation helpful? Give feedback.
-
What do you mean? so having a 202GB Plot have the same probability than having a k32 100Gb Plot? |
Beta Was this translation helpful? Give feedback.
-
If you have 512 k32 plots vs 64 k35 plots, the frequency for k32 plots passing through the filter is higher. After the filter, it's all about having the proof required. Obviously, a single k35 have more hashes than a single k32, so when each passed through the filter, it's easy to guess which has a higher probability to win. As all plots are equal and by looking from the perspective of space, they all seem to be practically the same. Although, that's just part of the whole puzzle...you still have the Timelord to deal with. He/She/It may not like your plot's face. |
Beta Was this translation helpful? Give feedback.
Uh oh!
There was an error while loading. Please reload this page.
-
A k-35 plot takes roughly the same size as 8 k-32 plots. Does it also mean it has 8 time the odds of finding a solution to a puzzle at a given difficulty as a k-32 plot? More? Less?
Beta Was this translation helpful? Give feedback.
All reactions