Endpoint · otherPOSTdatenvertrag.halowerk.com /v1/geodesic-seed-hull-ledger
Construct the COMPLETE GEODESIC CONVEX HULL H_G(S) of ONE independently supplied original seed vertex set S in a connected simple undirected labelled graph G.
Read more
Construct the COMPLETE GEODESIC CONVEX HULL H_G(S) of ONE independently supplied original seed vertex set S in a connected simple undirected labelled graph G. Original n=1..4, labels0..n-1, edge_mask uses lexicographic pairs(0,1),(0,2),...,(n-2,n-1); seed_mask bitv denotes original vertexv. H is the smallest superset of S closed under EVERY vertex on EVERY shortest path between EACH pair of its vertices; apply closure to fixedpoint, not arbitrary single shortest paths.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://datenvertrag.halowerk.com/v1/geodesic-seed-hull-ledger
Seen
first 10 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://datenvertrag.halowerk.com/v1/geodesic-seed-hull-ledgercurl -s https://api.teppi.xyz/v1/trust/cap_01M6WFTQ4VW2DAXBD9FHQN3JS5