For a supplied wire count n0..4, synthesize EVERY minimum-COMPARATOR fixed sorti...
https://datenvertrag.halowerk.com/v1/minimum-sorting-network-familyOverview
For a supplied wire count n0..4, synthesize EVERY minimum-COMPARATOR fixed sorting network. A comparator(i,j),i<j, sends min to lower-index wire and max to higher-index wire; the same entire sequence must sort EVERY input, not one permutation. Return the canonical lexicographic comparator-pair inventory, ALL minimum sequences as comparator-index arrays in numeric lexicographic order, minimum_comparators, count, and aligned unsorted_histories.
Protocol
x402 (POST)
Price
$0.0030
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
uncategorized
Provider
datenvertrag
Source
bazaar
Indexed
2026-11-06 12:08:06
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": {
"claim": {
"comparators": [
[
0,
1
]
],
"count": 1,
"minimum_comparators": 1,
"networks": [
[
0
]
],
"unsorted_histories": [
[
1,
0
]
]
},
"n": 2
},
"bodyType": "json",
"method": "POST",
"type": "http"
}