Nicola Greco

I work on a £50M research funding program on multi-agent security at ARIARead more about my work here. I led research teams at Protocol Labs, a PhD (drop out) at MIT advised by Tim Berners-Lee and fellow at Berkman Center.

Generative Cryptography

AI research loops for new generating secure cryptography protocols.

July 6, 2026

Cryptography is unusually well suited to AI research loops. Its problems can be stated formally, its solutions can be checked mechanically, and its progress has historically been bottlenecked by a small number of experts with years of context. If AI can reason about cryptography, we should be able to point a model in a loop, and watch it optimize, discover, and eventually invent.

The thesis of this memo in short:

The call to action for this memo is:

Three directions

Direction What the AI does Example
Using cryptography Picks or synthesizes protocols on the fly during agent interactions Two agents run an MPC instead of sharing calendars
Improving cryptography Optimizes existing constructions, implementations, and hardware Faster SNARK provers, better circuits, hash speedups
Inventing cryptography Solves open problems from assumptions and formal specifications New primitives; iO as the holy grail

Using cryptography

Imagine two AI agents that want to schedule a call, but their security policies forbid sharing calendars. A human team stuck in this position gives up or leaks information. Agents don’t have to: they can decide, mid-interaction, to engage in a multi-party computation — either picking a protocol from an existing library or generating one on the spot.

This is a supercognition property uniquely suited to AI. Writing a bespoke cryptographic protocol takes humans too long to do adaptively, in the middle of an interaction. For an agent, protocol selection and synthesis can become just another step in a negotiation. Cryptography stops being infrastructure you deploy in advance and becomes a move you make.

Improving cryptography

Fields like SNARKs have improved by orders of magnitude over the past decade — but every one of those improvements was the outcome of scarce, expensive engineering hours: new constructions, refinements to existing ones, hardware speedups for hash functions, better circuits, tighter implementations.

If AI can reason about cryptography, this entire surface becomes a target. Point a model at each deployed cryptographic protocol — its theory, its implementation, its hardware path — and let it grind: prove an optimization sound, benchmark it, keep it or discard it, repeat. None of this requires new science; it requires the loop.

Inventing cryptography: the research loop

The third direction is the one that names this post. Specify a set of assumptions and a problem specification, and let the AI go try to solve it — generating new protocols, and eventually attacking open problems.

What does a single iteration look like? There is a spectrum from the ideal setup to the practical one:

The formal end of the spectrum is what makes the loop closable today. Natural-language cryptography needs a human to judge whether a proof is right; Lean does not. A proof assistant turns “is this new protocol secure under these assumptions?” into a machine-checkable question — which is exactly the property a research loop needs to run unattended, and exactly the property that lets us measure whether the AI is improving over time.

Generative vs. emergent cryptography

There is a second, less obvious source of new cryptography. Historically, breakthroughs weren’t invented in a vacuum — they arose because there was a capability people wanted but couldn’t achieve:

Agent societies will create requirements humans have never encountered at scale. Once thousands or millions of autonomous agents negotiate, delegate authority, preserve privacy, and optimize trust against each other, they will hit coordination problems for which today’s cryptography is simply not the right abstraction. An Agentic Economic Zone is not just a benchmark for agents — it is a generator of cryptographic demand. Agents incentivized to minimize trust costs while maximizing capability create evolutionary pressure for new primitives.

This gives us two complementary research agendas:

The holy grail: iO

Every research loop needs a north star, and for cryptography the obvious one is indistinguishability obfuscation. iO is the primitive from which nearly everything else can be built — “crypto-complete” — and yet every known construction is impractical, resting on strong assumptions and astronomical overheads.

It is exactly the kind of problem a research loop should be pointed at: precisely specifiable, mechanically checkable, and stuck. If in five years we look back at this post and iO has been solved, I would be very glad.

What success looks like

There is a hierarchy of goals here, spanning decades:

Call to action

  1. Create datasets for cryptography. The field’s knowledge, formalized — constructions, assumptions, and proofs in Lean or similar — is the substrate every research loop will run on.
  2. Build benchmarks and evaluations. We cannot tell whether the loop is improving without measuring it: suites of cryptographic problems, from re-deriving known protocols to open questions.
  3. Build harnesses for research loops. The scaffolding that lets a model propose, prove, check, and iterate unattended — the auto-research infrastructure itself.
  4. Attempt the impossible. Point the loop at iO.

Get in touch

If you’re building cryptographic datasets, formalizing cryptography in Lean, working on auto-research harnesses — or you want to point a research loop at iO — DM @iamnotnicola on X.

Acknowledgements

This was written by Nicola Greco with support of AI.

- Nicola Greco,
Keep on rocking the free web

Thanks for reading

Generative Cryptography - July 6, 2026 - Nicola