All hashing is done with SHA-2-256 (also known as SHA-256), defined in FIPS 180-4 *. *

`HashDigest`

Output of the hashing function. Exactly 256 bits (32 bytes) long.

Two Merkle tree structures are used: a Binary Merkle Tree (to commit to bytecode) and a Sparse Merkle Tree (to commit to contract storage, i.e. state).

Binary Merkle trees are constructed in the same fashion as described in Certificate Transparency (RFC-6962) *, except for using a different hashing function . Leaves are hashed once to get leaf node values and internal node values are the hash of the concatenation of their children (either leaf nodes or other internal nodes). *

Nodes contain a single field:

name | type | description |
---|---|---|

`v` | `HashDigest` | Node value. |

The base case (an empty tree) is defined as the hash of the empty string:

`node.v = 0xe3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855`

For leaf node `node`

of leaf data `d`

:

`node.v = h(0x00, serialize(d))`

For internal node `node`

with children `l`

and `r`

:

`node.v = h(0x01, l.v, r.v)`

Note that rather than duplicating the last node if there are an odd number of nodes (the Bitcoin design *), trees are allowed to be imbalanced. In other words, the height of each leaf may be different. For an example, see Section 2.1.3 of Certificate Transparency (RFC-6962) **. *

Leaves and internal nodes are hashed differently: the one-byte `0x00`

is prepended for leaf nodes while `0x01`

is prepended for internal nodes. This avoids a second-preimage attack where internal nodes are presented as leaves * trees with leaves at different heights. *

name | type | description |
---|---|---|

`root` | `HashDigest` `[]` | The expected root of the Merkle tree. |

`data` | Bytes | The data of the leaf (unhashed). |

`siblings` | `HashDigest` `[]` | Sibling hash values, ordered starting from the leaf's neighbor. |

A proof for a leaf in a binary Merkle tree , as per Section 2.1.1 of Certificate Transparency (RFC-6962) *. *

In some contexts, the array of sibling hashes is also known as the proof set. Note that proof format prescribes that leaf data be in its original, unhashed state, while the proof set (array of sibling data) uses hashed data. This format precludes the proof set from itself including the leaf data from the leaf undergoing the proof; rather, proof verification explicitly requires hashing the leaf data during the calculation of the proof set root.

Sparse Merkle Trees (SMTs) are *sparse*, i.e. they contain mostly empty leaves. They can be used as key-value stores for arbitrary data, as each leaf is keyed by its index in the tree. Storage efficiency is achieved through clever use of implicit defaults, avoiding the need to store empty leaves.

Additional rules are added on top of plain binary Merkle trees :

- Default values are given to leaf nodes with empty leaves.
- While the above rule is sufficient to pre-compute the values of intermediate nodes that are roots of empty subtrees, a further simplification is to extend this default value to all nodes that are roots of empty subtrees. The 32-byte zero, i.e.
`0x0000000000000000000000000000000000000000000000000000000000000000`

, is used as the default value. This rule takes precedence over the above one. - The number of hashing operations can be reduced to be logarithmic in the number of non-empty leaves on average, assuming a uniform distribution of non-empty leaf keys. An internal node that is the root of a subtree that contains exactly one non-empty leaf is replaced by that leaf's leaf node.

Nodes contain a single field:

name | type | description |
---|---|---|

`v` | `HashDigest` | Node value. |

In the base case, where a sparse Merkle tree has `height = 0`

, the root of a tree is defined as the hash of the empty string:

`node.v = 0xe3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855`

When a sparse Merkle tree has a height of 0, it can have no leaves, and, therefore, no default value children. The root is then calculated as the hash of the empty string, similar to that of an empty binary Merkle tree.

For a tree with `height > 0`

, the root of an empty tree is defined as the default value:

`node.v = 0x0000000000000000000000000000000000000000000000000000000000000000`

Note that this is in contrast to the base case of the sparse and binary Merkle trees, where the root is the hash of the empty string. When a sparse Merkle tree has a height greater than 0, a new tree instance is composed of default value leaves. Nodes containing only default value children have the default value as well. Applying these rules recursively percolates the default value up to the tree's root.

For leaf node `node`

of leaf data `d`

with key `k`

:

