so, not private nor efficient nor solution to homomorphic data. basically a polynomial factor hash of the index keys... basically you will need the entire db p

so, not private nor efficient nor solution to homomorphic data. basically a polynomial factor hash of the index keys... basically you will need the entire db plus the larger hashed keys. doesn't help at all implementing any of the outlandish claims. guess the merit is in proving the poly fact they build on as secure. but that is not a game changer as there are better alternatives and nobody solved the claimed problems with them.