diff options
author | dec05eba <0xdec05eba@gmail.com> | 2018-05-14 20:13:24 +0200 |
---|---|---|
committer | dec05eba <0xdec05eba@gmail.com> | 2018-05-14 20:13:27 +0200 |
commit | 8daf7b3165c65a932a7d8eae1f0a640199892ca9 (patch) | |
tree | c6d44529e4e2e0808841366f112700a0bb3d1bfd /README.md | |
parent | 1fe14e8fcfbec25cb6b70df194a82ede4cc0a3e5 (diff) |
Only download nodes that we are missing
Diffstat (limited to 'README.md')
-rw-r--r-- | README.md | 8 |
1 files changed, 8 insertions, 0 deletions
@@ -40,3 +40,11 @@ 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 +## Safe multi-threading SQL handling +Create SQL classes with mutex for performing prepared statements. Currently the database can crasah if DatabaseStorage methods are accessed at the same time +from multiple threads +## Find a way to deal with u64 in sqlite +Used by timestamp and action counter +## Packet sorting +When you get packets from remote peers, you might get NodeAddData before Node, in that case the packets should not be discarded but there should be +a flag for NodeAddData to handle such situations |