Every product.
Its useful connection.

SUPPLIED ROLE
Supported discrete optimization and execution planning.

CONNECTION / CONTRIBUTION
Generate candidate customer decisions and execution plans; evaluate whether a different representation or resource configuration changes attainable results.

BOUNDARY
Shared cost model; original-model mapping; source-bound checks.

SUPPLIED ROLE
QUBO-based inference routing for supported cache-locality and mixture-of-experts load-balancing workflows.

CONNECTION / CONTRIBUTION
Choose routing together with cache locality, concurrency and eligible kernel configurations.

BOUNDARY
Preserve model quality and semantic routing requirements; this is not HTTP request routing or VRP.

SUPPLIED ROLE
Optimal data-placement software for memory-bound LLM inference across L2, HBM, CXL and NVMe.

CONNECTION / CONTRIBUTION
Price retention and placement using future reuse and avoided recomputation, not only bytes occupied.

BOUNDARY
KV compatibility and placement contracts; savings measured including movement.

SUPPLIED ROLE
GPU kernel optimization as a QUBO, with supported configuration selection and code generation.

CONNECTION / CONTRIBUTION
Tune for the representation, batching and placement actually selected by the system; optimize frequently used internal operations where supported.

BOUNDARY
Not a universal compiler or semantic proof engine; numerical and end-to-end qualification remain required.

SUPPLIED ROLE
Turnkey sovereign-AI infrastructure with supported compliance and placement rules expressed as QUBO constraints.

CONNECTION / CONTRIBUTION
Choose the compute work that best improves the downstream decision within authorized resource and policy limits.

BOUNDARY
Runtime authority, deadlines, policies and control timescales must be explicit.

SUPPLIED ROLE
Profiling, ranked improvement plans and performance/quality evaluation.

CONNECTION / CONTRIBUTION
Measure whether combinations improve accepted useful work, including overhead and quality.

BOUNDARY
Empirical quality tests are not mathematical optimality certificates.

SUPPLIED ROLE
KV compression and supported direct decode.

CONNECTION / CONTRIBUTION
Change the memory representation so a new batching/routing regime becomes feasible; evaluate task-sensitive fidelity.

BOUNDARY
No inherited end-to-end error guarantee; allowed representations and customer quality thresholds need validation.

SUPPLIED ROLE
Native search for supported constraint models.

CONNECTION / CONTRIBUTION
Express joint resource, decision and candidate-eligibility constraints where supported.

BOUNDARY
Do not equate its model support with every UNISOLVE theory; define ownership of search.

SUPPLIED ROLE
Structure-aware formulation, strategy selection and repair.

CONNECTION / CONTRIBUTION
Coordinate representation and repair choices rather than blindly trying every engine.

BOUNDARY
Do not duplicate UNISOLVE and Atlas controllers; explicit budget and objective ownership.

SUPPLIED ROLE
Supported solve-any dispatch, exact/numerical paths, original-source checks, theorem transport, sessions and recovery.

CONNECTION / CONTRIBUTION
Act as one computational and checking backbone for admitted cross-product claims.

BOUNDARY
82 registered profiles are not 82 independent algorithms; global, regional, statistical and numerical trust remain distinct.

SUPPLIED ROLE
Lattice basis reduction with reduction/lattice-related checks.

CONNECTION / CONTRIBUTION
Propose useful integer-coordinate changes for compatible MIP/constraint subproblems, not only crypto workloads.

BOUNDARY
Requires a complete integer parametrization and explicit exact transformation evidence; equal determinants alone do not prove lattice equality.

SUPPLIED ROLE
Exact determinant and linear-solve computations.

CONNECTION / CONTRIBUTION
Assist exact algebraic checking and reconstruction for model transformations and retained evidence.

BOUNDARY
Use valid bounds/reconstruction and admitted arithmetic; it is not automatically an HNF/SNF implementation.

SUPPLIED ROLE
Approximate nearest-neighbor retrieval and recall evaluation.

CONNECTION / CONTRIBUTION
Retrieve candidate reusable proofs, policies, configurations or diverse prior solutions.

BOUNDARY
Similarity is never a validity proof; misses reduce reuse, not correctness, if fallback is sound.

SUPPLIED ROLE
Compact frequency/cardinality estimation over streams.

CONNECTION / CONTRIBUTION
Estimate hot workload/state classes and target profiling or retrieval effort.

