PriceAI Whitepaper
  • PriceAI Whitepaper
  • Introduction
  • PriceAI Protocol
    • Evaluation Protocol
    • Non-interactive proofs
    • Elliptic curves and their pairings
    • Pairings of Elliptic Curves
    • Zero-knowledge part
    • Reduction to a QAP
    • Arithmetic circuits
    • Computations to Polynomials
    • Blind Evaluation Protocol
    • An Extended KCA
    • Blind Evaluation of Polynomials
    • The KC Test
    • Coefficient Test
    • Blind evaluation of a polynomial
    • Blind Evaluation of Polynomials
    • Homomorphic Hiding
    • Computation
    • How zk-SNARKs are constructed
  • Why PriceAI
  • Designed to Grow
  • Token Utility
  • Mission & Vision
  • Reference
Powered by GitBook
On this page
  1. PriceAI Protocol

Computations to Polynomials

PreviousArithmetic circuitsNextBlind Evaluation Protocol

Last updated 2 years ago

From Computations to Polynomials Quadratic Arithmetic Program (QAP). QAPs have become the basis for modern zk-SNARK constructions, in particular those used by . Suppose Jennifer wants to prove to Ted she knows c 1 , c 2 , c 3 ∈ F p such that ( c 1 ⋅ c 2 ) ⋅ ( c 1 + c 3 ) = 7 . The first step is to present the expression computed from c 1 , c 2 , c 3 as an arithmetic circuit.

PriceAI