aboutsummaryrefslogtreecommitdiffstats
path: root/lib/kernel/Merkle.ml
diff options
context:
space:
mode:
authorEstevan Castilho <tevo@riajuu.net>2026-08-01 00:34:42 +0000
committerEstevan Castilho <tevo@riajuu.net>2026-08-01 00:34:42 +0000
commit9cbaf09aaefb7e358bb18ac2eb31b0493f4b2fbb (patch)
treeead52187e3f2da203cc8f72d844bdc98bab650e0 /lib/kernel/Merkle.ml
parenta3f9ee8f227c94646bcc0a2269127b4fe369ebc0 (diff)
downloadRNT-9cbaf09aaefb7e358bb18ac2eb31b0493f4b2fbb.tar.gz
RNT-9cbaf09aaefb7e358bb18ac2eb31b0493f4b2fbb.zip
Be a bit more specific on this TODO
Diffstat (limited to 'lib/kernel/Merkle.ml')
-rw-r--r--lib/kernel/Merkle.ml5
1 files changed, 4 insertions, 1 deletions
diff --git a/lib/kernel/Merkle.ml b/lib/kernel/Merkle.ml
index f58935f..82fdae0 100644
--- a/lib/kernel/Merkle.ml
+++ b/lib/kernel/Merkle.ml
@@ -109,7 +109,10 @@ module Make : TREE = functor (S : Abstract.Storage.STORAGE) (K : KEY) -> struct
let to_blob node = to_bencode node |> Concepts.Codec.Bencode.to_blob
- (* FIXME *)
+ (* TODO: we should probably cache this inside the node itself rather
+ than recalculating it every time. We could also allow the user to
+ create "uninterned" nodes that are not storage-backed, that could
+ be used for intermediates and the like. *)
let hash_of node = to_blob node |> Concepts.Hash.hash_of_blob
let find tx node =