← browse profiles
Christian Lewe MEMBER SINCE 2022

Christian Lewe

@uncomputable-896ab721
5editions
4talks
0projects

5 editions attended.

On stage.

Full archive →
talk

Authenticated Input: A Challenge For Bridges

Modern Bitcoin bridges require data to be posted on chain. For example, a bridge operator posts a succinct proof to unlock a withdrawal. However, data is just data and can be created by anybody. To ensure that it comes from the operator, it must be authenticated. This means that the Bitcoin transactions that contain this data get very large. In this talk, we will go over the solutions to this problem: from Lamport signatures to adaptor signatures to experimental techniques. We will build an intuition for the hardness of this problem, how far we’ve gotten, and where future research is headed. Finally, we will connect the state of the problem with existing proposals in the greater Bitcoin universe. This talk will be accessible to all. No cryptographic background is required.

Toronto 2026
talk

Simplicity + Nix = Love

Simplicity is the future of smart contracts on Bitcoin and Liquid. But how do you get started with something as cutting-edge as this? By using nix! Simplicity has first-class support for nix so you can run all of our tools without having to worry about dependencies. In this talk I will give an overview of our nix infrastructure and show how you can use it for fun and profit.

Berlin 2023
talk

Simple Layer Twos

Simplicity is a proposed overhaul of the scripting language of Bitcoin. It fundamentally changes what can be done on layer one, but it does not stop there. Given what was possible with the existing scripts so far, imagine the explosion of ideas that Simplicity would enable. In this talk, we explore some of those applications, including Validity rollups and Fedimint accounts.

Austin 2023
talk

Simplicity: From Bitcoin Script to Arbitrary Computation

Bitcoin Script is a language that controls the spending of coins. However, there are various alternatives that strive to be better: Ethereum's Solidity can express all computable functions and allows for more introspection into spending transactions. Due to Turing completeness, static analysis is limited. Miniscript is a declarative language that corresponds to a subset of Bitcoin Script. It allows powerful static analysis, including a complete enumeration of all spending paths as well as guarantees about resource limits. The language can express at most what Bitcoin Script can express. A question arises: Can we design a language with higher expressivity, like Solidity, that has integrity and verifiability like Miniscript? Simplicity is a functional language developed by Russel O'Connor since 2015, which we hope to deploy on the Liquid network soon. It can implement powerful smart contracts, since it can express all Boolean functions. Meanwhile, it is verifiable and admits resource bounds. The language is implemented for the Coq proof assistant, which enables machine-verified proofs of arbitrary statements about a given Simplicity program. APIs in C, Rust and Haskell are in the making. In this talk, we give a general introduction to Simplicity. We explain the structure of a Simplicity program and look into how it can be used in practice. We draw parallels to Bitcoin Script and sketch a translation to Simplicity. By Christian Lewe of Blockstream https://btcpp2022.sched.com/event/12P73/simplicity-from-bitcoin-script-to-arbitrary-computation

Austin 2022