{"uid":"cap_TxAzuJcyrSP_x3OSjXYPK","slug":"minia2a-binary-search-8e46969a","name":"minia2a Binary Search","description":"minia2a service: x402-binary-search","url":"https://minia2a.uk/x402/x402-binary-search","method":"GET","headers":{},"bodySchema":{"type":"object","required":["input"],"properties":{"input":{"type":"object","properties":{"type":{"type":"string"},"method":{"type":"string"},"bodyType":{"type":"string"},"queryParams":{"type":"object"}}},"output":{"type":"object","properties":{"type":{"type":"string"}}}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.01","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.01/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.01","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.01","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_uO3dxo13pxINf-fBmmnKi","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.01","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Performs a binary search algorithm on a provided input, returning the search result via a pay-per-call x402 API.","exampleAgentPrompt":"Run a binary search on my sorted array to find the index of the target value 42 — the array is [1, 5, 12, 23, 42, 67, 89].","exampleUseCases":[{"title":"Find index in sorted dataset","prompt":"I have a sorted list of product IDs [101, 204, 317, 456, 589, 672] and I need to find the position of ID 317 using binary search — can you do that?"},{"title":"Efficient lookup in large sorted list","prompt":"I've got a sorted array of a million integers and I need to quickly find where the value 750000 appears — use binary search to locate it."},{"title":"Verify element presence in sorted sequence","prompt":"Check if the number 99 exists in this sorted array [2, 15, 33, 56, 78, 99, 134] and tell me its index using binary search."}],"resultDescription":"Returns the result of a binary search operation on the provided input, typically including the index or position of the target value in the sorted collection, or an indication that the value was not found.","failureModes":["Input array not sorted — binary search yields incorrect results","Target value not found in the array — returns not-found indicator","Missing or malformed 'input' query parameter — returns 400 error","Unsupported input type or format — schema mismatch error","Payment not processed — 402 Payment Required returned before executing search"],"whenToPreferThis":"Choose this endpoint when you need a simple, on-demand binary search computation as a service without running your own algorithm infrastructure. It is ideal for agents that need occasional efficient lookups on sorted datasets and prefer a pay-per-call model over maintaining in-house search utilities. Useful for prototyping or low-volume scenarios where spinning up a full search service is overkill.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T00:44:58.050Z","isFirstParty":false}