You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
During our integration of the lookup constraints in our components, we came across two questions.
Currently, the first row of all columns in the lookup tables is reserved for something. This leads to all tables being 1 larger than requried (i.e, our lookup table of size 2^16 is 2^16+1 long). What is the first column reserved for and is this required?
The two points mean that in a proof without zk, our lookup tables are a full power of two larger than the original table, which means tests take much longer.
Thanks for your answers.
The text was updated successfully, but these errors were encountered:
During our integration of the lookup constraints in our components, we came across two questions.
Currently, the first row of all columns in the lookup tables is reserved for something. This leads to all tables being 1 larger than requried (i.e, our lookup table of size 2^16 is 2^16+1 long). What is the first column reserved for and is this required?
The current padding rules for the trace are split into 2 functions: basic_padding and zk_padding.
In the basic_padding, since no Random padding is needed for ZK, does a trace that is already a power of two need to be extended to the next power of two?
i.e., Can the check in
https://github.com/NilFoundation/crypto3-zk/blob/a4fc6763c9397d2bd6f0a7caa64afc7d19c9e60b/include/nil/crypto3/zk/snark/arithmetization/plonk/padding.hpp#L45C38-L45C38 be removed for the basic padding?
The two points mean that in a proof without zk, our lookup tables are a full power of two larger than the original table, which means tests take much longer.
Thanks for your answers.
The text was updated successfully, but these errors were encountered: