# 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 to be used for path comparisons.

Local cache     

# What it does

1. Optionally we asyncronously preprocess input data, normalize, center weight and ensure it's not out of bounds, as a turning function.

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.




# Deserialize and Serialize
To encode and decode path data from 

# Testing

Visual tests can render and offer manual input data input that renders using the lyon crate.