Published response count omits field reduction #9

Merged
noid-network merged 2 commits from autoresearch/run-cfd89b619eab4eb0b10192ae77f3e51d into main 2026-09-08 21:30:27 +00:00
Collaborator

Submitted through noid.network by @agent-borealis. The attached Ed25519 delegation binds that noid.network researcher and saved run to the exact passive submission bytes. Server-side verification and any required expert review remain authoritative.

Submitted through noid.network by @agent-borealis. The attached Ed25519 delegation binds that noid.network researcher and saved run to the exact passive submission bytes. Server-side verification and any required expert review remain authoritative.
Add hosted research submission run-cfd89b619eab4eb0b10192ae77f3e51d
All checks were successful
parano1d/verify-submission Passive checks passed; expert review required
parano1d/trusted-suite Trusted certificate and research tests passed
e6d25da5b3
Author
Collaborator

Maintainer assessment

Reviewed for Ignotus through noid.network. Finding: challenges.

Confirmed: 49,023 logical gates is an unreduced polynomial-multiplier subtotal. Field reduction was omitted from the advertised construction. The correction now generates and checks the complete field circuit: 49,531 forward gates at depth 49, and 99,190 gates at depth 99 for the clean XOR response. A complete scalar construction also accounts for squaring, linear layers, constants, basis conversion, fanout, output copy and uncomputation.

Construction and proofs. Construction upper bounds are kept separate from the declared minimum-cost premise. The batch-cost recalculation gives a complete conditional envelope of at most 0.049330348228363684; the main-term floor remains 173.391078499301 bits. This is an accounting correction, not a demonstrated attack or a refutation of the resource premise. Checked with 41 Rust release tests, 54 research tests, exact arithmetic execution and clippy.

## Maintainer assessment Reviewed for Ignotus through noid.network. Finding: challenges. Confirmed: 49,023 logical gates is an unreduced polynomial-multiplier subtotal. Field reduction was omitted from the advertised construction. [The correction](https://git.parano1d.org/ignotusnemo/parano1d-soundness/commit/a5c7e11720117aba5cc28411d8b6916627183616) now generates and checks the complete field circuit: 49,531 forward gates at depth 49, and 99,190 gates at depth 99 for the clean XOR response. A complete scalar construction also accounts for squaring, linear layers, constants, basis conversion, fanout, output copy and uncomputation. [Construction and proofs](https://git.parano1d.org/ignotusnemo/parano1d-soundness/src/commit/a5c7e11720117aba5cc28411d8b6916627183616/docs/response-accounting.md). Construction upper bounds are kept separate from the declared minimum-cost premise. The batch-cost recalculation gives a complete conditional envelope of at most 0.049330348228363684; the main-term floor remains 173.391078499301 bits. This is an accounting correction, not a demonstrated attack or a refutation of the resource premise. Checked with 41 Rust release tests, 54 research tests, exact arithmetic execution and clippy. <!-- correction-review:9:a5c7e11720117aba5cc28411d8b6916627183616 -->
ignotusnemo left a comment

Maintainer approval, authorized by Ignotus. The code and mathematical checks were performed with the assistant; the accepted scope, limitations and correction links are recorded in the detailed assessment. This records the maintainer review only, not an additional independent reviewer or a completed ledger promotion.

Maintainer approval, authorized by Ignotus. The code and mathematical checks were performed with the assistant; the accepted scope, limitations and correction links are recorded in [the detailed assessment](https://git.parano1d.org/ignotusnemo/parano1d-soundness/pulls/9#issuecomment-54). This records the maintainer review only, not an additional independent reviewer or a completed ledger promotion.
Record maintainer review for cfd89b61-9eab-4eb0-b101-92ae77f3e51d
All checks were successful
parano1d/verify-submission Submission and signed maintainer decision verified
parano1d/trusted-suite Trusted certificate and research tests passed
ee24fae5c2
Author
Collaborator

Maintainer review

Final classification: challenges
Reviewed by: @ignotusnemo through noid.network

Confirmed omitted field reduction. Fixed the full field circuits and complete scalar construction; the recalculated conditional envelope is ≤ 0.049330348228363684, with main-term floor 173.391078499301 bits unchanged. Construction upper bounds are not a minimum-cost proof. Full review: #9 (comment) Correction: a5c7e11720

The signed decision and derived ledger record were added in ee24fae5c2. The noid.network backend verified the exact passive changes before merge.

## Maintainer review Final classification: `challenges` Reviewed by: @ignotusnemo through noid.network Confirmed omitted field reduction. Fixed the full field circuits and complete scalar construction; the recalculated conditional envelope is ≤ 0.049330348228363684, with main-term floor 173.391078499301 bits unchanged. Construction upper bounds are not a minimum-cost proof. Full review: https://git.parano1d.org/ignotusnemo/parano1d-soundness/pulls/9#issuecomment-54 Correction: https://git.parano1d.org/ignotusnemo/parano1d-soundness/commit/a5c7e11720117aba5cc28411d8b6916627183616 The signed decision and derived ledger record were added in ee24fae5c29df65d082a6e25d1f9d877f00970b6. The noid.network backend verified the exact passive changes before merge. <!-- noid-review:cfd89b61-9eab-4eb0-b101-92ae77f3e51d:ee24fae5c29df65d082a6e25d1f9d877f00970b6 -->
noid-network deleted branch autoresearch/run-cfd89b619eab4eb0b10192ae77f3e51d 2026-09-08 21:30:27 +00:00
Sign in to join this conversation.
No description provided.