Skip to main content
Glama
650,439 tools. Updated 2026-10-13 06:11

"AFFiNE" matching MCP tools:

  • Exact 4D separation over declared trajectories in integer-scaled geodetic coordinates: decide whether any two are ever SIMULTANEOUSLY inside the stated separation minima, and return either a separation certificate or the violating pair with the exact interval and magnitude of the incursion. Integer micro-degrees, feet and seconds with rational time parameters; no floating point and no epsilon, so separation exactly equal to the minima is separated and nine cells return the same verdict from the same bytes. The longitude frame is the caller's to state exactly, as an optional rational scale with its reference latitude, so the cos(latitude) approximation is chosen deliberately and on the record rather than done in floating point outside the boundary. Civil FAA/ICAO framing; a traffic-analysis instrument, never a control tool.
    ConnectorNo auth
  • Resume a Universal Manifold Controller Long Play from its latest sealed tip (local cache first, then the NATS KV bucket UMC_LONG_PLAY) for the given domain, session_id and node_id; direct=true advances one turn after resuming. GRANT CLASS MESH: requires a caller identity (user_vqbit_hash 32 lowercase hex, entity_id or wallet_hash) or the call is REFUSED_GRANT_MESH_IDENTITY_REQUIRED. Measured 2026-09-02 with an identity: status CALORIE_GAV_LONG_PLAY_RESUME and the same tip shape as umc_direct (turn_index, tau_height, torsion_num/torsion_den, amplitudes, invariant_root_hex). Use umc_direct to create or advance a session; use this to pick up where a previous call, tab or cell left off.
    ConnectorNo auth
  • Read-only: the Universal Manifold Controller tip, the KV buckets it seals to (UMC_LONG_PLAY, C4_STATES, JORDAN_BONDS), the four Long Play domains, the NATS subjects it publishes on (gaiaftcl.umc.state.> and gaiaftcl.agent.state.>) and the documented MCP tool surface. Takes no arguments, advances nothing, and is safe to call at any rate. Use it to discover what umc_direct and umc_resume will act on.
    ConnectorNo auth
  • QC-009 Amplitude amplification: the Grover oracle check plus the presented iterate count. THE BOUND IS N=4: oracle is a 0/1 string of length exactly 4 with exactly one 1 (e.g. 0001), marked is the index of that 1 (e.g. 3), and iterations must be 1 - one Grover iterate at N=4 is exact, so oracle=0001, marked=3, iterations=1 -> WIN 'iters=1 grover=WIN'. Any other oracle length (2, 3, 5..8) is REFUSED_INSTANCE_BOUND 'oracle length L: this court grades N=4 only; the law for other lengths is not built' - the court refuses rather than certify an iterate count it cannot check. A presented witness is verified; no amplitude is estimated. All three fields required. Floats refused.
    ConnectorNo auth
  • Ingest an ARTIFACT INGESTION BRIEF plus the artifact an agent generated for it; evaluate it against the laws the brief declares; seal and return the artifact ONLY on the top rung. THE BRIEF TEMPLATE is https://affine.earth/language-game/court-client.brief.txt: four bracketed sections, [LANGUAGE GAME DEFINITION] with Purpose, Win Condition (Exit) and Losing Moves; [STRUCTURAL GOAL] with Manifold Target, Input Coordinates and Execution Lock; [PAYLOAD SHAPE] with Target Architecture, File Structure and Memory Binding; [WASM MEMBRANE INTEGRATION] with Target Standalone WASM, NATS JetStream Subject and Integration Protocol - a missing field is REFUSED_MISSING_FIELD naming it. Headless by construction - a CI runner, a curl script, an autonomous agent and an editor all post the identical tools/call. The brief is the single home for the target architecture; a target_architecture argument that contradicts it is REFUSED_ARCHITECTURE_CONFLICT - the court compares the two strings verbatim, so with the served template send exactly 'Rust no_std wasm32' or omit the field ('wasm32' alone is refused). Verdicts are a ladder of rungs 0-7, not a coin: 7 CALORIE_AFFINE_ARTIFACT_DELIVERED, 6 ARTIFACT_ASSEMBLED_NOT_DELIVERED, 5 ARTIFACT_WIN_UNVERIFIABLE, 4 ARTIFACT_PROTOCOL_CONTRADICTED, 3 ARTIFACT_TARGET_ABSENT, 2 ARTIFACT_LAW_BROKEN, 1 NOT_KNOWN, 0 REFUSED_NO_BRIEF, with qmt_verdict WIN only at rung 7 and MISS below it. THE CEILING: a cell with no toolchain still judges - it reads the brief, enforces Affine law and checks the WASM target and protocol - but caps SOURCE at rung 6 ARTIFACT_ASSEMBLED_NOT_DELIVERED with qmt_verdict MISS, because certifying DELIVERED would claim a build that never happened; REFUSED_NO_CRUCIBLE_HOST is NOT reachable through this tool: its arguments are brief, artifact and target_architecture, and none of them asks for a build - measured 2026-09-29, a brief whose Target Architecture line reads 'Swift 6.4 ~Copyable' (the toolchain no cell has) answers with a rung and qmt_verdict, not that status. To reach rung 7 on any cell, post a COMPILED module: the artifact field as base64 of the wasm bytes (magic 00 61 73 6d 01 00 00 00) with the brief verbatim; the court verifies the magic, version word and section table, seals the bytes and returns them as an MCP resource blob with their sha256 (law_checked=false for a posted module; submit the source in a second call to have Constraints 3/4/5 decided over it).
    ConnectorNo auth
  • Start or advance a Universal Manifold Controller Long Play session for one domain (cinema, aviation, gaming or coding): seed the session, decompose the tau height into integer turns, measure the Rational torsion of each turn, shear-correct, converge, and (with checkpoint=true) seal the tip to the UMC_LONG_PLAY KV bucket so umc_resume can continue it on any cell. GRANT CLASS MESH: the call must carry a caller identity - user_vqbit_hash (32 lowercase hex), entity_id or wallet_hash - or it is refused as REFUSED_GRANT_MESH_IDENTITY_REQUIRED with the invocation still sealed. Measured 2026-09-02 with an identity: status CALORIE_GAV_LONG_PLAY; tip carries session_id, node_id, domain, turn_index, tau_height, torsion as torsion_num/torsion_den (and the string torsion), amplitudes as exact rationals, invariant_root_hex, goal_satisfied, stagnant; publish carries the KV key and NATS subject gaiaftcl.umc.state.<domain>.<session_id>.<node_id>. Stateful by session_id + node_id; tau_height and max_turns are decimal strings; floats refused. Use umc_status to read the tip without advancing it.
    ConnectorNo auth

