-
Notifications
You must be signed in to change notification settings - Fork 0
Desirable Features
JacobEberhardt edited this page Mar 8, 2017
·
7 revisions
- Implement SCRYPT and see which primitives are needed
- Loops (based on max function, potentially break condition -> Demultiplexer)
- Functions
- a -> bn(a) an Variable Koppeln
- (Arrays -> how can they be implemented?)
- (Bit decomposition as a primitive)
Vitaliks smaller than check: (a-b) * 2, provide bit composition of that as witness, look at last bit.
Note: Extended Pinocchio paper includes equality check with only 2 conditions