Speedup Bitcoin stateful contract updates using pre-authorizing signatures
Signatures act as public keys/addresses that are used to pre-authorize state updates and carry out token transactions.
Articles By Xiaohui Liu:
PLONK on Bitcoin
Bitcoin's programmability and scalability have paved the way for the creation of PLONK proof, a system that can be implemented similarly to a smart contract.
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.
Introducing sCrypt Playground
The introduction of sCrypt Playground combines the power of desktop IDE and the convenience of sCrypt Studio, providing a seamless development and management of sCrypt smart contracts.
Efficient zk-SNARKs on Bitcoin: Technical explainer
After all the optimizations, sCrypt was able to cut the Script size of pairing by 100X to 5MB, and they are exploring more optimizations to reduce it.
Zero-Knowledge private machine learning on Bitcoin
The application of Zero-Knowledge Proof machine learning on Bitcoin's neural networks allows sensitive data to be kept private while its algorithmic model is made public for transparency.
Introducing zkBattleship: The world’s first interactive Zero-Knowledge Proof tutorial
sCrypt is excited to introduce zkBattleship, the world’s first and only interactive ZKP tutorial, aimed at developers who want to learn how to use it without diving into math-heavy theory.
Running deep neural networks on Bitcoin
sCrypt implemented a deep neural network for the classification of handwritten digits trained offline using the MNIST dataset of handwritten digits.
Scalable peer to peer tokens on Bitcoin: Solve the back-to-Genesis problem using recursive SNARKs
sCrypt presents a simple NFT example using recursive SNARKs, which can be extended to a directed acyclic graph (DAG), rather than a chain of transactions.
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.