Building constraints: in order to prove the liability of our exchange, we state three claims: Claim 1: We accumulated every user's values correctly, including the value of each crypto and net value of each user Claim 2: The exchange has not forged a virtual user whose net value is negative to reduce the total exchange liability (An individual user having negative balances is acceptable only if her/his net value is above 0) Claim 3: The total value that the exchange claims accounts for every single

The diagram below uses an example with "Alice" to show the Merkle tree and her Merkle proof (colored in green). For more technical details, such as how we adjust account numbers to fit the batch size or choose the right hash algorithm, check out this page.Advances in zk-PoR Version 2 Our zk-PoR Version 2 has made several advances from the previous version: Greater efficiency: It is now 50 times faster than the previous version.