I’ve been reading spatial-temporal reasoning as a way of clearing up the mist of mystery surrounding it.
A distributed network of nodes connected to N servers and M untrusted clients. Assuming servers are 100% trusted and not compromised, an estimated perf number at each node can be formulated, though.
Would it be possible for node I to be connected simultaneously to N nodes and still maintain the required flow? Assuming the rate is constant, and the size of spatial-temporal objects are at minimum, would the world rendered at node I be within usable range?
I could plot this as a node within a mesh, the height determines the rate and radius figures the connection count.