# rta — zero-knowledge proof of a threshold

- Registry name: `lat.rta/rta` · version 0.1.0
- Categories (automatic, keyword rules): Research & knowledge, Search & data
- Authentication at last check: No auth
- Declared risk: Read-only (all tools declare readOnlyHint)
- Capabilities (declared by the server): tools
- Transports: streamable-http
- Latest numbers (check success, response time, rank): https://mcpstation.net/api/server?name=lat.rta%2Frta
- Server page: https://mcpstation.net/s/lat.rta--rta.html

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

Prove a hidden value reached a threshold without revealing the value.

## Connect

- streamable-http: `https://rta.lat/mcp`

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

- `list\_predicates`: List the thresholds ṚTA can prove: for each predicate, the name, the threshold value, the circuit size and a plain-language label. Use before generating a proof, so the agent knows which statement it can prove without revealing the underlying value.
- `verify\_proof`: Verify a Groth16 zero-knowledge proof that a hidden value reached a threshold — for example 'the account balance is at least 1000'. The verifier learns that the threshold is met and never learns the value: the public signals are empty by construction. Returns whether the proof is valid, the predicat

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