Skip to Content

Wiki source code of Networks

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