Skip to content

Known Issues

Josh Daymude edited this page Jun 9, 2026 · 2 revisions
  • assembly-theory tallies the number of states searched during recursive assembly index calculation. If the number of states searched exceeds the limit of a usize— 2^32 on 32-bit targets or 2^64 on 64-bit targets—the code panics. This is unlikely to occur when various strategies are enabled to prune the search space (e.g., bounding and memoization), but is theoretically always possible given a large enough molecule and sufficiently long search time. See #49 for details.

Clone this wiki locally