Search papers, labs, and topics across Lattice.
1
0
1
0
This work presents a preprocessing technique that improves the efficiency of ZkUnsat without introducing additional leakage, and normalizes the proof so that each derived clause is justified by a resolution chain of fixed public length k, which eliminates chain-length leakage and reduces prover memory usage.