In this RCast we talked about the record breaking hurricane season, and the decline of swamp ash for luthiers. We then discussed aspects of Directed Acyclic Graphs and how they apply to RChain’s technology as well as RChain’s CBC Casper tech.
0:00:00 – Intro
0:25:48 – Darryl – questions about DAGs, Directed Acyclic Graphs, and how they apply to RChain’s tech.
0:30:49 – Greg – Last Finalized State – eventually all the paths have to run through a block that everyone has to go through or a state that everyone has to see. You can prove that anything that was ultimately validated, has to have seen that state. It’s not a bottleneck because it is post facto.
0:34:39 – Greg – Casper – one of the 4 different architectural modules – 1 – execution mechanism 2 – storage mechanism 3 – communications mechanism 4 – consensus mechanism. It’s designed so you can mix and match
0:36:31 – the different Caspers – where Casper is at now. Fairness and Liveness.
0:39:22 – Fairness is a specific aspect of Liveness.
0:40:00 – Our notion of Liveness comes from the DAG structure itself, likewise with our notion of Fairness. Writing up formal proofs is a piece of the puzzle.
0:42:00 – What is Fairness and Liveness? The problem with adding clocks.
0:44:51 – Liveness is not getting stuck. Fairness – one part of the route is deferring to the other, which is not fair.
0:47:06 – OUTRO