Blockchain, Cryptography, Zero Knowledge Proofs, Zksnark, Mathematics.
would then pass the “polynomial restriction” check: Conclusions We came to the zero-knowledge succinct non-interactive arguments of knowledge protocol for the knowledge of a polynomial problem, which is a niche use-case. While one can claim that a prover can easily construct such polynomial p(x)