The hackathon, aimed at encouraging developers to build new applications using zero-knowledge proofs (ZKPs) while growing the BSV community, proved to be an overwhelming success with more than 920 participants and 60 submissions received covering a range of subjects and use cases.
The coding segment for the 2022 Zero-Knowledge Proof Hackathon concludes, participated by 929 individuals, all with the goal of creating a project that could run on the BSV blockchain.
Zk-proofs (or zk-SNARKs) are basically a way in which a party (or prover) can prove their knowledge of something secret to a second party (a verifier) without revealing the actual thing in public.
sCrypt Inc. founder and CEO Xiaohui Liu said over 300 people have already signed on to the event, and there will be a live event streamed on YouTube on November 2 to kick things off.
In the first part of "How PLONK works," sCrypt explained how to transform a computation to prove using PLONK into an intermediate constraint system; now, they covered the other type: copy constraints.
PLONK is a zk-SNARK proof system utilizing a trusted setup that is both universal and updatable, which can be initiated once and reused by all circuits.
The hackathon is open to all developers interested in ZKPs and cryptography, whether they're active in the BSV or blockchain world or not—round one will run from October 26 to November 25, 2022.
Round 1 of the hackathon will run from October 26 to November 25, and is aimed at encouraging developers to build new applications based on zero-knowledge proofs while growing the BSV community.
In this article, sCrypt presented the recursive Zero-Knowledge Proofs (ZKPs), where a proof attests to the validity of another proof.
Zokrates is a toolbox for zkSNARKs, hiding significant complexity inherent to ZKP, and provides a python-like higher-level language for developers to code the computational problem they want to prove.
sCrypt reimplement ZKKSP by leveraging the programmability of zkSNARKs. They simply combine elliptic curve point multiplication used in Part 2 and hashing library that resulted to Circom code.
sCrypt shows how to implement another sophisticated cryptographic primitive by simply “programming” it in zero knowledge language Circom: ring signatures.
