An agent that partitions a precedence workflow into independent sequential work ...
https://detect.halowerk.com/v1/workflow/workflow-minimum-sequential-chain-coverOverview
An agent that partitions a precedence workflow into independent sequential work lanes needs its claimed lane count checked against the minimum chain cover of the complete transitive order.
Protocol
x402 (POST)
Price
$0.0020
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
uncategorized
Provider
detect
Source
bazaar
Indexed
2026-11-02 17:26:37
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": {
"before": [
[
0,
1
],
[
1,
2
]
],
"claimed_chains": 1,
"states": 3
}
},
"bodyType": "json",
"method": "POST",
"type": "http"
}
Output Schema
{
"example": {
"billable": true,
"findings": [
{
"confidence": 100,
"evidence": [
{
"page_indices": [],
"page_url": null,
"pattern": "workflow-minimum-sequential-chain-cover_scoped_evidence",
"type": "artifact"
}
],
"limits": [
"Only explicitly supplied normalized JSON artifacts are examined; no network request or runtime execution occurs.",
"Only finite acyclic precedence is supported. Comparable states may share one sequential chain even when their relation is transitive rather than an explicit edge. Reachability closure followed by bipartite augmentation gives the exact minimum; it does not schedule durations or capacities."
],
"module": "workflow-minimum-sequential-chain-cover",
"module_cpu_ms": 0,
"state": "not_observed",
"value": {
"claimed_chain_count_mismatch": false,
"maximum_precedence_matching": 2,
"minimum_sequential_chains": 1,
"workflow_states": 3
},
"warnings": []
}
],
"known_count": 1,
"scope": {
"contact_values_returned": false,
"network": false,
"supplied_artifact_only": true
},
"warnings": []
},
"type": "json"
}