aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorMax Ogden <max@maxogden.com>2016-04-05 12:49:23 -0700
committerMax Ogden <max@maxogden.com>2016-04-05 12:49:23 -0700
commit2d12228213baa9af81f4e4b21c59d2597b9a39d8 (patch)
tree7138feff6ce1462eb6d460ef1c4eb9857159fd2d
parent35d4251dead3335525244c237af81b7aec67f0b2 (diff)
downloaddat-docs-2d12228213baa9af81f4e4b21c59d2597b9a39d8.tar.gz
dat-docs-2d12228213baa9af81f4e4b21c59d2597b9a39d8.zip
try again
-rw-r--r--how-dat-works.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/how-dat-works.md b/how-dat-works.md
index 71dba53..0e76667 100644
--- a/how-dat-works.md
+++ b/how-dat-works.md
@@ -38,7 +38,7 @@ Hyperdrive shares and synchronizes a set of files, similar to rsync or Dropbox.
![cdc diagram](meta/cdc.png)
-We have configured our Rabin chunker to produce chunks that are around 16KB on average. So if you share a folder containing a single 1MB JPG you will get around 64 chunks. The idea of CDC is that your chunks only change if
+We have configured our Rabin chunker to produce chunks that are around 16KB on average. So if you share a folder containing a single 1MB JPG you will get around 64 chunks.
After feeding the file contents through the chunker, we take the chunks and calculate the SHA256 hash of each one. We then arrange these hashes into a special data structure we developed that we call the Flat In-Order Merkle Tree.