If I did understand it right, you don't need to publish the Simplicity
code for the "jetable" expression.
That's the whole point of MAST. Each Simplicity expression can be
identified by its MAST root (the Merkle root of all branches in its
Abstract Syntax Tree).
Imagine you want to write a
Oops. That makes much more sense than what I said. Thanks a lot for the
clarification.
On 03.11.2017 02:10, Russell O'Connor via bitcoin-dev wrote:
> Hi Jose,
>
> Jets are briefly discussed in section 3.4 of
> https://blockstream.com/simplicity.pdf
>
> The idea is that we can recognize some set
Hi everyone,
I agree that the paper could use some more details on the rationale
behind "jets". After a couple of reads, I think I can "ELI5 them":
As far as I understand, jets are a smart optimization that makes complex
Simplicity contracts way cheaper to compute (ideally, comparable to
Script
Coincidentally, the kind of Merkle tree that Mark describes in his
proposal is exactly the one that we use at Stampery.
The Stampery BTA whitepaper[1] includes pseudocode for many of the
algorithms outlined by this proposal, including fast-SHA256, the tree
building process and the inclusion
