Wiki source code of Networks
Version 34.1 by Zenna Elfen on 2026/01/05 19:50
Hide last authors
| author | version | line-number | content |
|---|---|---|---|
 |
19.1 | 1 | (% class="jumbotron" %) |
| 2 | ((( | ||
| 3 | (% class="container" %) | ||
| 4 | ((( | ||
| |
20.1 | 5 | = Peer-for-Peer Networks = |
| |
19.1 | 6 | |
| |
20.1 | 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. |
| |
19.1 | 8 | ))) |
| 9 | ))) | ||
| 10 | |||
| |
27.1 | 11 | |
| |
28.1 | 12 | |
| |
34.1 | 13 | |
| 14 | |||
| |
33.1 | 15 | == Building Blocks of P4P Networks == |
| |
28.1 | 16 | |
| |
32.1 | 17 | |
| |
34.1 | 18 | (% class="col-xs-12 col-sm-5" %) |
| |
33.1 | 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 | ))) | ||
| |
32.1 | 22 | |
| |
33.1 | 23 | |
| 24 | |||
| 25 | |||
| 26 | |||
| 27 | |||
| |
34.1 | 28 | (% class="col-xs-12 col-sm-5" %) |
| |
27.1 | 29 | ((( |
| 30 | {{box title="==== Contents ==== | ||
| 31 | |||
| 32 | ====== ======"}} | ||
| |
28.1 | 33 | {{toc depth="5"/}} |
| |
27.1 | 34 | {{/box}} |
| 35 | ))) | ||
| 36 | |||
| 37 | |||
| |
11.1 | 38 | |
| |
1.1 | 39 | |
| |
24.1 | 40 | |
| |
31.1 | 41 | (% class="row" %) |
| |
25.1 | 42 | ((( |
| |
31.1 | 43 | (% class="col-xs-12 col-sm-8" %) |
| 44 | ((( | ||
| |
15.1 | 45 | ==== **1. Data Synchronization** ==== |
| |
11.1 | 46 | |
| |
13.1 | 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. |
| |
11.1 | 48 | |
| |
15.1 | 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 | ||
| |
11.1 | 51 | |
| 52 | |||
| 53 | |||
| |
15.1 | 54 | ==== **2. Collaborative Data Structures & Conflict Resolution** ==== |
| |
11.1 | 55 | |
| |
13.1 | 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 | |||
| |
15.1 | 58 | * //How do peers collaboratively change shared data and merge conflicts?// |
| 59 | * Examples: CRDTs (Yjs, Automerge), OT, Event Sourcing, Stream Processing, Version Vectors, Peritext | ||
| |
13.1 | 60 | |
| 61 | |||
| 62 | |||
| |
15.1 | 63 | ==== **3. Data Storage & Replication** ==== |
| |
13.1 | 64 | |
| 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 | |||
| |
15.1 | 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 | ||
| |
13.1 | 69 | |
| 70 | |||
| 71 | |||
| |
15.1 | 72 | ==== **4. Peer & Content Discovery** ==== |
| 73 | |||
| |
13.1 | 74 | > Discovery occurs in two phases: |
| 75 | > 1. **Peer Discovery** → finding _any_ nodes | ||
| 76 | > 2. **Topic Discovery** → finding _relevant_ nodes or resources | ||
| 77 | > These mechanisms enable decentralized bootstrapping and interest-based overlays. | ||
| 78 | |||
| |
15.1 | 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 | ||
| |
13.1 | 81 | |
| 82 | |||
| 83 | |||
| |
15.1 | 84 | ==== **5. Identity & Trust** ==== |
| |
13.1 | 85 | |
| 86 | > Identity systems ensure reliable mapping between peers and cryptographic keys. They underpin authorization, federated trust, and secure overlays. | ||
| 87 | |||
| |
15.1 | 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 | ||
| |
13.1 | 90 | |
| 91 | |||
| |
16.1 | 92 | |
| |
15.1 | 93 | ==== **6. Transport Layer** ==== |
| |
13.1 | 94 | |
| |
15.1 | 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. |
| |
13.1 | 96 | |
| |
16.1 | 97 | * //How do peers establish end-to-end byte streams and reliable delivery?// |
| |
15.1 | 98 | * Examples: TCP, UDP, QUIC, SCTP, WebRTC DataChannels, Interpeer transport stack |
| |
13.1 | 99 | |
| 100 | |||
| |
16.1 | 101 | |
| |
15.1 | 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 | |||
| |
16.1 | 106 | * //How does data move across the medium?// |
| |
15.1 | 107 | * Examples: Ethernet, Wi-Fi Direct / Wi-Fi Aware (post-AWDL), Bluetooth Mesh, LoRa, NFC, Cellular, CSMA/CA, TDMA, FHSS |
| 108 | |||
| |
16.1 | 109 | |
| 110 | |||
| |
15.1 | 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 | |||
| |
16.1 | 115 | * //How are connections initiated, authenticated, resumed, and kept alive?// |
| |
15.1 | 116 | * Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets |
| 117 | |||
| 118 | |||
| |
16.1 | 119 | |
| |
15.1 | 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 | |||
| |
16.1 | 124 | * //How is data addressed and verified by content, not location?// |
| |
15.1 | 125 | * Examples: IPFS CIDs, BitTorrent infohashes, Git hashes, SHA-256 addressing, Named Data Networking (NDN) |
| 126 | |||
| |
16.1 | 127 | |
| 128 | |||
| |
15.1 | 129 | ==== **10. P2P Connectivity** ==== |
| 130 | |||
| |
16.1 | 131 | > Connectivity ensures peers bypass NATs/firewalls to reach each other. |
| |
15.1 | 132 | |
| |
16.1 | 133 | * //How can two peers connect directly across networks, firewalls, and NATs?// |
| |
15.1 | 134 | * Examples: IPv6 direct, NAT Traversal, STUN, TURN, ICE (used in WebRTC), UDP hole punching, UPnP |
| 135 | |||
| |
16.1 | 136 | |
| 137 | |||
| |
15.1 | 138 | ==== **11. Session & Connection Management** ==== |
| 139 | |||
| 140 | > Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation. | ||
| 141 | |||
| |
16.1 | 142 | * //How are connections initiated, authenticated, resumed, and kept alive?// |
| |
15.1 | 143 | * Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets |
| 144 | |||
| |
16.1 | 145 | |
| 146 | |||
| |
15.1 | 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 | |||
| |
16.1 | 151 | * //How is data encoded, structured, and made interoperable between peers?// |
| |
15.1 | 152 | * Examples: CBOR, Protocol Buffers, Cap’n Proto, JSON, ASN.1, IPLD schemas, Flatbuffers |
| 153 | |||
| |
16.1 | 154 | |
| 155 | |||
| |
15.1 | 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 | |||
| |
16.1 | 160 | //How are large objects transferred and deduplicated efficiently across peers?// |
| |
15.1 | 161 | Examples: BitTorrent chunking, IPFS block-store, NDN segments, rsync-style delta sync, ZFS send-receive, streaming blob transfers |
| 162 | |||
| |
16.1 | 163 | |
| |
15.1 | 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 | |||
| |
16.1 | 168 | * //How do nodes persist, index, and process data locally—without external servers?// |
| |
15.1 | 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 | |||
| |
16.1 | 172 | |
| |
15.1 | 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 | |||
| |
16.1 | 177 | * //How do nodes recover and maintain correctness under failure?// |
| |
15.1 | 178 | * Examples: WALs, idempotent ops, partial log replay, transactional journaling, write fences |
| 179 | |||
| 180 | |||
| 181 | |||
| 182 | |||
| |
11.1 | 183 | == Distributed Network Types == |
| 184 | |||
| 185 | |||
| 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 | |||
| 188 | |||
| |
25.1 | 189 | |
| |
24.1 | 190 | ))) |
| |
11.1 | 191 | |
| 192 | |||
| |
32.1 | 193 | |
| |
33.1 | 194 | |
| |
34.1 | 195 | |
| |
21.1 | 196 | ((( |
| |
24.1 | 197 | == Overview of P4P Networks == |
| |
25.1 | 198 | |
| |
22.1 | 199 | {{include reference="Projects.WebHome"/}} |
| 200 | ))) | ||
| 201 | |||
| |
23.1 | 202 | |
| |
32.1 | 203 | ))) |