{"uid":"cap_ZKTVS9zHyYLfeMO4YeyEI","slug":"delx-seeded-rendezvous-rank-ecdf5e62","name":"Delx Seeded Rendezvous Rank","description":"Seeded Rendezvous Rank: Seeded Rendezvous Rank ranks nodes for a key using reproducible rendezvous hashing from bounded caller-supplied values without an external provider. Call Seeded Rendezvous Rank when an agent needs a reproducible decision that another run can independently replay. Returns the deterministic selection plus seed provenance, population bounds, and the operation-specific outcome for Seeded Rendezvous Rank as versioned deterministic JSON. Price: $0.001 USDC via x402 on Base. Fi…","url":"https://api.delx.ai/api/v1/x402/seeded-rendezvous-rank","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"key":{"type":"string","maxLength":8192,"description":"Key supplied to Seeded Rendezvous Rank; used only for this bounded calculation and processed in memory without retention."},"seed":{"type":"string","maxLength":8192,"description":"Seed supplied to Seeded Rendezvous Rank; used only for this bounded calculation and processed in memory without retention."},"nodes":{"type":"array","items":{"type":"string","maxLength":8192},"maxItems":256,"description":"Nodes supplied to Seeded Rendezvous Rank; used only for this bounded calculation and processed in memory without retention."}}},"responseSchema":{"type":"json","example":{"result":{"selected":"n2","ranked_nodes":[{"node":"n2","score":"bd039453c0ba9edb4613bcc40672868b77523fa05df3607d1284201813691a3e"},{"node":"n1","score":"444f37c2bc2a0abc09cffc79afebfd08a086442085bfb9f26fa31b239deaca4b"},{"node":"n3","score":"17909b5cada1fd90f21c1c871bf21f5be354a535f741ad9ea9879a42922989f9"}]},"schema":"delx/util-seeded-rendezvous-rank/v1","status":"pass","evidence":{"retained":false,"input_sha256":"3351b84ac1d977aa3f2c82a51fd28b618a255b972578172462ff51b4c20cf1b2","external_calls":0},"operation":"seeded_decision:seeded_rendezvous_rank"}},"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_6T7i1h4dnlxxjVLg13vyO","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":"Ranks a list of nodes by deterministic seeded rendezvous hashing to consistently select and order nodes given a key and seed.","exampleAgentPrompt":"I have a list of nodes ['n1', 'n2', 'n3'] and need to deterministically pick which one should handle the key 'user-42' — use seeded rendezvous ranking with seed 'myseed2024' and give me the full ranked order.","exampleUseCases":[{"title":"Stable shard assignment for user data","prompt":"I need to consistently route user 'user-9871' to the same database shard every time — rank these shards ['shard-a', 'shard-b', 'shard-c'] using seeded rendezvous hashing with key 'user-9871' and seed 'db-routing-v1'."},{"title":"Agent task assignment across workers","prompt":"I have three agent workers ['worker-alpha', 'worker-beta', 'worker-gamma'] and need to deterministically assign task 'job-55123' to one of them — can you do a seeded rendezvous rank with that key and seed 'task-dispatch-2024'?"},{"title":"Reproducible node selection for cache lookup","prompt":"For cache key 'product-catalog-v3', rank these cache nodes ['cache-us-east', 'cache-us-west', 'cache-eu'] using seeded rendezvous hashing with seed 'cache-ring-seed' so I always hit the same node."}],"resultDescription":"Returns the top-selected node, a full ranked list of all nodes each with their deterministic rendezvous hash score, plus evidence metadata including whether any data was retained (always false), the input SHA-256 hash, and number of external calls made (always zero).","failureModes":["Empty nodes array returns no selection","Nodes or key exceeding 8192 character limit rejected","More than 256 nodes in array rejected","Missing required fields (key, seed, nodes) may cause validation error","Payment failure (402) if USDC balance insufficient"],"whenToPreferThis":"Choose this endpoint when you need deterministic, reproducible node selection or ranking given a key and seed — ideal for consistent hashing, sharding, load balancing, or task routing where the same key must always map to the same node. Prefer over random selection when reproducibility and coordination-free routing matter. Use when privacy is important, as inputs are processed in memory with no retention.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T19:01:06.272Z","isFirstParty":false}