Dualmatrix: Conquering zkSNARK for Large Matrix Multiplication
Published in Cybersecurity, 2026
Overview
A scalable zkSNARK for large, sparse matrix multiplication with linear prover time in the number of non-zero input elements.
Cite
Mingshu Cong, Tsz Hon Yuen, and Siu-Ming Yiu. “Dualmatrix: Conquering zkSNARK for Large Matrix Multiplication.” Cybersecurity, vol. 9, article 126, 2026.
Resources
This paper presents Dualmatrix, a scalable zkSNARK for large matrix multiplication. Its prover time is linear in the number of non-zero input elements, enabling efficient verification of large sparse matrix computations.