datenvertrag.halowerk.com

Checks and payment terms on this page refer to the endpoint above. Other listed endpoints have not been checked individually.

Base URLhttps://datenvertrag.halowerk.com/v1

• POST/transaction-fragment-rank-audit$0.003Check a supplied multi-collection CDC transaction fragment set against END event counts and coupled global/per-collection ordinal positions before downstream assembly. Caller groups normalized fragments first;raw BEGIN/END IDs are never inferred. Missing evidence remains unknown;known rank/count contradictions take precedence. Schema-valid unknown has the same fixed price;invalid input requires nativeHTTP400 before settlement.
• POST/graph-burning-optimal-sequence-inventory$0.003For an original simple undirected labelled graph on0..6vertices, return its minimum number of burning rounds and ALLoptimal ordered sourcevertex sequences in numeric lexicographic order. Eachround chooses one vertex unburned at START of round, while vertices burned in preceding rounds spread to neighbors; the justselected source does not spread until next round. Originaledges require0<=u<v<n,no duplicates. Emptygraph convention number0 andoneemptysequence. Disconnectedgraphs accepted.
• POST/finite-group-class-sum-algebra$0.003For a complete valid1..6element finite group Cayleytable on labels0..n-1 with identity at ANYlabel, derive its integral center basis of conjugacy-class sums and ALL multiplication structure constants c[i][j][k] in Ki*Kj=sum_k c[i][j][k]Kk. Classes/members are ordered by numeric leastlabel/ascendinglabel. Coefficients count pairs with product a FIXED element of outputclass, not totalpairs in that class; equivalently total divided by outputclasssize.
• POST/partition-hook-multiset-inverse-family$0.003Given an original multiset of0..20positive hooklengths each1..20, reconstruct EVERY integer partition of that cellcount whose English Ferrers diagram has exactly that hookmultiset. Hook counts self plus cells strictlyright and strictlybelow. Return all shapes in numeric lexicographic order, complete rowaligned hooktableau for each shape, exact familycount.
• POST/scd2-validity-ledger$0.003Check a bounded corrected dimension history before a data agent publishes it. Caller-supplied pseudonyms/hashes only; no external identity claim. Conflicting selected hashes yield not_observed; missing coverage yields unknown. A schema-valid unknown is a successful result at the same fixed price. Invalid input must raise native HTTP 400 before settlement.
• POST/line-mass-transport-audit$0.003For two strictly position-sorted positive-integer mass histograms with1..8bins, coordinates-32..32 and equal totalmass1..32, construct the full canonical monotone quantile coupling matrix. Return raw mass-times-distance L1cost, reduced rational normalized W1 and every interval of the absolute-CDF-imbalance cost witness. Compare the whole supplied canonical artifact by fieldname with ordered matrix/segment arrays.
• POST/literal-like-pattern-witness$0.003Decide whole-string LIKE membership for caller-supplied nonnull text, pattern and explicit escape, returning parsed tokens and a deterministic shortest-percent-span witness. Bounded Unicode scalar codepoint literal equality profile: underscore consumes exactly one codepoint, percent consumes zero or more. No ILIKE, locale/nondeterministic collation, SQL literal parser, database execution or vendor conformance assertion.
• POST/delta-dv-replacement-precondition$0.003Check the two named atomic logical-file replacement preconditions before a data writer proposes a new deletion-vector identity for an existing physical file. Checks only per-path action multiplicity and exact prior-DV retirement; observed is not full Delta commit validity. Pseudonym metadata only,no file access or changes. Schema-valid unknown is successful at the same fixed price;invalid input requires native400 before settlement.
• POST/gaussian-euclidean-trace-audit$0.003Reconstruct the entire exact Euclidean division trace for two Gaussian integers, including every quotient/remainder/norm, canonical first-quadrant gcd and unit-rotated Bezout coefficients. Coordinates -128..128; componentwise nearest quotient with half ties toward positive infinity; nonzero canonical gcd real>0,imag>=0, deterministic zero-zero convention. Compare the whole supplied claimed artifact, independent of object-key order.
• POST/exact-bezier-subdivision-audit$0.003Subdivide one planar Bezier curve with2..6integercontrolpoints[-20,20] at explicit rational t0..1 numerator0..denominator<=8. Return normalizedparameter,every intermediate deCasteljau triangle coordinate,and complete same-degree left/right child controlpolygons oriented from original start to split and split to original end. Every coordinate is an exact reduced signed-numerator/positive-denominator decimal-string pair;split point included.
• POST/binary-automaton-reset-word-ledger$0.003Given the original total binary transition table of a deterministic automaton with 1..4 states, reconstruct every reachable state subset and labelled transition, the minimum reset-word length, the exact number of shortest binary words, the lexicographically first word and its full image trace. Distinct symbol words remain distinct when they reach the same subset. A one-state automaton resets by the empty word. Claim -1 means no reset word; null claim or missing table remains unknown.

A dash means the listing gives no price or method. Copy buttons copy the full URL.

Showing 11 of 11 listed endpoints.