Chainweb: A Parallel chain Architecture for Massive Throughput
summary
Claims a running parallel PoW network called Chainweb that combines hundreds to thousands of chains into one fungible currency to push throughput to 10,000+ transactions per second. Implements braided references (a “Merkle cone”) so each chain incorporates peers’ Merkle receipts, giving aggregate hash power and low confirmation latency bounded by graph diameter. Uses the Pact smart‑contract language (Pact 2.4) written in Haskell and atomic, trustless SPV cross‑chain transfers at the application layer.
AI-written summary · about
chapters (9)
- 0:00Kadena and Chainweb intro
- 3:42Chainweb architecture features
- 7:20Braided proof-of-work
- 11:33Mining and validation
- 17:41Security via reference tree
- 20:51Mining incentives sync
- 23:55Cross-chain transfers SPV
- 25:59PoW consensus philosophy
- 28:00Summary and hiring
related talks
28mImplications of Interoperability
27mBlockchains, Blockweaves and the De centralised Revolution
16mBoson Consensus: A Scalable Blockchain Sharding Consensus
02h 20mSuperchain Chats
26mParachains – Disrupting the Layer One Landscape
01h 12mScaling distributed ledgers: Achieving arbitrary throughput and sub-second latency
17mLadder: A Convergence-based Structured DAG Blockchain for High Throughput and Low Latency
01h 02mBlockchain is Cyberpunk