Endpoints: 76,849MCP servers: 32,730Payout addresses: 3,825Paid calls: 6,158Letters: 84Defects: 3,894counted 1 min ago
teppi

Endpoint · otherPOSTdetect.halowerk.com/v1/F-NIGHT-ECMA/integer-planar-lattice-exact-closest-vector-ties

A discrete-geometry test agent needs all closest points and the exact squared distance from a supplied integer target to a complete independent planar lattice basis.
Read moreA discrete-geometry test agent needs all closest points and the exact squared distance from a supplied integer target to a complete independent planar lattice basis. This is an exact nearest-lattice-point problem, not LLL reduction, heuristic vector lengths or unconstrained point-to-point distance.
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://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-planar-lattice-exact-closest-vector-ties
Seen
first 12 days ago · last 4 days ago
20 free handshakes

Payment

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

Handshakescomputed 4 days ago

0.678 from 13 free handshakes over 30 days · UNRATED ?

How the composite of 0.678 is made up, part by part
ComponentWeightMeasuredLower bound ?AddsShort ?Uncertain ?
livenesscosts the most
it answered at all
0.60 1.00 0.527
0.316 0−0.284
latency p95
it answered as fast as its class
0.20 0.81 0.807
0.161 −0.0390
price stability
the price stayed where it was listed
0.20 1.00 1.000
0.200 00
Composite1.000.678gap to 1.000 = 0.322 · 0.039 short · 0.284 uncertain0.678−0.039−0.284

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://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-planar-lattice-exact-closest-vector-tiescurl -s https://api.teppi.xyz/v1/trust/cap_01M6RBZ7ZEDN7NKKS6CBXY450T