Skip to main content
Glama

Affine Earth Math Court Remote

code_ir_equiv

The Code Court's first move: are two implementations equivalent by the exact value multiset of their LLVM IR constants? THE PAYLOAD IS THE CODE FILE — submit two whole source files (left_file and right_file, each {path, content}, or files as an array of two). The result leaf is those same whole files under files, plus WIN (constant-pool digests identical), CODE_IR_DIVERGED (naming the first divergent value), NOT_KNOWN (nothing mineable), or a REFUSED_* refusal. Stateless and content-addressed — the same two files rule identically on every cell, so a reviewer re-checks by re-digesting, not by re-reading the diff. Compares the constant pool (a necessary, strong condition for the numeric kernels the corpus is built from), not full behavioural equivalence.

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
filesNoExactly two whole files when left_file/right_file are not used. The payload IS the files.
left_irNoLEGACY fragment of the first implementation. Still accepted and lifted into a whole file with a defaulted path; prefer left_file.
right_irNoLEGACY fragment of the second implementation. Still accepted and lifted into a whole file with a defaulted path; prefer right_file.
left_fileNoWhole source file of the first implementation. The payload IS the file.
right_fileNoWhole source file of the second implementation. The payload IS the file.

TDQS

A4.7/5.0
Behavior5/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

With no annotations provided, the description carries the full behavioral burden, and it does so thoroughly: it discloses statelessness, content-addressed determinism, the possible result leaf states (WIN, CODE_IR_DIVERGED, NOT_KNOWN, REFUSED_*), and the exact comparison criterion. It even tells the reviewer that re-checking is done by re-digesting rather than re-reading a diff.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness5/5

Is the description appropriately sized, front-loaded, and free of redundancy?

The description is dense and front-loaded: within the first sentence an agent knows what the tool compares and what payload to send. Each later sentence adds a distinct decision-relevant detail—outcomes, determinism, and scope limitation—without padding or significant repetition.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness5/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

For a tool with no output schema, no annotations, and nested-object inputs, the description covers the input contract, all result signs, determinism, and equivalence semantics. The legacy left_ir/right_ir fields are covered by the schema, and the description is complete enough for an agent to call this tool without further inference.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters4/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema description coverage is 100%, so the baseline is 3. The description adds value by explaining the payload model: two whole source files can be supplied as left_file/right_file or as a two-element files array, and the result echoes those same files. This links the parameter mechanics to the output structure in a way the field descriptions do not.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description states a precise verb and resource: it decides whether two implementations are equivalent by comparing the exact value multiset of their LLVM IR constants. It also explicitly distinguishes itself from full behavioural equivalence, which separates it from the many verification-style siblings in the tool list.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines4/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

The description positions the tool as 'The Code Court's first move' and as a 'necessary, strong condition for the numeric kernels,' giving clear context for when it applies. It explicitly says it is not full behavioural equivalence, but it does not name a specific sibling tool as the alternative for that broader comparison.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Try in Browser

Glama MCP Gateway

Add one secure layer between your agents and this server.

TDQS

C2.6/5.0
Disambiguation2/5

Many verify_* tools are distinct, but there are overlapping clusters: math_court duplicates execute_2local_hamiltonian, route_spin_glass_manifold, and the quantum verifiers; project_affine_key, expose, verify_presented_pair, and the optional affine exposes in other tools blur together; weather and geometry tools also overlap. The detailed descriptions help a human, but an agent would likely struggle to choose between equivalent-seeming entry points.

Naming Consistency2/5

Naming is mostly snake_case but otherwise inconsistent: some tools use dotted prefixes (atc.*, twin.robotics.*, weather.*), some use bare verbs (expose, lattice_op, math_court), some use noun phrases (corpus_bonds, feeds_catalog), and others mix prefixes with verbs (ide_rebuild_mesh, umc_resume). The verify_* family is consistent, but the overall set has no single predictable verb_noun pattern.

Tool Count2/5

49 tools is far above the typical well-scoped server size and includes multiple near-duplicate paths to the same law (math_court, execute_*, route_*, verify_*). While not quite 50+, the count still feels like a sprawling kitchen-sink rather than a deliberate minimal surface.

Completeness3/5

The toolset covers a surprisingly wide range: QC verifiers, QMA laws, affine projections, corpus reads, weather, UMC state, and robotics IK. However, there are notable gaps for such a broad surface: no general court case lifecycle beyond expose/seal, no corpus content search, and no way to manage or update sealed artifacts; several areas have only entry-point coverage.

Resources