Skip to Content

Changes for page Networks

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