{"uid":"cap_P_tbBSCtSarF4bAozXbXy","slug":"one-engine-array-intersection-a4fbc360","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/t7?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.0065","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.0065/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.0065","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.0065","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_JTiOmCKPxiizeYdUztTYV","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.0065","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] — return up to 10 results starting from the first element.","exampleUseCases":[{"title":"Shared tag filtering across datasets","prompt":"I have two lists of product tags — [\"sale\", \"featured\", \"new\", \"trending\"] and [\"featured\", \"trending\", \"clearance\"] — can you find which tags appear in both lists?"},{"title":"Common user ID overlap detection","prompt":"Here are two arrays of user IDs: [101, 202, 303, 404] and [202, 404, 505, 606]. Which user IDs show up in both arrays?"},{"title":"Matching SKU reconciliation","prompt":"I need to find which SKUs are in both my inventory list [\"SKU-A\", \"SKU-B\", \"SKU-C\", \"SKU-D\"] and my order list [\"SKU-B\", \"SKU-D\", \"SKU-E\"] — give me just the overlapping ones."}],"resultDescription":"Returns a JSON object containing the array of elements that are present in both the primary 'values' array and the optional 'other' comparison array. The result reflects only common elements, optionally paginated via size and offset parameters.","failureModes":["Array exceeds 1000 item limit — request rejected","Missing required 'values' field — validation error","Malformed JSON array input — parsing error","Payment failure via x402 — 402 response before computation","Empty intersection — valid response with empty result array"],"whenToPreferThis":"Choose this endpoint when you need a lightweight, pay-per-call set intersection computation without spinning up your own infrastructure. Ideal for autonomous agents that occasionally need to find overlapping elements between two datasets at low cost ($0.0065 USDC). Best when arrays are under 1000 items each and you want a fast, stateless result without storing data.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-02T12:44:11.929Z","isFirstParty":false,"canonicalSlug":"one-engine-array-intersection-47781b97"}