BOUNDARY
Approximate telemetry must not authorize hard constraints without a sufficient conservative or exact check.

SUPPLIED ROLE
PageRank, connected components and shortest paths with algorithm-specific checks.

CONNECTION / CONTRIBUTION
Analyze an explicitly built dependency or candidate-transition graph for locality, reuse and alternatives.

BOUNDARY
Correct dependency extraction and source provenance are additional work; generic graph algorithms do not establish business semantics.

SUPPLIED ROLE
SAT solving and independent satisfying-assignment checks.

CONNECTION / CONTRIBUTION
Check supported logical eligibility and candidate decisions in fast specialized paths.

BOUNDARY
Assignment checking alone gives no UNSAT proof.

SUPPLIED ROLE
Exact 0/1 knapsack optimization.

CONNECTION / CONTRIBUTION
Choose a bounded subset of independent optional compute/profiling tasks under a budget.

BOUNDARY
Dependency-rich scheduling requires a more appropriate model; not a general MIP replacement.

SUPPLIED ROLE
Supported MDP value iteration and error checking.

CONNECTION / CONTRIBUTION
Plan which computational action or future decision has value under a bounded, calibrated transition model.

BOUNDARY
Not general POMDP support; state abstraction and error conditions must be checked.

SUPPLIED ROLE
Matrix-free systems and extreme eigenvalues with true-residual checking.

CONNECTION / CONTRIBUTION
Refine only decision-relevant numerical quantities where residual-to-error bounds exist.

BOUNDARY
Conditioning matters; a residual alone does not bound solution error.

SUPPLIED ROLE
FFT, convolution and spectral-PDE computations.

CONNECTION / CONTRIBUTION
Provide numerical model evaluations at qualified resolutions as part of a decision-driven computation plan.

BOUNDARY
Round-trip/Parseval checks do not bound every downstream physical-model error.

SUPPLIED ROLE
Reconstruction from noisy linear measurements with data-fit residual.

CONNECTION / CONTRIBUTION
Recover the state information that could change a customer decision; choose additional measurement work where supported.

BOUNDARY
A small data-fit residual is not a universal state-error guarantee. Reported benchmark did not exercise the matrix-free GPU path.

SUPPLIED ROLE
Discrete optimal transport with marginal checks.

CONNECTION / CONTRIBUTION
Compare or align admissible demand/state distributions or candidate portfolios.

BOUNDARY
Marginal agreement is not an unregularized optimum proof or a calibrated world-model guarantee.

SUPPLIED ROLE
State estimation with observations.

CONNECTION / CONTRIBUTION
Maintain a calibrated estimate of evolving resources/environment for the compute and decision planner.

BOUNDARY
Ensemble spread alone is not a universal certified uncertainty set.

SUPPLIED ROLE
Estimates with stated confidence intervals.

CONNECTION / CONTRIBUTION
Spend sampling effort on ambiguous decisions and estimated future recourse costs.

BOUNDARY
Adaptive sampling needs valid simultaneous/anytime coverage or a predeclared fixed sampling scheme.

SUPPLIED ROLE
Ising log-partition estimation with confidence information.

CONNECTION / CONTRIBUTION
Study the distribution of supported low-energy solutions, rather than retaining only the best score.

BOUNDARY
Not general exact counting or universal uniform sampling; constraints/encodings and statistical scope matter.

SUPPLIED ROLE
GPU-native state, indexing, transactions and persistence.

CONNECTION / CONTRIBUTION
Persist typed computational artifacts, source revisions, reuse conditions and replay records close to appropriate workloads.

BOUNDARY
Artifact schema, tenant isolation and actual durability guarantees must be qualified; not every metadata operation needs a GPU.

SUPPLIED ROLE
KV-cache compression, offload and restoration across supported tiers.

CONNECTION / CONTRIBUTION
Carry the chosen cache plan into execution and balance retained KV against recomputation.

BOUNDARY
It is a KV runtime, not an already demonstrated arbitrary proof-memory tier manager.

SUPPLIED ROLE
Workload mapping across compute, power, cooling, memory and network.

CONNECTION / CONTRIBUTION
Expose physical-resource feasibility and costs to the customer-decision compute planner.

BOUNDARY
Planning does not imply live power/cooling control; models require calibration.

