Changes for page Networks

Summary

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

Details

Page properties

Content

...	...	@@ -1,84 +1,173 @@
1		-(% class="box" %)
	1	+
	2	+
2	2	(((
3		-This page contains an overview of all P4P Networks in this wiki and their building blocks.
	4	+== 15 Building Blocks of P4P Networks ==
4	4
5		-You can also [[add a P4P Network>>doc:Projects.WebHome]] or have a look at the [[P4P Applications>>doc:P4P.Applications.WebHome]].
	6	+To fully assemble a P4P network one needs a few different building blocks, below is an overview of 15 of those building blocks.
6	6	)))
7	7
8	8
9	9
10	10
	12	+(% class="row" %)
	13	+(((
	14	+(% class="col-xs-12 col-sm-8" %)
	15	+(((
	16	+
11	11
	18	+==== **1. Data Synchronization** ====
12	12
	20	+> 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.
13	13
	22	+* //How do peers detect differences and synchronize state?//
	23	+* Examples: Range-Based Set Reconciliation, RIBLT, Gossip-based sync, State-based vs op-based sync, Lamport/Vector/HLC clocks, Braid Protocol
14	14
15	15
16	16
17		-== Building Blocks of P4P Networks ==
	27	+==== **2. Collaborative Data Structures & Conflict Resolution** ====
18	18
	29	+> 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.
19	19
20		-(% class="box" %)
21		-(((
22		-Lost in translation? Take a look at the [[terminology>>doc:P4P.Definitions.WebHome]].
23		-)))
	31	+* //How do peers collaboratively change shared data and merge conflicts?//
	32	+* Examples: CRDTs (Yjs, Automerge), OT, Event Sourcing, Stream Processing, Version Vectors, Peritext
24	24
25		-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.
26	26
27	27
28		-==== **Data Synchronization** ====
	36	+==== **3. Data Storage & Replication** ====
29	29
30		-> 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.
	38	+> 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.
31	31
32		-- _How do peers detect differences and synchronize state?_
33		-- Examples: Range-Based Set Reconciliation, RIBLT, Gossip-based sync, State-based vs op-based sync, Lamport/Vector/HLC clocks, Braid Protocol
	40	+* //How is data persisted locally and replicated between peers?//
	41	+* Examples: SQLite, IndexedDB, LMDB, Hypercore (append-only logs), WALs, Merkle-DAGs (IPFS/IPLD), Blob/media storage
34	34
35		-*Relevant links or documentation:*
36	36
37	37
38		-==== **Collaborative Data Structures & Conflict Resolution** ====
	45	+==== **4. Peer & Content Discovery** ====
39	39
40		-> 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.
	47	+> Discovery occurs in two phases:
	48	+> 1. **Peer Discovery** → finding _any_ nodes
	49	+> 2. **Topic Discovery** → finding _relevant_ nodes or resources
	50	+> These mechanisms enable decentralized bootstrapping and interest-based overlays.
41	41
42		-- _How do peers collaboratively change shared data and merge conflicts?_
43		-- Examples: CRDTs (Yjs, Automerge), OT, Event Sourcing, Stream Processing, Version Vectors, Peritext
	52	+* //How do peers find each other, and how do they discover content in the network?//
	53	+* Examples: DHTs (Kademlia, Pastry), mDNS, DNS-SD, Bluetooth scanning, QR bootstrapping, static peer lists, Interest-based routing, PubSub discovery (libp2p), Rendezvous protocols
44	44
45		-*Relevant links or documentation:*
46	46
47	47
48		-==== **Data Storage & Replication** ====
	57	+==== **5. Identity & Trust** ====
49	49
50		-> 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.
	59	+> Identity systems ensure reliable mapping between peers and cryptographic keys. They underpin authorization, federated trust, and secure overlays.
51	51
52		-- _How is data persisted locally and replicated between peers?_
53		-- Examples: SQLite, IndexedDB, LMDB, Hypercore (append-only logs), WALs, Merkle-DAGs (IPFS/IPLD), Blob/media storage
	61	+* //How peers identify themselves, authenticate, and establish trustworthy relationships?//
	62	+* Examples: PKI, Distributed Identities (DIDs), Web-of-Trust, TOFU (SSH-style), Verifiable Credentials (VCs), Peer key fingerprints (libp2p PeerIDs), Key transparency logs
54	54
55		-*Relevant links or documentation:*
56	56
57		-==== **Peer & Content Discovery** ====
58	58
59		-> Discovery occurs in two phases:
60		-> 1. **Peer Discovery** → finding _any_ nodes
61		-> 2. **Topic Discovery** → finding _relevant_ nodes or resources
62		-> These mechanisms enable decentralized bootstrapping and interest-based overlays.
	66	+==== **6. Transport Layer** ====
63	63
	68	+> This layer provides logical connections and flow control. QUIC and WebRTC bring modern congestion control and encryption defaults; Interpeer explores transport beyond IP assumptions.
64	64
65		-- _How do peers find each other, and how do they discover content in the network?_
66		-- Examples: DHTs (Kademlia, Pastry), mDNS, DNS-SD, Bluetooth scanning, QR bootstrapping, static peer lists, Interest-based routing, PubSub discovery (libp2p), Rendezvous protocols
	70	+* //How do peers establish end-to-end byte streams and reliable delivery?//
	71	+* Examples: TCP, UDP, QUIC, SCTP, WebRTC DataChannels, Interpeer transport stack
67	67
68		-*Relevant links or documentation:*
69	69
70		-# **Identity & Trust**
71	71
72		-> Identity systems ensure reliable mapping between peers and cryptographic keys. They underpin authorization, federated trust, and secure overlays.
	75	+==== **7. Underlying Transport (Physical/Link Layer)** ====
73	73
74		-- _How peers identify themselves, authenticate, and establish trustworthy relationships?_
75		-- Examples: PKI, Distributed Identities (DIDs), Web-of-Trust, TOFU (SSH-style), Verifiable Credentials (VCs), Peer key fingerprints (libp2p PeerIDs), Key transparency logs
	77	+> Highly relevant for **offline-first / edge networks**, device-to-device communication, and mesh networks and relates to the hardware which facilitates connections.
76	76
	79	+* //How does data move across the medium?//
	80	+* Examples: Ethernet, Wi-Fi Direct / Wi-Fi Aware (post-AWDL), Bluetooth Mesh, LoRa, NFC, Cellular, CSMA/CA, TDMA, FHSS
77	77
78	78
79	79
	84	+==== **8. Session & Connection Management** ====
80	80
	86	+> Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation—especially important in lossy or mobile networks.
81	81
	88	+* //How are connections initiated, authenticated, resumed, and kept alive?//
	89	+* Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets
	90	+
	91	+
	92	+
	93	+==== **9. Content Addressing** ====
	94	+
	95	+> Content addressing ensures **immutability, verifiability, and deduplication**. Identity of data = cryptographic hash, enabling offline-first and tamper-evident systems.
	96	+
	97	+* //How is data addressed and verified by content, not location?//
	98	+* Examples: IPFS CIDs, BitTorrent infohashes, Git hashes, SHA-256 addressing, Named Data Networking (NDN)
	99	+
	100	+
	101	+
	102	+==== **10. P2P Connectivity** ====
	103	+
	104	+> Connectivity ensures peers bypass NATs/firewalls to reach each other.
	105	+
	106	+* //How can two peers connect directly across networks, firewalls, and NATs?//
	107	+* Examples: IPv6 direct, NAT Traversal, STUN, TURN, ICE (used in WebRTC), UDP hole punching, UPnP
	108	+
	109	+
	110	+
	111	+==== **11. Session & Connection Management** ====
	112	+
	113	+> Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation.
	114	+
	115	+* //How are connections initiated, authenticated, resumed, and kept alive?//
	116	+* Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets
	117	+
	118	+
	119	+
	120	+==== **12. Message Format & Serialization** ====
	121	+
	122	+> Serialization ensures **portable data representation**, forward-compatible schemas, and efficient messaging. IPLD provides content-addressed structuring for P2P graph data.
	123	+
	124	+* //How is data encoded, structured, and made interoperable between peers?//
	125	+* Examples: CBOR, Protocol Buffers, Cap’n Proto, JSON, ASN.1, IPLD schemas, Flatbuffers
	126	+
	127	+
	128	+
	129	+==== **13. File / Blob Synchronization** ====
	130	+
	131	+> Bulk data syncing has **different trade-offs** than small collaborative state (chunking, deduplication, partial transfer, resume logic). Critical for media and archival P2P use-cases.
	132	+
	133	+//How are large objects transferred and deduplicated efficiently across peers?//
	134	+Examples: BitTorrent chunking, IPFS block-store, NDN segments, rsync-style delta sync, ZFS send-receive, streaming blob transfers
	135	+
	136	+
	137	+==== **14. Local Storage & Processing Primitives** ====
	138	+
	139	+> Provides durable on-device state and local computation (event sourcing, materialization, compaction). Enables offline-first writes and deterministic replay.
	140	+
	141	+* //How do nodes persist, index, and process data locally—without external servers?//
	142	+* Examples: RocksDB, LevelDB, SQLite, LMDB, local WALs/append-only logs, embedded stream processors (NATS Core JetStream mode, Actyx-like edge runtimes), Kafka-like libraries
	143	+
	144	+
	145	+
	146	+==== **15. Crash Resilience & Abortability** ====
	147	+
	148	+> Ensures P2P apps don’t corrupt state on crashes. Tied to **local storage & stream-processing**, and critical in offline-first and distributed update pipelines. Abortability is the updated term for Atomicity as part of the ACID abbreviation.
	149	+
	150	+* //How do nodes recover and maintain correctness under failure?//
	151	+* Examples: WALs, idempotent ops, partial log replay, transactional journaling, write fences
	152	+
	153	+
	154	+
	155	+
	156	+)))
	157	+
	158	+
	159	+
	160	+
	161	+(% class="col-xs-12 col-sm-4" %)
	162	+(((
	163	+{{box title=" **Contents**"}}
	164	+{{toc depth="5"/}}
	165	+{{/box}}
	166	+)))
	167	+
	168	+
	169	+(% class="col-xs-12 col-sm-12" %)
	170	+(((
82	82	== Distributed Network Types ==
83	83
84	84
...	...	@@ -89,3 +89,12 @@
89	89	== Overview of P4P Networks ==
90	90
91	91	{{include reference="Projects.WebHome"/}}
	181	+)))
	182	+
	183	+
	184	+
	185	+
	186	+
	187	+
	188	+
	189	+)))