Changes for page Networks

Summary

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

Details

Page properties

Content

...	...	@@ -1,3 +1,28 @@
	1	+(% class="jumbotron" %)
	2	+(((
	3	+(% class="container" %)
	4	+(((
	5	+= Peer-for-Peer Networks =
	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.
	8	+)))
	9	+)))
	10	+
	11	+
	12	+
	13	+
	14	+
	15	+
	16	+(% class="col-xs-12 col-sm-14" %)
	17	+(((
	18	+{{box title="==== Contents ====
	19	+
	20	+====== ======"}}
	21	+{{toc depth="5"/}}
	22	+{{/box}}
	23	+)))
	24	+
	25	+
1	1	(% class="box" %)
2	2	(((
3	3	This page contains an overview of all P4P Networks in this wiki and their building blocks.
...	...	@@ -8,24 +8,156 @@
8	8
9	9
10	10
	36	+
	37	+
	38	+(((
11	11	== Building Blocks of P4P Networks ==
12	12
13	13
14	14	(% class="box" %)
15	15	(((
16		-If you would like to look at the terminology you can read more about definitions here.
17		-
	44	+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]].
18	18	)))
19	19
20		-To fully assemble a P4P network one needs a few different building blocks. The following is an overview of the building blocks needed for P4P networks.
21	21
	48	+==== **1. Data Synchronization** ====
22	22
	50	+> 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.
23	23
	52	+* //How do peers detect differences and synchronize state?//
	53	+* Examples: Range-Based Set Reconciliation, RIBLT, Gossip-based sync, State-based vs op-based sync, Lamport/Vector/HLC clocks, Braid Protocol
24	24
25	25
26	26
	57	+==== **2. Collaborative Data Structures & Conflict Resolution** ====
27	27
	59	+> 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.
28	28
	61	+* //How do peers collaboratively change shared data and merge conflicts?//
	62	+* Examples: CRDTs (Yjs, Automerge), OT, Event Sourcing, Stream Processing, Version Vectors, Peritext
	63	+
	64	+
	65	+
	66	+==== **3. Data Storage & Replication** ====
	67	+
	68	+> 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.
	69	+
	70	+* //How is data persisted locally and replicated between peers?//
	71	+* Examples: SQLite, IndexedDB, LMDB, Hypercore (append-only logs), WALs, Merkle-DAGs (IPFS/IPLD), Blob/media storage
	72	+
	73	+
	74	+
	75	+==== **4. Peer & Content Discovery** ====
	76	+
	77	+> Discovery occurs in two phases:
	78	+> 1. **Peer Discovery** → finding _any_ nodes
	79	+> 2. **Topic Discovery** → finding _relevant_ nodes or resources
	80	+> These mechanisms enable decentralized bootstrapping and interest-based overlays.
	81	+
	82	+* //How do peers find each other, and how do they discover content in the network?//
	83	+* Examples: DHTs (Kademlia, Pastry), mDNS, DNS-SD, Bluetooth scanning, QR bootstrapping, static peer lists, Interest-based routing, PubSub discovery (libp2p), Rendezvous protocols
	84	+
	85	+
	86	+
	87	+==== **5. Identity & Trust** ====
	88	+
	89	+> Identity systems ensure reliable mapping between peers and cryptographic keys. They underpin authorization, federated trust, and secure overlays.
	90	+
	91	+* //How peers identify themselves, authenticate, and establish trustworthy relationships?//
	92	+* Examples: PKI, Distributed Identities (DIDs), Web-of-Trust, TOFU (SSH-style), Verifiable Credentials (VCs), Peer key fingerprints (libp2p PeerIDs), Key transparency logs
	93	+
	94	+
	95	+
	96	+==== **6. Transport Layer** ====
	97	+
	98	+> This layer provides logical connections and flow control. QUIC and WebRTC bring modern congestion control and encryption defaults; Interpeer explores transport beyond IP assumptions.
	99	+
	100	+* //How do peers establish end-to-end byte streams and reliable delivery?//
	101	+* Examples: TCP, UDP, QUIC, SCTP, WebRTC DataChannels, Interpeer transport stack
	102	+
	103	+
	104	+
	105	+==== **7. Underlying Transport (Physical/Link Layer)** ====
	106	+
	107	+> Highly relevant for **offline-first / edge networks**, device-to-device communication, and mesh networks and relates to the hardware which facilitates connections.
	108	+
	109	+* //How does data move across the medium?//
	110	+* Examples: Ethernet, Wi-Fi Direct / Wi-Fi Aware (post-AWDL), Bluetooth Mesh, LoRa, NFC, Cellular, CSMA/CA, TDMA, FHSS
	111	+
	112	+
	113	+
	114	+==== **8. Session & Connection Management** ====
	115	+
	116	+> Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation—especially important in lossy or mobile networks.
	117	+
	118	+* //How are connections initiated, authenticated, resumed, and kept alive?//
	119	+* Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets
	120	+
	121	+
	122	+
	123	+==== **9. Content Addressing** ====
	124	+
	125	+> Content addressing ensures **immutability, verifiability, and deduplication**. Identity of data = cryptographic hash, enabling offline-first and tamper-evident systems.
	126	+
	127	+* //How is data addressed and verified by content, not location?//
	128	+* Examples: IPFS CIDs, BitTorrent infohashes, Git hashes, SHA-256 addressing, Named Data Networking (NDN)
	129	+
	130	+
	131	+
	132	+==== **10. P2P Connectivity** ====
	133	+
	134	+> Connectivity ensures peers bypass NATs/firewalls to reach each other.
	135	+
	136	+* //How can two peers connect directly across networks, firewalls, and NATs?//
	137	+* Examples: IPv6 direct, NAT Traversal, STUN, TURN, ICE (used in WebRTC), UDP hole punching, UPnP
	138	+
	139	+
	140	+
	141	+==== **11. Session & Connection Management** ====
	142	+
	143	+> Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation.
	144	+
	145	+* //How are connections initiated, authenticated, resumed, and kept alive?//
	146	+* Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets
	147	+
	148	+
	149	+
	150	+==== **12. Message Format & Serialization** ====
	151	+
	152	+> Serialization ensures **portable data representation**, forward-compatible schemas, and efficient messaging. IPLD provides content-addressed structuring for P2P graph data.
	153	+
	154	+* //How is data encoded, structured, and made interoperable between peers?//
	155	+* Examples: CBOR, Protocol Buffers, Cap’n Proto, JSON, ASN.1, IPLD schemas, Flatbuffers
	156	+
	157	+
	158	+
	159	+==== **13. File / Blob Synchronization** ====
	160	+
	161	+> 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.
	162	+
	163	+//How are large objects transferred and deduplicated efficiently across peers?//
	164	+Examples: BitTorrent chunking, IPFS block-store, NDN segments, rsync-style delta sync, ZFS send-receive, streaming blob transfers
	165	+
	166	+
	167	+==== **14. Local Storage & Processing Primitives** ====
	168	+
	169	+> Provides durable on-device state and local computation (event sourcing, materialization, compaction). Enables offline-first writes and deterministic replay.
	170	+
	171	+* //How do nodes persist, index, and process data locally—without external servers?//
	172	+* Examples: RocksDB, LevelDB, SQLite, LMDB, local WALs/append-only logs, embedded stream processors (NATS Core JetStream mode, Actyx-like edge runtimes), Kafka-like libraries
	173	+
	174	+
	175	+
	176	+==== **15. Crash Resilience & Abortability** ====
	177	+
	178	+> 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.
	179	+
	180	+* //How do nodes recover and maintain correctness under failure?//
	181	+* Examples: WALs, idempotent ops, partial log replay, transactional journaling, write fences
	182	+
	183	+
	184	+
	185	+
29	29	== Distributed Network Types ==
30	30
31	31
...	...	@@ -32,7 +32,14 @@
32	32	[[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"]]
33	33
34	34
	192	+
	193	+)))
35	35
36		-== Overview of P4P Networks ==
37	37
	196	+(((
	197	+== Overview of P4P Networks ==
	198	+
38	38	{{include reference="Projects.WebHome"/}}
	200	+)))
	201	+
	202	+