SUPPLIED ROLE
Generation, scheduling, validation, storage and replay of agent workloads.

CONNECTION / CONTRIBUTION
Execute bounded observe/propose/solve/check/learn actions with retained traces.

BOUNDARY
It does not automatically contain a trained model, a safe multi-tenant host, or unrestricted execution authority.

SUPPLIED ROLE
Optimization inside learning workflows.

CONNECTION / CONTRIBUTION
Optimization inside learning workflows.

BOUNDARY
Differentiability is a product capability, not a guarantee of a global optimum or a universal learning speedup. The supplied table does not provide a product-specific benchmark, arbitrary-operation coverage or a universal gradient-correctness claim.

SUPPLIED ROLE
Physics-grounded drug-discovery scoring.

CONNECTION / CONTRIBUTION
Physics-grounded drug-discovery scoring.

BOUNDARY
Computational scoring is not evidence of experimental binding, efficacy, toxicity or clinical suitability. Discovery Core is explicitly the engine behind AMDE; no separate unprovided ALCHEMI dependency is invented.

SUPPLIED ROLE
Learned schedules for optimization runs.

CONNECTION / CONTRIBUTION
Learned schedules for optimization runs.

BOUNDARY
“Learned > heuristic” is the README’s claim; no general performance multiplier or cross-domain superiority is asserted here. A learned schedule does not supply an optimality certificate by itself.

SUPPLIED ROLE
An autonomous discovery product organized around perceive → hypothesize → experiment → learn.

CONNECTION / CONTRIBUTION
An autonomous discovery product organized around perceive → hypothesize → experiment → learn.

BOUNDARY
Autonomous discovery describes the product’s role. It is not permission to control physical equipment, a guarantee of a new discovery or confirmation that every domain-specific integration is already qualified.

SUPPLIED ROLE
Hybrid 3D reconstruction.

CONNECTION / CONTRIBUTION
Hybrid 3D reconstruction.

BOUNDARY
The README table establishes hybrid 3D reconstruction, not universal scene coverage, a specific sensor interface or a measured speedup on all scenes.

SUPPLIED ROLE
A quantum–classical optimization bridge for warm starts, validation and hybrid workflows.

CONNECTION / CONTRIBUTION
A quantum–classical optimization bridge for warm starts, validation and hybrid workflows.

BOUNDARY
The June 18 quantum head-to-head study used statevector simulation, not quantum hardware. It is not evidence of a particular QC Bridge hardware integration or a universal quantum/classical advantage.

SUPPLIED ROLE
A self-evolving optimizer that improves its optimization algorithms.

CONNECTION / CONTRIBUTION
A self-evolving optimizer that improves its optimization algorithms.

BOUNDARY
“Self-evolving” is the supplied product role. No universal monotonic improvement, proof of arbitrary generated code or autonomous production change is implied.

SUPPLIED ROLE
A self-improving materials-data pipeline built on the SpinForge core.

CONNECTION / CONTRIBUTION
A self-improving materials-data pipeline built on the SpinForge core.

BOUNDARY
The README states “1000× wet-lab speed.” No matched measurement record accompanies the supplied table, so this is not published as a general speed or experimental-equivalence promise.

SUPPLIED ROLE
Physical optimization in which a robot solves combinatorial problems.

CONNECTION / CONTRIBUTION
Physical optimization in which a robot solves combinatorial problems.

BOUNDARY
The supplied table does not identify a universal robot adapter, external safety certification or authority for unrestricted physical control. Hardware and operating responsibilities are separately scoped.

SUPPLIED ROLE
GPU-fleet scheduling formulated as a QUBO to maximize tokens per watt.

CONNECTION / CONTRIBUTION
GPU-fleet scheduling formulated as a QUBO to maximize tokens per watt.

BOUNDARY
Maximizing the modeled objective is the product purpose, not a claim of globally optimal production schedules or a guaranteed energy saving on every fleet. No multiplier is supplied in the table.

SUPPLIED ROLE
The synthesis meta-system through which its eleven products improve one another.

CONNECTION / CONTRIBUTION
Existing synthesis meta-system for its products improving one another. Cross-portfolio additions are separately scoped.

BOUNDARY
The eleven-product family and Recursive Engine are existing products by the owner’s confirmation. The supplied table does not enumerate every runtime connection or establish a universal improvement rate. Cross-family additions require their own integration scope.

