Practical indistinguishability obfuscation. Roadmap through Q2 2027: blind PRF over key-homomorphic encodings, ≥64-bit obfuscation, SNARK verification, witness encryption.
Implement FHE multiplication over key-homomorphic encodings. Foundation for blind PRF; unlocks predicate encryption / LFE.
Publish a paper detailing a new method for evaluating lookup tables over key-homomorphic encodings, along with low-depth modulo operation circuits.
Implement noise refreshing of GGH15 encodings with replaceable dummy blind PRF. Confirm parameter growth is polylogarithmic.
Implement a circuit compatible with key-homomorphic encodings that simulates a PRF without revealing key or output. The circuit will be used to replace the dummy blind PRF in the noise refreshing construction.
Implement the next version of the diamond iO, which will support a larger input size without compromising efficiency. A paper describing the construction and its security proof will be published as well.
Demo and presentation: the first practical-performance iO for nontrivial input size (e.g., 64 input bits), or its concrete estimation of the required hardware costs and performance.
Implement a SNARK verification circuit over key-homomorphic encodings; PV vs DV scheme selection (or new design) plus an Argo-style garbled-circuit path.
Obfuscation that releases a hardcoded message iff a SNARK proof verifies, unlocking trustless bridges, encrypted mempools, one-time programs, and time-lock encryption.