current pricing and rating algorithms use monte carlo methods
and would not solve densest subgraphs even for moderate parameters.
So at the very least those should be changed.
Turns out problem they reduced their model to is open in terms of finding good approximation to it. Excerpt from the FAQ: The paper relies upon a stronger form of "P not equals NP", namely,
that the planted dense subgraph problem does not have an efficient
algorithm. (In fact it is conjectured that there is no algorithm
to even compute any approximate solutions to this problem).
Fuchsia doesn't share as much of the story but does pick up where in Dante's Inferno the original Unix people tried to abandon the root user to redeem themselves almost 30 years ago. Combined with capability based model last seen deployed in the wild with OS/400 and Burroughs machines before that, it would be the first truly new OS in decades.