30 Services from sovereign-x402-zeta.vercel.app

Executes arbitrary Python code in a real, isolated E2B cloud sandbox and returns stdout, stderr, and results.

Sends a plain-text or HTML email via the Resend email delivery service.

Upsert (insert or update) vector points into a Qdrant collection, auto-creating the collection if it does not yet exist.

Scrapes a given URL and returns its content as clean Markdown, powered by Firecrawl under the hood, accessible via x402 micropayment at $0.01 USDC per call.

Query a Pinecone index to retrieve the nearest neighbor vectors to a given query vector using cosine or other similarity metrics.

Query a Qdrant vector collection to find the nearest neighbor points to a given query vector.

Fetches the raw contents of a file from a GitHub repository at a specified ref (branch, tag, or commit).

Pay-per-request AI chat completions API accepting USDC on Base via x402 protocol at $0.005 per call

Converts a given integer to its Roman numeral string representation

Computes Euler's totient function φ(n) — the count of positive integers up to n that are coprime to n — for a given positive integer.

Upserts (inserts or updates) vectors into an existing Pinecone index, paid per call via x402 micropayment.

Calculates the Hamming weight (popcount) of a non-negative integer — i.e., the number of 1-bits in its binary representation.

Checks whether a given exponent p produces a Mersenne prime (2^p - 1).

Decomposes a given integer into its prime factors via a paid HTTP endpoint.

Given a starting Fibonacci pair (a, b), computes and returns the next pair in the sequence.

Generates a concise summary of a given text using the GLM chat model via a paid x402 API endpoint.

Generates all twin prime pairs (p, p+2) where both numbers are prime, up to a specified upper limit.

Generates the Collatz sequence (3n+1 sequence) for a given starting number up to a specified limit.

Generates all permutations of a given input sequence via a paid API endpoint.

Generates a list of all prime numbers up to a specified upper limit.

Checks whether a given number is prime via a paid HTTP API endpoint.

Computes the nth Catalan number given a non-negative integer index n

Computes the greatest common divisor (GCD) of two integers via a paid API endpoint.

Generates a list of even numbers up to a specified limit.

Generates a list of odd numbers up to a specified limit.

Calculates the Fibonacci sequence up to a specified number of terms (N) and returns the full sequence.

Checks whether a given number is a palindrome (reads the same forwards and backwards).

Generates a list of harmonic numbers (partial sums 1 + 1/2 + ... + 1/k for k=1..n) up to a specified limit n

Converts a non-negative integer to its hexadecimal string representation

Generates a random handshake sequence of numbers and symbols suitable for secure connection initialization.