network:post-consensus:tradeoff
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
network:post-consensus:tradeoff [2022/08/08 15:41] – vleesbanaan | network:post-consensus:tradeoff [2023/01/03 21:58] (current) – removed vleesbanaan | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ===== Space-Time Trade-offs ===== | ||
- | ==== PoST vs PoW ==== | ||
- | One of the unique features of the Proof of Space and Time (PoST) consensus algotithm is that is it allows to cheaply precompute hashes, rather than computing them on the fly. This allows for a [[https:// | ||
- | |||
- | ==== Trade-offs ==== | ||
- | Although pre-computing the hashes is generally the most cost-effective way to respond to these network challenges, from a technical perspective it is still entirely possible to compute this bingo-card on the fly. This would require a supercomputer to brute-force the plot filter in order to create a plot that passes for each challenge. Effectively, | ||
- | Specifically, | ||
- | The former would be in the realm of $750 dollars, whereas the computer required to create such tables within 30 seconds alone would cost __substantially__ more, currently. | ||
- | |||
- | |||
- | ==== Role of k-size and Plot filter ==== | ||
- | Important determinants for the economic viability of PoST over PoW are the size of the table (k-size) and the plot filter. The k-size determines the drivespace required to save the table, based on the following approximation: | ||
- | i.e. If you reduce the network' | ||
- | |||
- | ==== Network Security ==== | ||
- | It is important to note that the space-time trade-off does not compromise the security of the network. It only allows to " |
network/post-consensus/tradeoff.1659973310.txt.gz · Last modified: 2022/08/08 15:41 by vleesbanaan