AIMarket Oracle Gateway

Install

Works with Claude Code, Codex, VS Code, Cursor, Windsurf, Claude Desktop. Read the repository before you give any tool access to your data.

npx agentmarket install connector/alexar76-aimarket-oracle-gateway

About

No reviews yet. Installed it? Reviews come from verified installers only. How reviews work

Permissions

What this server can do and what it asks for, from its tool list, install config and code. Checked Oct 26, 2026.

Tools

20 read · 0 write · 0 delete · 2 not yet classified

Secrets

None asked for

Install scripts

None found

Runs as

Python package

Tools (22)

Read from the source code; the running server may differ. Descriptions are the server’s own words; hidden characters are shown as [U+…].

• aggregate_values

  Robust consensus aggregation of multi-agent estimates (Murmuration). Combines median, trimmed mean, Tukey biweight, and DeGroot consensus — resistant to outliers and a few Byzantine agents. Use for multi-agent debate resolution, ensemble aggregation, DAO voting, and distributed anomaly consensus. Cost ~$0.002 USDC per call.

• analyze_cascade_risk

  Systemic cascade-risk analysis via abelian sandpile / SOC (Ablation). Returns avalanche-size distribution, power-law exponent tau, VaR/CVaR tail risk, and trigger nodes. Use for financial contagion, supply-chain resilience, and microservices failure analysis. Cost ~$0.01 USDC per call.

• analyze_network_resilience

  Percolation threshold and network resilience analysis (Percola). Returns critical attack fraction f_c, collapse curves P_inf(f), robustness scalar, and keystone nodes. Use before joining exposure graphs or multi-hop agent routes. Cost ~$0.01 USDC per call.

• ask_oracle

  Ask the Platon oracle for a grounded, entropy-derived read-only answer. Use for lightweight oracle-mediated decisions (e.g. an unbiased pick among options). Read-only — no side effects, no state change. Returns: The standard envelope; `result` carries the oracle's answer payload. Cost ~$0.003 USDC. Example: ask_oracle(question="Pick one at random: red, green, or blue?")

• audit_compute_cost

  Thermodynamic compute-cost audit via Landauer's principle (Landauer). Counts irreversible bit erasures in an operation DAG, derives the energy floor (erasures · k_B·T·ln2), efficiency, and hot gates. Use for LLM cost optimization, carbon reporting, ESG compliance, and EU AI Act energy disclosure. Cost ~$0.01 USDC per call.

• compute_least_time_route

  Least-time routing with eikonal potentials + dual certificate (Fermat). Finds the minimum-time path on a weighted graph and returns potentials T(v) as an optimality certificate. Use for multi-agent task routing, supply chain, logistics, and data-pipeline optimization. Cost ~$0.01 USDC per call.

• compute_vdf

  Evaluate a Verifiable Delay Function (Chronos) — proof that real sequential work elapsed. Use when you need provable, unforgeable elapsed time / sequential work: timed reveals, fair ordering, proof-of-elapsed-time, randomness that cannot be precomputed. Producing the output requires `T` sequential squarings over an RSA-2048 modulus (no shortcut), so a valid proof attests the delay actually happened. Verify cheaply with `verify_vdf`. Returns: The standard envelope; `result` contains: - `scheme`, `g`, `y` (= g^(2^T) mod N), `proof` (`{pi, l}`, Wesolowski), `modulus`. `verifiable.…

• get_agent_trust

  Trust score, rank, and percentile of ONE node in a trust graph you supply (LUMEN). A single-agent reputation lookup over the same PageRank as `get_reputation_scores` — use when you only care about one counterparty's standing. Returns: The standard envelope; `result` is `{target_node, score, rank (1=highest), of, percentile, graph_commitment}`. Cost ~$0.003 USDC. Example: get_agent_trust(nodes=3, edges=[[0,1,1.0],[1,2,0.5],[2,0,0.5]], target_node=1)

• get_blue_noise

  Blue-noise point set via Mitchell best-candidate (Turing). Evenly spaced points with large minimum distance — spawn placement, dithering, sensor layout. Omit seed for os.urandom (reported back). Cost ~$0.002 USDC per call.

• get_quasirandom_sequence

  Halton low-discrepancy quasi-random sequence (Lattice). Fills [0,1)^dim more evenly than RNG — faster QMC convergence for integration, pricing, and space-filling search. Deterministic from (count, dim, skip). Cost ~$0.002 USDC per call.

• get_random

  Draw unbiasable, Ed25519-signed verifiable randomness (Platon). Use this when you need randomness an autonomous agent cannot bias or predict and that a third party can verify — fair selection, sampling, raffles, commit-reveal, anti-MEV ordering. The oracle signs the value, so you (or anyone) can verify it offline against the published signer key. Returns: The standard envelope (see server instructions). `result` contains: - `random_hex`: the random bytes, hex-encoded (`num_bytes` long). - `proof`: `{state_hash, tick, timestamp, entropy_commitment}` binding the value to the …

• get_randomness_beacon

  Fetch the round's public randomness beacon (Platon) — one shared value all callers in the round observe, useful as a common coin / shared seed. Returns: The standard envelope; `result` has the same `{random_hex, proof, signature}` shape as `get_random`, but the value is the round-wide beacon (not caller-specific). Cost ~$0.004 USDC. Example: get_randomness_beacon()

• get_reputation_scores

  Compute PageRank/EigenTrust trust scores over a directed trust graph you supply (LUMEN). Use to rank agents/entities by trust when you have who-trusts-whom edges: counterparty selection, sybil-dampened weighting, prioritization. You provide the graph; the oracle returns a normalized score per node plus convergence info. Returns: The standard envelope; `result` contains: - `scores`: array of `nodes` floats that sum to 1 (±1e-6) — node i's trust share. - `iterations`, `converged`: power-iteration convergence info. Cost ~$0.005 USDC (scales with graph size). Example: ge…

• list_oracle_capabilities

  List every oracle tool with capabilityId, price, category, and optional subscription tiers. Call this first to discover what's available and what each call costs before invoking. Returns: JSON with `tools` (flat catalog) and `categories` (group labels). Example: list_oracle_capabilities()

• optimize_route

  Euclidean TSP tour with optimality gap certificate (Colony). Returns tour, length, admissible lower bound, and gap = how far from optimal. Use for routing, scheduling, and logistics with a quality proof. Cost ~$0.005 USDC per call.

Signals

Stars

0

Forks

0

Open issues

0

Weekly downloads

80

Last commit

Oct 23, 2026 (7 days ago)

Last release

Oct 21, 2026 (9 days ago)

Last package publish

Oct 14, 2026 (15 days ago)

From GitHub (fetched Oct 24, 2026) and the package registry.

Details

Registry name

io.github.alexar76/aimarket-oracle-gateway

Version

0.3.1

Auth

No auth

Packages

pypi aimarket-oracle-gateway

License

MIT

Repository

github.com/alexar76/aimarket-oracle-gateway

First seen

Oct 24, 2026

Last checked

Oct 25, 2026

Source

Official MCP Registrygithub-graphql