REM: Resource-Efficient Mining for Blockchains
summary
REM replaces wasted PoW hashing with Proof-of-Useful-Work inside Intel SGX enclaves, counting CPU instructions as metered work and using hierarchical attestations so arbitrary instrumented programs can be publicly verified. REM is implemented by swapping into Bitcoin Core — the first full SGX-based blockchain — and shows 5–15% runtime overhead while experimenting with four useful workloads. A statistical framework defends against compromised CPUs (stale-chips problem), with simulations where adversarial revenue converges near 1 and false-rejection waste falls toward zero.
AI-written summary · about
chapters (12)
- 0:00Start
- 3:35Environment Friendly Alternatives in other settings
- 5:20Software Guard extension
- 6:21SGX: remote attestation
- 8:06Related: Proof of Elapsed Time
- 9:18Unaddressed challenges in POET
- 12:05Meter the useful work
- 13:02Secure Instruction Counting
- 17:53Hierarchical Attestation
- 20:29Implicit PKI in SGX
- 22:42Cost: probability of false rejection
- 23:57Conclusion
related talks
50mTrusted Execution Environments Meet the Blockchain
25mEgalitarian Computing
54mWhen Good Turns Evil: Using Intel SGX to Stealthily Steal Bitcoins
41mMiguel de Vega, Ravital Solomon, Remi Gai & Pascal Paillier I Pragma Denver 2024
01h 00mPrivacy Preserving Smart Contracts
52mBDoS: Blockchain Denial of Service
15mAccelerating Encrypted Deduplication via SGX
20mEnabling Low-Cost Secure Computing on Untrusted In-Memory Architectures