ZK-SR117: A Chunked Zero-Knowledge Attestation Design for Aggregated Fair-Lending Metrics, with a Control Mapping toward Full SR 11-7 Coverage
Not on the map. Why?
Abstract (arXiv)
Deploying ML models in regulated decision-making (credit underwriting, fraud detection, loan approval) requires demonstrating fairness and robustness to auditors without exposing model weights or customer data. We address this attestation problem for U.S. bank supervision under SR 11-7 and OCC 2011-12 guidance. We present a chunked zero-knowledge circuit design that attests an aggregated fairness statistic - the demographic-parity gap - on committed, nonce-sampled batches of real 2022 HMDA mortgage data, and demonstrate it end-to-end: 32,768 rows, 32 independently verified zkSNARK proofs, aggregated attested gap within 0.0029 of the true held-out value, per-chunk proving under 4 seconds. We also demonstrate extensibility by attesting a second control on the identical architecture - expected calibration error at 10 bins - with all 32 chunks verified, per-chunk proving at about 14.7 seconds, and attested ECE within 0.00037 of the plaintext value on the same committed rows. We compare this design against two alternatives - a flat summation circuit, which overflows past a few thousand rows, and a tree-reduction circuit, numerically exact but intractable to compile - and find the chunked design is the only one that reached this scale. We discovered and root-caused a genuine data-quality failure (a sentinel-code outlier distorting circuit proving and the fairness statistic itself) and resolved it with a published preprocessing specification. We also propose a fuller mapping from SR 11-7 and OCC 2011-12 control language to zero-knowledge statements (nine control elements spanning soundness, calibration, robustness, and drift), a nonce-based sampling protocol resisting bank-side cherry-picking, and a threat model for deployment, proposed as design work, not implemented results. Two controls, one model class, one task are demonstrated end-to-end; the rest is scoped and left as future work.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 26 references that are in the map. First posted on arXiv 1 Aug 2026.
Builds on
10 of 26 references.
References · 10
- 2024Verifiable evaluations of machine learning models using zkSNARKscited by 16
- 2024Trustless Audits without Revealing Data or Modelscited by 15
- 2024FairProof : Confidential and Certifiable Fairness for Neural Networkscited by 13
- 2024Artemis: Efficient Commit-and-Prove SNARKs for zkMLcited by 7
- 2025"Show Me You Comply... Without Showing Me Anything": Zero-Knowledge Software Auditing for AI-Enabled Systemscited by 6
- 2025FairZK: A Scalable System to Prove Machine Learning Fairness in Zero-Knowledgecited by 5
- 2024Model Validation Practice in Banking: A Structured Approach for Predictive Modelscited by 3
- 2025ZKTorch: Compiling ML Inference to Zero-Knowledge Proofs via Parallel Proof Accumulationcited by 3
- 2026Jolt Atlas: Verifiable Inference via Lookup Arguments in Zero Knowledgecited by 3
- 2026A Regulatory Governance Framework for AI-Driven Financial Fraud Detection in U.S. Banking: Integrating OCC, SR 11-7, CFPB, and FinCEN Compliance Requirements for Model Development, Validation, and Monitoring Lifecyclescited by 2
Built on by
Not cited yet.