Paste gate names and connections. Get optimized 2D placement. Same Laplacian eigenvector math that folds proteins places transistors. place() minimizes wire length. isolate() maximizes security boundaries. Same math, opposite goals.
Force-directed layout: gates repel each other (Coulomb), connections attract (spring). 200 iterations to equilibrium. Connected gates end up close. Unconnected gates spread out. Total wire length is the objective. Same math as VLSI chip placement at scale — 40 million gates in 4.5 seconds on the full engine.
Your data stays on your machine.