What is this talk about? Give us as many details as possible.
This talk is about how fraud proofs work on Bitcoin.
In classic fraud proofs, challenges are conducted against a single instruction;
In Bitcoin, the program is split into multiple segments to not break Bitcoin limitations and to reduce the number of intermediate values;
The segments need to be linked using Lamport signatures in order to maintain consistency;
A smart compiler is required to do the nontrivial job of segmenting;
A fraud proof game is designed to prove the incorrect segment and slash the game loser.
Bitlayer has made a test project to demonstrate the fraud proof game and also a smart compiler to do the segmenting (source code will be open soon).
What would an attendee learn from this talk?
Attendees will learn:
Options to turn programs written in general language into another format that can be segmented;
How to link the segments of the same program;
How to design a fraud proof game on Bitcoin;
Use ZK verifier to replace the original program, further reducing the size of the computation
A smart compiler that can split the program into segments.
Is there anything folks should read up on before they attend this talk?
Attendees may benefit from reviewing the following topics:
Basics of Bitcoin scripting and opcodes.
Basic understanding of validity proofs and fraud proofs.
Description
What is this talk about? Give us as many details as possible.
This talk is about how fraud proofs work on Bitcoin.
What would an attendee learn from this talk?
Attendees will learn:
Is there anything folks should read up on before they attend this talk?
Attendees may benefit from reviewing the following topics:
Relevant Links
About the Speaker
Social Links
Twitter: https://x.com/CharlieHusats Website: not maintained
Talk Details
Length of Talk
20-30 minutes, ideally longer
Preferred Day/Time Slot
*We will do our best to accommodate your requested time slot. Please let us know if there are any dates/times that absolutely do not work for you.*