SUPPLIED ROLE
The shared computational engine behind AMDE and SpinForge Bio.

CONNECTION / CONTRIBUTION
Confirmed shared engine behind AMDE and SpinForge Bio; no Bench dependency asserted.

BOUNDARY
The supplied clarification establishes dependencies on AMDE and SpinForge Bio. It does not establish a Bench dependency or a separate ALCHEMI engine link. A shared computational engine does not establish experimental biological validation.

SUPPLIED ROLE
Protein binder design producing a ranked candidate panel for downstream synthesis and evaluation.

CONNECTION / CONTRIBUTION
Protein binder design producing a ranked candidate panel for downstream synthesis and evaluation.

BOUNDARY
A computational candidate panel is not evidence that sequences were synthesized, bind experimentally, are safe or are suitable for clinical use. The publication does not provide biological sequences, experimental instructions or an efficacy claim.

SUPPLIED ROLE
A distinct offering focused on certified Gset optimality.

CONNECTION / CONTRIBUTION
A distinct offering focused on certified Gset optimality.

BOUNDARY
The supplied description does not enumerate the proved Gset instance set or name a universal completion budget. No claim that all Gset instances are solved is made. No dependency on Discovery Core is asserted.

SUPPLIED ROLE
Satisfy hard clauses while optimizing weighted soft requirements.

CONNECTION / CONTRIBUTION
Satisfy hard clauses while optimizing weighted soft requirements.

BOUNDARY
A feasible assignment and a proved optimum are different outcomes.

SUPPLIED ROLE
Solve Max-Cut/Ising problems with independently checkable optimality evidence where completed.

CONNECTION / CONTRIBUTION
Solve Max-Cut/Ising problems with independently checkable optimality evidence where completed.

BOUNDARY
An objective recount alone is not a proof that no better cut exists.

SUPPLIED ROLE
Constraint programming for supported XCSP3 models and scheduling.

CONNECTION / CONTRIBUTION
Constraint programming for supported XCSP3 models and scheduling.

BOUNDARY
General XCSP parsing and deciding coverage are distinct.

SUPPLIED ROLE
Divide a supported graph or hypergraph while evaluating its partition objective.

CONNECTION / CONTRIBUTION
Divide a supported graph or hypergraph while evaluating its partition objective.

BOUNDARY
A partition score is not automatically a measured system-wide communication saving.

SUPPLIED ROLE
Plan vehicle routes under supported CVRP and VRPTW requirements.

CONNECTION / CONTRIBUTION
Plan vehicle routes under supported CVRP and VRPTW requirements.

BOUNDARY
Customer-specific routing requirements outside CVRP/VRPTW require an admitted representation.

SUPPLIED ROLE
Check supported bit-vector and integer-arithmetic requirements.

CONNECTION / CONTRIBUTION
Check supported bit-vector and integer-arithmetic requirements.

BOUNDARY
Supported theory fragments do not imply complete SMT-LIB coverage.

SUPPLIED ROLE
Select compatible computational backends and apply execution guards.

CONNECTION / CONTRIBUTION
Select compatible computational backends and apply execution guards.

BOUNDARY
This is backend selection, not inference token routing, vehicle routing or network path construction. Its evidence is separate from UNISOLVE’s internal router.

SUPPLIED ROLE
Solve quantified Boolean formulas with their quantifier order retained.

CONNECTION / CONTRIBUTION
Solve quantified Boolean formulas with their quantifier order retained.

BOUNDARY
Broader dependency/proof variants and competition parity are not implied.

SUPPLIED ROLE
Find tours for supported traveling-salesman problems.

CONNECTION / CONTRIBUTION
Find tours for supported traveling-salesman problems.

BOUNDARY
This is separate from vehicle-routing constraints such as capacity and time windows.

SUPPLIED ROLE
Preprocess supported CNF before MaxSAT execution.

CONNECTION / CONTRIBUTION
Preprocess supported CNF before MaxSAT execution.

BOUNDARY
The held-out improvement was not confirmed; the product remains off by default in the described release.

SUPPLIED ROLE
Solve supported linear, quadratic and second-order-cone models.

CONNECTION / CONTRIBUTION
Solve supported linear, quadratic and second-order-cone models.

BOUNDARY
The product includes a labeled portfolio; native and external backend results remain distinguished.

