fix: Authenticate all frontier group members in the recursive verifier#606

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
arthurpaulino merged 3 commits into from
Sep 2, 2026
Merged

fix: Authenticate all frontier group members in the recursive verifier #606

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
e8d3b2a
Authenticate all frontier group members in the recursive verifier
samuelburnham Sep 1, 2026
73e1b0c
Drop the multi_stark::advice dependency
samuelburnham Sep 1, 2026
e6d6f51
Bump multi-stark audit revision
arthurpaulino Sep 2, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Cargo.lock
View file
Open in desktop

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion Cargo.toml
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -56,7 +56,7 @@ libc = "0.2"
log = "0.4"
memmap2 = "0.9"
mimalloc = { version = "0.1", default-features = false }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "33b4454aa63b88427b3d3cc09980fe86ddeb7e5f" }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "8f3c50d8f48aad2efc90c24729c441677b296fe2" }
nom = "7.1.3"
num-bigint = "0.4.6"
quickcheck = "1.0.3"
Expand Down
48 changes: 42 additions & 6 deletions Ix/MultiStark/Pcs.lean
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -389,6 +389,27 @@ def pcs := ⟦
}
}

-- Rows of matrices at log-height <= `target`, in circuit order. Used to
-- cross-check that two frontier queries sharing a parent agree on every
-- not-yet-injected (shorter) matrix: only the group lead's rows are hashed
-- into the shared frontier, so the others must be pinned to match it
-- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`). Skips
-- empty (inactive-circuit) rows exactly as `select_rows`.
fn select_rows_le(rows: List‹List‹U64››, lhs: List‹G›, target: G) -> List‹List‹U64›› {
match load(rows) {
ListNode.Nil => store(ListNode.Nil),
ListNode.Cons(r, rrest) =>
let &ListNode.Cons(lh, lrest) = lhs;
match u32_less_than(target, lh) {
1 => select_rows_le(rrest, lrest, target),
_ => match load(r) {
ListNode.Nil => select_rows_le(rrest, lrest, target),
_ => store(ListNode.Cons(r, select_rows_le(rrest, lrest, target))),
},
},
}
}

-- Pop one canonicalized lane across row boundaries. `got = 0` iff both the
-- current row and the remaining rows are exhausted (selected rows are
-- non-empty, so advancing to the next row always yields a lane).
Expand DownExpand Up@@ -525,16 +546,20 @@ def pcs := ⟦
ListNode.Cons(x, xrest) => match load(ys) {
ListNode.Nil => xs,
ListNode.Cons(y, yrest) =>
let FrontierNode.Mk(xi, _xb, _xr, xd) = x;
let FrontierNode.Mk(yi, _yb, _yr, yd) = y;
let FrontierNode.Mk(xi, _xb, xr, xd) = x;
let FrontierNode.Mk(yi, _yb, yr, yd) = y;
match memo_u32_less_than(xi, yi) {
1 => store(ListNode.Cons(x, frontier_merge(xrest, ys))),
_ => match eq_zero(xi - yi) {
1 =>
-- Duplicate transcript queries must open the same leaf. A
-- direct pointer assertion is sound here: only equality is
-- accepted; non-canonical equal digests can at worst reject.
-- Duplicate transcript queries (same index) must open the
-- SAME full opened rows, not merely the same tallest-matrix
-- leaf digest: their shorter-matrix rows share a reduced index
-- too and both feed the FRI arithmetic (Plonky3
-- `verify_batch_pruned`'s `InconsistentDuplicateOpenings`).
-- Pointer equality is admissible inside `assert_eq!`.
assert_eq!(ptr_val(xd), ptr_val(yd));
assert_eq!(ptr_val(xr), ptr_val(yr));
store(ListNode.Cons(x, frontier_merge(xrest, yrest))),
_ => store(ListNode.Cons(y, frontier_merge(xs, yrest))),
},
Expand DownExpand Up@@ -595,10 +620,21 @@ def pcs := ⟦
let aparent = bits_to_num(aparent_bits);
match load(rest) {
ListNode.Cons(b, brest) =>
let FrontierNode.Mk(bi, bbits, _br, bd) = b;
let FrontierNode.Mk(bi, bbits, br, bd) = b;
let &ListNode.Cons(_bbit, bparent_bits) = bbits;
match eq_zero(aparent - bits_to_num(bparent_bits)) {
1 =>
-- Group members sharing a parent are collapsed to the lead
-- `a`; only `ar` is injected from here up, so `b` must agree
-- with `a` on every not-yet-injected (height <= next_lh)
-- matrix. Otherwise `b`'s shorter-matrix opened rows, still
-- consumed in its own FRI arithmetic, would go unauthenticated
-- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`;
-- pointer equality is admissible inside `assert_eq!` — see
-- `IxVM.Core`). Transitive across pairwise merges, so the whole
-- group is pinned.
assert_eq!(ptr_val(select_rows_le(ar, lhs, next_lh)),
ptr_val(select_rows_le(br, lhs, next_lh)));
let parent = inject_maybe(ar, lhs, next_lh, mmcs_compress(ad, bd));
let (tail, p2) = frontier_level(brest, proof, lhs, next_lh);
(store(ListNode.Cons(FrontierNode.Mk(aparent, aparent_bits, ar, parent), tail)), p2),
Expand Down
8 changes: 3 additions & 5 deletions crates/aiur/src/synthesis.rs
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -450,11 +450,9 @@ impl AiurSystem {
&self,
claim: &[G],
proof: &AiurProof,
) -> Result<Vec<u8>, multi_stark::advice::AdviceError> {
self.verify(claim, proof).map_err(|e| {
multi_stark::advice::AdviceError::Verification(format!("{e:?}"))
})?;
proof.to_bytes().map_err(multi_stark::advice::AdviceError::Encode)
) -> Result<Vec<u8>, String> {
self.verify(claim, proof).map_err(|e| format!("{e:?}"))?;
proof.to_bytes().map_err(|e| format!("{e:?}"))
}
}

Expand Down
2 changes: 1 addition & 1 deletion crates/ffi/src/aiur/protocol.rs
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -154,7 +154,7 @@ extern "C" fn rs_aiur_proof_to_advice_bytes(
let claim = claim.map(|x| lean_unbox_g(&x));
match aiur_system_obj.get().proof_to_advice_bytes(&claim, proof_obj.get()) {
Ok(bytes) => LeanExcept::ok(LeanByteArray::from_bytes(&bytes)),
Err(err) => LeanExcept::error_string(&format!("{err:?}")),
Err(err) => LeanExcept::error_string(&err),
}
}

