Endpoints: 76,849MCP servers: 32,730Payout addresses: 3,825Paid calls: 6,166Letters: 84Defects: 3,898counted just now
teppi

Endpoint · researchPOSTdatenvertrag.halowerk.com/v1/minimum-sorting-network-family

For a supplied wire count n0..4, synthesize EVERY minimum-COMPARATOR fixed sorting network.
Read moreFor 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.
UNRATEDListed

Overview

Grade?
UNRATED
0 of 30 paid calls toward a letter
Price
$0.003 per call
Paid calls
none yet
delivery unknown until someone pays

More info

URL
https://datenvertrag.halowerk.com/v1/minimum-sorting-network-family
Seen
first 12 days ago · last 4 days ago
20 free handshakes

Payment

Pays through
x402
Offered on?
Base USDC
Listed on?
Base

Handshakescomputed 2 days ago

0.570 from 16 free handshakes over 30 days · UNRATED ?

How the composite of 0.570 is made up, part by part
ComponentWeightMeasuredLower bound ?AddsShort ?Uncertain ?
livenesscosts the most
it answered at all
0.60 1.00 0.616
0.370 0−0.230
latency p95
it answered as fast as its class
0.20 0.00 0.000
0.000 −0.2000
price stability
the price stayed where it was listed
0.20 1.00 1.000
0.200 00
Composite1.000.570gap to 1.000 = 0.430 · 0.200 short · 0.230 uncertain0.570−0.200−0.230

Not measured: correctness · nobody paid; honesty · nobody paid; schema conformance · no answer had a published shape to check

BURN_INFREE_TIER_ONLY
Verify it yourselfnpx teppi-check https://datenvertrag.halowerk.com/v1/minimum-sorting-network-familycurl -s https://api.teppi.xyz/v1/trust/cap_01M6RBZPMXSGJ4ZV4YK2D5Q27X