BenX: Resource-Sharing Permutations for Computational Integrity

arXiv:2609.31087 · cs.CR · Submitted 2026-09-25 · Read on arXiv

cs.CR

Submitted: 2026-09-25

Updated: 2026-09-25

Code: https://github.com/Plonky3/Plonky3

Terminology

• Trace — 10× in this paper · explained in 2 episodes
• Verifier — 7× in this paper · explained in 2 episodes
• Benchmark — 6× in this paper · explained in 2 episodes
• Core — 4× in this paper · explained in 2 episodes
• Homogenization — 4× in this paper · explained in 2 episodes
• Verification — 4× in this paper · explained in 2 episodes
• Multi-Scalar Multiplication — 2× in this paper
• Number Theoretic Transform — 2× in this paper
• Alternation — 1× in this paper · explained in 1 episode
• Federal Information Processing Standards Publication — 1× in this paper
• Query Complexity — 1× in this paper · explained in 2 episodes

Sources

• The number of solutions of a random system of polynomials over a finite field
• Construction of a set of circulant matrix submatrices for faster MDS matrix verification
• Permutation polynomials of finite fields

Related papers

• SoK: AI-Augmented Binary Reversing
• Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
• Calibration-Family Overfit: Why Trusted Sabotage Monitors Don't Transfer Across Lineages
• Efficient Fuzzy PSI under One-Sided Assumptions
• Sealing the Audit-Runtime Gap for LLM Skills
• Token Composition: A Graph Based on EVM Logs