Expand Down
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Add copy buttons to all 
 blocks\n(function() {\n function addCopyButtons() {\n document.querySelectorAll('pre code').forEach(function(codeBlock) {\n if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;\n codeBlock.parentElement.setAttribute('data-copy-added', 'true');\n \n var btn = document.createElement('button');\n btn.textContent = 'Copy';\n btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';\n btn.onmouseover = function() { this.style.opacity = '1'; };\n btn.onmouseout = function() { this.style.opacity = '0.7'; };\n btn.onclick = function() {\n navigator.clipboard.writeText(codeBlock.textContent).then(function() {\n btn.textContent = 'Copied!';\n setTimeout(function() { btn.textContent = 'Copy'; }, 1500);\n });\n };\n codeBlock.parentElement.style.position = 'relative';\n codeBlock.parentElement.appendChild(btn);\n });\n }\n \n addCopyButtons();\n \n // Re-run on dynamic content\n var observer = new MutationObserver(addCopyButtons);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Add Copy Buttons to Code Blocks");
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '

Skip to content
fix: Authenticate all frontier group members in the recursive verifier#606

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

arthurpaulino
merged 3 commits into

from

Sep 2, 2026
 Merged


fix: Authenticate all frontier group members in the recursive verifier
#606
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
e8d3b2a

Authenticate all frontier group members in the recursive verifier


samuelburnham Sep 1, 2026
73e1b0c

Drop the multi_stark::advice dependency


samuelburnham Sep 1, 2026
e6d6f51

Bump multi-stark audit revision


arthurpaulino Sep 2, 2026

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
Cargo.lock

View file


Open in desktop


Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.


2 changes: 1 addition & 1 deletion
Cargo.toml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -56,7 +56,7 @@ libc = "0.2"
log = "0.4"
memmap2 = "0.9"
mimalloc = { version = "0.1", default-features = false }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "33b4454aa63b88427b3d3cc09980fe86ddeb7e5f" }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "8f3c50d8f48aad2efc90c24729c441677b296fe2" }
nom = "7.1.3"
num-bigint = "0.4.6"
quickcheck = "1.0.3"
Expand Down

48 changes: 42 additions & 6 deletions
Ix/MultiStark/Pcs.lean

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -389,6 +389,27 @@ def pcs := ⟦
 }
 }

 -- Rows of matrices at log-height <= `target`, in circuit order. Used to
 -- cross-check that two frontier queries sharing a parent agree on every
 -- not-yet-injected (shorter) matrix: only the group lead's rows are hashed
 -- into the shared frontier, so the others must be pinned to match it
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`). Skips
 -- empty (inactive-circuit) rows exactly as `select_rows`.
 fn select_rows_le(rows: List‹List‹U64››, lhs: List‹G›, target: G) -> List‹List‹U64›› {
 match load(rows) {
 ListNode.Nil => store(ListNode.Nil),
 ListNode.Cons(r, rrest) =>
 let &ListNode.Cons(lh, lrest) = lhs;
 match u32_less_than(target, lh) {
 1 => select_rows_le(rrest, lrest, target),
 _ => match load(r) {
 ListNode.Nil => select_rows_le(rrest, lrest, target),
 _ => store(ListNode.Cons(r, select_rows_le(rrest, lrest, target))),
 },
 },
 }
 }

 -- Pop one canonicalized lane across row boundaries. `got = 0` iff both the
 -- current row and the remaining rows are exhausted (selected rows are
 -- non-empty, so advancing to the next row always yields a lane).
Expand DownExpand Up@@ -525,16 +546,20 @@ def pcs := ⟦
 ListNode.Cons(x, xrest) => match load(ys) {
 ListNode.Nil => xs,
 ListNode.Cons(y, yrest) =>
 let FrontierNode.Mk(xi, _xb, _xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, _yr, yd) = y;
 let FrontierNode.Mk(xi, _xb, xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, yr, yd) = y;
 match memo_u32_less_than(xi, yi) {
 1 => store(ListNode.Cons(x, frontier_merge(xrest, ys))),
 _ => match eq_zero(xi - yi) {
 1 =>
 -- Duplicate transcript queries must open the same leaf. A
 -- direct pointer assertion is sound here: only equality is
 -- accepted; non-canonical equal digests can at worst reject.
 -- Duplicate transcript queries (same index) must open the
 -- SAME full opened rows, not merely the same tallest-matrix
 -- leaf digest: their shorter-matrix rows share a reduced index
 -- too and both feed the FRI arithmetic (Plonky3
 -- `verify_batch_pruned`'s `InconsistentDuplicateOpenings`).
 -- Pointer equality is admissible inside `assert_eq!`.
 assert_eq!(ptr_val(xd), ptr_val(yd));
 assert_eq!(ptr_val(xr), ptr_val(yr));
 store(ListNode.Cons(x, frontier_merge(xrest, yrest))),
 _ => store(ListNode.Cons(y, frontier_merge(xs, yrest))),
 },
Expand DownExpand Up@@ -595,10 +620,21 @@ def pcs := ⟦
 let aparent = bits_to_num(aparent_bits);
 match load(rest) {
 ListNode.Cons(b, brest) =>
 let FrontierNode.Mk(bi, bbits, _br, bd) = b;
 let FrontierNode.Mk(bi, bbits, br, bd) = b;
 let &ListNode.Cons(_bbit, bparent_bits) = bbits;
 match eq_zero(aparent - bits_to_num(bparent_bits)) {
 1 =>
 -- Group members sharing a parent are collapsed to the lead
 -- `a`; only `ar` is injected from here up, so `b` must agree
 -- with `a` on every not-yet-injected (height <= next_lh)
 -- matrix. Otherwise `b`'s shorter-matrix opened rows, still
 -- consumed in its own FRI arithmetic, would go unauthenticated
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`;
 -- pointer equality is admissible inside `assert_eq!` — see
 -- `IxVM.Core`). Transitive across pairwise merges, so the whole
 -- group is pinned.
 assert_eq!(ptr_val(select_rows_le(ar, lhs, next_lh)),
 ptr_val(select_rows_le(br, lhs, next_lh)));
 let parent = inject_maybe(ar, lhs, next_lh, mmcs_compress(ad, bd));
 let (tail, p2) = frontier_level(brest, proof, lhs, next_lh);
 (store(ListNode.Cons(FrontierNode.Mk(aparent, aparent_bits, ar, parent), tail)), p2),
Expand Down

8 changes: 3 additions & 5 deletions
crates/aiur/src/synthesis.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -450,11 +450,9 @@ impl AiurSystem {
 &self,
 claim: &[G],
 proof: &AiurProof,
 ) -> Result<Vec<u8>, multi_stark::advice::AdviceError> {
 self.verify(claim, proof).map_err(|e| {
 multi_stark::advice::AdviceError::Verification(format!("{e:?}"))
 })?;
 proof.to_bytes().map_err(multi_stark::advice::AdviceError::Encode)
 ) -> Result<Vec<u8>, String> {
 self.verify(claim, proof).map_err(|e| format!("{e:?}"))?;
 proof.to_bytes().map_err(|e| format!("{e:?}"))
 }
}

Expand Down

2 changes: 1 addition & 1 deletion
crates/ffi/src/aiur/protocol.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -154,7 +154,7 @@ extern "C" fn rs_aiur_proof_to_advice_bytes(
 let claim = claim.map(|x| lean_unbox_g(&x));
 match aiur_system_obj.get().proof_to_advice_bytes(&claim, proof_obj.get()) {
 Ok(bytes) => LeanExcept::ok(LeanByteArray::from_bytes(&bytes)),
 Err(err) => LeanExcept::error_string(&format!("{err:?}")),
 Err(err) => LeanExcept::error_string(&err),
 }
}

Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Force GitHub README to respect dark mode\n(function() {\n var style = document.createElement('style');\n style.textContent = '\n .markdown-body {\n color-scheme: dark light;\n }\n .markdown-body pre { background: #161b22 !important; }\n .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }\n .markdown-body table th, .markdown-body table td { border-color: #30363d !important; }\n .markdown-body img { background: #0d1117; }\n .markdown-body blockquote { border-left-color: #8b949e; }\n .markdown-body hr { border-color: #30363d; }\n ';\n document.head.appendChild(style);\n})();", "GitHub Dark Mode README Fix");
}
} catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
fix: Authenticate all frontier group members in the recursive verifier#606

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

arthurpaulino
merged 3 commits into

from

Sep 2, 2026
 Merged


fix: Authenticate all frontier group members in the recursive verifier
#606
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
e8d3b2a

Authenticate all frontier group members in the recursive verifier


samuelburnham Sep 1, 2026
73e1b0c

Drop the multi_stark::advice dependency


samuelburnham Sep 1, 2026
e6d6f51

Bump multi-stark audit revision


arthurpaulino Sep 2, 2026

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
Cargo.lock

View file


