Optimizing network topologies...
summary
Claim: a DAG-based consensus replaces proof-of-work by layering signature-backed units and dynamic reputation to scale confirmation without heavy mining. Prototype uses Scala, Akka, Cats, Algebird, Kubernetes and composes HoneyBadger-style async consensus (HoneyBadger BFT / ACS) for rare conflicts. Validation runs in parallel as granular “monadic execution contexts,” a magnetic pipeline gossips uncertain observations, a stochastic neural-gas rebalances peer topology, and a directed acyclic hypergraph bundles transactions; core pieces are implemented and tested though the monad wrapper is not yet complete.
AI-written summary · about
chapters (14)
- 0:00Introduction and speaker background
- 1:48Bitcoin overview and scaling issues
- 3:51Directed acyclic graph proposal
- 6:00Replacing proof-of-work with reputation
- 8:07Programmatic validation explained
- 10:30Resolution and consensus mechanisms
- 11:54Magnetic execution pipeline
- 13:39Tip selection and hypergraphs
- 14:21Optimizing network topologies
- 16:08Byzantine fault tolerance
- 17:32Data model and reuse in DAGs
- 19:20Hierarchical clustering and scale-free topology
- 20:41Dependencies and validation speed
- 21:02Programmatic validation and monadic design
related talks
42mBeyond Blockchain: Convergent Consensus
47mCant we just agree
55mUntangling the BlockDAG
16mDispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks
48mDistributed Consensus Algorithms
19mLiDO-DAG: A Framework for Verifying Safety and Liveness of DAG-Based Consensus Protocols
31mProofless Consensus & Client-side Validation
29mBuilding Probabilistic BFT Protocols Through Subsampled Voting