{"uid":"cap_V69SnZs6pZ_KlHij28HK_","slug":"coinopselect-code-complexity-analyzer-5ff10d0a","name":"CoinOpSelect Code Complexity Analyzer","description":"Paid on-chain token, wallet, contract and research data over x402 on Base.","url":"https://coinop.publicvm.com/api/v1/code/complexity?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"source":{"type":"string"}}},"responseSchema":{"type":"json","example":{"query":"complexity","report":{}}},"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_27J1lVHoqQd_-pDNG3X8T","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":"Analyzes source code and returns a complexity report for the provided code snippet or file.","exampleAgentPrompt":"Can you analyze this Python function for code complexity and give me a report? Here's the source: def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2)","exampleUseCases":[{"title":"Pre-commit code quality gate","prompt":"Before I merge this pull request, can you run a complexity analysis on this JavaScript function and tell me if it's too complex to maintain? Here's the source code: function processOrder(order) { ... }"},{"title":"Refactoring prioritization","prompt":"I have a legacy Python class I need to refactor — can you check the complexity of this source code and tell me where the most complex parts are so I know what to tackle first?"},{"title":"Algorithm comparison","prompt":"I wrote two versions of a sorting algorithm — can you analyze the complexity of each one and tell me which is simpler? Here's version 1: [code1] and version 2: [code2]"}],"resultDescription":"Returns a JSON object with a 'query' field set to 'complexity' and a 'report' object containing complexity metrics and analysis results for the submitted source code.","failureModes":["Empty or missing 'source' field returns an empty or error report","Malformed source code may produce incomplete or meaningless complexity metrics","Payment failure via x402 protocol results in 402 response before analysis runs","Very large source inputs may time out or return partial results","Non-code text submitted as source may yield nonsensical complexity output"],"whenToPreferThis":"Choose this endpoint when you need a quick, pay-per-use code complexity analysis without setting up a local static analysis tool or CI pipeline integration. It is well-suited for one-off checks, agent-driven code review workflows, or lightweight code quality gates where spinning up a full static analysis suite is overkill.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-21T12:43:51.807Z","isFirstParty":false,"canonicalSlug":"coinopselect-code-complexity-analyzer-5ff10d0a"}