diff options
| author | Max Ogden <max@maxogden.com> | 2016-04-05 12:48:33 -0700 |
|---|---|---|
| committer | Max Ogden <max@maxogden.com> | 2016-04-05 12:48:33 -0700 |
| commit | 35d4251dead3335525244c237af81b7aec67f0b2 (patch) | |
| tree | 57e92d4b8a88bf02048252b2c6fac5eb047a0e33 /hyperdrive.md | |
| parent | 20e67d4c4ffed610481b80ff559dcf7326e1771c (diff) | |
| download | dat-docs-35d4251dead3335525244c237af81b7aec67f0b2.tar.gz dat-docs-35d4251dead3335525244c237af81b7aec67f0b2.zip | |
test githubs gpg signed commits
Diffstat (limited to 'hyperdrive.md')
| -rw-r--r-- | hyperdrive.md | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/hyperdrive.md b/hyperdrive.md index 999a03c..1636d77 100644 --- a/hyperdrive.md +++ b/hyperdrive.md @@ -18,9 +18,9 @@ The protocol itself draws heavy inspiration from existing file sharing systems s ## How Hypercore works -### Flat Trees +### Flat In-Order Trees -A flat tree is a simple way represent a binary tree as a list. It also allows you to identify every node of a binary tree with a numeric index. Both of these properties makes it useful in distributed applications to simplify wire protocols that uses tree structures. +A Flat In-Order Tree is a simple way represent a binary tree as a list. It also allows you to identify every node of a binary tree with a numeric index. Both of these properties makes it useful in distributed applications to simplify wire protocols that uses tree structures. Flat trees are described in [PPSP RFC 7574 as "Bin numbers"](https://datatracker.ietf.org/doc/rfc7574/?include_text=1) and a node version is available through the [flat-tree](https://github.com/mafintosh/flat-tree) module. |