Limitations

• There is no universal practical speedup implied by beta, hopbound, or epsilon.
• The current hopset construction is sequential Python code.
• Process-level construction parallelism is opt-in and workload-dependent.
• reachq.research and optional acceleration backends may change without stable API guarantees.
• Exact transitive closure is output-quadratic and guarded by a pair budget.
• The project is not a general graph library or a hosted graph service.

For the adoption checklist and measured benchmark fields, see the concise limitations page and benchmarking guide.