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 more
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. This is an exact nearest-lattice-point problem, not LLL reduction, heuristic vector lengths or unconstrained point-to-point distance.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
Seller?
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
Paid calls
No paid calls yet.
Delivery is unknown until someone pays. A handshake only shows it asks for payment.
Verify it yourself
npx 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