Hub · Entwicklung & APIs

Technische Prüfungen & Formate

2.003 veröffentlichte Endpunkt-URLs. Methoden, Preise, Eingaben und Originaldokumentation auf jeder Detailseite.

detect.halowerk.com · Katalogstand 2026-11-01, 20:49 UTC

Endpunkte

1981–2003 von 2.003

Technische Prüfungen & Formate0,002 USDC
workflow / workflow reduced boolean decision contract
POSThttps://detect.halowerk.com/v1/workflow/workflow-reduced-boolean-decision-contract
An agent that publishes an autonomous feature-policy decision artifact needs its claimed reduced ordered decision-node count and satisfying-assignment count checked against the supplied Boolean expression.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow register linearizability
POSThttps://detect.halowerk.com/v1/workflow/workflow-register-linearizability
An agent that replays concurrent single-register calls needs whether one sequential ordering respects real-time precedence and all returned read values.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow regular trace edit distance
POSThttps://detect.halowerk.com/v1/workflow/workflow-regular-trace-edit-distance
An agent that repairs a finite event trace against a regular contract needs its claimed minimum insertion deletion and substitution cost checked over every accepted trace.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow rendezvous placement correspondence
POSThttps://detect.halowerk.com/v1/workflow/workflow-rendezvous-placement-correspondence
An agent that rebalances deterministic worker ownership needs supplied old and new assignments checked against exact rendezvous hash winners and the number of moved keys.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow replay order cardinality
POSThttps://detect.halowerk.com/v1/workflow/workflow-replay-order-cardinality
An agent that reconstructs a worker event log needs the exact number of full replay orders consistent with all supplied happens-before edges rather than one arbitrary topological ordering.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow resource constrained makespan
POSThttps://detect.halowerk.com/v1/workflow/workflow-resource-constrained-makespan
An agent that schedules a finite artifact build project needs its claimed minimum completion time checked when nonpreemptive tasks compete for renewable resource capacities and obey precedence.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow rga sequence reconstruction
POSThttps://detect.halowerk.com/v1/workflow/workflow-rga-sequence-reconstruction
An agent that merges anchored collaborative sequence operations needs whether its visible insertion identity order agrees with deterministic sibling ordering and retained tombstone anchors.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow rup refutation handover
POSThttps://detect.halowerk.com/v1/workflow/workflow-rup-refutation-handover
An agent that receives an optimizer unsatisfiability artifact needs its claimed RUP proof verification checked through reverse unit propagation additions and explicit clause deletions.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow savepoint rollback transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-savepoint-rollback-transcript
An agent that replays nested transactional edits needs whether supplied value assertions agree with rollback-to and release semantics including repeated savepoint names.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow semaphore deadlock trace
POSThttps://detect.halowerk.com/v1/workflow/workflow-semaphore-deadlock-trace
An agent that audits a normalized resource trace needs dynamic wait-for cycles and ownership violations measured without running tasks.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow shortest route betweenness
POSThttps://detect.halowerk.com/v1/workflow/workflow-shortest-route-betweenness
An agent that places autonomous workflow observation points needs claimed shortest-route intermediary shares checked over all ordered source and target pairs including equal-length alternatives.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow shortest synchronizing word
POSThttps://detect.halowerk.com/v1/workflow/workflow-shortest-synchronizing-word
An agent that resets a finite workflow from an unknown initial state needs the claimed shortest common reset length checked over every possible starting state.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow singleflight cancellation transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-singleflight-cancellation-transcript
An agent that coalesces concurrent paid artifact requests needs claimed execution launches aborts and delivered waiters checked through client cancellation and stale completion generations.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow smith lattice certificate
POSThttps://detect.halowerk.com/v1/workflow/workflow-smith-lattice-certificate
An agent that hands over an integer batch recipe needs its claimed solvability checked against a supplied Smith-normal-form certificate with unimodular row and column transforms.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow stochastic critical path cdf
POSThttps://detect.halowerk.com/v1/workflow/workflow-stochastic-critical-path-cdf
An agent that accepts an artifact pipeline deadline distribution needs its claimed completion probabilities checked while shared predecessor durations remain correlated across every downstream branch.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow strided artifact write overlap
POSThttps://detect.halowerk.com/v1/workflow/workflow-strided-artifact-write-overlap
An agent that parallelizes generated artifact patches needs conflicting strided byte-region pairs identified exactly without expanding millions of offsets into a flat interval list.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow terminal relay tree optimum
POSThttps://detect.halowerk.com/v1/workflow/workflow-terminal-relay-tree-optimum
An agent that connects selected artifact workers through optional relay workers needs its claimed minimum undirected Steiner connection cost checked without forcing every available relay into the plan.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow transition monoid counter freedom
POSThttps://detect.halowerk.com/v1/workflow/workflow-transition-monoid-counter-freedom
An agent that publishes a finite workflow transition table needs its claimed counter-free behavior checked for hidden cyclic permutations induced by arbitrary finite command words.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow transitive reduction claims
POSThttps://detect.halowerk.com/v1/workflow/workflow-transitive-reduction-claims
An agent that publishes a workflow dependency handover needs its claimed irredundant DAG edge set checked against all reachability implied by the original dependencies.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow two phase commit correspondence
POSThttps://detect.halowerk.com/v1/workflow/workflow-two-phase-commit-correspondence
An agent that audits an offline atomic-commit transcript needs participant votes coordinator decisions and applied outcomes checked for contradictory commit paths.
Technische Prüfungen & Formate0,003 USDC
workflow / workflow universal spending bound
POSThttps://detect.halowerk.com/v1/workflow/workflow-universal-spending-bound
API operation: workflow workflow universal spending bound. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow weighted backbone family count
POSThttps://detect.halowerk.com/v1/workflow/workflow-weighted-backbone-family-count
An agent that exports redundant integration backbones needs its claimed weighted count of all spanning trees checked instead of accepting only one cheapest backbone.
Technische Prüfungen & Formate0,003 USDC
xml schema / xsd11 structural particle attribution
POSThttps://detect.halowerk.com/v1/xml-schema/xsd11-structural-particle-attribution
API operation: xml schema xsd11 structural particle attribution. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.