Compiler nightly

https://rust-lang.github.io/rustup/concepts/channels.html

How to print sctruct

http://joelmccracken.github.io/entries/how-to-print-a-struct-in-rust/

Operators to learn

https://doc.rust-lang.org/book/appendix-02-operators.html

Debuger

https://levelup.gitconnected.com/rust-with-visual-studio-code-46404befed8

About ZK system, PLONK, video about

https://www.youtube.com/watch?v=dhotx3AaiKs&t=412s

About plonk

https://vitalik.ca/general/2019/09/22/plonk.html


P representing  as a circuit with logic gates eg. R(x) = x^3 + x +5 = 35 , wires here are operations sucahs as +/-/etc 
one equation per gate
Gate1 //  
Gate2
Gate3


So now we have a problem where a prover wants to prove that they have a bunch of x-a,y-b  and x-c values that satisfy a bunch of equations that are of the same form. 

...


https://media.consensys.net/introduction-to-zksnarks-with-examples-3283b554fc3b
non-interactive zero knowledge proofs
which means that the proof itself is a blob of data that can be verified without any interaction from the prover.

//modern cryptography generally relies heavily on abstract algebraic structures and concepts.

go refresh