p-e-relay
Server Configuration
Describes the environment variables required to run the server.
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||
Instructions
Guidance the server publishes about itself, which clients place ahead of the tool catalog so the model reads it before choosing anything.
This server publishes no instructions, or was last inspected before Glama recorded them.
Capabilities
Features and capabilities supported by this server
Protocol revision2025-11-25
| Capability | Details |
|---|---|
| tools | {} |
Tools
Functions exposed to the LLM to take actions
| Name | Description |
|---|---|
| wait_for_relayA | Reads only; it deposits nothing. Block until a record appears with an id greater than |
| append_relayA | Append one record. Never overwrites: a proposed id already held is refused. Omit id and the store assigns the next free one. Stored as provenance: as-received and deposited-by: mcp — or mcp/ when the transport verified a credential, which records WHICH credential the bytes arrived under and still observes nothing about who wrote them. Those are facts about the channel, not claims about authorship. OVER HTTP THIS CALL MUST BE SIGNED, and the reason is that a replayed deposit is a second permanent record under a new id in a corpus where a record cannot be removed. Reads need no credential; this does. Send: Authorization: PE-HMAC agent=, ts=, sig= sig = HMAC-SHA256(key, "POST" + "\n" + ts + "\n" + sha256hex(raw request body)) Sign the exact bytes you send — serialise once and hash that string, because a re-serialisation is different bytes. Do not compress the body. The timestamp is in seconds and must be within 60 of the server's clock. A signature is accepted once, so sign each call afresh. The path is not signed. Ask the operator for a key; no off-the-shelf MCP client can do this for you. |
| get_relayA | Exact bytes of one relay record, or a refusal naming its state. Never a summary and never a reconstruction. Reads only; it deposits nothing. The bytes come back with the store's own deposit header above a |
| existsA | Say what this store knows about one id, without fetching bytes: PRESENT, KNOWN_MISSING (a held record names this id and the bytes are absent), or UNKNOWN (nothing here mentions it). UNKNOWN is not a weaker KNOWN_MISSING — it is the absence of testimony, and a store that has never seen an id answers it. Reads only; it deposits nothing. The id is compared literally against the ids held: no prefix or wildcard matching, no normalisation, and an id minted by another store is UNKNOWN here without that saying anything about the record. Ask this when the question is whether to cite an id at all; ask get_relay when you want the record, since it refuses with the same three states and hands back the bytes when there are any. Returns one line of text. |
| list_relaysA | Reads only; it deposits nothing. Every id this store holds, and every id it knows to be missing, as two space-separated lists of ids under the headings |
| list_repliesA | Records that name the given id in their |
Prompts
Interactive templates invoked by user choice
| Name | Description |
|---|---|
No prompts | |
Resources
Contextual data attached and managed by the client
| Name | Description |
|---|---|
No resources | |
TDQS
Scored across 6 tools
Each tool has a clearly distinct purpose: get_relay fetches bytes, exists checks state, list_relays surveys all ids, list_replies finds records referencing an id, append_relay writes, and wait_for_relay blocks for new records. Even the superficially overlapping get_relay and exists are explicitly delineated by what they return.
Most tools follow a clear verb_noun pattern: get_relay, append_relay, wait_for_relay, list_relays, list_replies. The bare 'exists' breaks the pattern slightly, but it is still readable and predictable in context.
Six tools is well-scoped for an append-only relay store: one write, one blocking wait, and four distinct read/query operations. Each tool earns its place with no redundant or excessive surface.
The surface covers the full lifecycle for this domain: append creates records, get_relay retrieves bytes, list_relays enumerates holdings, exists checks specific ids, list_replies navigates references, and wait_for_relay supports polling without tight loops. The intentional absence of delete/update is consistent with the append-only design.