SUPPLIED ROLE
Solve optimal-transport and assignment problems with the appropriate checks.

CONNECTION / CONTRIBUTION
Solve optimal-transport and assignment problems with the appropriate checks.

BOUNDARY
Certified marginals and a global assignment optimum are different guarantees.

SUPPLIED ROLE
Schedule generator commitment and dispatch on power-system models with certified objectives.

CONNECTION / CONTRIBUTION
Schedule generator commitment and dispatch on power-system models with certified objectives.

BOUNDARY
A certified objective for a returned schedule is not a global-optimality proof; the reported lower bound states the remaining gap.

SUPPLIED ROLE
Refine camera poses and 3D points for large photogrammetry problems on the GPU.

CONNECTION / CONTRIBUTION
Refine camera poses and 3D points for large photogrammetry problems on the GPU.

BOUNDARY
Measured against Ceres on one machine: faster to the same final cost on 6 of 8 BAL problems; Ceres stays ahead on trafalgar-257 and venice-52.

SUPPLIED ROLE
Solve AC optimal power flow.

CONNECTION / CONTRIBUTION
Solve AC optimal power flow.

BOUNDARY
Measured against Ipopt on one machine: 64 of 66 PGLib-OPF cases solved vs 65; case1888_rte and case78484_epigrids remain open, and Ipopt is faster below 1,000 buses.

SUPPLIED ROLE
Estimate the power-system state from network measurements, with bad-data suppression.

CONNECTION / CONTRIBUTION
Estimate the power-system state from network measurements, with bad-data suppression.

BOUNDARY
The estimate is only as good as the network's observability and the supplied measurement model.

SUPPLIED ROLE
Solve minimum-cost network flow exactly, with every optimum independently verified.

CONNECTION / CONTRIBUTION
Solve minimum-cost network flow exactly, with every optimum independently verified.

BOUNDARY
The lead over OR-Tools is 4% to 14% from 2^16 nodes up, measured on NETGEN-8 instances.

SUPPLIED ROLE
Solve semidefinite programs on the GPU, with infeasibility certificates.

CONNECTION / CONTRIBUTION
Solve semidefinite programs on the GPU, with infeasibility certificates.

BOUNDARY
Measured against CSDP on one machine: optimal on 64 SDPLIB instances to CSDP's 58 and faster wherever CSDP needs over 10 s; CSDP is faster on small instances and closes hinf4 and hinf12, which garmo does not.

SUPPLIED ROLE
Schedule job shops and factory operations, with proofs of optimality where they are found.

CONNECTION / CONTRIBUTION
Schedule job shops and factory operations, with proofs of optimality where they are found.

BOUNDARY
A schedule found in the budget is not an optimality proof unless the proof is reported; CP-SAT is ahead on the 15x15 Taillard set.

SUPPLIED ROLE
Solve mixed-integer quadratic programs, with every reported solution verified.

CONNECTION / CONTRIBUTION
Solve mixed-integer quadratic programs, with every reported solution verified.

BOUNDARY
A better objective is not an optimality proof unless one is reported; SCIP is ahead on 6 of the 120 instances.

SUPPLIED ROLE
Solve pseudo-Boolean satisfaction and optimization problems with checked proofs.

CONNECTION / CONTRIBUTION
Solve pseudo-Boolean satisfaction and optimization problems with checked proofs.

BOUNDARY
RoundingSat solves more instances on the reported benchmark.

SUPPLIED ROLE
Decide Boolean satisfiability, with checked models and DRAT proofs for unsatisfiable formulas.

CONNECTION / CONTRIBUTION
Decide Boolean satisfiability, with checked models and DRAT proofs for unsatisfiable formulas.

BOUNDARY
Kissat solves more instances on the reported sample.

SUPPLIED ROLE
Solve parity games for verification and synthesis, with an independent strategy check.

CONNECTION / CONTRIBUTION
Solve parity games for verification and synthesis, with an independent strategy check.

BOUNDARY
No head-to-head comparison against another parity-game solver is recorded yet.

SUPPLIED ROLE
Find a small infeasible subsystem of an infeasible MIP, to show why the model has no solution.

CONNECTION / CONTRIBUTION
Find a small infeasible subsystem of an infeasible MIP, to show why the model has no solution.

BOUNDARY
Irreducibility is claimed only where every kept element carries a certificate (17 of 50); some outputs are larger than the reference.

