2 tài liệu đã gắn thẻ với "peer network"

The normative content-replication flywheel: how a DIG Node turns every read into a new holder — connect over mTLS, discover holders through the Kademlia provider DHT (find_providers) and the real-time signed holdings-announce (gossip opcode 222), fetch and merkle-verify the bytes against the chain-anchored root, admit the capsule into the bounded on-disk LRU cache (1 GiB default, pins exempt), then announce the gain so the reader becomes a discoverable holder — plus the eviction retract that keeps the holder map honest, the first-party landing gate that stops a stranger deciding what this node stores, and the untrusted-peer property that makes the loop safe: content is accepted because it verifies, never because of who served it.

The normative privacy-mode content-retrieval protocol: the per-request speed-vs-privacy toggle on the dig RPC surface, how a private read is onion-routed end-to-end (requester → guard/entry → middle → exit → providers → back) with a who-knows-what table, telescoping circuit construction over dig-nat mTLS (ntor X25519 + HKDF-SHA256 handshake, fixed-size 512-byte ChaCha20-Poly1305 layered cells, the RELAY command set), the onion-relay directory (dig-dht tag 0x04) and relay advertisement, guard nodes, the exit reusing the ordinary merkle-verified content read, and the honest threat model (partial-adversary unlinkability, stronger than Tor on exit integrity, weaker on anonymity-set size and Sybil cost).