A finite-field algebra conformance agent needs every irreducible factor and mult...
https://detect.halowerk.com/v1/F-B-NIGHT-FINITE-STRUCTURES/finite-prime-field-complete-polynomial-factorizationOverview
A finite-field algebra conformance agent needs every irreducible factor and multiplicity of a full polynomial, including repeated factors invisible to a boolean irreducibility result.
Protocol
x402 (POST)
Price
$0.0030
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
uncategorized
Provider
detect
Source
bazaar
Indexed
2026-11-02 17:26:22
Health
Status
unknown
Latency (p50)
—
Uptime (30d)
—
Reliability Score
—
Last Checked
Never
Last Healthy
Never
Consecutive Failures
0
x402 Payment Validation
Payment Requirements
—
Asset Verified
—
Facilitator
—
Input Schema
{
"body": {
"artifact": {
"factor": {
"claim": [
{
"multiplicity": 2,
"polynomial": [
0,
1
]
}
],
"polynomial": [
0,
1
],
"prime": 2
}
}
},
"bodyType": "json",
"method": "POST",
"type": "http"
}
Output Schema
{
"example": {
"billable": true,
"findings": [
{
"confidence": 95,
"evidence": [
{
"page_indices": [],
"page_url": null,
"pattern": "finite-prime-field-complete-polynomial-factorization_scoped_evidence",
"type": "artifact"
}
],
"limits": [
"Canonical ascending coefficients, monic degree0–6, p=2/3/5/7. Unit1 has empty factorization. Factor order degree then lexicographic ascending coefficient vector; multiplicities positive. No integer/rational factoring or final-answer SDK call."
],
"module": "finite-prime-field-complete-polynomial-factorization",
"state": "observed",
"value": {
"claim_matches": false,
"degree": 1,
"factors": [
{
"multiplicity": 1,
"polynomial": [
0,
1
]
}
],
"square_free": true
},
"warnings": []
}
],
"known_count": 1,
"scope": {
"contact_values_returned": false,
"network": false,
"supplied_artifact_only": true
},
"warnings": []
},
"type": "json"
}