https://github.com/uncomputable/simple-layer-twos
Replit resources from Bitcoin++ 2023 in Austin
https://github.com/uncomputable/simple-layer-twos
bitcoin circuit learning logic tutorial
Last synced: 3 months ago
JSON representation
Replit resources from Bitcoin++ 2023 in Austin
- Host: GitHub
- URL: https://github.com/uncomputable/simple-layer-twos
- Owner: uncomputable
- License: cc0-1.0
- Created: 2023-05-11T14:58:18.000Z (about 2 years ago)
- Default Branch: master
- Last Pushed: 2023-11-10T16:29:42.000Z (over 1 year ago)
- Last Synced: 2025-02-04T19:46:38.221Z (5 months ago)
- Topics: bitcoin, circuit, learning, logic, tutorial
- Homepage:
- Size: 1.4 MB
- Stars: 3
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Simple Layer Twos
(Replit resources from Bitcoin++ 2023 in Austin)
Speaker: Christian Lewe
Github: [uncomputable](https://github.com/uncomputable)
Twitter: [@uncomputab1e](https://twitter.com/uncomputab1e)
## Session Agenda:
1. What Is Simplicity
2. Fedimint + Simplicity (aka Simpimint)
3. Rollups + Simplicity
4. Elements + Simplicity
5. Conclusion
## What's In This Repl?
Nothing less than the best resource on Simplicity on the web!
- Section 1 is this page
- Sections 2-5 cover the slides of the talk
- Sections 6-8 explain some of the foundations of Simplicity in detail
- Section 9 contains links and summaries of past talks
- Section 10 contains links and summaries of past blog posts
## Hackathon Ideas Chris Could Help You With:
1. Execute Simplicity transactions on Elements Core (regtest). There is a [`simplicity` branch for Elements](https://github.com/ElementsProject/elements/tree/simplicity) that accepts Simplicity programs inside specially tagged tap leaves. The tool [tappy](https://github.com/uncomputable/tappy/tree/simplicity) lets you write Simplicity transactions using Miniscript-esque descriptors. Feel free to experiment!
2. Add a Simplicity contract into the Fedimint Lightning module. Subject of the talk. This is a continuation of the Simpimint project from last year (which won first prize at the hackerthon btw).
3. Build interesting Simplicity programs using [rust-simplicity](https://github.com/ElementsProject/rust-simplicity). Last year I built a [program that verifies the computation of a Turing machine](https://github.com/uncomputable/simple-turing). There are infinitely many other options. Anything is possible with Simplicity.