Benchmark
non-incremental/QF_ANIA/20211213-GrandProduct-Ozdemir/unsound/diff/6.smt2
# The special soundness of PLONK's grand product argument
Let F be a prime-order field and n a natural less than F's size. Let n = {1,
2, .., n} be a subset of F. The PLONK[1] grand product argument relies on the
fact that given a permutation pi: [n] -> [n] and functions A, B: [n] -> [n],
prod_i (A(i) + beta * i + gamma) = prod_i (B(i) + beta * pi(i) + gamma)
holds for random beta, gamma in F with good probability only when A composed
with pi is B.
Does this implication hold in a deterministic setting, where the above is
checked for distinct---but non-random---beta and gamma?
If it is checked for n+1 distinct values of beta, and for each value of beta,
n+1 distinct values of gamma, then yes. One can prove this.
If it is checked for 2 distinct values of beta, and for each value of beta, n+1
distinct values of gamma, then no.
This series of benchmarks checks the implication holds
* for varying n
* for a fixed permutation pi = (2 3 ... n 1)
* for all A and B
* that must be equal ("same") or may differ ("diff")
* for all distinct 2 ("unsound") or n+1 ("sound") beta values
rather than instantiating gamma explicitly, we just check that the multisets
{{A[i] + beta * i}}_i == {{B[i] + beta * pi(i)}}_i
are equal.
[1]: https://eprint.iacr.org/2019/953
| Benchmark |
|---|
| Size | 5468 |
| Compressed Size | 1747 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | crafted |
| First Occurrence | 2022-08-10 |
| Generated By | Alex Ozdemir |
| Generated On | 2021-12-13 00:00:00 |
| Generator | Z3Py API |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | sat |
| Size | 5460 |
| Compressed Size | 1753 |
| Max. Term Depth | 35 |
| Asserts | 28 |
| Declared Functions | 0 |
| Declared Constants | 15 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 1 |
not | 1 |
and | 2 |
= | 8 |
distinct | 1 |
let | 61 |
+ | 48 |
* | 12 |
<= | 12 |
>= | 12 |
select | 24 |
store | 24 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2022
|
0.50 (2/4) |
CVC4 |
CVC4-sq-final_default |
unknown ❌
|
1200.10000
|
1199.89000
|
| |
cvc5 |
cvc5-default-2022-07-02-b15e116-wrapped_sq |
unknown ❌
|
1200.01000
|
1199.92000
|
| |
MathSAT |
MathSAT-5.6.8_default |
sat ✅
|
2.44010
|
2.43981
|
| |
Z3 |
z3-4.8.17_default |
sat ✅
|
4.78062
|
4.78229
|
|
SMT-COMP 2023
|
0.50 (2/4) |
CVC4 |
CVC4-sq-final_default |
unknown ❌
|
1200.01000
|
1199.83000
|
| |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
unknown ❌
|
1200.01000
|
1199.83000
|
| |
SMTInterpol |
smtinterpol-2.5-1272-g2d6d356c_default |
sat ✅
|
1.63741
|
4.62926
|
| |
Yices2 |
Yices 2 for SMTCOMP 2023_default |
sat ✅
|
41.56390
|
41.56480
|
|
SMT-COMP 2024
|
|
cvc5 |
cvc5 |
sat ✅
|
114.36541
|
114.26275
|
| |
SMTInterpol |
SMTInterpol |
sat ✅
|
1.65902
|
4.44937
|
| |
Yices2 |
Yices2 |
sat ✅
|
2.03790
|
1.93745
|
|
SMT-COMP 2025
|
|
cvc5 |
cvc5 |
sat ✅
|
94.77912
|
94.64652
|
| |
SMTInterpol |
SMTInterpol |
sat ✅
|
1.52370
|
3.98656
|
| |
Yices2 |
Yices2 |
sat ✅
|
1.70359
|
1.58271
|