From b995e79eaf3ac940547beb902c1e1da5c08308ec Mon Sep 17 00:00:00 2001 From: dec05eba Date: Mon, 14 May 2018 00:29:48 +0200 Subject: Update readme --- README.md | 5 +---- 1 file changed, 1 insertion(+), 4 deletions(-) diff --git a/README.md b/README.md index 1f6d8a9..90c17fd 100644 --- a/README.md +++ b/README.md @@ -6,7 +6,6 @@ See src/Encryption.cpp, src/Signature.cpp and src/Hash.cpp. Also check Scheme.md for packet construction. # Limits Only 65kb of data can be used for each `add`. You can add more data by using `add` several times. -User and group name can't be longer than 255 characters. # TODO ## Data limit @@ -27,7 +26,7 @@ This can happen because we dont verify all peers get the data so by the time one (depends on network routing, network speed etc). Out of order requests also allows the network to operate faster. Operations are parsed in order for the receiving peer using operation timestamp. ## Padding -Packets should have padding in the encrypted data to prevent peers without encryption key to analyze content +Packets should have padding in the encrypted data to prevent peers without encryption key to analyze content by length ## Fake packets To prevent duplication of packets, the hash of packets should be stored and each request should check against the hash list if it has not already been received ## Functionality for dependant applications @@ -41,5 +40,3 @@ Combine opendht with udt. Use opendht to find other peers and udt for communicat Use a merkle tree and when requesting new nodes when connecting, send X latest hashes and other peers can send you where you have missing data and send you it. If all X hashes are wrong, send older hashes. However if we are only using opendht to find other peers, we might as well use https://github.com/DavidKeller/kademlia or https://github.com/ytakano/libcage -## Remove username -Username is cosmetic and not unique. Applications that uses odhtdb should implement their own username system if they wish to do so (using addData operation) -- cgit v1.2.3