Open in desktop


Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.


2 changes: 1 addition & 1 deletion
Cargo.toml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -56,7 +56,7 @@ libc = "0.2"
log = "0.4"
memmap2 = "0.9"
mimalloc = { version = "0.1", default-features = false }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "33b4454aa63b88427b3d3cc09980fe86ddeb7e5f" }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "8f3c50d8f48aad2efc90c24729c441677b296fe2" }
nom = "7.1.3"
num-bigint = "0.4.6"
quickcheck = "1.0.3"
Expand Down

48 changes: 42 additions & 6 deletions
Ix/MultiStark/Pcs.lean

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -389,6 +389,27 @@ def pcs := ⟦
 }
 }

 -- Rows of matrices at log-height <= `target`, in circuit order. Used to
 -- cross-check that two frontier queries sharing a parent agree on every
 -- not-yet-injected (shorter) matrix: only the group lead's rows are hashed
 -- into the shared frontier, so the others must be pinned to match it
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`). Skips
 -- empty (inactive-circuit) rows exactly as `select_rows`.
 fn select_rows_le(rows: List‹List‹U64››, lhs: List‹G›, target: G) -> List‹List‹U64›› {
 match load(rows) {
 ListNode.Nil => store(ListNode.Nil),
 ListNode.Cons(r, rrest) =>
 let &ListNode.Cons(lh, lrest) = lhs;
 match u32_less_than(target, lh) {
 1 => select_rows_le(rrest, lrest, target),
 _ => match load(r) {
 ListNode.Nil => select_rows_le(rrest, lrest, target),
 _ => store(ListNode.Cons(r, select_rows_le(rrest, lrest, target))),
 },
 },
 }
 }

 -- Pop one canonicalized lane across row boundaries. `got = 0` iff both the
 -- current row and the remaining rows are exhausted (selected rows are
 -- non-empty, so advancing to the next row always yields a lane).
Expand DownExpand Up@@ -525,16 +546,20 @@ def pcs := ⟦
 ListNode.Cons(x, xrest) => match load(ys) {
 ListNode.Nil => xs,
 ListNode.Cons(y, yrest) =>
 let FrontierNode.Mk(xi, _xb, _xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, _yr, yd) = y;
 let FrontierNode.Mk(xi, _xb, xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, yr, yd) = y;
 match memo_u32_less_than(xi, yi) {
 1 => store(ListNode.Cons(x, frontier_merge(xrest, ys))),
 _ => match eq_zero(xi - yi) {
 1 =>
 -- Duplicate transcript queries must open the same leaf. A
 -- direct pointer assertion is sound here: only equality is
 -- accepted; non-canonical equal digests can at worst reject.
 -- Duplicate transcript queries (same index) must open the
 -- SAME full opened rows, not merely the same tallest-matrix
 -- leaf digest: their shorter-matrix rows share a reduced index
 -- too and both feed the FRI arithmetic (Plonky3
 -- `verify_batch_pruned`'s `InconsistentDuplicateOpenings`).
 -- Pointer equality is admissible inside `assert_eq!`.
 assert_eq!(ptr_val(xd), ptr_val(yd));
 assert_eq!(ptr_val(xr), ptr_val(yr));
 store(ListNode.Cons(x, frontier_merge(xrest, yrest))),
 _ => store(ListNode.Cons(y, frontier_merge(xs, yrest))),
 },
Expand DownExpand Up@@ -595,10 +620,21 @@ def pcs := ⟦
 let aparent = bits_to_num(aparent_bits);
 match load(rest) {
 ListNode.Cons(b, brest) =>
 let FrontierNode.Mk(bi, bbits, _br, bd) = b;
 let FrontierNode.Mk(bi, bbits, br, bd) = b;
 let &ListNode.Cons(_bbit, bparent_bits) = bbits;
 match eq_zero(aparent - bits_to_num(bparent_bits)) {
 1 =>
 -- Group members sharing a parent are collapsed to the lead
 -- `a`; only `ar` is injected from here up, so `b` must agree
 -- with `a` on every not-yet-injected (height <= next_lh)
 -- matrix. Otherwise `b`'s shorter-matrix opened rows, still
 -- consumed in its own FRI arithmetic, would go unauthenticated
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`;
 -- pointer equality is admissible inside `assert_eq!` — see
 -- `IxVM.Core`). Transitive across pairwise merges, so the whole
 -- group is pinned.
 assert_eq!(ptr_val(select_rows_le(ar, lhs, next_lh)),
 ptr_val(select_rows_le(br, lhs, next_lh)));
 let parent = inject_maybe(ar, lhs, next_lh, mmcs_compress(ad, bd));
 let (tail, p2) = frontier_level(brest, proof, lhs, next_lh);
 (store(ListNode.Cons(FrontierNode.Mk(aparent, aparent_bits, ar, parent), tail)), p2),
Expand Down

8 changes: 3 additions & 5 deletions
crates/aiur/src/synthesis.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -450,11 +450,9 @@ impl AiurSystem {
 &self,
 claim: &[G],
 proof: &AiurProof,
 ) -> Result<Vec<u8>, multi_stark::advice::AdviceError> {
 self.verify(claim, proof).map_err(|e| {
 multi_stark::advice::AdviceError::Verification(format!("{e:?}"))
 })?;
 proof.to_bytes().map_err(multi_stark::advice::AdviceError::Encode)
 ) -> Result<Vec<u8>, String> {
 self.verify(claim, proof).map_err(|e| format!("{e:?}"))?;
 proof.to_bytes().map_err(|e| format!("{e:?}"))
 }
}

Expand Down

2 changes: 1 addition & 1 deletion
crates/ffi/src/aiur/protocol.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -154,7 +154,7 @@ extern "C" fn rs_aiur_proof_to_advice_bytes(
 let claim = claim.map(|x| lean_unbox_g(&x));
 match aiur_system_obj.get().proof_to_advice_bytes(&claim, proof_obj.get()) {
 Ok(bytes) => LeanExcept::ok(LeanByteArray::from_bytes(&bytes)),
 Err(err) => LeanExcept::error_string(&format!("{err:?}")),
 Err(err) => LeanExcept::error_string(&err),
 }
}

Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Highlight search terms from Google/DuckDuckGo/Bing referrer\n(function() {\n var ref = document.referrer;\n var terms = [];\n \n if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {\n var url = new URL(ref);\n var q = url.searchParams.get('q') || url.searchParams.get('p');\n if (q) {\n terms = q.split(/\\s+/).filter(function(t) { return t.length > 2; });\n }\n }\n \n if (terms.length === 0) return;\n \n var style = document.createElement('style');\n style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';\n document.head.appendChild(style);\n \n function highlight(node) {\n if (node.nodeType === 3) { // text node\n var text = node.textContent;\n var found = false;\n terms.forEach(function(term) {\n var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\') + ')', 'gi');\n if (regex.test(text)) {\n found = true;\n var frag = document.createDocumentFragment();\n var parts = text.split(regex);\n parts.forEach(function(part, i) {\n if (i % 2 === 0) {\n frag.appendChild(document.createTextNode(part));\n } else {\n var span = document.createElement('span');\n span.className = 'userscript-highlight';\n span.textContent = part;\n frag.appendChild(span);\n }\n });\n node.parentNode.replaceChild(frag, node);\n }\n });\n } else if (node.nodeType === 1 && node.childNodes) { // element\n var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];\n if (!skipTags.includes(node.tagName)) {\n Array.from(node.childNodes).forEach(highlight);\n }\n }\n }\n \n highlight(document.body);\n \n // Re-highlight on dynamic content\n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1 || node.nodeType === 3) highlight(node);\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Highlight Search Terms");
}
} catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
fix: Authenticate all frontier group members in the recursive verifier#606

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

