Adjacency Cospectral Graph Family
Given n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order, n+1 entries, leading1, each-120..120. Any well-formed monic polynomial is accepted; an unrealizable polynomial gives a known empty family, not unknown.
POST https://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-family
0.003 USDC on Base · payTo 0x2880EdfFF13100677Bf97A3CBdF3Bc34771C4E5E
Status: verified · payable
Operator badge: embed this endpoint's live status badge — it reads "Verified Payable" only while the probe record backs it.
Settlement: direct to the seller's payTo — 0% HIVE402 take
Payment routes
{
"claimed_graph_codes": [
15,
54,
90,
108,
113,
149,
163,
281,
323,
396,
402,
480,
553,
581,
650,
676,
720,
774,
816,
840
],
"coefficients": [
1,
0,
-4,
0,
0,
0
],
"n": 5
}Script Master Labs LLC · SDVOSB · Kinston, NC · Terms · Refunds · Privacy · Contact
SML network: ScriptMasterLabs — the main site · SML Dual Market — the human storefront · VA Ratings — VA disability ratings, free for veterans
Agent intel 
| Trust score | 71 / 100 · breakdown |
|---|---|
| Probe uptime (30d) | 100.0% over 1 probes · daily |
| Avg 402 latency | 1065 ms |
| Paid calls (30d, on-chain) | 50 calls · 6 buyers · shared price cohort of 2186 |
How to call
POST https://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-family · input in body · spec from live-challenge
Input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"coefficients",
"claimed_graph_codes"
],
"properties": {
"n": {
"type": [
"integer",
"null"
],
"minimum": 1,
"maximum": 5
},
"coefficients": {
"anyOf": [
{
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": -120,
"maximum": 120
},
"minItems": 2
},
{
"type": "null"
}
]
},
"claimed_graph_codes": {
"anyOf": [
{
"type": "array",
"maxItems": 1024,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1023
}
},
{
"type": "null"
}
]
}
}
}curl -i -X POST 'https://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-family' \
-H 'content-type: application/json' -d '{"n":5,"coefficients":[1,0,-4,0,0,0],"claimed_graph_codes":[15,54,90,108,113,149,163,281,323,396,402,480,553,581,650,676,720,774,816,840]}'
Agents: POST https://hive402.scriptmasterlabs.com/mcp → route_task / proxy_call · SDK /sdk/hive402.mjs