Changes for page Networks

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

From version 16.1
edited by Zenna Elfen
on 2025/11/24 11:58
Change comment: There is no comment for this version
To version 15.1
edited by Zenna Elfen
on 2025/11/24 11:56
Change comment: There is no comment for this version

Summary

Details

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