arthurpaulino
merged 3 commits into

from

Sep 2, 2026
 Merged


fix: Authenticate all frontier group members in the recursive verifier
#606
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
e8d3b2a

Authenticate all frontier group members in the recursive verifier


samuelburnham Sep 1, 2026
73e1b0c

Drop the multi_stark::advice dependency


samuelburnham Sep 1, 2026
e6d6f51

Bump multi-stark audit revision


arthurpaulino Sep 2, 2026

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
Cargo.lock

View file


Open in desktop


Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.


2 changes: 1 addition & 1 deletion
Cargo.toml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -56,7 +56,7 @@ libc = "0.2"
log = "0.4"
memmap2 = "0.9"
mimalloc = { version = "0.1", default-features = false }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "33b4454aa63b88427b3d3cc09980fe86ddeb7e5f" }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "8f3c50d8f48aad2efc90c24729c441677b296fe2" }
nom = "7.1.3"
num-bigint = "0.4.6"
quickcheck = "1.0.3"
Expand Down

48 changes: 42 additions & 6 deletions
Ix/MultiStark/Pcs.lean

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -389,6 +389,27 @@ def pcs := ⟦
 }
 }

 -- Rows of matrices at log-height <= `target`, in circuit order. Used to
 -- cross-check that two frontier queries sharing a parent agree on every
 -- not-yet-injected (shorter) matrix: only the group lead's rows are hashed
 -- into the shared frontier, so the others must be pinned to match it
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`). Skips
 -- empty (inactive-circuit) rows exactly as `select_rows`.
 fn select_rows_le(rows: List‹List‹U64››, lhs: List‹G›, target: G) -> List‹List‹U64›› {
 match load(rows) {
 ListNode.Nil => store(ListNode.Nil),
 ListNode.Cons(r, rrest) =>
 let &ListNode.Cons(lh, lrest) = lhs;
 match u32_less_than(target, lh) {
 1 => select_rows_le(rrest, lrest, target),
 _ => match load(r) {
 ListNode.Nil => select_rows_le(rrest, lrest, target),
 _ => store(ListNode.Cons(r, select_rows_le(rrest, lrest, target))),
 },
 },
 }
 }

 -- Pop one canonicalized lane across row boundaries. `got = 0` iff both the
 -- current row and the remaining rows are exhausted (selected rows are
 -- non-empty, so advancing to the next row always yields a lane).
Expand DownExpand Up@@ -525,16 +546,20 @@ def pcs := ⟦
 ListNode.Cons(x, xrest) => match load(ys) {
 ListNode.Nil => xs,
 ListNode.Cons(y, yrest) =>
 let FrontierNode.Mk(xi, _xb, _xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, _yr, yd) = y;
 let FrontierNode.Mk(xi, _xb, xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, yr, yd) = y;
 match memo_u32_less_than(xi, yi) {
 1 => store(ListNode.Cons(x, frontier_merge(xrest, ys))),
 _ => match eq_zero(xi - yi) {
 1 =>
 -- Duplicate transcript queries must open the same leaf. A
 -- direct pointer assertion is sound here: only equality is
 -- accepted; non-canonical equal digests can at worst reject.
 -- Duplicate transcript queries (same index) must open the
 -- SAME full opened rows, not merely the same tallest-matrix
 -- leaf digest: their shorter-matrix rows share a reduced index
 -- too and both feed the FRI arithmetic (Plonky3
 -- `verify_batch_pruned`'s `InconsistentDuplicateOpenings`).
 -- Pointer equality is admissible inside `assert_eq!`.
 assert_eq!(ptr_val(xd), ptr_val(yd));
 assert_eq!(ptr_val(xr), ptr_val(yr));
 store(ListNode.Cons(x, frontier_merge(xrest, yrest))),
 _ => store(ListNode.Cons(y, frontier_merge(xs, yrest))),
 },
Expand DownExpand Up@@ -595,10 +620,21 @@ def pcs := ⟦
 let aparent = bits_to_num(aparent_bits);
 match load(rest) {
 ListNode.Cons(b, brest) =>
 let FrontierNode.Mk(bi, bbits, _br, bd) = b;
 let FrontierNode.Mk(bi, bbits, br, bd) = b;
 let &ListNode.Cons(_bbit, bparent_bits) = bbits;
 match eq_zero(aparent - bits_to_num(bparent_bits)) {
 1 =>
 -- Group members sharing a parent are collapsed to the lead
 -- `a`; only `ar` is injected from here up, so `b` must agree
 -- with `a` on every not-yet-injected (height <= next_lh)
 -- matrix. Otherwise `b`'s shorter-matrix opened rows, still
 -- consumed in its own FRI arithmetic, would go unauthenticated
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`;
 -- pointer equality is admissible inside `assert_eq!` — see
 -- `IxVM.Core`). Transitive across pairwise merges, so the whole
 -- group is pinned.
 assert_eq!(ptr_val(select_rows_le(ar, lhs, next_lh)),
 ptr_val(select_rows_le(br, lhs, next_lh)));
 let parent = inject_maybe(ar, lhs, next_lh, mmcs_compress(ad, bd));
 let (tail, p2) = frontier_level(brest, proof, lhs, next_lh);
 (store(ListNode.Cons(FrontierNode.Mk(aparent, aparent_bits, ar, parent), tail)), p2),
Expand Down

8 changes: 3 additions & 5 deletions
crates/aiur/src/synthesis.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -450,11 +450,9 @@ impl AiurSystem {
 &self,
 claim: &[G],
 proof: &AiurProof,
 ) -> Result<Vec<u8>, multi_stark::advice::AdviceError> {
 self.verify(claim, proof).map_err(|e| {
 multi_stark::advice::AdviceError::Verification(format!("{e:?}"))
 })?;
 proof.to_bytes().map_err(multi_stark::advice::AdviceError::Encode)
 ) -> Result<Vec<u8>, String> {
 self.verify(claim, proof).map_err(|e| format!("{e:?}"))?;
 proof.to_bytes().map_err(|e| format!("{e:?}"))
 }
}

Expand Down

