bl/redoal
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

punch out warnings and patch some readme

Browse Source
This commit is contained in:
Bendik Lynghaug
2024-10-27 14:52:26 +01:00
parent 718d42f825
commit 76d0bd9f91
2 changed files with 18 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
ReadMe.md
View File

@@ -1,13 +1,19 @@
# Redoal
> Defeating the DNS hedgemony through path comparisons of all possibilties of the curve on a DHT
A library to quantize input path data as a search tree enabling the core functionality of a DHT based path lookup.
A library to quantize input path data as a search tree enabling the core functionality of a DHT to be used for path comparisons.
Local cache
# What it does
1. Optionally we preprocess input data, normalize, center weight and ensure it's not out of bounds, as a turning function.
1. Optionally we asyncronously preprocess input data, normalize, center weight and ensure it's not out of bounds, as a turning function.
2.
2. Cluster path data into a k-d tree.
3. Indexing - Store the tree coordinates in a hashmap with a unique key.
4. Query Processing - Query the tree for the nearest neighbor.