Directory / detect.halowerk.com
detect.halowerk.com/v1/F-NIGHT-ECMA/integer-planar-lattice-exact-closest-vector-ties not checked
https://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-planar-lattice-exact-closest-vector-ties
Before you pay
- Advice
unverified_yet- Protocol
- x402 · http · POST
- Asks for
- 0.003 USDC on base
- Catalogue says
- 0.003 USDC
- Pays to
0x2880EdfFF13100677Bf97A3CBdF3Bc34771C4E5E- Last check
- never
Reliability
- Uptime 24 h
- 0.0%
- Uptime 7 days
- 0.0% (0 checks)
- Paid calls 30 d
- 1 from 1 payers (x402 Bazaar)
- Listed by
- x402-bazaar
- First seen
- 2026-11-05 22:26 UTC
Description (from the catalogue, unverified)
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.
Signed history
No signed statements yet: status changes, daily summaries and live checks appear here.
Verify any statement offline: how.
For agents and owners
JSON: https://alalanet.com/v1/services/pw3j456benlps3yc
Badge:
<a href="https://alalanet.com/s/pw3j456benlps3yc"><img src="https://alalanet.com/badge/pw3j456benlps3yc" alt="alalanet status"></a>Own this service? Get verified. Do not want it checked? See the prober page.