{"uid":"cap_A07gEXUFY8OQIiu6Vmg5Q","slug":"shuffle-a-list-fisher-yates-csprng-7b015b2c","name":"Shuffle a List (Fisher-Yates CSPRNG)","description":"60 paid endpoints with no metering, no API key and no account. Each endpoint has one flat price per call, whatever the size of the request: LLM completions with automatic failover across several large models, read-only EVM tooling over Base, Ethereum, Polygon, Arbitrum and Optimism, and pure crypto utilities that touch no network.","url":"https://flat-rate-llm.kikoribera03.workers.dev/v1/random/shuffle","method":"POST","headers":{},"bodySchema":{"type":"object","required":["items"],"properties":{"items":{"type":"string","description":"The list to shuffle, comma-separated. A JSON array of strings is also accepted in a POST body."}}},"responseSchema":{"type":"object","properties":{"count":{"type":"number"},"shuffled":{"type":"array","items":{"type":"object"}}}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.0025","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.0025/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.0025","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.0025","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_7REwjLTxRzuUJMHI9JfNM","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.0025","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Randomly shuffles a comma-separated list into a uniformly random order using the Fisher-Yates algorithm over a cryptographically secure PRNG.","exampleAgentPrompt":"Shuffle this list for me using a cryptographically fair Fisher-Yates shuffle: Alice, Bob, Carol, Dave, Eve, Frank.","exampleUseCases":[{"title":"Random team assignment order","prompt":"I have a list of employees and need to randomly assign presentation order — shuffle this for me: Jordan, Taylor, Morgan, Riley, Casey, Quinn, Avery."},{"title":"Randomized game card draw","prompt":"Shuffle this deck of card names so I can deal them in a truly random order: Ace, King, Queen, Jack, Ten, Nine, Eight, Seven."},{"title":"Fair raffle draw ordering","prompt":"We have 10 raffle entrants and need a cryptographically fair random order for drawing prizes — shuffle this list: Emma, Liam, Olivia, Noah, Ava, Ethan, Sophia, Mason, Isabella, Logan."}],"resultDescription":"Returns a JSON object with 'shuffled' (an array of the input items in a new uniformly random order, guaranteed by Fisher-Yates over a CSPRNG) and 'count' (the number of items in the list).","failureModes":["Missing 'items' parameter returns an error — the comma-separated list is required","Empty list may return an empty shuffled array","Malformed JSON array in POST body returns a parse error","Very large lists may hit request size limits"],"whenToPreferThis":"Choose this endpoint when you need a provably uniform random permutation — sorting by a random key does not produce every permutation with equal probability, but Fisher-Yates does. Ideal when fairness matters (raffles, game logic, assignment queues) and a cryptographically secure source of randomness is required. Prefer over naive client-side shuffles or sort-by-random-key hacks.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T18:52:42.942Z","isFirstParty":false}