Skip to Content

Changes for page Networks

Last modified by Zenna Elfen on 2026/01/05 21:51
From version 26.1
edited by Zenna Elfen
on 2026/01/05 19:44
Change comment: There is no comment for this version
To version 12.1
edited by Zenna Elfen
on 2025/11/24 11:46
Change comment: There is no comment for this version

Summary

Details

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