Abstract: Sparse LU factorization is considered to be one of the most time-consuming components in circuit simulation, particularly when dealing with circuits of considerable size in the advanced ...

implementing a ZKP for integer factorization: proving knowledge of two integers p and q such that p × q = N, without revealing p and q. Recursive zk-Proofs take this a step further by allowing a proof ...