Timeline for Non interactive Zero Knowledge Proof for Satisfiability of Pairing Product Equations
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 14, 2019 at 18:05 | vote | accept | user1990088 | ||
| Nov 24, 2018 at 1:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 25, 2018 at 0:04 | answer | added | K.Baghery | timeline score: 1 | |
| Jul 27, 2018 at 11:28 | comment | added | Vadym Fedyukovych | libsnark on github? | |
| Jul 26, 2018 at 14:33 | comment | added | Changyu Dong | It is definitely implementable. It only uses conventional primitives. | |
| Jul 26, 2018 at 14:29 | history | edited | e-sushi | CC BY-SA 4.0 |
deleted 28 characters in body
|
| Jul 26, 2018 at 14:15 | review | First posts | |||
| Jul 26, 2018 at 14:29 | |||||
| Jul 26, 2018 at 14:12 | history | asked | user1990088 | CC BY-SA 4.0 |