I certainly wasn't commenting on the preciseness of React's diffing (and how they're able to reduce it from O(n) to O(n^3) by ignoring things). I was merely poi

I certainly wasn't commenting on the preciseness of React's diffing (and how they're able to reduce it from O(n) to O(n^3) by ignoring things). I was merely pointing out that it's possible to diff trees in polynomial time. Edit: Just to clarity, I'm also not saying O(n^3) isn't slow compared to React's O(n), just that it's potentially a lot faster than NP.