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

Coefficient Test

The Knowledge of Coefficient Test and Assumption

The Knowledge of Coefficient Test and Assumption Fact that Jennifer is able to compute E ( P ( s ) ) does not guarantee she will indeed send E ( P ( s ) ) to Ted, rather than some completely unrelated value.

Thus, we need a way to “force” Jennifer to follow the protocol correctly.

We denote by g a generator of a group G of order | G | = p where the discrete log is hard. It will be convenient from this post onwards to write our group additively rather than multiplicatively. That is, for α ∈ F p , α ⋅ g denotes the result of summing α copies of g .

PreviousThe KC TestNextBlind evaluation of a polynomial

Last updated 2 years ago