Hash Array Mapped Tries (HAMT) to the Rescue

Re:Hash Array Mapped Tries (HAMT) to the Rescue by ianopolous on Monday September 07, 2020 @09:37AM (#24399337)

I've implemented CHAMP [0] for Peergos in the IPLD/IPFS setting, largely based on the Steindorfer paper. There is one improvement that whyrusleeping from ipfs came up with which is to allow a small number of hash collisions in a level, before pushing things down a level.

[0] https://github.com/Peergos/Peergos/blob/master/src/peergos/s...

[ Parent | on HN ]

Re:Hash Array Mapped Tries (HAMT) to the Rescue by omginternets on Monday September 07, 2020 @11:47AM (#24400190)

Thanks for the link, this is super helpful.

I posted my parent comment opportunistically, so I have yet to distill my reading into specific, well-formed questions. Is there any way I can message you when I get around to doing so?

In the meantime:

>There is one improvement that whyrusleeping from ipfs came up with which is to allow a small number of hash collisions in a level, before pushing things down a level.

How is this an improvement, exactly?

[ Parent | on HN ]

Re:Hash Array Mapped Tries (HAMT) to the Rescue by ianopolous on Monday September 07, 2020 @12:04PM (#24400342)

Sure, I have a protonmail email with my github username.

>How is this an improvement, exactly? This allows you to essentially make the tree "fatter" for a given bitwidth. This matters more in the ipfs setting because links are not memory pointers, but Merkle-links to objects which may be a network request away.

[ Parent | on HN ]

Re:Hash Array Mapped Tries (HAMT) to the Rescue by omginternets on Monday September 07, 2020 @12:35PM (#24400554)

Ah ok, that makes sense.

I've sent you an email with from my personal gmail account. I really appreciate the help, thanks!

[ Parent | on HN ]