Hacker News new | past | comments | ask | show | jobs | submit login
Solving Fine Grained Authorization with Incremental Computation (feldera.com)
4 points by gz09 2 days ago | hide | past | favorite | 1 comment





[I am the author of the blog] It's been fun working on this demo. FGA is a very cool concept, but building an efficient FGA engine is hard: you basically need to solve a graph reachability problem for each auth request.

So I tried a different approach: precompute all authorization decisions ahead of time and incrementally update the computation in real-time. As the post explains, there's not free lunch; there's a space/time tradeoff involved, but overall I think it's very promising.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: