Introducing scryptTS: Write Bitcoin smart contracts in Typescript
scryptTS allows developers to directly code smart contracts in Typescript, using existing programming languages and tools that many are already familiar with.
Xiaohui Liu
author
Articles By Xiaohui Liu:
Pay for storage using Proof of Retrievability on Bitcoin
The cryptographic protocol Proof of Retrievability allow users to pay for cloud storage without having to trust the server.
Bitcoin ZK Bounty Series: Part 1 — Pay for Decryption Key
Zero-Knowledge Bounties provide a solution to a Sudoku problem and the classic fair exchange problem, providing assurance that payment will result in disclosing the right decryption key.
Verifiable Delay Functions on Bitcoin
The Verifiable Delay Function acts as another layer of security in blockchain, preventing bad faith actors from influencing an output by predicting future values.
Zero-Knowledge proof of solvency for crypto exchanges: How to detect the next FTX and Mt. Gox
Many users prefer to store their digital assets with centralized exchanges for ease of use, but doing so exposes them to the risk of losing their assets due to external or internal theft.
The first successful Zero-Knowledge Pay-to-Sudoku Bounty on Bitcoin
By using Zero-Knowledge Contingent Payment (ZKCP), a seller does not have to interact with the buyer, as they only need to post a single bounty transaction.
Private non-interactive bounties for general computation on Bitcoin
Outsourcing arbitrary computation securely and privately on a blockchain needs Zero Knowledge Proof to validate encrypted solution and prevent data from leaking.
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.
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.