This appears to be that, but with a Pi (and of course a lot of impressive finish / software ).
A Pi for the masses / convince sounds amazing.
Deleted Comment
I guess its fine if you have a small project and aren't going to see much traffic, but Python is so slow and difficult to maintian compared to (e.g.) Go. I say this as someone who worked in Python for a long time, and on several large Django projects.
It isn't an outlandish thing to say that those companies deliver a disproportionate amount of hype to results as other companies in the same space.
However blocking ads (especially when done by prevent them being fetched) directly damages the 2nd party at a known price. Each individual pageview has a cost to serve it, and a revenue gained from it (via ads). In that sense what we're stealing is actually pageviews, which have (IMO) more in common with physical real-world objects (rivalrous) than a digital copy of a file.
More productively:
"How can you claim to let users delete content when the papers on your own company's storage and file systems explicitly state that data is never deleted but instead marked as unavailable?"
EDIT:
To wit:
https://code.facebook.com/posts/685565858139515/needle-in-a-...
> The delete operation is simple – it marks the needle in the haystack store as deleted by setting a “deleted” bit in the flags field of the needle. However, the associated index record is not modified in any way so an application could end up referencing a deleted needle. A read operation for such a needle will see the “deleted” flag and fail the operation with an appropriate error. The space of a deleted needle is not reclaimed in any way. The only way to reclaim space from deleted needles is to compact the haystack (see below).
> Compaction is an online operation which reclaims the space used by the deleted and duplicate needles (needles with the same key). It creates a new haystack by copying needles while skipping any duplicate or deleted entries. Once done it swaps the files and in-memory structures.
Just in an efficient way for FB