2 changes: 1 addition & 1 deletion
crates/ffi/src/aiur/protocol.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -154,7 +154,7 @@ extern "C" fn rs_aiur_proof_to_advice_bytes(
 let claim = claim.map(|x| lean_unbox_g(&x));
 match aiur_system_obj.get().proof_to_advice_bytes(&claim, proof_obj.get()) {
 Ok(bytes) => LeanExcept::ok(LeanByteArray::from_bytes(&bytes)),
 Err(err) => LeanExcept::error_string(&format!("{err:?}")),
 Err(err) => LeanExcept::error_string(&err),
 }
}

Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Strip utm_, fbclid, gclid, etc. from all links on page\n(function() {\n var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',\n 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',\n 'ref', 'ref_src', 'source', 'medium', 'campaign'];\n \n function cleanUrl(url) {\n try {\n var u = new URL(url, window.location.origin);\n var changed = false;\n trackingParams.forEach(function(p) {\n if (u.searchParams.has(p)) {\n u.searchParams.delete(p);\n changed = true;\n }\n });\n return changed ? u.toString() : url;\n } catch (e) {\n return url;\n }\n }\n \n function cleanLinks() {\n document.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n \n cleanLinks();\n \n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1) {\n if (node.tagName === 'A') cleanLinks();\n node.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Remove Tracking Parameters from Links");
}
} catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); }
})();
(function(){
try {
var __m = "youtube.com";
var __re = new RegExp('^' + "youtube\\.com" + '

Skip to content
fix: Authenticate all frontier group members in the recursive verifier#606

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

arthurpaulino
merged 3 commits into

from

Sep 2, 2026
 Merged


fix: Authenticate all frontier group members in the recursive verifier
#606
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
e8d3b2a

Authenticate all frontier group members in the recursive verifier


samuelburnham Sep 1, 2026
73e1b0c

Drop the multi_stark::advice dependency


samuelburnham Sep 1, 2026
e6d6f51

Bump multi-stark audit revision


arthurpaulino Sep 2, 2026

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
Cargo.lock

View file


Open in desktop


Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.


2 changes: 1 addition & 1 deletion
Cargo.toml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -56,7 +56,7 @@ libc = "0.2"
log = "0.4"
memmap2 = "0.9"
mimalloc = { version = "0.1", default-features = false }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "33b4454aa63b88427b3d3cc09980fe86ddeb7e5f" }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "8f3c50d8f48aad2efc90c24729c441677b296fe2" }
nom = "7.1.3"
num-bigint = "0.4.6"
quickcheck = "1.0.3"
Expand Down

48 changes: 42 additions & 6 deletions
Ix/MultiStark/Pcs.lean

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -389,6 +389,27 @@ def pcs := ⟦
 }
 }

 -- Rows of matrices at log-height <= `target`, in circuit order. Used to
 -- cross-check that two frontier queries sharing a parent agree on every
 -- not-yet-injected (shorter) matrix: only the group lead's rows are hashed
 -- into the shared frontier, so the others must be pinned to match it
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`). Skips
 -- empty (inactive-circuit) rows exactly as `select_rows`.
 fn select_rows_le(rows: List‹List‹U64››, lhs: List‹G›, target: G) -> List‹List‹U64›› {
 match load(rows) {
 ListNode.Nil => store(ListNode.Nil),
 ListNode.Cons(r, rrest) =>
 let &ListNode.Cons(lh, lrest) = lhs;
 match u32_less_than(target, lh) {
 1 => select_rows_le(rrest, lrest, target),
 _ => match load(r) {
 ListNode.Nil => select_rows_le(rrest, lrest, target),
 _ => store(ListNode.Cons(r, select_rows_le(rrest, lrest, target))),
 },
 },
 }
 }

 -- Pop one canonicalized lane across row boundaries. `got = 0` iff both the
 -- current row and the remaining rows are exhausted (selected rows are
 -- non-empty, so advancing to the next row always yields a lane).
Expand DownExpand Up@@ -525,16 +546,20 @@ def pcs := ⟦
 ListNode.Cons(x, xrest) => match load(ys) {
 ListNode.Nil => xs,
 ListNode.Cons(y, yrest) =>
 let FrontierNode.Mk(xi, _xb, _xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, _yr, yd) = y;
 let FrontierNode.Mk(xi, _xb, xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, yr, yd) = y;
 match memo_u32_less_than(xi, yi) {
 1 => store(ListNode.Cons(x, frontier_merge(xrest, ys))),
 _ => match eq_zero(xi - yi) {
 1 =>
 -- Duplicate transcript queries must open the same leaf. A
 -- direct pointer assertion is sound here: only equality is
 -- accepted; non-canonical equal digests can at worst reject.
 -- Duplicate transcript queries (same index) must open the
 -- SAME full opened rows, not merely the same tallest-matrix
 -- leaf digest: their shorter-matrix rows share a reduced index
 -- too and both feed the FRI arithmetic (Plonky3
 -- `verify_batch_pruned`'s `InconsistentDuplicateOpenings`).
 -- Pointer equality is admissible inside `assert_eq!`.
 assert_eq!(ptr_val(xd), ptr_val(yd));
 assert_eq!(ptr_val(xr), ptr_val(yr));
 store(ListNode.Cons(x, frontier_merge(xrest, yrest))),
 _ => store(ListNode.Cons(y, frontier_merge(xs, yrest))),
 },
Expand DownExpand Up@@ -595,10 +620,21 @@ def pcs := ⟦
 let aparent = bits_to_num(aparent_bits);
 match load(rest) {
 ListNode.Cons(b, brest) =>
 let FrontierNode.Mk(bi, bbits, _br, bd) = b;
 let FrontierNode.Mk(bi, bbits, br, bd) = b;
 let &ListNode.Cons(_bbit, bparent_bits) = bbits;
 match eq_zero(aparent - bits_to_num(bparent_bits)) {
 1 =>
 -- Group members sharing a parent are collapsed to the lead
 -- `a`; only `ar` is injected from here up, so `b` must agree
 -- with `a` on every not-yet-injected (height <= next_lh)
 -- matrix. Otherwise `b`'s shorter-matrix opened rows, still
 -- consumed in its own FRI arithmetic, would go unauthenticated
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`;
 -- pointer equality is admissible inside `assert_eq!` — see
 -- `IxVM.Core`). Transitive across pairwise merges, so the whole
 -- group is pinned.
 assert_eq!(ptr_val(select_rows_le(ar, lhs, next_lh)),
 ptr_val(select_rows_le(br, lhs, next_lh)));
 let parent = inject_maybe(ar, lhs, next_lh, mmcs_compress(ad, bd));
 let (tail, p2) = frontier_level(brest, proof, lhs, next_lh);
 (store(ListNode.Cons(FrontierNode.Mk(aparent, aparent_bits, ar, parent), tail)), p2),
Expand Down

8 changes: 3 additions & 5 deletions
crates/aiur/src/synthesis.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -450,11 +450,9 @@ impl AiurSystem {
 &self,
 claim: &[G],
 proof: &AiurProof,
 ) -> Result<Vec<u8>, multi_stark::advice::AdviceError> {
 self.verify(claim, proof).map_err(|e| {
 multi_stark::advice::AdviceError::Verification(format!("{e:?}"))
 })?;
 proof.to_bytes().map_err(multi_stark::advice::AdviceError::Encode)
 ) -> Result<Vec<u8>, String> {
 self.verify(claim, proof).map_err(|e| format!("{e:?}"))?;
 proof.to_bytes().map_err(|e| format!("{e:?}"))
 }
}

Expand Down

2 changes: 1 addition & 1 deletion
crates/ffi/src/aiur/protocol.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -154,7 +154,7 @@ extern "C" fn rs_aiur_proof_to_advice_bytes(
 let claim = claim.map(|x| lean_unbox_g(&x));
 match aiur_system_obj.get().proof_to_advice_bytes(&claim, proof_obj.get()) {
 Ok(bytes) => LeanExcept::ok(LeanByteArray::from_bytes(&bytes)),
 Err(err) => LeanExcept::error_string(&format!("{err:?}")),
 Err(err) => LeanExcept::error_string(&err),
 }
}

Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Auto-enable theater mode on YouTube\n(function() {\n function tryTheater() {\n var btn = document.querySelector('button[aria-label=\"Theater mode\"], ytd-player #player button[title=\"Theater mode\"]');\n if (btn && !btn.classList.contains('activated')) {\n btn.click();\n }\n }\n \n // Try immediately\n tryTheater();\n \n // Try after navigation (SPA)\n var lastUrl = location.href;\n setInterval(function() {\n if (location.href !== lastUrl) {\n lastUrl = location.href;\n setTimeout(tryTheater, 500);\n }\n }, 1000);\n \n // Also try on player load\n var observer = new MutationObserver(tryTheater);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "YouTube Theater Mode Default");
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
fix: Authenticate all frontier group members in the recursive verifier#606

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

arthurpaulino
merged 3 commits into

from

Sep 2, 2026
 Merged


fix: Authenticate all frontier group members in the recursive verifier
#606
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
e8d3b2a

Authenticate all frontier group members in the recursive verifier


samuelburnham Sep 1, 2026
73e1b0c

Drop the multi_stark::advice dependency


samuelburnham Sep 1, 2026
e6d6f51

Bump multi-stark audit revision


arthurpaulino Sep 2, 2026

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
Cargo.lock

View file


Open in desktop


Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.


2 changes: 1 addition & 1 deletion
Cargo.toml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -56,7 +56,7 @@ libc = "0.2"
log = "0.4"
memmap2 = "0.9"
mimalloc = { version = "0.1", default-features = false }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "33b4454aa63b88427b3d3cc09980fe86ddeb7e5f" }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "8f3c50d8f48aad2efc90c24729c441677b296fe2" }
nom = "7.1.3"
num-bigint = "0.4.6"
quickcheck = "1.0.3"
Expand Down

