Главная
Study mode:
on
1
Intro
2
Some Requirements
3
Convergence example
4
Three requirements for a CRDT merge function
5
Some examples of CRDTS
6
Ideally we want universal state transitions
7
Voting Example
8
One solution is Blockchain
9
Not a good solution
10
What happens if somebody adds a new block?
11
Fault Tolerance
12
What if blocks conflict?
13
Simultaneous confirmation
14
We can now define a merge function!
15
One big problem?
16
Data structures to the rescue
17
Optimising Beliefs
18
Convergent Proof of Stake is close to optimal
19
Convex Virtual Machine
20
Structure of Global State
21
Data Types
22
Every Account is Lisp Machine!
23
Smart Contracts - Vote Counting Actor
24
Smart Contracts - Usage from User Account
25
A little necessary economics
Description:
Explore a novel approach to consensus inspired by CRDTs and category theory in this conference talk from Strange Loop 2022. Delve into the Convergent Proof of Stake consensus algorithm and its implementation for efficient real-time decentralized computation using Convex Lisp. Learn how immutable persistent data structures and digital signatures enhance security in blockchain technology. Discover how this innovative method addresses the shortcomings of traditional blockchain, offering improved scalability and efficiency. Follow along as the speaker, Mike Anderson, demonstrates the practical applications of this technology, including voting systems and smart contracts. Gain insights into the structure of global state, data types, and the concept of treating every account as a Lisp machine. Understand the economic considerations necessary for implementing this system and how it compares to existing blockchain solutions.

Beyond Blockchain - Convergent Consensus

Strange Loop Conference
Add to list
0:00 / 0:00