Changes for page Networks

Summary

• Page properties (1 modified, 0 added, 0 removed)

Details

Page properties

Content

...	...	@@ -1,45 +1,30 @@
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		-== Core principles of Peer-4-Peer Networks ==
12	12
13	13
14		-=== Mutual-Aid ===
15	15
16	16
17		-=== Peer-2-Peer ===
18	18
19	19
20		-=== Local-First ===
21	21
22	22
23		-=== Routing Agnostic ===
24	24
25	25
26	26
	19	+== Building Blocks of P4P Networks ==
27	27
28		-(((
29		-== 15 Building Blocks of P4P Networks ==
30	30
31		-To fully assemble a P4P network one needs a few different building blocks, below is an overview of 15 of those building blocks.
	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]].
32	32	)))
33	33
34	34
35		-
36		-
37		-(% class="row" %)
38		-(((
39		-(% class="col-xs-12 col-sm-8" %)
40		-(((
41		-
42		-
43	43	==== **1. Data Synchronization** ====
44	44
45	45	> 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.
...	...	@@ -87,111 +87,82 @@
87	87	* Examples: PKI, Distributed Identities (DIDs), Web-of-Trust, TOFU (SSH-style), Verifiable Credentials (VCs), Peer key fingerprints (libp2p PeerIDs), Key transparency logs
88	88
89	89
90		-
91	91	==== **6. Transport Layer** ====
92	92
93	93	> This layer provides logical connections and flow control. QUIC and WebRTC bring modern congestion control and encryption defaults; Interpeer explores transport beyond IP assumptions.
94	94
95		-* //How do peers establish end-to-end byte streams and reliable delivery?//
	79	+* How do peers establish end-to-end byte streams and reliable delivery?
96	96	* Examples: TCP, UDP, QUIC, SCTP, WebRTC DataChannels, Interpeer transport stack
97	97
98	98
99		-
100	100	==== **7. Underlying Transport (Physical/Link Layer)** ====
101	101
102	102	> Highly relevant for **offline-first / edge networks**, device-to-device communication, and mesh networks and relates to the hardware which facilitates connections.
103	103
104		-* //How does data move across the medium?//
	87	+* How does data move across the medium?
105	105	* Examples: Ethernet, Wi-Fi Direct / Wi-Fi Aware (post-AWDL), Bluetooth Mesh, LoRa, NFC, Cellular, CSMA/CA, TDMA, FHSS
106	106
107		-
108		-
109	109	==== **8. Session & Connection Management** ====
110	110
111	111	> Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation—especially important in lossy or mobile networks.
112	112
113		-* //How are connections initiated, authenticated, resumed, and kept alive?//
	94	+* How are connections initiated, authenticated, resumed, and kept alive?
114	114	* Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets
115	115
116	116
117		-
118	118	==== **9. Content Addressing** ====
119	119
120	120	> Content addressing ensures **immutability, verifiability, and deduplication**. Identity of data = cryptographic hash, enabling offline-first and tamper-evident systems.
121	121
122		-* //How is data addressed and verified by content, not location?//
	102	+* How is data addressed and verified by content, not location?
123	123	* Examples: IPFS CIDs, BitTorrent infohashes, Git hashes, SHA-256 addressing, Named Data Networking (NDN)
124	124
125		-
126		-
127	127	==== **10. P2P Connectivity** ====
128	128
129		-> Connectivity ensures peers bypass NATs/firewalls to reach each other.
	107	+> Connectivity ensures peers bypass NATs/firewalls to reach each other.
130	130
131		-* //How can two peers connect directly across networks, firewalls, and NATs?//
	109	+* How can two peers connect directly across networks, firewalls, and NATs?
132	132	* Examples: IPv6 direct, NAT Traversal, STUN, TURN, ICE (used in WebRTC), UDP hole punching, UPnP
133	133
134		-
135		-
136	136	==== **11. Session & Connection Management** ====
137	137
138	138	> Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation.
139	139
140		-* //How are connections initiated, authenticated, resumed, and kept alive?//
	116	+* How are connections initiated, authenticated, resumed, and kept alive?
141	141	* Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets
142	142
143		-
144		-
145	145	==== **12. Message Format & Serialization** ====
146	146
147	147	> Serialization ensures **portable data representation**, forward-compatible schemas, and efficient messaging. IPLD provides content-addressed structuring for P2P graph data.
148	148
149		-* //How is data encoded, structured, and made interoperable between peers?//
	123	+* How is data encoded, structured, and made interoperable between peers?
150	150	* Examples: CBOR, Protocol Buffers, Cap’n Proto, JSON, ASN.1, IPLD schemas, Flatbuffers
151	151
152		-
153		-
154	154	==== **13. File / Blob Synchronization** ====
155	155
156	156	> 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.
157	157
158		-//How are large objects transferred and deduplicated efficiently across peers?//
	130	+How are large objects transferred and deduplicated efficiently across peers?
159	159	Examples: BitTorrent chunking, IPFS block-store, NDN segments, rsync-style delta sync, ZFS send-receive, streaming blob transfers
160	160
161		-
162	162	==== **14. Local Storage & Processing Primitives** ====
163	163
164	164	> Provides durable on-device state and local computation (event sourcing, materialization, compaction). Enables offline-first writes and deterministic replay.
165	165
166		-* //How do nodes persist, index, and process data locally—without external servers?//
	137	+* How do nodes persist, index, and process data locally—without external servers?
167	167	* Examples: RocksDB, LevelDB, SQLite, LMDB, local WALs/append-only logs, embedded stream processors (NATS Core JetStream mode, Actyx-like edge runtimes), Kafka-like libraries
168	168
169	169
170		-
171	171	==== **15. Crash Resilience & Abortability** ====
172	172
173	173	> 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.
174	174
175		-* //How do nodes recover and maintain correctness under failure?//
	145	+* How do nodes recover and maintain correctness under failure?
176	176	* Examples: WALs, idempotent ops, partial log replay, transactional journaling, write fences
177	177
178	178
179	179
180		-
181		-)))
182	182
183		-
184		-
185		-(% class="col-xs-12 col-sm-4" %)
186		-(((
187		-{{box title=" **Contents**"}}
188		-{{toc depth="5"/}}
189		-{{/box}}
190		-)))
191		-
192		-
193		-(% class="col-xs-12 col-sm-12" %)
194		-(((
195	195	== Distributed Network Types ==
196	196
197	197
...	...	@@ -202,12 +202,3 @@
202	202	== Overview of P4P Networks ==
203	203
204	204	{{include reference="Projects.WebHome"/}}
205		-)))
206		-
207		-
208		-
209		-
210		-
211		-
212		-
213		-)))