48 changes: 42 additions & 6 deletions
Ix/MultiStark/Pcs.lean

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -389,6 +389,27 @@ def pcs := ⟦
 }
 }

 -- Rows of matrices at log-height <= `target`, in circuit order. Used to
 -- cross-check that two frontier queries sharing a parent agree on every
 -- not-yet-injected (shorter) matrix: only the group lead's rows are hashed
 -- into the shared frontier, so the others must be pinned to match it
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`). Skips
 -- empty (inactive-circuit) rows exactly as `select_rows`.
 fn select_rows_le(rows: List‹List‹U64››, lhs: List‹G›, target: G) -> List‹List‹U64›› {
 match load(rows) {
 ListNode.Nil => store(ListNode.Nil),
 ListNode.Cons(r, rrest) =>
 let &ListNode.Cons(lh, lrest) = lhs;
 match u32_less_than(target, lh) {
 1 => select_rows_le(rrest, lrest, target),
 _ => match load(r) {
 ListNode.Nil => select_rows_le(rrest, lrest, target),
 _ => store(ListNode.Cons(r, select_rows_le(rrest, lrest, target))),
 },
 },
 }
 }

 -- Pop one canonicalized lane across row boundaries. `got = 0` iff both the
 -- current row and the remaining rows are exhausted (selected rows are
 -- non-empty, so advancing to the next row always yields a lane).
Expand DownExpand Up@@ -525,16 +546,20 @@ def pcs := ⟦
 ListNode.Cons(x, xrest) => match load(ys) {
 ListNode.Nil => xs,
 ListNode.Cons(y, yrest) =>
 let FrontierNode.Mk(xi, _xb, _xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, _yr, yd) = y;
 let FrontierNode.Mk(xi, _xb, xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, yr, yd) = y;
 match memo_u32_less_than(xi, yi) {
 1 => store(ListNode.Cons(x, frontier_merge(xrest, ys))),
 _ => match eq_zero(xi - yi) {
 1 =>
 -- Duplicate transcript queries must open the same leaf. A
 -- direct pointer assertion is sound here: only equality is
 -- accepted; non-canonical equal digests can at worst reject.
 -- Duplicate transcript queries (same index) must open the
 -- SAME full opened rows, not merely the same tallest-matrix
 -- leaf digest: their shorter-matrix rows share a reduced index
 -- too and both feed the FRI arithmetic (Plonky3
 -- `verify_batch_pruned`'s `InconsistentDuplicateOpenings`).
 -- Pointer equality is admissible inside `assert_eq!`.
 assert_eq!(ptr_val(xd), ptr_val(yd));
 assert_eq!(ptr_val(xr), ptr_val(yr));
 store(ListNode.Cons(x, frontier_merge(xrest, yrest))),
 _ => store(ListNode.Cons(y, frontier_merge(xs, yrest))),
 },
Expand DownExpand Up@@ -595,10 +620,21 @@ def pcs := ⟦
 let aparent = bits_to_num(aparent_bits);
 match load(rest) {
 ListNode.Cons(b, brest) =>
 let FrontierNode.Mk(bi, bbits, _br, bd) = b;
 let FrontierNode.Mk(bi, bbits, br, bd) = b;
 let &ListNode.Cons(_bbit, bparent_bits) = bbits;
 match eq_zero(aparent - bits_to_num(bparent_bits)) {
 1 =>
 -- Group members sharing a parent are collapsed to the lead
 -- `a`; only `ar` is injected from here up, so `b` must agree
 -- with `a` on every not-yet-injected (height <= next_lh)
 -- matrix. Otherwise `b`'s shorter-matrix opened rows, still
 -- consumed in its own FRI arithmetic, would go unauthenticated
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`;
 -- pointer equality is admissible inside `assert_eq!` — see
 -- `IxVM.Core`). Transitive across pairwise merges, so the whole
 -- group is pinned.
 assert_eq!(ptr_val(select_rows_le(ar, lhs, next_lh)),
 ptr_val(select_rows_le(br, lhs, next_lh)));
 let parent = inject_maybe(ar, lhs, next_lh, mmcs_compress(ad, bd));
 let (tail, p2) = frontier_level(brest, proof, lhs, next_lh);
 (store(ListNode.Cons(FrontierNode.Mk(aparent, aparent_bits, ar, parent), tail)), p2),
Expand Down

8 changes: 3 additions & 5 deletions
crates/aiur/src/synthesis.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -450,11 +450,9 @@ impl AiurSystem {
 &self,
 claim: &[G],
 proof: &AiurProof,
 ) -> Result<Vec<u8>, multi_stark::advice::AdviceError> {
 self.verify(claim, proof).map_err(|e| {
 multi_stark::advice::AdviceError::Verification(format!("{e:?}"))
 })?;
 proof.to_bytes().map_err(multi_stark::advice::AdviceError::Encode)
 ) -> Result<Vec<u8>, String> {
 self.verify(claim, proof).map_err(|e| format!("{e:?}"))?;
 proof.to_bytes().map_err(|e| format!("{e:?}"))
 }
}

Expand Down

2 changes: 1 addition & 1 deletion
crates/ffi/src/aiur/protocol.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -154,7 +154,7 @@ extern "C" fn rs_aiur_proof_to_advice_bytes(
 let claim = claim.map(|x| lean_unbox_g(&x));
 match aiur_system_obj.get().proof_to_advice_bytes(&claim, proof_obj.get()) {
 Ok(bytes) => LeanExcept::ok(LeanByteArray::from_bytes(&bytes)),
 Err(err) => LeanExcept::error_string(&format!("{err:?}")),
 Err(err) => LeanExcept::error_string(&err),
 }
}

Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Remove or un-stick sticky/fixed headers that block content\n(function() {\n function unstick() {\n document.querySelectorAll('header, nav, [role=\"banner\"], .header, .navbar, .sticky, .fixed-top, [style*=\"position: fixed\"], [style*=\"position:sticky\"]').forEach(function(el) {\n if (el.style.position === 'fixed' || el.style.position === 'sticky' || \n getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {\n el.style.position = 'static';\n el.style.top = 'auto';\n el.style.zIndex = 'auto';\n }\n });\n }\n \n unstick();\n \n var observer = new MutationObserver(unstick);\n observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });\n})();", "Kill Sticky Headers");
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
fix: Authenticate all frontier group members in the recursive verifier#606

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

arthurpaulino
merged 3 commits into

from

Sep 2, 2026
 Merged


fix: Authenticate all frontier group members in the recursive verifier
#606
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
e8d3b2a

Authenticate all frontier group members in the recursive verifier


samuelburnham Sep 1, 2026
73e1b0c

Drop the multi_stark::advice dependency


samuelburnham Sep 1, 2026
e6d6f51

Bump multi-stark audit revision


arthurpaulino Sep 2, 2026

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
Cargo.lock

View file


Open in desktop


Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.


2 changes: 1 addition & 1 deletion
Cargo.toml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -56,7 +56,7 @@ libc = "0.2"
log = "0.4"
memmap2 = "0.9"
mimalloc = { version = "0.1", default-features = false }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "33b4454aa63b88427b3d3cc09980fe86ddeb7e5f" }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "8f3c50d8f48aad2efc90c24729c441677b296fe2" }
nom = "7.1.3"
num-bigint = "0.4.6"
quickcheck = "1.0.3"
Expand Down

