Leaf
scalus.crypto.trie.Node.Leaf
final class Leaf(val skipStart: Int, val fullPath: ByteString, val key: ByteString, val value: ByteString) extends Node
A leaf node that stores the value and the full key.
Hash is computed lazily — only when first accessed (e.g. for rootHash or proof generation). This avoids redundant blake2b_256 calls during bulk trie construction.
Value parameters
- skipStart
-
cursor position at creation; nibbles are derived via
nibbleAt(fullPath, skipStart + i)
Attributes
- Graph
-
- Supertypes
Members list
In this article