Merge pull request #650 from SoraSuegami/docs/update-machina-io-mastermap

Docs/update machina io mastermap and the project page
This commit is contained in:
Vivian Plasencia
2026-04-01 11:19:55 +02:00
committed by GitHub
2 changed files with 47 additions and 54 deletions

View File

@@ -357,95 +357,79 @@ export const PROJECTS: ProjectData[] = [
category: "private-writes",
status: "Research",
statusVariant: "research",
completion: 10,
completion: 20,
description:
"Practical indistinguishability obfuscation. 2026 focus: noise refreshing, blind PRF over key-homomorphic encodings, \u226564-bit obfuscation, SNARK verification kickoff.",
href: "/mastermap/machina",
tags: ["iO", "GGH15", "Lattice", "FHE", "key-homomorphic"],
tags: ["iO", "Lattice", "key-homomorphic encodings", "FHE", "GGH15"],
now: [
{
name: "FHE multiplication over encodings",
name: "FHE multiplication over key-homomorphic encodings",
description:
"Implement FHE multiplication over key-homomorphic encodings. Foundation for blind PRF; unlocks predicate encryption / LFE.",
status: "Q1 2026 \u00b7 In progress",
status: "Q1 2026 \u00b7 The FHE multiplication circuit compatible with key-homomorphic encodings has been implemented. A further optimization and the evaluation of the circuit over the encodings is underway.",
statusDot: "green",
},
{
name: "Noise refreshing + dummy blind PRF",
name: "A paper on a new lookup table evaluation method over key-homomorphic encodings and low-depth modulo operation circuits",
description: "Publish a paper detailing a new method for evaluating lookup tables over key-homomorphic encodings, along with low-depth modulo operation circuits.",
status: "Q2 2026 \u00b7 The method and the circuit have been implemented, and the paper is in the process of being written.",
statusDot: "green",
},
{
name: "Noise refreshing with a dummy blind PRF",
description:
"Implement noise refreshing of GGH15 encodings with replaceable dummy blind PRF. Confirm parameter growth is polylogarithmic.",
status: "Q2 2026",
status: "Q2 2026 \u00b7 The noise refreshing with a dummy blind PRF has not been implemented yet, but the high-level design has been finalized.",
statusDot: "green",
},
{
name: "Benchmark harness",
description:
"Circuit size/depth sensitivity and parameter-growth behavior. Set targets for real blind PRF circuit size.",
status: "Q2 2026",
statusDot: "yellow",
},
{
name: "Noise refreshing paper",
description:
"Paper: noise refreshing construction and security proof (venue TBD).",
status: "Q2 2026",
statusDot: "yellow",
},
],
next: [
{
name: "Blind PRF over key-homomorphic encodings",
description:
"Circuit over encodings that simulates a PRF without revealing key or output. Replace dummy in noise refreshing.",
status: "Q2\u2013Q3 2026 \u00b7 Critical",
"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.",
status: "Q2\u2013Q3 2026 \u00b7 The circuit is expected to be implementable by combining the gadgets implemented in Q1 2026, although further efficiency improvements and careful parameter tuning are still needed.",
statusDot: "yellow",
},
{
name: "\u226564-bit obfuscation",
description:
"End-to-end obfuscation and evaluation for \u226564 input bits. First practical iO beyond lookup-table scale.",
name: "Diamond iO 2",
description: "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.",
status: "Q3 2026",
statusDot: "yellow",
},
{
name: "Devcon 2026",
name: "Devcon 2026: obfuscation for nontrivial input size",
description:
"Paper and presentation: first practical-performance iO for nontrivial input size.",
"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.",
status: "Q3 2026",
statusDot: "yellow",
},
],
later: [
{
name: "SNARK verification over encodings",
name: "SNARK verification over key-homomorphic encodings",
description:
"Milestone 5 kickoff: PV vs DV scheme selection, verification circuit over key-homomorphic encodings. Continues into Q1 2027.",
"Start implementing a SNARK verification circuit over key-homomorphic encodings. Continues into Q1 2027.",
status: "Q4 2026",
statusDot: "gray",
},
{
name: "Collaboration: security \u00b7 efficiency",
description:
"Academic collaboration on cryptanalysis (all-product LWE, evasive LWE, encodings) and efficiency improvements.",
status: "2026",
statusDot: "gray",
},
],
details: {
description: [
"Execute 2026 critical path toward practical iO",
"Noise refreshing in practice; real blind PRF; \u226564-bit obfuscation",
"SNARK verification over encodings (kickoff Q4)",
"Improve efficiency of key-homomorphic encodings to enable blind PRF and noise refreshing",
"Diamond iO 2, supporting larger input sizes without compromising efficiency",
"SNARK verification over key-homomorphic encodings (kickoff Q4)",
],
deliverables: [
"FHE multiplication + noise refreshing (dummy then real blind PRF)",
"First \u226564-bit obfuscation with reproducible benchmarks",
"Noise refreshing + security proof paper; Devcon 2026 dissemination",
"SNARK verification scheme selection and early prototype (Q4)",
"Implementation of FHE multiplication + blind FHE over key-homomorphic encodings, along with noise refreshing",
"Implementation of obfuscation with a 64-bit input size or its concrete estimation of the required hardware costs and performance",
"Papers on the new lookup table evaluation method and low-depth circuit in Q2 and the next diamond iO construction in Q3",
"Concrete specs for the SNARK verification circuit compatible with key-homomorphic encodings",
],
impact: [
"First practical-performance iO for nontrivial input size",
"Foundation for predicate encryption / LFE implementations",
"Foundation for practical implementations of key-homomorphic encodings",
"Security and efficiency collaboration with academia",
],
},
@@ -562,7 +546,7 @@ export const PROJECTS: ProjectData[] = [
{
name: "Build Standards",
description:
"If explorations into standardisation feaibility are successful, build ERC(s) with other teams.",
"If explorations into standardisation feaibility are successful, build ERC(s) with other teams.",
status: "Planned \u00b7 Critical",
statusDot: "yellow",
},

View File

@@ -5,13 +5,14 @@ image: ""
section: "pse"
projectStatus: "active"
category: "research"
tldr: "Building the first practical indistinguishability obfuscation (iO) system for secure and scalable cryptographic applications."
tldr: "Building the first practical indistinguishability obfuscation (iO) system for trustless and scalable confidential smart contracts."
tags:
keywords:
[
"indistinguishability obfuscation",
"iO",
"cryptography",
"key-homomorphic encodings",
"Ethereum",
"FHE",
"SNARKs",
@@ -21,10 +22,10 @@ tags:
links:
twitter: "https://x.com/machina__io"
github: "https://github.com/MachinaIO/"
website: "https://hackmd.io/@MachinaIO/H1w5iwmDke"
website: "https://hackmd.io/@MachinaIO/rygxbLqZZe"
team:
- name: "Sora Suegami"
email: "sorasuegami@pse.dev"
email: "sora.suegami@ethereum.org"
---
@@ -34,14 +35,15 @@ Machina iO is a research project within Privacy & Scaling Explorations (PSE) foc
## Current focus (2026)
*Last updated: 2026-01-07*
*Last updated: 2026-03-31*
In 2026, we are executing milestones on the critical path toward practical iO:
- **Q1 2026:** Implement **noise refreshing of GGH15 encodings**, initially using a **dummy blind PRF** (so it can be swapped out later).
- **Q1 2026:** Implement **FHE multiplication over key-homomorphic encodings (BGG+ encodings)** by introducing new methods such as lookup table evaluation over encodings.
- **Q2 2026:** Implement **noise refreshing of GGH15 encodings**, initially using a **dummy blind PRF** (so it can be swapped out later).
- **Q2Q3 2026:** Implement a **blind PRF over key-homomorphic encodings**, and plan the integration into the noise refreshing implementation.
- **Q3 2026:** Demonstrate **obfuscation with nontrivial input size** (target threshold: **≥ 64 input bits**) and produce reproducible benchmarks.
- **Q4 2026:** Kick off work on **SNARK verification over key-homomorphic encodings** (scheme selection + early prototype).
- **Q4 2026:** Kick off work on **SNARK verification over key-homomorphic encodings**.
For technical definitions and the full milestone breakdown, see the roadmap link below.
@@ -54,13 +56,20 @@ For technical definitions and the full milestone breakdown, see the roadmap link
## Publications
- **Scalable Private World Computer via Root iO: Application-Agnostic iO and Our Roadmap for Making It Practical** — Sora Suegami, Enrico Bottazzi
https://eprint.iacr.org/2025/2139
- **Diamond iO: A Straightforward Construction of Indistinguishability Obfuscation from Lattices** — Sora Suegami, Enrico Bottazzi, Gayeong Park
https://eprint.iacr.org/2025/236
- **Lookup-Table Evaluation over Key-Homomorphic Encodings and KP-ABE for Nonlinear Operations** - Sora Suegami, Enrico Bottazzi
https://eprint.iacr.org/2025/1870
- **Scalable Private World Computer via Root iO: Application-Agnostic iO and Our Roadmap for Making It Practical** — Sora Suegami, Enrico Bottazzi
https://eprint.iacr.org/2025/2139
## Talks
- **Obfuscation workshop at the Simons Institute (Berkeley)**
https://simons.berkeley.edu/talks/sora-suegami-ethereum-foundation-machina-io-2025-06-24
- **Devconnect 2025 (Buenos Aires) — Ethereum Privacy Stack (Machina iO segment)**
https://www.youtube.com/watch?v=C-kF0gplCto&t=3772s