/explore
|
You are here 
|
highlyscalable.wordpress.com | ||
| | | | |
blog.fastforwardlabs.com
Probabilistic data structures store data compactly with low memory and provide approximate answers to queries about stored data. They are designed to answer queries in a space-efficient manner, which can mean sacrificing accuracy. However, they typically provide guarantees and bounds on error rates depending on specifications of the data structure in question. Because they provide low memory footprints, probabilisitic data structures are particularly useful ink streaming and low power settings. |
|
| | | | | ||
| | | | |
lsd.gnunet.org
This document contains the R 5 N DHT technical specification. R 5 N is a secure distributed hash table (DHT) routing algorithm and data structure for decentralized applications. It features an open peer-to-peer overlay routing mechanism which supports ad-hoc permissionless participation and support for topologies in restricted-route environments. Optionally, the paths data takes through the overlay can be recorded, allowing decentralized applications to use the DHT to discover routes. This document defines the normative wire format of protocol messages, routing algorithms, cryptographic routines and security considerations for use by implementers. This specification was developed outside the IETF and does not have IETF consensus. It is published here to guid... |
|
| | | | | ||
| | | | |
backdrifting.net
[AI summary] The author explains what Bloom Filters are, their limitations, various applications like pre-caching, and the mathematical theory behind using them as constant-space probabilistic data structures. |
|
| | | | | ||
| | | | |
quantumloom.in
A simple guide to how cryptography keeps your digital stuff safe-from secret codes to secure messages. |
|
| | | |||
