Skip to Content

Changes for page Networks

Last modified by Zenna Elfen on 2025/11/24 12:07
From version 12.1
edited by Zenna Elfen
on 2025/11/24 11:46
Change comment: There is no comment for this version
To version 13.1
edited by Zenna Elfen
on 2025/11/24 11:47
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -10,6 +10,8 @@
10 10  
11 11  
12 12  
13 +
14 +
13 13  == Building Blocks of P4P Networks ==
14 14  
15 15  
... ... @@ -21,12 +21,60 @@
21 21  To fully assemble a P4P network one needs a few different building blocks. The following is an overview of the building blocks needed for P4P networks.
22 22  
23 23  
26 +##### 9. **Data Synchronization**
24 24  
28 +> Synchronization answers **how updates flow between peers** and how they determine what data to exchange. This layer is about **diffing, reconciliation, order, causality tracking, and efficient exchange**, not persistence or user-facing collaboration semantics.
25 25  
30 +- _How do peers detect differences and synchronize state?_
31 +- Examples: Range-Based Set Reconciliation, RIBLT, Gossip-based sync, State-based vs op-based sync, Lamport/Vector/HLC clocks, Braid Protocol
26 26  
33 +*Relevant links or documentation:*
27 27  
28 28  
36 +##### 10. **Collaborative Data Structures & Conflict Resolution**
29 29  
38 +> This layer defines **how shared data evolves** when multiple peers edit concurrently. It focuses on **conflict-free merging, causality, and consistency of meaning**, not transport or storage. CRDTs ensure deterministic convergence, while event-sourced or stream-driven models maintain a history of all changes and derive consistent state from it.
39 +
40 +- _How do peers collaboratively change shared data and merge conflicts?_
41 +- Examples: CRDTs (Yjs, Automerge), OT, Event Sourcing, Stream Processing, Version Vectors, Peritext
42 +
43 +*Relevant links or documentation:*
44 +
45 +
46 +##### 11. **Data Storage & Replication**
47 +
48 +> This layer focuses on **durability, consistency, and redundancy**. It handles write-paths, crash-resilience, and replication semantics across nodes. It is the “database/storage engine” layer where **data lives and survives over time**, independent of sync or merging logic.
49 +
50 +- _How is data persisted locally and replicated between peers?_
51 +- Examples: SQLite, IndexedDB, LMDB, Hypercore (append-only logs), WALs, Merkle-DAGs (IPFS/IPLD), Blob/media storage
52 +
53 +*Relevant links or documentation:*
54 +
55 +##### 12. **Peer & Content Discovery**
56 +
57 +> Discovery occurs in two phases:
58 +> 1. **Peer Discovery** → finding _any_ nodes
59 +> 2. **Topic Discovery** → finding _relevant_ nodes or resources
60 +> These mechanisms enable decentralized bootstrapping and interest-based overlays.
61 +
62 +
63 +- _How do peers find each other, and how do they discover content in the network?_
64 +- Examples: DHTs (Kademlia, Pastry), mDNS, DNS-SD, Bluetooth scanning, QR bootstrapping, static peer lists, Interest-based routing, PubSub discovery (libp2p), Rendezvous protocols
65 +
66 +*Relevant links or documentation:*
67 +
68 +##### 13. **Identity & Trust**
69 +
70 +> Identity systems ensure reliable mapping between peers and cryptographic keys. They underpin authorization, federated trust, and secure overlays.
71 +
72 +- _How peers identify themselves, authenticate, and establish trustworthy relationships?_
73 +- Examples: PKI, Distributed Identities (DIDs), Web-of-Trust, TOFU (SSH-style), Verifiable Credentials (VCs), Peer key fingerprints (libp2p PeerIDs), Key transparency logs
74 +
75 +
76 +
77 +
78 +
79 +
30 30  == Distributed Network Types ==
31 31  
32 32