Interfold Cryptography
Verifiability in the Coordination Trilemma
This is the second entry in the Interfold Cryptography series, focused on the cryptographic assumptions and circuit design behind verifiable multiparty execution.
Private Inputs. Collective Outcomes.
Infrastructure for confidential coordination
Confidential Coordination
Confidential Coordination III: How Execution Becomes Distributed
This essay is the third in a series on confidential coordination. It explains how execution is structured across a distributed network so encrypted inputs can produce shared, verifiable outcomes without any single operator controlling the process.
Multiplayer Privacy
How Trust Works in Shared Computation
The work coming out of the Interfold sits at the intersection of some of the most ambitious ideas in modern cryptography: multi-party computation (MPC), threshold encryption, verifiable computation, and emerging primitives like indistinguishability obfuscation (iO). Privacy is no longer just about hiding data, but about coordinating computation across many parties
Confidential Coordination
Confidential Coordination II: Why It Requires a Network
This essay is the second in a series on confidential coordination. It argues that once private inputs must produce a shared outcome, execution authority becomes the central problem, and solving it requires a network rather than a single execution environment.
Multiplayer Privacy
Messaging & Analytics Without Surveillance
Privacy-first software is often defined by what it refuses to collect. In messaging products, that refusal can be explicit: no phone numbers, no identifiers, and no collection of user data or metadata. Built as a decentralized, onion-routed messaging network, Session represents one of the clearest attempts to carry that logic
