Learning path · 19 steps

Builder

The strongest systems combine primitives: anonymity networks with encryption, TEEs with attestation, cryptography that computes on data it cannot see. This path covers the building blocks and how they compose.

Who it is for Developers and engineers designing systems that should not need to be trusted.

01
Map: Composing Primitives Map
How the primitives in this library combine, and where compositions fail.
02
Local-first Software and CRDTs Explainer · Usable
Separate offline editing and automatic merging from encryption and access control.
03
Hypercore and Hyperdrive Deep dive · Usable
Assess signed log replication, file APIs and peer discovery for an application.
04
IPNS and DNSLink Deep dive · Usable
Publish changing content under a stable key-based or DNS-based name.
05
Zero-Knowledge Proofs Explainer · Usable
Prove statements without revealing the data behind them.
06
Multi-Party Computation Explainer · Usable
Compute jointly on private inputs without a trusted party.
07
Fully Homomorphic Encryption Explainer
Compute on encrypted data directly.
08
Private Information Retrieval Explainer
Query a database without the server learning what you asked for.
09
Confidential Computing Explainer
Hardware isolation, and what it does and does not protect.
10
Remote Attestation Architecture Explainer · Usable
How to verify what code is running on a machine you do not control.
11
TEE Side-Channel Attacks Threat model · Cautionary
The attacks that keep breaking enclaves.
12
Post-Quantum Cryptography Explainer
Plan migrations now for data that must stay secret for years.
13
Migrating to Hybrid Key Exchange Guide
The practical path to post-quantum key exchange.
14
Veilid Deep dive · Experimental
Separate a private-routing framework from the security responsibilities of an application.
15
Biscuit authorization tokens Deep dive · Usable
Delegate narrowly scoped permissions using offline token attenuation.
16
drand and tlock Deep dive · Usable
Understand the threshold trust and availability assumptions of timed release.
17
Compare fully homomorphic encryption libraries Comparison · Usable
Match encrypted arithmetic and bootstrapping requirements to documented library capabilities.
18
TEE state, recovery and revocation Explainer · Usable
Plan sealed-state recovery, freshness and attestation-policy changes.
19
Build a post-quantum cryptographic inventory Explainer · Usable
Map deployed cryptography, owners and suppliers before migration.