This should also equivalently help for designing c/storage layer IDs/lookup.

Acceptance criteria:

• Semantics of hash conflicts in one algorithm vs. the other, on compressed vs. uncompressed, are accurately understood and documented in an (if possible) easy-to-consume way
• Database schema is designed
• Database is prototyped in the "memory" cache backend at least (the real DB backends to follow)