Skip to Content

Changes for page Networks

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