aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authordec05eba <dec05eba@protonmail.com>2019-04-07 17:14:12 +0200
committerdec05eba <dec05eba@protonmail.com>2020-08-18 23:26:34 +0200
commiteb715599c9e2e447f649d9fd2dd531820d69400c (patch)
tree9b67656302cee1ef300b1101f57e7fab0a65a8fb /README.md
parentcb841e34cd200827c45c55afb537255865531026 (diff)
Use argon2d instead of argon2i
We want gpu-resistance instead of side-channel attack resistance since password is hashed locally.
Diffstat (limited to 'README.md')
-rw-r--r--README.md5
1 files changed, 2 insertions, 3 deletions
diff --git a/README.md b/README.md
index fc334e8..dcae648 100644
--- a/README.md
+++ b/README.md
@@ -1,5 +1,6 @@
# odhtdb
-Decentralized key-value database using OpenDHT for decentralized communication. CRDT is used to replicate data across nodes.
+Decentralized key-value database using sibs-pubsub for decentralized communication. CRDT is used to replicate data across nodes.
+It is designed to use less bandwidth over speed.
## End-to-end encryption
Data is signed using ed25519, encrypted using xchacha20-poly1305 ietf and hashed using Blake2b.
See src/Encryption.cpp, src/Signature.cpp and src/Hash.cpp.
@@ -34,8 +35,6 @@ This database is used for chat application, and in chat applications you may wan
Functionality for an invite link that is only available for a certain amount of time can be added by generating an invite packet as an admin user with timestamp
and the user that should be added can be excluded from the signed packet, allowing any user to be added to channel while the invite link is valid.
The invite link could be converted to hex string to make it shareable and also generate QR-code using it to make it easy to join with mobile device.
-## UDT
-Combine opendht with udt. Use opendht to find other peers and udt for communication.
## New node download
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.