48 changes: 42 additions & 6 deletions
Ix/MultiStark/Pcs.lean

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -389,6 +389,27 @@ def pcs := ⟦
 }
 }

 -- Rows of matrices at log-height <= `target`, in circuit order. Used to
 -- cross-check that two frontier queries sharing a parent agree on every
 -- not-yet-injected (shorter) matrix: only the group lead's rows are hashed
 -- into the shared frontier, so the others must be pinned to match it
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`). Skips
 -- empty (inactive-circuit) rows exactly as `select_rows`.
 fn select_rows_le(rows: List‹List‹U64››, lhs: List‹G›, target: G) -> List‹List‹U64›› {
 match load(rows) {
 ListNode.Nil => store(ListNode.Nil),
 ListNode.Cons(r, rrest) =>
 let &ListNode.Cons(lh, lrest) = lhs;
 match u32_less_than(target, lh) {
 1 => select_rows_le(rrest, lrest, target),
 _ => match load(r) {
 ListNode.Nil => select_rows_le(rrest, lrest, target),
 _ => store(ListNode.Cons(r, select_rows_le(rrest, lrest, target))),
 },
 },
 }
 }

 -- Pop one canonicalized lane across row boundaries. `got = 0` iff both the
 -- current row and the remaining rows are exhausted (selected rows are
 -- non-empty, so advancing to the next row always yields a lane).
Expand DownExpand Up@@ -525,16 +546,20 @@ def pcs := ⟦
 ListNode.Cons(x, xrest) => match load(ys) {
 ListNode.Nil => xs,
 ListNode.Cons(y, yrest) =>
 let FrontierNode.Mk(xi, _xb, _xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, _yr, yd) = y;
 let FrontierNode.Mk(xi, _xb, xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, yr, yd) = y;
 match memo_u32_less_than(xi, yi) {
 1 => store(ListNode.Cons(x, frontier_merge(xrest, ys))),
 _ => match eq_zero(xi - yi) {
 1 =>
 -- Duplicate transcript queries must open the same leaf. A
 -- direct pointer assertion is sound here: only equality is
 -- accepted; non-canonical equal digests can at worst reject.
 -- Duplicate transcript queries (same index) must open the
 -- SAME full opened rows, not merely the same tallest-matrix
 -- leaf digest: their shorter-matrix rows share a reduced index
 -- too and both feed the FRI arithmetic (Plonky3
 -- `verify_batch_pruned`'s `InconsistentDuplicateOpenings`).
 -- Pointer equality is admissible inside `assert_eq!`.
 assert_eq!(ptr_val(xd), ptr_val(yd));
 assert_eq!(ptr_val(xr), ptr_val(yr));
 store(ListNode.Cons(x, frontier_merge(xrest, yrest))),
 _ => store(ListNode.Cons(y, frontier_merge(xs, yrest))),
 },
Expand DownExpand Up@@ -595,10 +620,21 @@ def pcs := ⟦
 let aparent = bits_to_num(aparent_bits);
 match load(rest) {
 ListNode.Cons(b, brest) =>
 let FrontierNode.Mk(bi, bbits, _br, bd) = b;
 let FrontierNode.Mk(bi, bbits, br, bd) = b;
 let &ListNode.Cons(_bbit, bparent_bits) = bbits;
 match eq_zero(aparent - bits_to_num(bparent_bits)) {
 1 =>
 -- Group members sharing a parent are collapsed to the lead
 -- `a`; only `ar` is injected from here up, so `b` must agree
 -- with `a` on every not-yet-injected (height <= next_lh)
 -- matrix. Otherwise `b`'s shorter-matrix opened rows, still
 -- consumed in its own FRI arithmetic, would go unauthenticated
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`;
 -- pointer equality is admissible inside `assert_eq!` — see
 -- `IxVM.Core`). Transitive across pairwise merges, so the whole
 -- group is pinned.
 assert_eq!(ptr_val(select_rows_le(ar, lhs, next_lh)),
 ptr_val(select_rows_le(br, lhs, next_lh)));
 let parent = inject_maybe(ar, lhs, next_lh, mmcs_compress(ad, bd));
 let (tail, p2) = frontier_level(brest, proof, lhs, next_lh);
 (store(ListNode.Cons(FrontierNode.Mk(aparent, aparent_bits, ar, parent), tail)), p2),
Expand Down

8 changes: 3 additions & 5 deletions
crates/aiur/src/synthesis.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -450,11 +450,9 @@ impl AiurSystem {
 &self,
 claim: &[G],
 proof: &AiurProof,
 ) -> Result<Vec<u8>, multi_stark::advice::AdviceError> {
 self.verify(claim, proof).map_err(|e| {
 multi_stark::advice::AdviceError::Verification(format!("{e:?}"))
 })?;
 proof.to_bytes().map_err(multi_stark::advice::AdviceError::Encode)
 ) -> Result<Vec<u8>, String> {
 self.verify(claim, proof).map_err(|e| format!("{e:?}"))?;
 proof.to_bytes().map_err(|e| format!("{e:?}"))
 }
}

Expand Down

2 changes: 1 addition & 1 deletion
crates/ffi/src/aiur/protocol.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -154,7 +154,7 @@ extern "C" fn rs_aiur_proof_to_advice_bytes(
 let claim = claim.map(|x| lean_unbox_g(&x));
 match aiur_system_obj.get().proof_to_advice_bytes(&claim, proof_obj.get()) {
 Ok(bytes) => LeanExcept::ok(LeanByteArray::from_bytes(&bytes)),
 Err(err) => LeanExcept::error_string(&format!("{err:?}")),
 Err(err) => LeanExcept::error_string(&err),
 }
}

Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Universal Dark Mode - works on any site\n(function() {\n var enabled = true;\n \n function applyDarkMode() {\n if (!enabled) return;\n \n // Create style element if it doesn't exist\n var style = document.getElementById('universal-dark-mode-style');\n if (!style) {\n style = document.createElement('style');\n style.id = 'universal-dark-mode-style';\n document.head.appendChild(style);\n }\n \n // Dark mode CSS - inverts colors but preserves images/video\n style.textContent = '\n /* Invert everything except media */\n html {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #1a1a2e !important;\n }\n \n /* Restore images, videos, iframes, canvas */\n img, video, iframe, canvas, svg, picture, [style*=\"background-image\"] {\n filter: invert(1) hue-rotate(180deg) !important;\n }\n \n /* Preserve specific elements that should not be inverted */\n .no-dark-mode, .no-dark-mode *,\n [data-theme=\"light\"], [data-theme=\"light\"],\n .ace_editor, .ace_editor *,\n .CodeMirror, .CodeMirror *,\n .monaco-editor, .monaco-editor *,\n .markdown-body pre, .markdown-body pre *,\n .highlight, .highlight *,\n pre code, pre code * {\n filter: none !important;\n }\n \n /* Fix common UI elements */\n .modal, .popup, .dropdown-menu, .tooltip, .popover {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #2d2d44 !important;\n border-color: #444 !important;\n }\n \n /* Scrollbars */\n ::-webkit-scrollbar { background: #1a1a2e !important; }\n ::-webkit-scrollbar-thumb { background: #444 !important; }\n ::-webkit-scrollbar-thumb:hover { background: #555 !important; }\n \n /* Selection */\n ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ';\n }\n \n function removeDarkMode() {\n var style = document.getElementById('universal-dark-mode-style');\n if (style) style.remove();\n }\n \n // Toggle with Alt+Shift+D\n document.addEventListener('keydown', function(e) {\n if (e.altKey && e.shiftKey && e.key === 'D') {\n e.preventDefault();\n enabled = !enabled;\n if (enabled) {\n applyDarkMode();\n console.log('[Universal Dark Mode] Enabled');\n } else {\n removeDarkMode();\n console.log('[Universal Dark Mode] Disabled');\n }\n }\n });\n \n // Apply on load\n applyDarkMode();\n \n // Re-apply on dynamic content\n var observer = new MutationObserver(function(mutations) {\n if (enabled && !document.getElementById('universal-dark-mode-style')) {\n applyDarkMode();\n }\n });\n observer.observe(document.head, { childList: true });\n \n console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');\n})();", "Universal Dark Mode");
}
} catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); }
})();
})();

