Changes for page Networks

Summary

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

Details

Page properties

Content

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