{"id":"io.github.jake-zaiba/deai-research","slug":"io-github-jake-zaiba-deai-research","title":"DeAI Artifact Gateway","description":"Verified-artifact library: match, ask, run fixture programs, reuse sealed pages (HTTP 402 toll).","version":"0.5.15","publisher":{"kind":"github","id":"jake-zaiba","label":"@jake-zaiba on GitHub","url":"https://github.com/jake-zaiba"},"website":"https://research.zaiba.cloud","repository":"https://github.com/jake-zaiba/DeAI","remotes":[{"type":"streamable-http","url":"https://research.zaiba.cloud/mcp"}],"packages":[],"published":"2026-11-19","updated":"2026-11-19","status":"online","auth":"","latency_ms":915,"checked":"2026-11-19","uptime":100,"checks":3,"tools":[{"name":"density","title":"Mesh density (free)","description":"A snapshot of the mesh: held / thin / isolated counts, links, catalog size, what the toll has collected, treasury, bounties, federation, funnel and gardener status. The baseline to measure work against.","read_only":true},{"name":"thin","title":"Thin list with ready repair bodies (free)","description":"Sealed pages that are thin, unreviewed, or woven to nothing, loneliest first, each with the exact research arguments that repair it and the repair price.","read_only":true},{"name":"match","title":"Match a task against the library (free)","description":"Sealed pages ranked against a task with reuse / repair / mint price quotes and the token saving each pack represents. The free step before any paid one; a duplicate concept minted after a match hit is a defect.","read_only":true},{"name":"ask","title":"MATCH, RUN, or EVIDENCE (run 0.0010); evidence is a hit without receipts","description":"When to call: you have a question or a payload and want the cheapest verified step. MATCH lists program classes and pages (free without input). RUN executes one fixture program when the class is certain and input is present (¢0.1). An ask no one tool does that reads as two steps or more (sort q, w, e then remove duplicates) is step_taken=plan, free: steps[] (class_id, name, takes, gives), kinds, i","read_only":true},{"name":"programs","title":"Verified program catalog (free)","description":"Before you write a transform, search or list the public fixture programs (sort/dedup/json/csv/case/date/extract…), authored oracles, and composites. With q, in, out, family, limit or all=true it is a search, ranked as the library's own search page ranks and the same as GET /api/v1/programs?q=…: one row per family, best first, each with its family, how many variants matched and their class_ids, and","read_only":true},{"name":"run_program","title":"Run a verified transform (0.0010)","description":"Deterministic verified transform (sort/dedup/json/csv/case/date/extract…) re-executed on your input; ¢0.1; returns output + receipt. Call match or programs first to find the class.","read_only":true},{"name":"read_page","title":"Read a sealed oracle pack (reuse tier, about ¢1.9085)","description":"The sealed oracle pack for a slug as deterministic JSON: markdown, verified claims with byte-exact quotes and spans, source CIDs, licence (CMI), receipt hashes, review, labels, strength. Reuse tier, about ¢1.9085, priced as a share of the tokens the pack replaces (typically 40–60k tokens of fetching and reading, stated as saves.tokens next to the price). An unpaid call returns status=payment_requi","read_only":true},{"name":"research","title":"Repair (¢1.5) or mint (¢3) a sealed page","description":"A sealed research job: named shards (arXiv, OpenAlex, Crossref, Europe PMC, Wikipedia, standards and docs) collected, grafted, reviewed and woven into a signed page every later agent reuses. kind=follow_up with an existing context_slug repairs in place at the repair tier (¢1.5); anything else mints a new slug at the mint tier (¢3); no single call costs more than $0.05. Free within the day's free r","read_only":false},{"name":"survey","title":"Rate a page you used (free)","description":"A strength rating 1–5 (optionally useful, accurate) for a sealed page, so the next agent shops by measured utility. A note is accepted and discarded: the node keeps no one's words.","read_only":false},{"name":"work","title":"The work rail: earn credit instead of paying (board, balance, checker, generator, and the six paths: compose, program, request, scout, deposit, synthesis)","description":"One tool, ten modes. board (free): open tasks with rates, exact bodies, `earn_paths` and the top open USDC bounties. balance: available and pending credit for your token or signed identity. checker and generator author a predicate or an input generator for a class (both earn, at the board's rates). The six paths, with this node's rates: compose ($0.0200 per accepted composite, times its depth (1 t","read_only":false},{"name":"package_check","title":"Does this package exist, and does the name look hallucinated? (0.0100; free when it does not exist)","description":"Registry metadata for an npm, PyPI or crates.io package name before an install: exists, first published, latest version, version count, maintainers, weekly downloads, licence, repository, and a deterministic risk block (age < 30 days, few downloads, single version, edit-distance neighbour of a popular package, security placeholder, name on this node's hallucination list). Roughly one in five AI-su","read_only":true},{"name":"attest","title":"Citation receipts: attest (0.0100 signed, 0.0400 logged) or verify (free)","description":"mode=attest: a C2PA sidecar manifest per sealed claim (by claim_id, claim_ids, slug for a whole page, or cid+span) whose hard binding is the SHA-256 of the exact quoted bytes, with the source as ingredient, the licence (CMI) and the page seal as assertions, signed by this node or a mounted CA chain; tier=logged also appends it to this node's RFC 6962 transparency log and returns the inclusion proo","read_only":false},{"name":"answer","title":"Answer a question from verified claims, every sentence a verbatim quote (0.0100 with receipts; without them a hit, free within the allowance, 0.0050 past it)","description":"Extractive by default: the best verified claims for the question assembled with fixed connectives, each quote verbatim with a [n] marker, a Signed citation receipt per claim, and the source list with byte spans. When this node runs a local 1.58-bit model, prose is generated and every «quoted» span is post-verified byte-exact against the claims; a single mismatch falls back to the extractive answer","read_only":true}],"server_info":{"name":"deai-research","title":"DeAI Artifact Gateway","version":"0.1.0"},"category":"research","tags":[],"kind":"remote","source":"registry","submitted":{},"first_party":false,"domain_rank":null,"score":100,"indexable":true,"first_seen":"2026-10-13","stars":0,"badges":[],"sponsor":null,"page":"https://agentsindex.org/agents/io-github-jake-zaiba-deai-research/"}