Changes for page Networks

Summary

• Page properties (1 modified, 0 added, 0 removed)

Details

Page properties

Content

...	...	@@ -8,75 +8,24 @@
8	8
9	9
10	10
11		-
12		-
13		-
14		-
15	15	== Building Blocks of P4P Networks ==
16	16
17	17
18	18	(% class="box" %)
19	19	(((
20		-Lost in translation? Take a look at the [[terminology>>doc:P4P.Definitions.WebHome]].
	16	+If you would like to look at the terminology you can read more about definitions here.
	17	+
21	21	)))
22	22
23	23	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.
24	24
25	25
26		-##### 9. **Data Synchronization**
27	27
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.
29	29
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
32	32
33		-*Relevant links or documentation:*
34	34
35	35
36		-##### 10. **Collaborative Data Structures & Conflict Resolution**
37	37
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		-
80	80	== Distributed Network Types ==
81	81
82	82
...	...	@@ -84,6 +84,6 @@
84	84
85	85
86	86
87		-== Overview of P4P Networks ==
	36	+== Overview of P4P Networks ==
88	88
89	89	{{include reference="Projects.WebHome"/}}