Matching MCP Servers

  • A
    license
    A
    quality
    A
    maintenance
    Enables interaction with AFFiNE workspaces through GraphQL API to manage documents, search content, handle comments, and access version history. Supports comprehensive workspace operations including document publishing, comment management, and user authentication via session cookies or personal access tokens.
    95
    620 npm
    297
    MIT
  • Exact integer algebra on UUM-8D lattices - eight decimal lanes and a homology z, written x0,x1,x2,x3,x4,x5,x6,x7|z. op selects the law: verify (is A a well-formed lattice), shear (the J_Z shear of A against B through K), add, sub, mul (lane-wise), distance and locking_distance (integer lattice distances A to B), lane_mask (which lanes of A are non-zero), park (fold A by the 0-255 homology mask), permute_p1 and permute_p2 (the two Jordan permutations), is_zero. An empty op returns the list of ops. Every lane is a decimal integer string. Refusals are status REFUSED with the reason under proven: REFUSED_NO_PAIR when an operand is missing or has the wrong lane count, AFFINE_JZ_PARSE when a lane is not a decimal integer (a float lane lands here) - measured 2026-09-02. Same law as verify_jordan_bond, exposed one operation at a time so a caller can inspect intermediate values.
    ConnectorNo auth
  • QC-015 Quantum counting: certify that count equals the number of 1s in the presented oracle string. oracle is a 0/1 string of length 2..8 (the marked entries are the 1s), count is the claimed number as a decimal string. WIN when equal, MISS naming the true count. A presented witness is verified; nothing is counted by amplitude. Floats refused.
    ConnectorNo auth
  • Check dimensions, then compare first-order GUM with seeded fixed-sample Monte Carlo for an explicit model of 1–16 inputs. Return uncertainty budgets, coverage intervals and convergence/linearization findings. Conditional on supplied distributions; no affine units. CPU, direct-only; no planner binding.
    ConnectorNo auth
  • The Code Court's first move: are two implementations equivalent by the exact value multiset of their LLVM IR constants? THE PAYLOAD IS TEXTUAL LLVM IR, NOT SOURCE: submit two .ll files (left_file and right_file, each {path, content}, or files as an array of two) produced by clang -S -emit-llvm, swiftc -emit-ir or rustc --emit=llvm-ir. What is graded: the constant pool of each side - every exact scalar operand (integers, and doubles lifted exactly at 64 bits), including vector constants, phi incoming values and operands behind attributes - digested as a multiset and compared. WIN when the two multisets are identical (constant-pool digests equal); CODE_IR_DIVERGED naming the first value one side has and the other does not (e.g. 'left has 7/1x1 not matched on right'); NOT_KNOWN when nothing mineable was found; a REFUSED_* refusal when a side is not IR (no define, declare, target or %name = / @name = line). Two-line .ll example from the MCP guide - left: 'define i32 @f(i32 %x) { %r = mul i32 %x, 3 ret i32 %r }' (one line per instruction) and right the same with 'mul i32 %x, 4' -> CODE_IR_DIVERGED; identical constants -> WIN. Stateless and content-addressed - the same two files rule identically on every cell. Compares the constant pool (a necessary, strong condition for numeric kernels), not full behavioural equivalence.
    ConnectorNo auth
  • QC-001b Shor TWIN projection. Post ONE half, receive the other. Post halfPow a (a^2 == 1 mod N, a != +/-1) and the court projects factor/cofactor by gcd(a-1,N) and gcd(a+1,N). Post factor and cofactor and it projects a by CRT (a == 1 mod factor, a == -1 mod cofactor). The projected half is verified before return. Bijection in polynomial time - it does not search for a period and does not derive a discrete log. Decimal strings; empty means not posted. Floats refused.
    ConnectorNo auth
  • Franklin's sign-off over an Affine IDE release regression record. The IDE's regression agent opens every study and writes a canonical tab-separated record of what it saw: one stage arm per study (route and the viewer actually showing), the rail, the chat, the en/es/ar locales, the served download page, the prover and one line per screenshot. This court grades that record with ReleaseRegressionLaw from LatticeRender - the same source the IDE's own prover compiles - and answers FRANKLIN_SIGNED_OFF only when every arm is ok, there is exactly one stage arm per study, the three locale arms, a served arm, the prover arm, at least one study with one screenshot per study and, when dmg_sha256 is present, an ok served arm named dmg_sha_matches. Otherwise the terminal is CURE (a ruling, not an error) with failing and missing each naming what is not proven, once; a stage arm whose detail shows the movie stage on a domain route is CURE even when flagged ok (the 0.2.6.3 shape). Returns terminal, digest (sha256 over the canonical bytes), arms_total, arms_ok, failing, missing, franklin (the narration lines), sealed_by and status. The court opens no app and runs no prover: the arms are the caller's measurements. It WRITES NOTHING on the cell and reads no clock; nine cells return the same bytes for the same record.
    ConnectorNo auth
  • QC-011 Phase kickback: certify that the presented phase equals k / 2^m exactly, as a rational. m is the register width (decimal), k the integer eigenphase index, phase the claimed rational written num/den (e.g. 1/2 for m=1, k=1). WIN or MISS with the exact rational the court computed. No estimation is performed; floats refused.
    ConnectorNo auth
  • QC-012 Quantum walk on the two-vertex cycle C2: from start (0 or 1), an even number of steps returns to start and an odd number lands on the other vertex; certify that the presented end matches. steps, start and end are decimal strings (start and end are 0 or 1). WIN or MISS naming the vertex the walk reaches. Floats refused.
    ConnectorNo auth
  • QC-008 Simon collision: certify a presented collision for a hidden mask. x and y are equal-length bit strings with x != y and x XOR y == mask, and f(x) == f(y) (fx and fy are the presented function values). WIN when all three hold, MISS naming the failing relation. The mask is presented, never recovered. Floats refused.
    ConnectorNo auth
  • QC-022 fused bond - the pipeline in ONE call: open key in, bond, verified pair, signature requirements. Post q_hex (the open key, uncompressed 04-prefixed pubkey hex; Q is accepted as the same face) and optionally A (the presented private face, 64-hex or decimal; k is the same face). q_hex ALONE answers UNPRESENTED_PAIR - no scalar on the wire; x(Q) is reported as ground because it is real and derivable, and it is PUBLIC, never a face. With A presented the court projects ground = A*G (scalar multiplication, total, no search - the same law project_affine_key runs) and grades the pair by the verify_presented_pair law: pair_verdict is WIN iff A*G == Q exactly, and A == x(Q) is the FALSE FACE, halting at APART_x_of_Q_is_public_not_a_face. sig_ready is true iff pair_verdict is WIN; pack_lock is ground on a WIN and absent otherwise. Malformed input answers in the court's REFUSED family. Floats refused. Deterministic. Does not ECDLP.
    ConnectorNo auth
  • QC-018 Bell measurement: certify that the presented Bell class bits equal the presented two-qubit pair. ab is the two measured bits (e.g. 00, 11) and class is the two class bits the caller claims; WIN when they agree, MISS naming both when they do not. A presented witness is verified; no state is prepared or sampled. Bit strings only; floats refused.
    ConnectorNo auth
  • Presented period: a^r == 1 (mod N), gcd(a,N)=1, and none of the posted proper_divisors is itself a period (the order claim). All four fields are required: a, N, r, proper_divisors - e.g. a=2, N=15, r=4, proper_divisors=1,2 -> WIN 'a^4 == 1 mod 15'. A call missing one returns REFUSED_NO_INSTANCE naming the missing field. Does not search for r. Floats refused.
    ConnectorNo auth
  • Exact containment of a declared track against convective cell boundaries, including NON-CONVEX footprints: decide whether the track stays outside every declared cell within that cell's altitude layer, and on a breach name the breaching segment, the cell, how the breach happens and the exact parameter along the segment where it does. Exact integer crossing number over micro-degree vertices, with the optional standoff decided by comparing squared distances — no square root, no floating point, no epsilon. Advisory only; not a dispatch or flight-planning authority.
    ConnectorNo auth
  • Exact integer FORWARD pose of a fixed seven-piece avatar rig - it takes no target pose and derives no joint values from one; that solver is not built here. The rig is the head and its eyes: piece ids 0-6 are head, left eye globe, right eye globe, left upper lid, left lower lid, right upper lid, right lower lid. Post the piece_id to report; pieces is OPTIONAL - rows (piece_id, parent_id, origin_*_milli, rotation_milli_deg, extent_milli as decimal strings) that override the built-in rest chain by id, and with pieces absent or [] the court composes the built-in seven-piece rig as declared; the court composes each local frame from the sovereign anchor (or relative_to_head) and returns that piece's pose in whole milli-units - PROVEN_EXACT_IK with the pose, or a refusal naming the piece or field. Zero floats, one Q16 normalization point, byte-identical on arm64 and wasm32. A declared chain solved toward a target pose is not built here (decided 2026-09-26: such a chain answers only where an exact closed form exists and refuses by name otherwise; a later release builds it).
    ConnectorNo auth