BSV Zero Knowledge Hackathon is underway, don’t forget to sign up!
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.
Latest zk-SNARK News
How PLONK works: Part 2
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.
How PLONK Works: Part 1
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.
Interested in Zero-Knowledge Proofs on BSV? Join the BSV sCrypt Zero-Knowledge Proof Hackathon!
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.
Registrations now own open for BSV Zero-Knowledge Hackathon
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.
Recursive Zero-Knowledge Proofs: Proof of a proof of a proof…
In this article, sCrypt presented the recursive Zero-Knowledge Proofs (ZKPs), where a proof attests to the validity of another proof.
Create your first zero-knowledge proof program on Bitcoin: A practical step-by-step guide
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.
Programmable zero knowledge proofs using zk-SNARKs: part 3
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.
Programmable zero knowledge proofs using zk-SNARKs: Part 2
sCrypt shows how to implement another sophisticated cryptographic primitive by simply “programming” it in zero knowledge language Circom: ring signatures.
Programmable zero knowledge proofs using zk-SNARKs: part 1
Developing a ZKP for a problem often requires the invention of a whole new cryptographic algorithm. It has no standard recipe and requires extensive and in-depth knowledge of cryptography.