Structured state over untrusted networks

How can independent users query shared state and communicate securely across unreliable infrastructure?

Relations separated logical questions from storage paths; packets shared links and tolerated route changes; internetworking joined heterogeneous networks; public-key methods changed key distribution.

A shared system becomes evolvable when data meaning, delivery, internetworking, and trust are separated into explicit contracts.

Reconstruct the mechanism

1. State the logical data and query independently of layout
2. Split communication into addressed packets over shared links
3. Join unlike networks through a common internetwork contract
4. Establish cryptographic keys or signatures without a pre-shared pairwise secret

Express a query in relational algebra, packetize it, inject loss and reordering, and perform a small authenticated Diffie–Hellman exchange.

Evidence and uncertainty

Each abstraction solves a narrower problem than popular retellings suggest. For example, encryption does not establish authorization or truthful endpoints.

• Codd’s relational paper — ACM Digital Library
• A Brief History of the Internet — Internet Society
• New Directions in Cryptography — Stanford University