Dense Gaussian and Eisenstein--Jacobi (EJ) networks are algebraic interconnection networks with compact coordinate balls, fixed degree, and simple modular addressing. A source-centered coordinate-reduction tree gives a non-redundant one-to-all broadcast in the fault-free network, but processor faults can split the tree into multiple healthy components. Unlike search-based repair methods that require a linear scan of the network to select the repair plan, the certificate selectors introduced here operate in $O(1)$ time and $O(1)$ memory, consulting only the fault coordinates. This paper develops this stronger formulation for the one- and two-fault regime: a constant-time certificate selector. Given only the faulty coordinates, the selector classifies the relative fault geometry, chooses a coordinate-reduction orientation, and returns a bounded ordered set of component-crossing repair edges. For dense Gaussian networks $G_k$, every source-free fault set with $|F|\le2$ is repaired with depth at most $k+2$ and with exactly $c-1$ external component-crossing edges for the selected fault-pruned orientation. For dense EJ networks $H_t$, every one-fault placement is repaired within depth $t+1$, and every two-fault placement is repaired within depth $t+2$, again with exactly $c-1$ external repair edges. Exhaustive strict validation confirms the Gaussian selector over $146{,}156$ one- and two-fault cases for $k=5,\ldots,12$ and the EJ selector over $52{,}395$ cases for $t=2,\ldots,8$, with zero failures in connectivity, acyclicity, exact repair count, or depth bound.

翻译：暂无翻译