Skip to main content
Glama

Affine Earth Math Court Remote

execute_transition

Certified membrane: Rational S4/C4 lanes -> SCF boundary -> annihilate raw context -> NATS geometry-only turn -> Aristotelian projection. IDEMPOTENT: this membrane is stateless and keeps no record of a signature, so replaying an identical request is admitted and returns the identical receipt_hash rather than being refused as a replay. Safe to retry on a timeout; it is not a second transition.

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
intentYes
economicsNoOptional I_PF economics: executor hash + impact matrix (Rational weights).
entity_idYeswallet_geo entityID hex
bond_statusNo
c4_constraintsNoRational lanes as num/den strings
s4_coordinatesNoRational lanes as num/den strings
user_vqbit_hashNoExactly 32 lowercase hex, or OMIT it and the cell derives sha256(entity_id|scf_hex)[0:16]. A stated value that is not 32 hex is REFUSED rather than replaced - the cell will not verify your signature against an identity you did not state.
client_signatureYessha256(INTENT|scf_hex|user_vqbit_hash|genesis_epoch) first 16 bytes as 32 lowercase hex; or the game seal sha256(INTENT|scf_hex|user_vqbit_hash); or an ML-DSA-87 IDENTITY_BIND package. scf_hex is NOT an input and is NOT a sha256: the cell derives it with SpatialChordalFingerprint (15 integer lattice ratios folded FNV-1a-128) over the NORMALISED lanes. Mirror that algorithm to sign on the first call - /language-game/scf.js is the reference port - or send any 32-hex signature once and re-sign over the scf_hex the refusal returns. genesis_epoch is 2026-01-27T00:00:00Z.

TDQS

B3.3/5.0
Behavior4/5

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

With no annotations, the description carries the full behavioral burden and does so substantively: it states idempotency, statelessness, replay admission, identical receipt_hash, and timeout-retry safety. It leaves the side effects of `annihilate raw context` unspecified, but this is still strong behavioral disclosure compared to typical descriptions.

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

Conciseness4/5

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

The description is compact, front-loads the pipeline, and devotes only two additional sentences to idempotency and retry semantics. A plain-language summary would help, but as written every sentence earns its place and there is no padding.

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

Completeness3/5

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

The schema and referenced signing algorithm are rich, and the description explains idempotent retry well. However, there is no output schema and the description only mentions `receipt_hash` without defining the full return contract. For a complex 8-parameter protocol with 14 intent values and an undefined `bond_status`, the context remains incomplete.

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

Parameters3/5

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

The free-text description adds no parameter-level meaning, but the input schema already documents 6 of 8 parameters, including a very detailed `client_signature`. The under-documented `intent` (enum-only) and `bond_status` are not compensated for, so the description stays at a baseline-3 level without improving parameter understanding.

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

Purpose3/5

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

The description names a concrete membrane pipeline (`Rational S4/C4 lanes -> SCF boundary -> annihilate raw context -> NATS geometry-only turn -> Aristotelian projection`) but never explains in plain terms what a transition is or what observable result it produces. It avoids being a tautology, yet an agent without domain vocabulary cannot reliably tell what this tool accomplishes, and it does not contrast itself with sibling `execute_*` tools.

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

Usage Guidelines3/5

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

The description gives one actionable retry rule (`Safe to retry on a timeout; it is not a second transition`) and clarifies idempotent replay behavior. However, it never states when to choose this tool over alternatives or what input conditions warrant calling it, so the primary usage guidance is only implied.

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