[erlang-questions] [Kai-users] Merkle trees and related things in Erlang

[Takeru INOUE]

Good job!
The three algorithms are essential in most of distributed data store.
Especially, merkle.erl enables the tree to grow incrementally.
This is great feature.


On Thu, Jul 31, 2008 at 5:22 AM, Justin Sheehy <justin@REDACTED> wrote:
>> On 7/14/08 10:09 AM, "Takeru INOUE" <takeru.inoue@REDACTED> wrote:
>>
>>>>> What good news!
>>>>> We were seeking vector clocks and Merkle tree.
>
> Several people have been asking about this for a while, so I decided
> to just go ahead and put it online.  The google code project at
> http://code.google.com/p/distributerl/ now has vector clocks,
> consistent hashing, and a Merkle tree implementation that is suitable
> for dynamic trees.
>
> The Merkle trees are somewhat different from the traditional style of
> construction algorithm, because the common way to do it works very
> well for the original use (digital signatures) but does not adapt
> easily to trees representing data that changes incrementally over time.
>
> The documentation is minimal but functional right now.  If anyone has
> questions about this, feel free to either ask me or post to the google
> group tied to the code repository.
>
> Enjoy.
>
> -Justin
>
>
>
>
>
>
> -------------------------------------------------------------------------
> This SF.Net email is sponsored by the Moblin Your Move Developer's challenge
> Build the coolest Linux based applications with Moblin SDK & win great prizes
> Grand prize is a trip for two to an Open Source event anywhere in the world
> http://moblin-contest.org/redirect.php?banner_id=100&url=/
> _______________________________________________
> Kai-users mailing list
> Kai-users@REDACTED
> https://lists.sourceforge.net/lists/listinfo/kai-users
>



-- 
 Takeru INOUE <takeru.inoue@REDACTED>