So essentially I need a PIR that meets the following requirements: 1. Single bit, non-sequential I do not want to get a block of bytes from a position in a database, I want to get single bits that are at pseudo-random locations throughout the database. This puts the Pynchon Gate PIR out the window because it has query sizes that grow by one bit for each item in the database, which works fine if the items in the database are 1 megabyte but if they are 1 bit then it is is obviously worse than just doing everybody gets everything PIR. 2. Scalable, not computationally bound to theoretical papers I envision hundreds of thousands of clients doing thousands of queries a day. They are all for small bit strings though. 3. Computational PIR. I want a single server PIR, so the database doesn't need to be distributed. I don't know if any PIR schemes meet these requirements. I understand Pynchon Gate PIR inside and out because it is fairly simple, but many of the advanced PIR papers look to me as if somebody vomited up math symbols onto a paper. I want to spend time to implement something and I am willing to spend much time figuring out how to do it and learning the associated math, but I don't want to spend four weeks to get to the point of understanding that I realize this PIR will not work for me, thirty times before I find the one that will.