idea: search tree which is also "merkle tree" so, if you have a trusted hash for the index root, you can:
- cheaply guarantee results accuracy
- run a pure ipld-based distributed search with reasonable complexity
- run a safe optimized delegated search (you query a peer with greater resources that has something like a monolith db and you can verify the result with the hashtree lineage)
Feel free to tell me why this is a stupid idea before I lose my mind trying to implement it :P
idea: search tree which is also "merkle tree" so, if you have a trusted hash for the index root, you can:
Feel free to tell me why this is a stupid idea before I lose my mind trying to implement it :P