We have a mildly suboptimal detection heuristic which marks nodes that have been seen by the recursive process function, however the case where an upstream node's has connections to multiple downstream nodes means the second downstream node will see the node as processing
theres likely a nicer fix, but temporarily we avoid setting nil in the cache which lowers CPU on setters and fixes some subtle graph eval issues.
We have a mildly suboptimal detection heuristic which marks nodes that have been seen by the recursive process function, however the case where an upstream node's has connections to multiple downstream nodes means the second downstream node will see the node as processing
theres likely a nicer fix, but temporarily we avoid setting nil in the cache which lowers CPU on setters and fixes some subtle graph eval issues.