SUPPLIED ROLE
Run MiniZinc and FlatZinc constraint models directly, with every solution re-verified.

CONNECTION / CONTRIBUTION
Run MiniZinc and FlatZinc constraint models directly, with every solution re-verified.

BOUNDARY
Chuffed, CP-SAT and Gecode answer more of the competition instances.

SUPPLIED ROLE
Constrained portfolio construction.

CONNECTION / CONTRIBUTION
Constrained portfolio construction.

BOUNDARY
The demo records constraint checks, not return or risk; it is not a benchmark.

SUPPLIED ROLE
Real-time assignment and dispatch decisions.

CONNECTION / CONTRIBUTION
Real-time assignment and dispatch decisions.

BOUNDARY
Shown on a small dispatch instance; larger instances need an evaluation.

SUPPLIED ROLE
Places products in a warehouse to shorten picking routes.

CONNECTION / CONTRIBUTION
Places products in a warehouse to shorten picking routes.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
3D structural layout (topology) optimization for parts.

CONNECTION / CONTRIBUTION
3D structural layout (topology) optimization for parts.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Fair allocation of indivisible resources among people or teams.

CONNECTION / CONTRIBUTION
Fair allocation of indivisible resources among people or teams.

BOUNDARY
The demo allocation is valid but 0.21 short of the best total utility.

SUPPLIED ROLE
Turns coarse climate-model output into fine-resolution fields that respect the coarse values.

CONNECTION / CONTRIBUTION
Turns coarse climate-model output into fine-resolution fields that respect the coarse values.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Radio frequency assignment without interference.

CONNECTION / CONTRIBUTION
Radio frequency assignment without interference.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Designs the connectivity of a network from its bandwidth and latency requirements.

CONNECTION / CONTRIBUTION
Designs the connectivity of a network from its bandwidth and latency requirements.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Searches for error-correcting codes with a larger minimum distance.

CONNECTION / CONTRIBUTION
Searches for error-correcting codes with a larger minimum distance.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Designs an amino-acid sequence for a target protein fold.

CONNECTION / CONTRIBUTION
Designs an amino-acid sequence for a target protein fold.

BOUNDARY
Computational design only; no laboratory confirmation is claimed.

SUPPLIED ROLE
Designs DNA or RNA sequences that fold into a target structure.

CONNECTION / CONTRIBUTION
Designs DNA or RNA sequences that fold into a target structure.

BOUNDARY
The demo sequence matched the target with F1 0.94, not exactly; computational only.

SUPPLIED ROLE
Chooses multi-drug combinations for benefit under interaction limits.

CONNECTION / CONTRIBUTION
Chooses multi-drug combinations for benefit under interaction limits.

BOUNDARY
A tested prototype: no benchmark result is recorded yet. Not a clinical tool.

SUPPLIED ROLE
Crystal structure prediction.

CONNECTION / CONTRIBUTION
Crystal structure prediction.

BOUNDARY
Shown on a small crystal; larger systems need an evaluation.

SUPPLIED ROLE
Finds ground states of user-defined physical models.

CONNECTION / CONTRIBUTION
Finds ground states of user-defined physical models.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Runs a defined physics experiment across many instances and assembles the analysis, figures and draft.

CONNECTION / CONTRIBUTION
Runs a defined physics experiment across many instances and assembles the analysis, figures and draft.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Register allocation for compilers.

CONNECTION / CONTRIBUTION
Register allocation for compilers.

BOUNDARY
Shown on a small program; production compilers need an evaluation.

SUPPLIED ROLE
Maps quantum circuits onto qubit hardware.

CONNECTION / CONTRIBUTION
Maps quantum circuits onto qubit hardware.

BOUNDARY
The mapping is legal; circuit depth grew from 48 to 70 in the demo.

SUPPLIED ROLE
Compiles a constraint description into a model SpinForge solves.

CONNECTION / CONTRIBUTION
Compiles a constraint description into a model SpinForge solves.

BOUNDARY
Shown on a small graph-colouring model.

SUPPLIED ROLE
Chooses solver settings for a family of workloads.

CONNECTION / CONTRIBUTION
Chooses solver settings for a family of workloads.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Places chiplets and HBM stacks on an interposer.

CONNECTION / CONTRIBUTION
Places chiplets and HBM stacks on an interposer.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Selects which clients join each federated-learning round.

