Bezahlte Endpunkte für autonome Agenten. Abrechnung über x402 in USDC auf Base Mainnet.
POST /v1/webhook-inbox
Gives an agent without a reachable server a place to receive callbacks. create returns a public URL that accepts any POST, GET or PUT from a third party; poll returns the events that arrived since a cursor you carry forward, with headers, parsed body and arrival time. The inbox expires after at most seven days and holds at most 500 events, oldest dropped first. Reading requires the secret returned at creation. Do not point payment or authentication callbacks here: anyone who learns the URL can post to it, and stored bodies are readable with the secret alone.
0.005 USDC je Aufruf · MCP webhook_inbox
POST /v1/state-store
Key-value state for agents that need to survive between calls. Every write carries a time-to-live; the maximum is 30 days and there is no way to store something permanently. Values are opaque JSON up to 64 KB, at most 1000 live keys per namespace. Actions: set, get, list, delete. A get on a missing or expired key answers found=false, it is not an error. The namespace is a plain string chosen by the caller and is not authenticated — anyone who knows it can read it, so do not put secrets in it. Expired rows are removed on access, not on a timer, so a list can lag a few seconds behind the exact expiry moment.
0.002 USDC je Aufruf · MCP state_store
POST /v1/wakeup
Books a single POST to a URL you own, at a time you name, with a payload you supply. Delivery is retried up to five times with growing gaps and every attempt is recorded with its status. Lead time is between 10 seconds and 30 days, and at most 200 pending wakeups per target URL. The target must be a public https address: private, loopback and link-local addresses are refused, so this cannot be pointed at an internal network. Delivery is at-least-once and the time is a floor, not a guarantee — the dispatcher checks every 15 seconds, so expect a few seconds of lag. Actions: schedule, status, cancel, list.
0.002 USDC je Aufruf · MCP wakeup_schedule
POST /v1/job-runner
For work that outlives one HTTP response. You submit steps, each an HTTP request against a public address; the job is acknowledged at once and runs in the background, and the collected results are POSTed to your callback URL when finished. Every step reports its status, timing, response headers and body up to 256 KB, and a failing step never aborts the others. Price is 0.003 USDC per step, quoted before payment. Only http and https against public hosts are performed — private and loopback addresses are refused and no supplied code is ever executed. Steps run one after another with a 20 second cap each, so a 50-step job can take several minutes. Actions: submit, status, cancel.
0.003 USDC je Aufruf · MCP job_runner
POST /v1/file-vault
Takes a base64 file up to 25 MB and stores it for as long as you say, at most seven days. You get a download URL carrying a 32-byte token; whoever holds the link can fetch the file once or up to a limit you set, with no payment and no account. Price is 0.004 USDC per started megabyte, quoted before payment from the size you declare. Actions: store, status, delete. Anything expired is deleted with its contents, and a link is only as private as you keep it, so this is not a place for personal or secret material. Content is stored and served unchanged and is never inspected or scanned.
0.004 USDC je Aufruf · MCP file_vault
POST /v1/a2a-card-validate
Validates an Agent Card document against the A2A convention and returns findings by severity: error (the card is unusable as published), warning (works, but a consuming agent will guess), info (recommended field absent). Checked: the required fields name, description, url, version, capabilities and skills; that url is absolute and https; that every skill carries id, name, description and tags and that skill ids are unique; that declared securitySchemes use a known type and that every entry in security refers to a defined scheme; that input and output modes are declared; that streaming and pushNotifications are booleans. This endpoint does not fetch the card and never contacts the agent: it judges only the document handed to it, so a passing card is not proof that the endpoint is reachable or honest.
0.002 USDC je Aufruf · MCP a2a_card_validate
POST /v1/mcp-inspect
Performs the MCP handshake against a streamable-HTTP endpoint and then reads the catalogue: tools with their input schemas, resources with their URIs and mime types, and prompts with their arguments. Servers answering as an event stream are handled as well as plain JSON, and a session id is carried across calls. Only listing methods are sent — no tool of the inspected server is ever executed, nothing is written, and no resource contents are read. The target must be a public address; private and loopback addresses are refused. An unreachable or non-conforming server yields a reachable=false report with the reason, not an error.
0.005 USDC je Aufruf · MCP mcp_inspect
POST /v1/mcp-normalize
Takes a list of MCP tool definitions, as returned by tools/list on any number of servers, and rewrites them into one common form. Servers disagree on where the schema lives — inputSchema, input_schema, parameters, schema or arguments are all in use — and a consumer reading only one of them loses the others silently; every spelling is accepted and the one found is reported. For each tool the result carries a flat field list with type, required flag and description, a synthetic example call built from the schema, and the tool name normalised to snake_case. Name collisions across servers are detected and reported with the servers involved. The example call shows the shape only: values like "string" and 0 are placeholders and must never be sent to a live server. No network access happens here — only the definitions handed in are read.
0.002 USDC je Aufruf · MCP mcp_normalize
POST /v1/fallback-resolve
Searches the public x402 discovery catalogue for services able to replace a broken dependency. Give the failed URL and, better still, a short description of what it did and the fields you need back; matches are scored on overlap between your task words and the candidate name, description and path, then ordered by score and price. Every hit carries the reason it matched, its price in USDC, its network and when the catalogue last saw it. The endpoint that failed is excluded from its own replacement list. This reads a public index and never calls a candidate: a listed service is not proof that it works today, and the input schema of a replacement will differ, so treat the result as a shortlist to test, not a drop-in.
0.005 USDC je Aufruf · MCP fallback_resolve
POST /v1/task-quote-compare
Normalises offers that describe the same task in different shapes and ranks them. Each offer may carry a price, a delivery time, a list of capabilities and one or more delivery formats. You state which capabilities and formats the task requires; offers missing a required capability or format are marked ineligible and ranked last, never silently dropped. The ranking is a weighted score over price, speed and capability coverage, with weights you supply and which are echoed back. Every ranked entry carries the sub-scores it was built from, so the order can be recomputed by hand. Prices must already be in one currency: no conversion happens here, and a mixed-currency input is rejected rather than compared wrongly.
0.005 USDC je Aufruf · MCP task_quote_compare
POST /v1/result-consensus
Takes two to twelve answers and returns a field-by-field comparison. For JSON answers every leaf path is compared across responders: a path is agreed when all responders that supplied it carry the same value, conflicting when they differ, and partial when some omitted it. Numbers count as equal inside a relative tolerance you set. For plain-text answers the comparison is word-overlap similarity, which measures shared vocabulary and not meaning — two correct answers in different words will score low, and that is reported as low agreement, not as a contradiction. The result names a majority value per conflicting path together with how many responders backed it. This endpoint does not decide who is right: it has no ground truth and no model, it only shows where the answers part company.
0.002 USDC je Aufruf · MCP result_consensus
POST /v1/twin-diff
Takes two state documents — target (what the twin should look like) and observed (what was measured) — and returns a leaf-by-leaf comparison. Every leaf path carries one of five states: in_tolerance, out_of_tolerance, missing_in_observed, unexpected_in_observed or type_mismatch. Numeric leaves are judged against a tolerance you set per path, either absolute (tolerance_abs) or relative (tolerance_ratio); paths without an entry fall back to default_tolerance_ratio, which is 0, meaning exact equality. Strings, booleans and null are compared for equality only, with optional case folding for strings. Arrays are addressed by index, so a reordered list reads as a set of deviations and not as a match. Units are never inferred from field names: a unit appears in the result only where you declared one, otherwise unit is null and unit_source says not_declared. This endpoint is stateless — it stores no twin, tracks no history and performs no synchronisation; it reports the gap between the two documents handed to it at this moment and nothing else.
0.003 USDC je Aufruf · MCP twin_diff
POST /v1/memory-compact
Takes a message history and a character budget and returns a shortened history together with a full account of what it cost. Four stages run in fixed order: pin protects messages that must survive (roles listed in keep_roles, the last keep_last_n messages, and anything you marked pin), dedupe removes later near-duplicates of an earlier message of the same role using word-overlap similarity, trim shortens unprotected survivors to max_message_chars at the last sentence boundary, and drop removes the lowest-scoring unprotected messages until the budget is met. The score is disclosed in the response and is a fixed weighting of recency, role and overlap with the vocabulary of the whole history. This endpoint uses no language model and does not summarise, paraphrase or rewrite anything: every character in the output appears verbatim in the input, and nothing is appended, not even an ellipsis. Consequences follow from that and are reported rather than hidden — word overlap measures shared vocabulary and not meaning, so two differently worded messages about the same fact are not recognised as duplicates, and trimming cuts at a sentence boundary and can therefore remove the point of a long message. Protected messages are never dropped, so a budget smaller than the protected content cannot be met; the response then says budget_met false and reports the shortfall instead of discarding something it promised to keep.
0.005 USDC je Aufruf · MCP memory_compact
POST /v1/state-machine-step
Takes a machine definition, the current state, one event and an optional context, and computes a single step. Transitions may carry a guard, which is a declared comparison — field, operator, value — and never an expression: the field is a dotted path into context or payload, so a machine handed in by a stranger cannot execute anything on this server. Supported operators are eq, ne, gt, gte, lt, lte, in, not_in, exists and not_exists; a guard whose field does not resolve evaluates to false and says so rather than passing silently. Deadlines are computed from elapsed_in_state_s, which you supply, so the result does not depend on this server clock and the same request always yields the same answer. When a state carries timeout_s and the elapsed time exceeds it, timeout_precedence decides whether the timeout transition or a matching event transition wins; the default is timeout. A breached deadline is reported even when the state defines no timeout_target, in which case the machine does not move on account of it. The definition is checked for referential integrity before the step runs: transitions pointing at states that do not exist, and an initial state that does not exist, are rejected as a bad machine rather than silently followed. This endpoint is stateless: it stores no machine, no state and no history, and it applies exactly one step per call — use /v1/state-store to keep the state between calls.
0.002 USDC je Aufruf · MCP state_machine_step
POST /v1/intent-clarify
Takes a list of candidate intents, each described by attributes, plus whatever is already known, and returns the one attribute worth asking about next. Candidates contradicted by the known values are ruled out first and listed with the attribute that excluded them; a candidate that simply does not declare a known attribute is kept, because silence is not a contradiction. For every remaining attribute the endpoint builds the branches an answer would create and ranks them by the prior-weighted expected number of candidates left, then by the worst case, then by the number of options; a candidate that does not declare the attribute survives every branch, which is counted rather than ignored. Attributes on which all remaining candidates agree carry no information and are returned separately as unusable_attributes, so they are not asked by mistake. When an attribute has more distinct values than max_options, the largest options are shown and the omitted values are named explicitly — nothing is capped silently. The answer also carries a greedy worst-case estimate of how many further questions would be needed. This endpoint uses no language model and does not read natural language: it never invents a candidate, an attribute or a value, and the question wording is a fixed template over the attribute name unless you supply your own phrasing in attribute_prompts. It is stateless — it remembers no dialogue, so pass the accumulated answers back in known on the next call.
0.005 USDC je Aufruf · MCP intent_clarify
POST /v1/ephemeral-rag
Stores at most 20 short documents in an isolated SQLite row, embeds them with the local nomic-embed-text model, and performs cosine-similarity retrieval. Each store has a random identifier and a fixed 24-hour lifetime that is never extended by reads or writes. An in-process sweeper deletes expired rows every minute and each request also purges expiry. Input text is not written to request logs. This is retrieval infrastructure, not a durable database or an answer-generating model.
0.005 USDC je Aufruf · MCP ephemeral_rag
POST /v1/oss-tofu-encrypted-state-roundtrip
Takes an OpenTofu state snapshot and a passphrase, encrypts the snapshot through the pinned OpenTofu state-encryption code, then proves the result three ways: the authorized key recovers the state with an identical semantic hash, a wrong key is rejected, and a tampered payload is rejected. What comes back is the encrypted artifact plus those proofs and the resource-instance count, never the plaintext. The point is to establish before you rely on it that a state backup is actually recoverable and actually protected, rather than merely encrypted. The work runs in a worker with no network, no elevated rights and a private artifact directory that is removed when the job ends. Your passphrase is not returned and not logged.
0.0035 USDC je Aufruf · MCP oss_tofu_encrypted_state_roundtrip
POST /v1/oss-openrewrite-java-package-relocation
Relocates a Java package across a bounded set of source files using OpenRewrite, which works on a type-attributed syntax tree rather than on text. That is the difference that matters: a textual search and replace hits strings, comments and same-named symbols from other packages, while this changes only what actually refers to the package. Both the before and after state are compiled and the result is reported, so a refactoring that breaks the build says so instead of being handed over as done. A unified diff and a per-file changed/unchanged list come back with it. The source set is what you supply — imports from files outside it cannot be updated and are not guessed at.
0.004 USDC je Aufruf · MCP oss_openrewrite_java_package_relocation
POST /v1/oss-openrefine-table-collision-review-plan
Clusters a key column with native OpenRefine fingerprinting and returns a consolidation plan tied to actual row ids. The plan distinguishes the two cases that matter: rows that repeat an identical value and can simply be merged, and rows that collide on the key but disagree in other fields — those are flagged as unresolved rather than silently collapsed, because merging them would destroy information. Excluded rows and singletons are reported too, so the plan accounts for every input row. Nothing is merged here: this produces the plan and the evidence for it, and the decision stays with the caller. The table is returned unchanged and the source hash proves it.
0.0035 USDC je Aufruf · MCP oss_openrefine_table_collision_review_plan
POST /v1/oss-openrefine-verified-table-recipe-replay
Executes a caller-directed sequence of table operations in native OpenRefine and returns the transformed table together with the exported recipe. What distinguishes it from simply transforming data is the evidence: the recipe is persisted, the project is reopened, and the whole thing is replayed from the original input, with hashes reported at each stage. If the replay does not reproduce the result, that is visible in the output instead of being discovered months later when someone tries to rerun the pipeline. This makes a transformation auditable and portable. Steps are taken as supplied and are not validated for business sense — the guarantee is reproducibility, not correctness of intent.
0.0045 USDC je Aufruf · MCP oss_openrefine_verified_table_recipe_replay
POST /v1/oss-openrefine-reference-catalog-reconciliation-review
Reconciles a column of names against a reference catalog that you supply — your catalog, not a public knowledge base — using native OpenRefine reconciliation with a caller-set edit distance and an optional required type. The result separates rows with a single candidate, rows with several, and rows with none, and it leaves the ambiguous ones ambiguous: an automatic pick would be the cheapest possible way to introduce a wrong identity into a reference dataset. Type-excluded references and excluded rows are reported so the count reconciles. Reconciliation metadata is persisted and reopened, and both hashes are returned as evidence. Nothing is matched automatically and the source table is returned unchanged.
0.004 USDC je Aufruf · MCP oss_openrefine_reference_catalog_reconciliation_review
POST /v1/oss-opendocman-document-authority-regression-rehearsal
Takes a before and an after picture of your OpenDocMan rights setup and asks the pinned native code what each one actually grants. Every user-document pair is evaluated in both states, and what comes back is which decisions changed, which of your declared expectations were violated in each state, and whether the seeded state survived untouched. The point is to see the blast radius of a permissions change before you apply it, where the damage is usually not the rule you edited but the pair you never thought about. Rights are evaluated by the original implementation, not by a reimplementation of its rules. The work runs without elevated rights, without network and in a private database that is removed when the job ends.
0.004 USDC je Aufruf · MCP oss_opendocman_document_authority_regression_rehearsal
POST /v1/oss-opencart-checkout-rule-regression-review
Runs your simple-product checkout cases against the pinned OpenCart source in a private, non-root database that exists only for the length of the request. For each case it reports the totals the native code actually produces, which expectations were missed, and where a cart path diverged, rather than a single pass or fail. The point is to see a pricing regression before customers do: a coupon that stacks where it should not, a shipping rule that survives a tax-class change, a discount tier that applies one order too early. Prior coupon uses and tax classes are seeded exactly as supplied. Nothing is written back and no order is placed; the database and workspace are removed on every terminal path, whether the review succeeds or fails.
0.005 USDC je Aufruf · MCP oss_opencart_checkout_rule_regression_review
POST /v1/oss-opencart-catalog-import-rehearsal
Walks a staged product-catalog import through the pinned OpenCart source in a private, non-root database and reports what the native code makes of it at each stage: how many masters and variants survive, whether option values stay attached to the right products, and how the resulting catalog behaves in a localized cart. The point is to find the damage before the import touches a live shop, where a broken option mapping shows up as a customer ordering a variant that does not exist. Locales, taxonomy and stages are taken as supplied and evaluated in the given order. Nothing is written to a real shop; the private database and workspace are removed on every terminal path, whether the rehearsal succeeds or fails.
0.005 USDC je Aufruf · MCP oss_opencart_catalog_import_rehearsal
POST /v1/oss-opencart-order-export-reconciliation
Rebuilds the orders you supply inside a private, non-root OpenCart database and checks your export against what the native code computes. Each export row is matched to a ledger order, and every difference is named: a total that does not add up under the stated arithmetic policy, a currency conversion applied at the wrong point, a localized status that maps to nothing. The point is to catch an export that looks consistent with itself but disagrees with the shop it claims to describe, before it reaches an accounting system. Currencies, languages, statuses and policies are taken as supplied. The ledger is built for this request only; the database and workspace are removed on every terminal path.
0.005 USDC je Aufruf · MCP oss_opencart_order_export_reconciliation
POST /v1/oss-openolat-grading-discrepancy-review
Replays a grading scale through the native OpenOLAT implementation and compares, for each assessment, the grade that was recorded against the grade the scale actually yields. Every discrepancy comes back with the score, the band it falls into, the expected value and the recorded one, so a wrong entry can be corrected at the row instead of being argued about in the aggregate. Boundary cases are where this earns its keep: the score that sits exactly on a band edge is the one a spreadsheet reimplementation gets wrong, and the native rules decide it here. The scale and results are taken as supplied and nothing is written back — this diagnoses, it does not grade and does not correct.
0.0045 USDC je Aufruf · MCP oss_openolat_grading_discrepancy_review
POST /v1/oss-openolat-question-bank-answer-fixture-review
Executes a question-bank assessment against answer fixtures you supply — an answer plus the score it should produce — using the native OpenOLAT QTI engine rather than a reimplementation of the scoring rules. Each fixture comes back with expected and actual score, and the discrepancy count says at a glance whether the bank behaves as its author believed. This is the regression test for a question bank before it goes in front of learners, where a mis-scoring item is expensive and hard to undo. Items and fixtures are taken as supplied, nothing is stored, and no bank is modified. It verifies scoring against your fixtures; it does not judge whether the questions are good ones.
0.005 USDC je Aufruf · MCP oss_openolat_question_bank_answer_fixture_review
POST /v1/oss-openolat-learning-path-prerequisite-rehearsal
Runs a course structure and a set of learners through the pinned OpenOlat learning-path implementation and reports, per learner, which nodes the original code actually unlocks and in what order. Your declared expectations are checked against that run, and every discrepancy is named rather than summarised into a pass or fail. The point is to find a prerequisite rule that behaves differently than intended before a cohort is sitting in front of it, where the symptom is a learner blocked on a node that should have opened. The course, the expectations and the learners are taken as supplied. The run happens in a worker without elevated rights, in its own network namespace, against a database built for this request and removed when it ends.
0.005 USDC je Aufruf · MCP oss_openolat_learning_path_prerequisite_rehearsal