<p><span class="h-card" translate="no"><a href="https://infosec.exchange/@david_chisnall" class="u-url mention">@<span>david_chisnall</span></a></span> <span class="h-card" translate="no"><a href="https://discuss.systems/@steve" class="u-url mention">@<span>steve</span></a></span> <span class="h-card" translate="no"><a href="https://mastodon.social/@wingo" class="u-url mention">@<span>wingo</span></a></span> the main downside is that the current implementation will do 2 passes rewriting 99% of the netlist and then 15 passes rewriting the same one cell using all three passes over and over until it converges. I think this should be fixable with a system that tracks a lower bound on the cells to be revisited, running partial passes followed by one full pass once partial ones find nothing to mop up anything it missed</p>