Skip to Content

Changes for page Networks

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