rta — zero-knowledge proof of a threshold

lat.rta/rta · v0.1.0 · agents-and-memory

rta — zero-knowledge proof of a threshold is healthy: it completed an MCP handshake in 1880 ms and exposes 2 tools.

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

Endpoint: https://rta.lat/mcp (streamable-http)

Repository · JSON · Add to my inventory

Facts

Users (last 30 days)0
HandshakeHealthy
Auth neededNone
Tool count2
Latency1880 ms
Last checked (UTC)2026-10-21T10:30:59.886Z

Health history

Checked (UTC)StatusLatencyError
2026-10-21T10:30:59.886ZHealthy1880

Tools (2)

list_predicatesList 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_proofVerify 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