Random circuit sampling (RCS) is studied primarily for its assumed inherent difficulty for a classical computer to execute and sample, as the basis of a number of "quantum supremacy" experiments. Recently, it has been argued that RCS can be used to certify random number generation. While Quantinuum's ion trap processors have all-to-all connectivity between qubits, allowing unstructured RCS, which Qrack still finds difficult to simulate, we argue that structured RCS, on most nearest-neighbor connectivity topologies (like Google's Sycamore and Willow processors, since their 2019 "quantum supremacy" experiment) are efficiently simulated via the very "patching" and "elision" concepts that Google Quantum AI used to validate their results in the first place, since 2019, generalized as an automatic feature in Qrack as "automatic circuit elision" (ACE). To reproduce our experiment at scales small enough to directly validate against ideal simulation with Qiskit Aer, run experiment_nn.sh, and other scripts in this folder can report how long it takes to run frontier-scale experiments (which cannot be compared to ideal simulation), by simulating the full circuit protocol under stopwatch timing.