`node.v = h(0x00, k, h(serialize(d)))`

The key of leaf nodes must be prepended, since the index of a leaf node that is not at maximum depth cannot be determined without this information. Leaf values are hashed so that they do not need to be included in full in non-membership proofs.

For internal node `node`

with children `l`

and `r`

:

`node.v = h(0x01, l.v, r.v)`

Before insertion of the key-value pair, each key of the Sparse Merkle Tree should be hashed with `sha256`

to prevent tree structure manipulations.
During the proof verification, the original leaf key should be hashed similarly. Otherwise, the root will not match.

SMTs can further be extended with *compact* proofs. Merkle proofs are composed, among other things, of a list of sibling node values. We note that, since nodes that are roots of empty subtrees have known values (the default value), these values do not need to be provided explicitly; it is sufficient to simply identify which siblings in the Merkle branch are roots of empty subtrees, which can be done with one bit per sibling.

For a Merkle branch of height `h`

, an `h`

-bit value is appended to the proof. The lowest bit corresponds to the sibling of the leaf node, and each higher bit corresponds to the next parent. A value of `1`

indicates that the next value in the list of values provided explicitly in the proof should be used, and a value of `0`

indicates that the default value should be used.

A proof into an SMT is structured as:

name | type | description |
---|---|---|

`depth` | `uint16` | Depth of the leaf node. The root node is at depth `0` . Must be `<= 256` . |

`siblings` | `HashDigest` `[]` | Sibling hash values, ordered starting from the leaf's neighbor. |

`includedSiblings` | `byte[32]` | Bitfield of explicitly included sibling hashes. |

The `includedSiblings`

is ordered by most-significant-byte first, with each byte ordered by most-significant-bit first. The lowest bit corresponds to the leaf node level.

A specification describing a suite of test vectors and outputs of a Sparse Merkle Tree is here .

Consensus-critical data is authenticated using ECDSA *, with the curve secp256k1 **. A highly-optimized library is available in C **, with wrappers in Go ** and Rust **. *

Public keys are encoded in uncompressed form, as the concatenation of the `x`

and `y`

values. No prefix is needed to distinguish between encoding schemes as this is the only encoding supported.

Deterministic signatures (RFC-6979 *) should be used when signing, but this is not enforced at the protocol level as it cannot be. *

Signatures are represented as the `r`

and `s`

(each 32 bytes), and `v`

(1-bit) values of the signature. `r`

and `s`

take on their usual meaning (see: SEC 1, 4.1.3 Signing Operation *), while *`v`

is used for recovering the public key from a signature more quickly (see: SEC 1, 4.1.6 Public Key Recovery Operation *). Only low-*`s`

values in signatures are valid (i.e. `s <= secp256k1.n//2`

); `s`

can be replaced with `-s mod secp256k1.n`

during the signing process if it is high. Given this, the first bit of `s`

will always be `0`

, and can be used to store the 1-bit `v`

value.

`v`

represents the parity of the `Y`

component of the point, `0`

for even and `1`

for odd. The `X`

component of the point is assumed to always be low, since the possibility of it being high is negligible *. *

Putting it all together, the encoding for signatures is:

```
| 32 bytes || 32 bytes |
[256-bit r value][1-bit v value][255-bit s value]
```

This encoding scheme is derived from EIP 2098: Compact Signature Representation *. *

Ed25519 * is supported for use by applications built on Fuel. Edwards curve operations are performed by the ed25519-dalek ** Rust library. *

Public keys are encoded in compressed form as specified by the Ed25519 format RFC-8032 5.1.5 *. Point compression is performed by replacing the most significant bit in the final octet of the *`y`

coordinate with the sign bit from the `x`

coordinate:

```
let mut pk = y;
pk ^= x.is_negative().unwrap_u8() << 7;
```

Public keys are required to be strong enough to prevent malleability, and are checked for weakness during signature verification.

Signatures are 64 bytes, represented as the concatenation of `R`

(32 bytes) and `S`

(32 bytes) Where `R`

and `S`

are defined in RFC-8032 5.1.6 *. *

Signatures must conform to strict verification requirements * to avoid malleability concerns. While this is not part of the original Ed25519 specification, it has become a growing concern especially in cryptocurrency applications. *