Seek in archive
It's using the index and the gzip member file to seek to the exact record in the HTTP request.
Hash=HASHVALUE) (it's the hex representation of MD5);
select rfingerprint from keys where md5 in ('HASHVALUE');
List of services which are giving access to Tor network and especially Tor hidden services
via web interface. We keep track of potential injection or abuse from such service (the column
Analysed directory /usr/lib/modules/5.11.0-41-generic/ on maurer running Linux-5.11.0-43-generic-x86_64-with-glibc2.29 at 2022-01-02 11:20:10.596458+00:00.
Run with hashlookup-forensic-analysed version 0.8.
Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not – in other words, a query returns either "possibly in set" or "definitely not in set".
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can bechanging dynamically via insertions and deletions. As with a Bloom filter,a CBF obtains space savings by allowing false positives. We provide asimple hashing-based alternative based ond-left hashing called ad-leftCBF (dlCBF). The dlCBF offers the same functionality as a CBF, butuses less space, generally saving a factor of two or more. We describethe construction of dlCBFs, provide an analysis, and demonstrate theireffectiveness experimentally
CIRCL hash lookup is a public API to lookup hash values against known database of files. NSRL RDS database is included. More database will be included in the future. The API is accessible via HTTP ReST API and the API is also described as an OpenAPI.
curl -X 'GET' \ 'https://hashlookup.circl.lu/info' \ -H 'accept: application/json'