Bulletproofs Inner Product Argument & Range Proofs in Monero using Bulletproofs

Notes $\mathbb F_p$ is a Finite Field. We use an Elliptic Curve $E(\mathbb F_p)$ over this field. The order of the curve is $q$ & the discrete log problem is hard in the Group of the Curve. When we sample any random numbers in this post, please assume it’s sampled from $\mathbb F_q$. The Prover is $\mathcal P$ & the Verifier $\mathcal V$. Prerequisites Pedersen Commitments The basic Pedersen…