{"uid":"cap_ZX1qaXjcgbvTBuQeX9H9h","slug":"one-engine-array-intersection-814dd8f8","name":"ONE Engine Array Intersection","description":"Low-cost pay-per-call utility APIs for autonomous agents using x402 on Base.","url":"https://one-search.one-engine.workers.dev/v3/array/intersection/t6?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","required":["values"],"properties":{"size":{"type":"integer"},"other":{"type":"array","description":"Optional comparison array"},"offset":{"type":"integer"},"values":{"type":"array","description":"JSON array with at most 1000 items"}}},"responseSchema":{"type":"object","additionalProperties":true},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.004","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.004/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.004","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.004","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_AUy_0czVytOF9QCBKi7hN","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.004","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes the intersection of two arrays, returning elements common to both input arrays.","exampleAgentPrompt":"Find the intersection of these two arrays for me: [1, 2, 3, 4, 5] and [3, 4, 5, 6, 7] — I want to know which numbers appear in both.","exampleUseCases":[{"title":"Shared product tag filtering","prompt":"I have a list of tags on this product: [\"electronics\", \"sale\", \"wireless\", \"portable\"] and a list of tags the user has favorited: [\"sale\", \"portable\", \"outdoor\"]. Which tags appear in both lists?"},{"title":"Common user permission check","prompt":"Given these two permission sets — user permissions: [\"read\", \"write\", \"comment\"] and required permissions: [\"write\", \"admin\", \"comment\"] — tell me which permissions the user actually has from the required list."},{"title":"Overlapping audience segments","prompt":"I have segment A with user IDs [101, 202, 303, 404, 505] and segment B with [303, 404, 606, 707]. Which user IDs appear in both segments?"}],"resultDescription":"Returns a JSON object containing the array of elements that are present in both the primary 'values' array and the 'other' comparison array. Supports pagination via offset and size parameters for large result sets.","failureModes":["Missing required 'values' field returns a 400 error","Arrays exceeding 1000 items are rejected","Payment not included or insufficient USDC triggers a 402 Payment Required response","Malformed JSON body causes parsing error","Empty intersection returns an empty array (not an error)"],"whenToPreferThis":"Choose this endpoint when you need a cheap, fast, pay-per-call array intersection computation without standing up your own infrastructure. Ideal for autonomous agents on Base that need set-theoretic operations on moderate-sized arrays (up to 1000 items) and want to pay micro-amounts in USDC per call rather than subscribe to a service.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-02T12:43:45.507Z","isFirstParty":false,"canonicalSlug":"one-engine-array-intersection-47781b97"}