From 854807950f5f6daf1a67cb6561ee0f6d1d31bd8e Mon Sep 17 00:00:00 2001 From: John Turpish <97759690+John-LittleBearLabs@users.noreply.github.com> Date: Mon, 22 May 2023 14:22:46 -0400 Subject: [PATCH] Update src/_blog/2023-05-multi-gateway-browser-client.md Co-authored-by: Marcin Rataj --- src/_blog/2023-05-multi-gateway-browser-client.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/_blog/2023-05-multi-gateway-browser-client.md b/src/_blog/2023-05-multi-gateway-browser-client.md index af955ca2..9565f5a9 100644 --- a/src/_blog/2023-05-multi-gateway-browser-client.md +++ b/src/_blog/2023-05-multi-gateway-browser-client.md @@ -145,7 +145,7 @@ In this case the `data` field isn't really important to us. The `links`, however ###### [HAMT](https://en.wikipedia.org/wiki/Hash_array_mapped_trie) (sharded) Directory -This is for directories with just too many entries in them. The links from this directory node might be entries in the directory or they might be other HAMT nodes referring to the same directory (basically, the directory itself is getting split up over a tree of nodes). +This is for directories with just too many entries in them to fit in a single block. The links from this directory node might be entries in the directory or they might be other HAMT nodes referring to the same directory (basically, the directory itself is getting split up over a tree of nodes). * If you're coming in from another HAMT node, you might have some unused bits of the hash to select the next child. * If you have a path, hash the name of the item you're looking for, pop the correct number of bits off the hash, and use it to select which element you're going to next.