Endpoint · computePOSTnumtheory.openverbs.com /v1/totient
Euler's totient φ(n) — the count of integers in [1, n] coprime to n — for a positive integer ≤ 10^15 (it is computed from the prime factorization).
Overview
Grade?
UNRATED
0 of 30 paid calls toward a letter
Price
$0.004 per call
Paid calls
none yet
delivery unknown until someone pays
More info
Seller?
URL
https://numtheory.openverbs.com/v1/totient
Seen
first 2 months ago · last 29 days ago
81 free handshakes
Payment
Pays through
x402 · MPP evm, tempo
Offered on?
Base USDC, Tempo 0x8335…2913
Listed on?
Base
Handshakescomputed 16 days ago
0.668 from 28 free handshakes over 30 days · UNRATED ?
| Component | Weight | Measured | Lower bound ? | Adds | Short ? | Uncertain ? | |
|---|---|---|---|---|---|---|---|
| latency p95costs the most it answered as fast as its class |
0.20 | 0.00 | 0.000 | 0.000 | −0.200 | 0 | |
| liveness it answered at all |
0.60 | 1.00 | 0.780 | 0.468 | 0 | −0.132 | |
| price stability the price stayed where it was listed |
0.20 | 1.00 | 1.000 | 0.200 | 0 | 0 | |
| Composite | 1.00 | 0.668 | gap to 1.000 = 0.332 · 0.200 short · 0.132 uncertain | 0.668 | −0.200 | −0.132 |
Not measured: correctness · nobody paid; honesty · nobody paid; schema conformance · no answer had a published shape to check
BURN_INFREE_TIER_ONLY
Verify it yourself
npx teppi-check https://numtheory.openverbs.com/v1/totientcurl -s https://api.teppi.xyz/v1/trust/cap_01M1TKXT6H3ZQAGW21VK0SA44H