REAL SERVERLESS WITH CRDTS AND IPFS
summary
A peer-to-peer order-picking prototype uses Scala, IPFS/IPLD and Akka CRDTs to keep each picker’s JSON tree locally and replicate only content-addressable roots; updates produce new hashes so history is preserved and evidence is auditable. Implementation uses a content-addressable DAG via IPFS/IPLD, a CRDT map of orderID → current-root-hash for cluster membership and sync, and a free-monad based “Fresnel” routine to fold nested JSON into linked hashes; the system runs and survives intermittent connectivity.
AI-written summary · about
chapters (34)
- 0:00Intro
- 0:34Factory
- 1:07Serverless
- 1:39Client Only
- 1:49PeertoPeer Technology
- 2:20Factory on fire
- 2:48Main tenets
- 3:21Order Picking
- 3:34Raw Material Information
- 4:45Distributed data
- 4:57What technology to use
- 5:21What is IPFS
- 6:03IPFS DAG
- 7:04IPFS Value
- 7:54IPFS Construction
- 9:17Scala Model
- 10:49Label to Map
- 12:16Free Monad
- 12:38Functional Programming
- 12:50Interpreter
- 13:04Logic
- 13:14Lifting
- 13:43JSON
- 14:03Test Interpreter
- 15:00Nested Structures
- 15:48Fresnel Lens
- 17:36Monadic
- 18:15Fresnel Ring
- 19:01Fiddle
- 19:53Combining elements
- 21:16Fixing comments
- 21:47Working with Jason
- 22:26Streaming hashes
- 23:07akka cluster
related talks
51mDistributed Apps with IPFS
30mCONSCIOUS CONSISTENCY WITH AKKA CLUSTER, CRDTS AND DISTRIBUTED DATA
45mHow to build decentralized serverless html5 applications
08mBuilding CRDT Objects for P2P Multiplayer Applications
36mKnee Deep Into P2P
31mFUNCTIONAL EVENT-DRIVEN ARCHITECTURE
49mWhat CRDTs, distributed editing and the speed of light means to your writer friends
27mBUILDING A REAL-TIME AUCTION ENGINE USING EVENT SOURCING