CSM achieves optimal linear scaling in storage efficiency, throughput, and security for state machine execution under Byzantine faults via coded states and information-theoretically verifiable delegation.
Pinocchio: Nearly practical verifiable computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Coded State Machine -- Scaling State Machine Execution under Byzantine Faults
CSM achieves optimal linear scaling in storage efficiency, throughput, and security for state machine execution under Byzantine faults via coded states and information-theoretically verifiable delegation.