Changes for page Networks

Summary

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

Details

Page properties

Content

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