Changes for page Networks

Summary

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

Details

Page properties

Content

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