{"uid":"cap_hcp6PIk40ErUJ6HdPZiH9","slug":"delx-commerce-seeded-pairing-bc4f6b72","name":"Delx Commerce Seeded Pairing","description":"Pay-per-result APIs for agents. No signup. Exact price. Verifiable delivery. USDC on Base + Solana via x402.","url":"https://commerce.delx.ai/api/v1/x402/seeded-pairing?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"seed":{"type":"string","maxLength":8192,"description":"Seed supplied to Seeded Pairing; used only for this bounded calculation and processed in memory without retention."},"participants":{"type":"array","items":{"type":"string","maxLength":8192},"maxItems":256,"description":"Participants supplied to Seeded Pairing; used only for this bounded calculation and processed in memory without retention."}}},"responseSchema":{"type":"json","example":{"result":{"bye":"b","pairs":[["d","a"],["c","e"]]},"schema":"delx/util-seeded-pairing/v1","status":"pass","evidence":{"retained":false,"input_sha256":"0bfb1a13590bf6beabbd01835232e976edb6c53d8cd2ab2a61049c2b2b57645a","external_calls":0},"operation":"seeded_decision:seeded_pairing"}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.001","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.001/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_ofJvu9A0IIOtbn61-jxn7","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.001","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Deterministically pairs a list of participants into matched pairs (with optional bye) using a seed value, returning verifiable, reproducible results.","exampleAgentPrompt":"Pair up these 5 players — Alice, Bob, Carol, Dave, and Eve — into tournament matchups using the seed 'round1-2024', and tell me who gets the bye.","exampleUseCases":[{"title":"Tournament bracket generation","prompt":"I have 8 players for a chess tournament: Magnus, Hikaru, Fabiano, Wesley, Ding, Anish, Ian, and Levon. Use the seed 'chess-open-2024' to pair them up for the first round."},{"title":"Team partner assignment","prompt":"Match these 6 workshop attendees into pairs for the pair-programming exercise — Jordan, Taylor, Morgan, Casey, Riley, and Avery — using the seed 'workshop-day1'."},{"title":"Randomized debate matchups","prompt":"I need verifiable, reproducible debate pairings for these 5 students: Sam, Jamie, Alex, Robin, and Drew. Use seed 'debate-semifinal' so I can prove the matchups weren't manipulated."}],"resultDescription":"Returns a JSON object with a 'pairs' array of two-element arrays (each a matched pair), an optional 'bye' field naming the participant who sits out, an operation identifier, a schema version string, a status of 'pass', and an evidence block containing the SHA-256 hash of the input, a flag confirming no data was retained, and a count of zero external calls — enabling full verifiability of the result.","failureModes":["Participants list exceeds 256 items — request rejected","Seed or participant string exceeds 8192 characters — validation error","Empty participants list — undefined pairing behavior or error response","Malformed JSON body — HTTP 400 bad request","Payment not included or insufficient — HTTP 402 payment required"],"whenToPreferThis":"Choose this endpoint when you need deterministic, reproducible, and verifiably fair pairings — especially when an audit trail matters (e.g. proving no post-hoc manipulation). It is ideal for tournament brackets, partner assignments, and any matchmaking scenario where the same seed + participant list must always yield the same result. Prefer it over ad-hoc random shuffles when reproducibility or verifiability is a requirement, and over complex matchmaking engines when the only constraint is seeded randomness.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-01T00:49:45.764Z","isFirstParty":false,"canonicalSlug":"delx-commerce-seeded-pairing-bc4f6b72"}