Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with simplicity
Search options not deleted
user 49364
Simplicity is a work-in-progress programming language proposed as a more flexible and expressive alternative to Bitcoin Script.
3
votes
Accepted
Pruning a Simplicity case expression
The definition of cond is
cond thn els = match (drop els) (drop thn)
Expanding this in your definition of full yields
full = match (drop unit) (drop u)
The correct pruned version should be
prun …
- 466
6
votes
Accepted
How is Simplicity better suited for static analysis compared to script?
In Simplicity, we have a separation between the Simplicity language and the language of the Bit Machine with a formal translation from the Simplicity language to the Bit Machine language (see Figure 2 … Instead one is expected to use the formal semantics of Simplicity to directly reason about Simplicity expressions (for example we have a proof of correctness of the SHA-256 implementation in Simplicity …
- 466
3
votes
Accepted
Intuition for Simplicity's CheckSigHashAll
Simplicity doesn't use BIP-Schnorr per se. Rather checkSigHashAll is a Simplicity expression that implements an old draft of BIP-Schnorr. … Instead the checkSigHashAll Simplicity expression contains primitives that, during Simplicity execution, return the transaction's locktime and version
To make a simple 2-of-2 multisig you could write …
- 466
5
votes
Accepted
How does Elements integrate Simplicity?
It has always been the case that the full Bit Machine would be "exposed"[1] by allowing arbitrary Simplicity. … The Bit Machine can only be run through interpreting well-typed Simplicity programs. This is important because the Bit Machine relies on the type-safety of Simplicity for its memory safety. …
- 466