Skip to content
fix: Authenticate all frontier group members in the recursive verifier#606

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

arthurpaulino
merged 3 commits into

from

Sep 2, 2026
 Merged


fix: Authenticate all frontier group members in the recursive verifier
#606
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


3 commits


Select commit
Hold shift + click to select a range
e8d3b2a

Authenticate all frontier group members in the recursive verifier


samuelburnham Sep 1, 2026
73e1b0c

Drop the multi_stark::advice dependency


samuelburnham Sep 1, 2026
e6d6f51

Bump multi-stark audit revision


arthurpaulino Sep 2, 2026

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
Cargo.lock

View file


Open in desktop


Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.


2 changes: 1 addition & 1 deletion
Cargo.toml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -56,7 +56,7 @@ libc = "0.2"
log = "0.4"
memmap2 = "0.9"
mimalloc = { version = "0.1", default-features = false }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "33b4454aa63b88427b3d3cc09980fe86ddeb7e5f" }
multi-stark = { git = "https://github.com/argumentcomputer/multi-stark.git", rev = "8f3c50d8f48aad2efc90c24729c441677b296fe2" }
nom = "7.1.3"
num-bigint = "0.4.6"
quickcheck = "1.0.3"
Expand Down

48 changes: 42 additions & 6 deletions
Ix/MultiStark/Pcs.lean

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -389,6 +389,27 @@ def pcs := ⟦
 }
 }

 -- Rows of matrices at log-height <= `target`, in circuit order. Used to
 -- cross-check that two frontier queries sharing a parent agree on every
 -- not-yet-injected (shorter) matrix: only the group lead's rows are hashed
 -- into the shared frontier, so the others must be pinned to match it
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`). Skips
 -- empty (inactive-circuit) rows exactly as `select_rows`.
 fn select_rows_le(rows: List‹List‹U64››, lhs: List‹G›, target: G) -> List‹List‹U64›› {
 match load(rows) {
 ListNode.Nil => store(ListNode.Nil),
 ListNode.Cons(r, rrest) =>
 let &ListNode.Cons(lh, lrest) = lhs;
 match u32_less_than(target, lh) {
 1 => select_rows_le(rrest, lrest, target),
 _ => match load(r) {
 ListNode.Nil => select_rows_le(rrest, lrest, target),
 _ => store(ListNode.Cons(r, select_rows_le(rrest, lrest, target))),
 },
 },
 }
 }

 -- Pop one canonicalized lane across row boundaries. `got = 0` iff both the
 -- current row and the remaining rows are exhausted (selected rows are
 -- non-empty, so advancing to the next row always yields a lane).
Expand DownExpand Up@@ -525,16 +546,20 @@ def pcs := ⟦
 ListNode.Cons(x, xrest) => match load(ys) {
 ListNode.Nil => xs,
 ListNode.Cons(y, yrest) =>
 let FrontierNode.Mk(xi, _xb, _xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, _yr, yd) = y;
 let FrontierNode.Mk(xi, _xb, xr, xd) = x;
 let FrontierNode.Mk(yi, _yb, yr, yd) = y;
 match memo_u32_less_than(xi, yi) {
 1 => store(ListNode.Cons(x, frontier_merge(xrest, ys))),
 _ => match eq_zero(xi - yi) {
 1 =>
 -- Duplicate transcript queries must open the same leaf. A
 -- direct pointer assertion is sound here: only equality is
 -- accepted; non-canonical equal digests can at worst reject.
 -- Duplicate transcript queries (same index) must open the
 -- SAME full opened rows, not merely the same tallest-matrix
 -- leaf digest: their shorter-matrix rows share a reduced index
 -- too and both feed the FRI arithmetic (Plonky3
 -- `verify_batch_pruned`'s `InconsistentDuplicateOpenings`).
 -- Pointer equality is admissible inside `assert_eq!`.
 assert_eq!(ptr_val(xd), ptr_val(yd));
 assert_eq!(ptr_val(xr), ptr_val(yr));
 store(ListNode.Cons(x, frontier_merge(xrest, yrest))),
 _ => store(ListNode.Cons(y, frontier_merge(xs, yrest))),
 },
Expand DownExpand Up@@ -595,10 +620,21 @@ def pcs := ⟦
 let aparent = bits_to_num(aparent_bits);
 match load(rest) {
 ListNode.Cons(b, brest) =>
 let FrontierNode.Mk(bi, bbits, _br, bd) = b;
 let FrontierNode.Mk(bi, bbits, br, bd) = b;
 let &ListNode.Cons(_bbit, bparent_bits) = bbits;
 match eq_zero(aparent - bits_to_num(bparent_bits)) {
 1 =>
 -- Group members sharing a parent are collapsed to the lead
 -- `a`; only `ar` is injected from here up, so `b` must agree
 -- with `a` on every not-yet-injected (height <= next_lh)
 -- matrix. Otherwise `b`'s shorter-matrix opened rows, still
 -- consumed in its own FRI arithmetic, would go unauthenticated
 -- (Plonky3 `verify_batch_pruned`'s `InconsistentGroupOpening`;
 -- pointer equality is admissible inside `assert_eq!` — see
 -- `IxVM.Core`). Transitive across pairwise merges, so the whole
 -- group is pinned.
 assert_eq!(ptr_val(select_rows_le(ar, lhs, next_lh)),
 ptr_val(select_rows_le(br, lhs, next_lh)));
 let parent = inject_maybe(ar, lhs, next_lh, mmcs_compress(ad, bd));
 let (tail, p2) = frontier_level(brest, proof, lhs, next_lh);
 (store(ListNode.Cons(FrontierNode.Mk(aparent, aparent_bits, ar, parent), tail)), p2),
Expand Down

8 changes: 3 additions & 5 deletions
crates/aiur/src/synthesis.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -450,11 +450,9 @@ impl AiurSystem {
 &self,
 claim: &[G],
 proof: &AiurProof,
 ) -> Result<Vec<u8>, multi_stark::advice::AdviceError> {
 self.verify(claim, proof).map_err(|e| {
 multi_stark::advice::AdviceError::Verification(format!("{e:?}"))
 })?;
 proof.to_bytes().map_err(multi_stark::advice::AdviceError::Encode)
 ) -> Result<Vec<u8>, String> {
 self.verify(claim, proof).map_err(|e| format!("{e:?}"))?;
 proof.to_bytes().map_err(|e| format!("{e:?}"))
 }
}

Expand Down

2 changes: 1 addition & 1 deletion
crates/ffi/src/aiur/protocol.rs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -154,7 +154,7 @@ extern "C" fn rs_aiur_proof_to_advice_bytes(
 let claim = claim.map(|x| lean_unbox_g(&x));
 match aiur_system_obj.get().proof_to_advice_bytes(&claim, proof_obj.get()) {
 Ok(bytes) => LeanExcept::ok(LeanByteArray::from_bytes(&bytes)),
 Err(err) => LeanExcept::error_string(&format!("{err:?}")),
 Err(err) => LeanExcept::error_string(&err),
 }
}

Expand Down
Loading