Solve x = a1 (mod m1), x = a2 (mod m2), ... with the Chinese remainder theorem, ...
https://crypto-math.x402tookit.com/crtOverview
Solve x = a1 (mod m1), x = a2 (mod m2), ... with the Chinese remainder theorem, coprime or not.
Protocol
x402
Price
$0.02
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
uncategorized
Provider
Crypto Math
Source
bazaar
Indexed
2026-10-20 21:22:37
Health
Status
healthy
Latency (p50)
575ms
Uptime (30d)
80.0%
Reliability Score
80/100
Last Checked
2026-10-28 06:36:25
Last Healthy
2026-10-28 06:36:25
Consecutive Failures
0
x402 Payment Validation
Payment Requirements
Valid
Asset Verified
Known USDC
Facilitator
—
Input Schema
{
"method": "GET",
"queryParams": {
"congruences": "2:3,3:5,2:7"
},
"type": "http"
}
Output Schema
{
"example": {
"asOf": "2026-10-11T23:46:27.714Z",
"degraded": false,
"disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.",
"equation": "x = 23 (mod 105)",
"equationCount": 3,
"modulus": "105",
"notChecked": [
"that the moduli are pairwise coprime (they need not be; compatibility is checked instead)",
"negative moduli (not accepted)"
],
"reasons": [
"Solved by merging the congruences one at a time with the extended Euclidean algorithm.",
"Every integer x + k*M is also a solution; the smallest non-negative one is returned.",
"…1 more"
],
"source": "generalised Chinese remainder theorem on JavaScript BigInt, computed locally",
"summary": "x = 23 (mod 105).",
"verdict": "COMPUTED",
"x": "23"
},
"type": "json"
}