Explore a groundbreaking approach to reducing costs in large-scale replicated systems under a Byzantine fault model in this IEEE conference talk. Discover how the proposed method transforms replicated state machines (RSMs) to delegate state machine execution, utilizing an untrusted prover to produce cryptographic proofs of correct state transitions. Learn about Piperine, a system designed to make proof machinery profitable in RSMs by reducing proving and verifying costs while maintaining liveness. Examine the experimental results demonstrating Piperine's effectiveness in a payment service and its application to ERC-20 transactions in Ethereum, showcasing significant reductions in per-transaction and network costs. Delve into topics such as PCPs, SNARKs, state extraction, and performance optimizations. Gain insights into the potential of this innovative approach for improving efficiency in real-world RSMs with large numbers of nodes.
Overview
Syllabus
Intro
Reexecution Problem
Mitigating cost of reexecution
Piperine: Idea
Piperine: Extra features
Rest of the talk
Background: PCPs, SNARKS
Background: Spice [OSDI'18]
Background: State in Spice
Liveness
Our Solution: State Extraction
Performance Optimizations
Ethereum Primer
Applying Piperine to Ethereum
Implementation
Experimental Questions
1 When can Piperine reduce cost?
1 When can Piperine reduce CPU cost?
1 When can Piperine reduce network use?
2 Can Piperine help real RSMS?
Summary
Taught by
IEEE Symposium on Security and Privacy