CONNECTION / CONTRIBUTION
Selects which clients join each federated-learning round.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Orders learning material for the best learning sequence.

CONNECTION / CONTRIBUTION
Orders learning material for the best learning sequence.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Finds adversarial inputs for binary and ternary neural networks.

CONNECTION / CONTRIBUTION
Finds adversarial inputs for binary and ternary neural networks.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Runs binary-network inference as one optimization problem.

CONNECTION / CONTRIBUTION
Runs binary-network inference as one optimization problem.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Estimates post-quantum lattice hardness.

CONNECTION / CONTRIBUTION
Estimates post-quantum lattice hardness.

BOUNDARY
Recorded after a fix at dimensions 10 to 30; larger dimensions need an evaluation.

SUPPLIED ROLE
Checks concurrent programs for deadlock.

CONNECTION / CONTRIBUTION
Checks concurrent programs for deadlock.

BOUNDARY
Shown on two small programs; larger systems need an evaluation.

SUPPLIED ROLE
Satisfiability as an application on SpinForge.

CONNECTION / CONTRIBUTION
Satisfiability as an application on SpinForge.

BOUNDARY
For competition-grade satisfiability, see the SAT solver product.

SUPPLIED ROLE
Combinatorial game and puzzle solving.

CONNECTION / CONTRIBUTION
Combinatorial game and puzzle solving.

BOUNDARY
Shown on a small colouring puzzle.

SUPPLIED ROLE
Writes counterpoint that follows classical rules for a given melody.

CONNECTION / CONTRIBUTION
Writes counterpoint that follows classical rules for a given melody.

BOUNDARY
A tested prototype: no benchmark result is recorded yet.

SUPPLIED ROLE
Evaluate supported mixed-integer nonlinear models from OSiL/PIP inputs.

CONNECTION / CONTRIBUTION
Evaluate supported mixed-integer nonlinear models from OSiL/PIP inputs.

BOUNDARY
This product runs on SCIP; it is not presented as a newly invented native nonlinear algorithm.

SUPPLIED ROLE
Optimize binary quadratic choices subject to linear constraints.

CONNECTION / CONTRIBUTION
Optimize binary quadratic choices subject to linear constraints.

BOUNDARY
The stated examples include k-cluster, independent set and quadratic knapsack; broader scope requires confirmation.

SUPPLIED ROLE
One product for certified MDP values, partition-function bounds and model counting.

CONNECTION / CONTRIBUTION
One product for certified MDP values, partition-function bounds and model counting.

BOUNDARY
The three modes are capabilities inside one product, not three additional current solver products.

SUPPLIED ROLE
Select a mixed-integer programming path for a supported constrained model.

CONNECTION / CONTRIBUTION
Select a mixed-integer programming path for a supported constrained model.

BOUNDARY
Numerical backend completion is not automatically independent mathematical proof.

SUPPLIED ROLE
Solve matrix-free linear systems with a recomputed true-residual certificate.

CONNECTION / CONTRIBUTION
Solve matrix-free linear systems with a recomputed true-residual certificate.

BOUNDARY
A residual is not a universal solution-error bound without the appropriate conditioning assumptions.

SUPPLIED ROLE
Optimize higher-order binary models with three- and four-body terms.

CONNECTION / CONTRIBUTION
Optimize higher-order binary models with three- and four-body terms.

BOUNDARY
The current release describes three- and four-body models; historical LABS wording is not a new unrestricted domain claim.

SUPPLIED ROLE
Solve supported toroidal and planar spin-glass instances exactly.

CONNECTION / CONTRIBUTION
Solve supported toroidal and planar spin-glass instances exactly.

BOUNDARY
A theorem for the admitted structure is not a proof for arbitrary graphs.

SUPPLIED ROLE
Execute thousands of supported tiny QUBO or SAT instances in a batch.

CONNECTION / CONTRIBUTION
Execute thousands of supported tiny QUBO or SAT instances in a batch.

BOUNDARY
Batch throughput must include input preparation, execution and checking, not only one launch.

SUPPLIED ROLE
Prove early when a supported routing or flow problem cannot be routed.

CONNECTION / CONTRIBUTION
Prove early when a supported routing or flow problem cannot be routed.

BOUNDARY
This product is an infeasibility checker, not a general route-construction engine.