Skip to Content

Changes for page Networks

Last modified by Zenna Elfen on 2026/01/05 21:51
From version 13.1
edited by Zenna Elfen
on 2025/11/24 11:47
Change comment: There is no comment for this version
To version 28.1
edited by Zenna Elfen
on 2026/01/05 19:45
Change comment: There is no comment for this version

Summary

Details

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