4 ms·
Proof size and verification time would be constant (therefore efficient) for all cases. Not using a friendly signature scheme would in principle cause a big inc
by emmorais 4y ago
Proof size and verification time would be constant (therefore efficient) for all cases. Not using a friendly signature scheme would in principle cause a big increase in proving time. The same situation happens if you want to use something different from Poseidon. But we are designing an improvement to the architecture that allows to deal with such cases, shortly by constructing specialized co-processors. However, it is not yet clear how it would affect performance in practice, but the goal is exactly to improve it significantly.
- tromp 4y agoYes, I'm asking for the rough sizes of these constants, i.e. order of magnitude. Is proof size for the first case closer to 1MB or 10MB? Is verification time closer to 1s, 10s, 100s, or 1000s?
- emmorais 4y agoIt depends on which backend you want to use (currently Groth16 or Nova, but more options can be implemented). For example, Nova proof is roughly 8-9 KB. In this situation we have that verification is not constant, for instance, for 2^20 constraints it would take roughly 1s.
- tromp 4y agoAnd how many constraints would roughly be needed to represent the first case of a million secp256k1 signatures in a SHA256 Merkle tree?