spicedb will assemble the full union set at each level, presumably; so doesn't this just double the complexity from O(n*m) to O(2*n*m) where n is the number of levels and m the (average) number of users at each level?