@@ -77,7 +77,7 @@ SHA256, like the rest of the commitment procedures used here.
77
77
78
78
The main data type, related to the merklization, is ` MerkleHash ` : it is a tagged
79
79
hash (using ` urn:ubideco:merkle:node#2024-01-31 ` tag) representing node at any
80
- position of the tree: leafs , branch nodes and merkle tree root. ` MerkleHash `
80
+ position of the tree: leaves , branch nodes and merkle tree root. ` MerkleHash `
81
81
can be produced in the following ways:
82
82
- as a result of merklziation procedure, when it represents Merkle tree root;
83
83
- as a root of empty Merkle tree (i.e. collection having 0 elements), by calling
@@ -86,7 +86,7 @@ can be produced in the following ways:
86
86
commitment id to be ` MerkleHash ` .
87
87
88
88
In all of the above cases the hash commits to the tree parameters, which makes
89
- it safe to use the same type for leafs , branches and root nodes. Specifically,
89
+ it safe to use the same type for leaves , branches and root nodes. Specifically,
90
90
it uses an intermediate structure ` MerkleNode ` , which is filled with information
91
91
on (see [ ` MerkleNode.vesper ` ] ( ../stl/MerkleNode.vesper ) for details):
92
92
- type of node branching (no branches, one branch or two branches),
@@ -103,7 +103,7 @@ call. The API puts the following requirements on the collection: either
103
103
- maximum number of elements must be either 0xFF or 0xFFFF ** and** each
104
104
collection element must implement ` CommitEncode ` trait with target id set to
105
105
` MerkleHash ` ,
106
- - or there is a manual implementation of ` MerkleLeafs ` trait.
106
+ - or there is a manual implementation of ` MerkleLeaves ` trait.
107
107
108
108
``` mermaid
109
109
flowchart BT
@@ -251,7 +251,7 @@ constructing multi-protocol commitment tree. Bundle id commits to operation ids
251
251
for the participating state transitions and maps of the witness transaction
252
252
input to the operation ids. For this purpose, the commitment is created by
253
253
strict-encoding ` input_map ` field of ` TransitionBundle ` into the hasher,
254
- initialized with tag ` urn:lnp-bp:rgb:bundle#2024-02-03 ` . Input map is serialzied
254
+ initialized with tag ` urn:lnp-bp:rgb:bundle#2024-02-03 ` . Input map is serialized
255
255
first as a 16-bit little-endian integer specifying the number of the items in
256
256
the map, followed by the sequence of pairs of input number (32-bit LE value)
257
257
and ` OpId ` (32-bytes).
0 commit comments