SNHP

One single-issue negotiation turn, entirely in real dollars.

Recommend a multi-issue package by logrolling (concede where you care little, win where you care much — the trade that beats splitting every issue down the middle).

Score a settled package against the exact Pareto frontier — the SNHP leaderboard metric ("dollars left on the table") for YOUR negotiation.

Your math-optimal next move in any price negotiation — free, no account or key needed.

Negotiate several linked issues at once by logrolling — free, no account or key needed.

The optimal bid when you're bidding in an auction — free, no account or key needed.

The revenue-optimal reserve price when you're selling — free, no account or key needed.

Best price plus markdown schedule to clear stock by a deadline — free, no account or key needed.

Match two groups by their rankings so no pair wants to swap — free, no account or key needed.

Sell-side next-offer recommendation.

Buy-side next-offer recommendation with a defense bundle.

Z-score the opponent's opening offer against a market prior {mu, sigma}. Recommends ignore / counter_with_market / walk_away.

Cryptographically commit to a buyer reservation. Returns an EdDSA-signed JWT attestation the buyer shows the seller. Use SHA-256 over (reservation || nonce || salt || buyer_id || seller_id), base64url-encoded without padding, as `reservation_hash`.

Reveal a previous first-strike to obtain the binding offer.

ASCII PEM of the server's first-strike attestation public key.

Recommend format from {first_price, vickrey, english} given weights.

Monte Carlo auction revenue + efficiency.

Myerson revenue-optimal mechanism for asymmetric IPV. Per-bidder reserves; collapses to second-price-with-reserve under symmetric IPV.

Register your operator identity — STEP 0 of the verified-peer deal flow.

Get the DNS-TXT record to publish to prove control of `domain` (sybil- resistant, domain-level identity).

Verify the published DNS-TXT challenge and register `domain` as a domain-verified operator.

STEP 1 of the A2A flow — sign a per-negotiation peer proof, LOCALLY.

STEP 3 of the A2A flow — verify BOTH peer proofs and open a session.

STEP 4 of the A2A flow — your next move, using the SESSION's verified peer_mode.

STEP 5 (final) of the A2A flow — mint the signed deal record.

Open a stateful price-negotiation session that PONDERS on the other side's clock.

Make your next move in a pondering session and kick off background speculation.

Feed the counterparty's latest dollar offer and get your next move.

Close a pondering session and cancel any in-flight background speculation.

PAID from your wallet at wholesale passthrough (typically well under the 2¢ admission cap): one clean read of a stubborn page → markdown, proxy/anti-bot handling included, automatic failover across backends. url must be http(s), <= 2048 chars.

Persistent memory for your agent across sessions — save now, load in any later session.

Load a memory you saved in an earlier session — retrieval is free.

Open a $2 receipted negotiation session: deterministic, replayable, every move signed.

Your next move inside a receipted session (single-issue) — no additional charge (the $2 at session_open covered it).

Multi-issue logrolled advice inside a receipted session — no additional charge.

Close a receipted session and get the signed summary receipt.

See what's on the shelf — free, no key needed: prices, predicates, receipt scheme, and your balance.

Ask for a capability we don't sell yet — free; filings are public and drive what we stock.

Profile a seller's menu: classify every dimension FREE or LEVER — where the negotiation surface actually is.

Price a buyer's cart on a menu — a Nash-split, DISCOUNT-ONLY quote (never above list).

The NEXTMOVE vending machine: what's on the shelf and how to pay. One SKU: a paid NEGOTIATION SESSION — $2 covers every move of one negotiation (up to 10, 7-day window), category-tuned, receipted, and deterministic (fixed 400k-rollout budget + seed: same context in, bit-identical advice out, auditab…

Ask the vending machine for ANYTHING it doesn't stock — a negotiation category, a different game, a capability. Free, keyless OK. One intake, two names: this shares the store's demand loop, so a request filed here gets the SAME request_id + status you can return to (GAUNTLET #5). Check it with GET /…

Check a filed store_request by its id (GAUNTLET #5: the void now has a status to return). Returns {request_id, status, status_note, filed_at, door, text} — status is 'logged' until the shelf-owner acts on it, at which point status_note carries the reason. Unknown id → {found: false}. (Core-door call…

The public demand tally (GAUNTLET #5, the §3 observatory's first increment): {total, distinct, recent[], requests[]}. `requests` is distinct asks with EXACT-MATCH duplicate counts (whitespace/case folded, no fuzzy classification), most-asked first — the mechanical read of what the shelf is missing. …

YOUR OWN filings (roadmap: a voter comes back a reachable customer) — the private counterpart to the public store_requests tally, keyed to your api_key. Returns {requests: [{request_id, filed_at, text, status, status_note, status_ts, watch, same_ask_count}]}, newest first; `watch` echoes whether you…