Downvoting for flame bait. Come on.
It‘s not just the government. As SF controls ever larger part of the world, many power hungry people flock to SF. Prices go up and more people want a piece of the action.
Although because pi is a transcendental number maybe it is impossible to have an algorithm to return the n-th digit in O(1) operations? Does anyone know ?
Upd: thinking more about it, just to read all the digits of number n, one needs log(n) operations, so I guess anything that has performance of O(log(n)) can be considered easy (i.e. the digits of rational numbers can be computed in O(logn).
There are transcendental numbers where the n-th digit can be computed in O(log n) like Champerowne constant though.