The general gist is that one would use the subtree diff skipping APIs to prevent expensive diffs, and per-component redraws to selectively update things in the problematic subtree. Admittedly, it&#x27;s not perfect and requires a not-so-trivial amount of app-space code, but at least it&#x27;s not a black box renderer like, say, Angular 1.<p>Ultimately, there are a vast number of different scenarios, some of which are likely to remain open problems for the foreseable future (e.g. a 100,000 item reverse), and some of which can be worked around via application space &quot;escape hatches&quot; such as the use of granular update APIs and techniques like occlusion culling.<p>As I said, it&#x27;s very interesting to see work that tackles the problem from an algorithmic complexity angle, and it&#x27;s always healthy to explore different performance characteristics, but I think it&#x27;s important to also keep in perspective what is the performance profile of solutions currently in the market, because looking at their theoretical algorithmic complexity alone doesn&#x27;t tell the whole story.