Wiki source code of Networks

Last modified by Zenna Elfen on 2025/11/24 12:07

version	line-number	content
3.1	1	(% class="box" %)
	2	(((
11.1	3	This page contains an overview of all P4P Networks in this wiki and their building blocks.
	4
	5	You can also [[add a P4P Network>>doc:Projects.WebHome]] or have a look at the [[P4P Applications>>doc:P4P.Applications.WebHome]].
3.1	6	)))
1.1	7
17.1	8	{{toc/}}
1.1	9
3.1	10
11.1	11	== Building Blocks of P4P Networks ==
9.1	12
	13
11.1	14	(% class="box" %)
	15	(((
15.1	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]].
11.1	17	)))
	18
	19
15.1	20	==== 1. Data Synchronization ====
11.1	21
13.1	22	> 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.
11.1	23
15.1	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
11.1	26
	27
	28
15.1	29	==== 2. Collaborative Data Structures & Conflict Resolution ====
11.1	30
13.1	31	> 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.
	32
15.1	33	* //How do peers collaboratively change shared data and merge conflicts?//
	34	* Examples: CRDTs (Yjs, Automerge), OT, Event Sourcing, Stream Processing, Version Vectors, Peritext
13.1	35
	36
	37
15.1	38	==== 3. Data Storage & Replication ====
13.1	39
	40	> 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.
	41
15.1	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
13.1	44
	45
	46
15.1	47	==== 4. Peer & Content Discovery ====
	48
13.1	49	> Discovery occurs in two phases:
	50	> 1. Peer Discovery → finding _any_ nodes
	51	> 2. Topic Discovery → finding _relevant_ nodes or resources
	52	> These mechanisms enable decentralized bootstrapping and interest-based overlays.
	53
15.1	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
13.1	56
	57
	58
15.1	59	==== 5. Identity & Trust ====
13.1	60
	61	> Identity systems ensure reliable mapping between peers and cryptographic keys. They underpin authorization, federated trust, and secure overlays.
	62
15.1	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
13.1	65
	66
16.1	67
15.1	68	==== 6. Transport Layer ====
13.1	69
15.1	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.
13.1	71
16.1	72	* //How do peers establish end-to-end byte streams and reliable delivery?//
15.1	73	* Examples: TCP, UDP, QUIC, SCTP, WebRTC DataChannels, Interpeer transport stack
13.1	74
	75
16.1	76
15.1	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
16.1	81	* //How does data move across the medium?//
15.1	82	* Examples: Ethernet, Wi-Fi Direct / Wi-Fi Aware (post-AWDL), Bluetooth Mesh, LoRa, NFC, Cellular, CSMA/CA, TDMA, FHSS
	83
16.1	84
	85
15.1	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
16.1	90	* //How are connections initiated, authenticated, resumed, and kept alive?//
15.1	91	* Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets
	92
	93
16.1	94
15.1	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
16.1	99	* //How is data addressed and verified by content, not location?//
15.1	100	* Examples: IPFS CIDs, BitTorrent infohashes, Git hashes, SHA-256 addressing, Named Data Networking (NDN)
	101
16.1	102
	103
15.1	104	==== 10. P2P Connectivity ====
	105
16.1	106	> Connectivity ensures peers bypass NATs/firewalls to reach each other.
15.1	107
16.1	108	* //How can two peers connect directly across networks, firewalls, and NATs?//
15.1	109	* Examples: IPv6 direct, NAT Traversal, STUN, TURN, ICE (used in WebRTC), UDP hole punching, UPnP
	110
16.1	111
	112
15.1	113	==== 11. Session & Connection Management ====
	114
	115	> Manages connection lifecycle, including authentication handshakes, reconnection after drops, and session continuation.
	116
16.1	117	* //How are connections initiated, authenticated, resumed, and kept alive?//
15.1	118	* Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets
	119
16.1	120
	121
15.1	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
16.1	126	* //How is data encoded, structured, and made interoperable between peers?//
15.1	127	* Examples: CBOR, Protocol Buffers, Cap’n Proto, JSON, ASN.1, IPLD schemas, Flatbuffers
	128
16.1	129
	130
15.1	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
16.1	135	//How are large objects transferred and deduplicated efficiently across peers?//
15.1	136	Examples: BitTorrent chunking, IPFS block-store, NDN segments, rsync-style delta sync, ZFS send-receive, streaming blob transfers
	137
16.1	138
15.1	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
16.1	143	* //How do nodes persist, index, and process data locally—without external servers?//
15.1	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
16.1	147
15.1	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
16.1	152	* //How do nodes recover and maintain correctness under failure?//
15.1	153	* Examples: WALs, idempotent ops, partial log replay, transactional journaling, write fences
	154
	155
	156
	157
11.1	158	== Distributed Network Types ==
	159
	160
	161	[[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"]]
	162
	163
	164
12.1	165	== Overview of P4P Networks ==
11.1	166
1.1	167	{{include reference="Projects.WebHome"/}}