Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Block-STM: parallel execution by turning a preset order into a schedule |
|---|---|
| What the text proposes | Block-STM executes a block's transactions in parallel against a preset serial order, then re-executes the ones that read a value the parallel run got wrong. |
| Who may write | Rati Gelashvili, Alexander Spiegelman, Zhuolun Xiang, George Danezis, Dahlia Malkhi and others |
| What is settled | Transactions have a fixed order. Workers execute them optimistically. A read that later proves stale is aborted and retried. |
| Load-bearing assumption | This is a research paper. It is not a claim about a live chain's throughput. |
| What this library says afterwards | A reading of the project's public design document. Not a copy, not a benchmark, and not an offer. |
| Rights | Official external source only |