diff options
| author | Marcos Magueta <maguetamarcos@gmail.com> | 2026-03-11 01:59:19 -0300 |
|---|---|---|
| committer | Marcos Magueta <maguetamarcos@gmail.com> | 2026-03-11 01:59:19 -0300 |
| commit | de3249dcfcff5c628f77da3c3d1e65f5fe8b0d7f (patch) | |
| tree | ace65e0207ba40efd988beadd54d48d32413244d /lib/merkle.ml | |
| parent | e1d28558d0c19003690be4d6c29fcf2421d577c5 (diff) | |
| download | Sakura-de3249dcfcff5c628f77da3c3d1e65f5fe8b0d7f.tar.gz Sakura-de3249dcfcff5c628f77da3c3d1e65f5fe8b0d7f.zip | |
todos
Diffstat (limited to '')
| -rw-r--r-- | lib/merkle.ml | 6 |
1 files changed, 6 insertions, 0 deletions
diff --git a/lib/merkle.ml b/lib/merkle.ml index e3f68d9..ffa7171 100644 --- a/lib/merkle.ml +++ b/lib/merkle.ml @@ -54,6 +54,12 @@ module HashSet : S = struct let member hash tree = StringSet.mem hash tree let keys tree = StringSet.elements tree + (* TODO: Streaming/pagination for large tuple sets. Currently materializes + entire keyset into memory, which fails for relations with billions of tuples. + Replace with paginated access (keys_paginated offset limit) or lazy generator + to avoid loading all hashes upfront. Consider replacing HashSet with proper + radix-merkle tree (plebeia) for native lazy traversal. *) + let root_hash tree = if StringSet.is_empty tree then |