Changes for page Networks

Summary

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

Details

Page properties

Content

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