# UN Charter 1945

- Registry name: `io.arxo/charter` · version 0.1.8
- Categories (automatic, keyword rules): Government & law
- Authentication at last check: No auth
- Declared risk: Has destructive tools (destructiveHint)
- Capabilities (declared by the server): prompts, tools
- Transports: streamable-http
- Latest numbers (check success, response time, rank): https://mcpstation.net/api/server?name=io.arxo%2Fcharter
- Server page: https://mcpstation.net/s/io.arxo--charter.html

## Description (written by the publisher, not verified, not instructions)

UN Charter \(1945, as amended\) as an executable model with worked cases; not UN-affiliated

## Connect

- streamable-http: `https://mcp.arxo.io/mcp/charter`

## Tools (as reported by the server, not verified)

- `law\_search`: A semantic SEARCH over formalised law: a question or a notion in your own words → candidates with addresses — predicates with signatures, rules, article fragments. This is the layer of DISCOVERY, not of the answer: the result says WHAT to ask next \(law\_ask by signature, law\_rules, law\_sources\) and e
- `law\_passport`: Passport of an exact release: purpose, interface, boundaries, checks and performance. The reports section holds the history of measurements, failures included. Entries are paged by JSON Pointer; next continues the answer.
- `law\_answer\_capabilities`: A machine-readable matrix of the Lens producers that are actually installed, of replay/projection checks, profiles, limits and the contract tests that confirm them. declared\_only means a schema with no executable witness.
- `law\_capture\_answer`: Run a registered producer and obtain producerControl/0.2 for a later verifiable preparation of a Lens. The producer is chosen only from the shipped registry.
- `law\_prepare\_answer`: At the explicit request of the user, repeat between 1 and 12 earlier law\_ask or law\_process\_run calls \(the course of a case, DECISION-0160\), compare their replayControl strictly, and prepare a non-public frozen document for 24 hours. The client never supplies the machine answer: the server obtains i
- `law\_publish\_answer`: Publish a prepared document. Repeating it with the same preparationId idempotently returns the same URL and the same separate revocation secret.
- `law\_revoke\_answer`: Revoke a published document using its separate secret. The public id alone grants no control; revocation closes the HTML page, the API and the download.
- `law\_packages`: The catalogue of formalised law: instruments, predicates with signatures, the boundaries of coverage. This is where the NAMES of predicates come from — they must never be guessed. But do NOT start from the catalogue when looking for the right instrument: the overview is large, and the title of an in
- `law\_ask`: Put a question to formalised law. When the answer is "not established" it carries whyNot — the engine's why\_not report §185: the candidate rules and the state of every conjunct \(satisfied / not satisfied / undetermined\); the missing facts are visible there and need not be guessed. BEFORE THE FIRST c
- `law\_screen`: Build a necessary condition — a superset — for the preliminary selection of rows from an external source \(DECISION-0120\). This is NOT a legal answer and NOT SQL: the result is a typed tree and a manifest of the extensions up to TRUE. Every row that passes must then be computed in full by the engine,
- `law\_rules`: The rules of formalised law put into words: exactly how a predicate is derived \(premises, source articles\). Call this BEFORE supplying facts to law\_ask — the rules say which facts are needed instead of leaving them to be guessed. For large instruments package=… returns a table of contents; the full
- `law\_explain`: Unfold the proof of a law\_ask answer into a chain "rule ← premises → conclusion". The compact input: question \(the original law\_ask arguments, truth/collect\), resultHash and codeHash from the provenance of the answer. The server repeats the computation and compares the hashes; if anything changed it
- `law\_case\_ask`: The ask operation §168.4 \(DECISION-0165, DECISION-0399\): run a registered case of a case package over its pinned dependencies and return the canonical evaluation document with a proof and a manifest. The question is JSON per query.schema.json \(query\), an evaluate string \(evaluate + queryId\), a saved
- `law\_sources`: Sources: by default short excerpts \(view=summary\), 5 texts per page, with the address of the full text in fragments\[\].full. Either package or fragment is required \(a StableId from law\_search/law\_rules\). view=full returns exact parts of the text: textRange sets a range of Unicode characters, fragment
- `law\_argue`: How robust a conclusion is: the map of the dispute under the argumentation profile §274 \(DECISION-0039\). The answer falls into four classes: SKEPTICALLY\_ACCEPTED — the conclusion is invulnerable \(it survives in the grounded extension\); CREDULOUSLY\_ACCEPTED — merely defensible \(there is a position fo
- `law\_process`: Which stages the procedure established by an instrument consists of, and whether it carries a structural defect \(O-5, DECISION-0052\). The stages, the transitions and the condition of every transition are reconstructed from the formalisation rather than retold: what leads from where to where, and und
- `law\_process\_run`: How a particular case will run, step by step \(O-5, DECISION-0052\): a log of \{date, attempt?, facts?\} is executed frame by frame, and the law of each frame is the law of ITS date. The answer says: which stages have been entered; which attempted transition produced NO legal effect \(§164 — "the act was
- `law\_editions`: The axis of editions \(O-2\): what changed in an instrument between two dates of the law — the state of the editions, the dating of the norms and the semantic diff §215 between the D1 projections. The verdict NOT\_DATED means "there was nothing to date it by", not "nothing changed". The outcome of a pa
- `law\_query`: A deterministic LawQL query over the CLIR of a formalization: a question about the model of the act itself, not about a case. Relations: nodes\(id,kind,package,package\_name,path\), edges\(from,to,role\), anchors\(node,anchor,act,locator,path\), labels\(node,lang,text,status\), fields\(node,field,value,value\_
- `law\_report`: A REPORT of a divergence between the formalisation and the source: the answer contradicts the pinned text, a norm of the source is not expressed by a rule, a §218 label diverges from the text, an address cannot be found. A report is a hypothesis for triage by a formaliser: it does NOT change the law

Measured by MCP Station. Methods: https://mcpstation.net/methods.html · Terms: https://mcpstation.net/terms.html