AI Decision System
Replayable, offline-verifiable records for AI-assisted go/no-go decisions: experiment promotions, typed model answers and human-approved actions.
A supercomputer's worth of work, done by a crowd. Every result verified, settled on Solana.
Translation pending
Developer toolsTypeScript · RustGitHub @kotebiboOnlineOwner unconfirmed
Have you tried it? One tap is enough. No sign-in needed.
No updates detected yet. GitHub releases will appear here.
Owners of public repositories under a personal GitHub account can sign in to verify ownership and manage the introduction themselves. No administrator approval is needed.
Sign in, generate a verification file, and commit it to this repository’s default branch within 30 minutes. Files on other branches or forks do not count. Then check the file below to manage the project without administrator approval. Keep the file to retain your access.
If needed, you will go to sign-in. After signing in, return here and press your chosen verification button again.
Run /nomorevibe verify in your project folder to verify ownership and manage the introduction yourself.
Verify in one minuteAsk about other verification options
Verifiable distributed compute marketplace on Solana — contributors run search chunks in-browser via WASM, a CLI, or a Tauri desktop app and are paid per verified chunk, with 0.45% verification overhead instead of replication's ~200%.
Taken from the repository README
Loading the full README. The saved excerpt is shown below.
Verifiable distributed search compute — live at sievework.com.
Fund a brute-force search job; contributors run chunks of the search space on their own hardware — in the browser via WebAssembly, a native CLI, or a native desktop app (CPU, with a GPU kernel for hash-grind) — and get paid per verified chunk on Solana (devnet). Every discovery is permanently attributed on-chain to whoever found it. Verification is deterministic and publicly reproducible at ~0.9% measured overhead (at a 10% audit rate), versus the ~200% of replication-based approaches.Read the full README ↗Verifiable distributed search compute — live at sievework.com.
▶ Watch the pitch — 1:46. What it is, why verification is the hard part, and a run on devnet end to end.
Fund a brute-force search job; contributors run chunks of the search space on their own hardware — in the browser via WebAssembly, a native CLI, or a native desktop app (CPU, with a GPU kernel for hash-grind) — and get paid per verified chunk on Solana (devnet). Every discovery is permanently attributed on-chain to whoever found it. Verification is deterministic and publicly reproducible at ~0.9% measured overhead (at a 10% audit rate), versus the ~200% of replication-based approaches.
New here? ARCHITECTURE.md is the one-page system map — components, the four verification surfaces, the on-chain money/trust flow, and the honest trust boundaries.
The class of problem served: hard to find, easy to check — compact inputs, deterministic evaluation, and a witness anyone can re-verify in microseconds. Launch vertical: Minecraft seedfinding (via cubiomes, MIT). The platform itself is game-agnostic.
The coordinator verifies with the identical WASM artifact workers run, pinned by content hash (worker_spec_hash), making worker/verifier drift impossible by construction.
| Path | Purpose |
|---|---|
apps/web | Next.js app — bounty board, live job detail, in-browser worker (Vercel) |
apps/coordinator | Fastify service — leasing, verification, SSE, voucher signing (Fly.io) |
apps/cli | Native CLI worker — lease → evaluate → merkle commit → sign → submit |
packages/protocol | The public interface: message schemas, canonical JSON, wallet signatures |
packages/merkle | Commitment tree shared verbatim by workers and the verifier |
packages/worker-core | C wrapper over vendored cubiomes; builds to native binary and WASM |
packages/wasm-runtime | Hash-verifying WASM loader used by browsers and the coordinator |
programs/sieveworks | Anchor program: find attribution, escrow, stake, claim vouchers |
supabase/migrations | Postgres schema with RLS (honeypots and rejection reasons are dark) |
pnpm install
pnpm build # turbo builds packages in dependency order
pnpm --filter @sieveworks/worker-core test # native-vs-WASM determinism test
cd apps/web && pnpm dev # local web against the live coordinator
The platform above shipped solo in 7 days (Aug 24–31, tag pre-cwf marks that baseline). Everything after the tag is Crypto World's Fair work — tracked in CHANGELOG.md and specced in plans/cwf/:
output_hash recompute-audit (rendering) and checkpointed-trajectory training verification (evolutionary compute)Originally built for the Solana hackathon, August 2026.
Sieveworks is open source under the MIT license, built in the open as a public good. The value is the mechanism — a cheap, publicly reproducible way to verify untrusted compute (~1% overhead instead of ~200% redundancy) — and it is most useful if anyone can audit, fork, and build on it. Every verified record ships a public audit recipe you can re-run against the pinned WASM artifact, so the verification is checkable by anyone, not just taken on trust. Contributions welcome — see CONTRIBUTING.md.