{"uid":"cap_EzWfiT8lgu8TRSPM-BBpE","slug":"minia2a-primitive-root-checker-619312bd","name":"minia2a Primitive Root Checker","description":"Is Primitive Root","url":"https://minia2a.uk/x402/isPrimitiveRoot?utm_source=zero.xyz","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":{"type":"json","example":{"ok":true},"answerAt":"result"},"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_W32TVP1jQBVIg_5Yjc-8C","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":"Checks whether a given integer is a primitive root modulo some modulus (number theory computation)","exampleAgentPrompt":"Can you check if 3 is a primitive root modulo 7?","exampleUseCases":[{"title":"Cryptographic key parameter validation","prompt":"I'm setting up a Diffie-Hellman key exchange and need to verify that 2 is a primitive root modulo 23 — can you check that for me?"},{"title":"Number theory homework check","prompt":"My discrete math homework asks me to find all primitive roots mod 11 — can you check if 2, 3, and 5 are primitive roots modulo 11?"},{"title":"Algorithm debugging for modular arithmetic","prompt":"I'm writing a finite field generator and need to confirm that 5 is a primitive root modulo 17 before I use it as my generator element."}],"resultDescription":"Returns a boolean or similar result indicating whether the provided integer is a primitive root modulo the given modulus, based on number theory computation.","failureModes":["Missing or invalid input number returns an error","Non-integer or non-positive input may be rejected","Very large numbers may time out or be unsupported","Missing modulus parameter causes computation failure"],"whenToPreferThis":"Use this endpoint when you need a quick, paid API check for primitive root status in modular arithmetic — suitable for cryptographic parameter validation, discrete math problems, or finite field construction where you need a reliable remote computation without implementing the algorithm yourself.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-29T07:21:42.017Z","isFirstParty":false,"canonicalSlug":"minia2a-primitive-root-checker-619312bd"}