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

1921–1980 von 2.003

Technische Prüfungen & Formate0,002 USDC
workflow / workflow directed arborescence optimum
POSThttps://detect.halowerk.com/v1/workflow/workflow-directed-arborescence-optimum
An agent that wires a rooted artifact replication plan needs its claimed minimum directed arborescence cost checked while every worker receives one incoming handover and remains reachable from the root.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow dominant resource fair allocation
POSThttps://detect.halowerk.com/v1/workflow/workflow-dominant-resource-fair-allocation
An agent that divides a fixed multi-resource build pool needs its claimed weighted dominant-resource-fair continuous allocation checked across all capacity bottlenecks.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow epoch reclamation transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-epoch-reclamation-transcript
An agent that validates a workflow runtime handover needs its claimed retirement reclamation permissions checked against active epoch read sections and explicit epoch advances.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow erlang c wait claims
POSThttps://detect.halowerk.com/v1/workflow/workflow-erlang-c-wait-claims
An agent that models a pooled artifact worker queue needs its claimed stationary waiting probability and mean queue wait checked under the explicitly declared stable Poisson-arrival exponential-service model.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow eulerian replay cardinality
POSThttps://detect.halowerk.com/v1/workflow/workflow-eulerian-replay-cardinality
An agent that replays every labeled transition record exactly once needs its claimed number of valid start-to-end replay trails checked for the complete directed multigraph.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow event transducer functionality
POSThttps://detect.halowerk.com/v1/workflow/workflow-event-transducer-functionality
An agent that generates event-normalization adapters needs whether every accepted input event word has one output word despite nondeterministic internal branches.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow exact terminal reliability
POSThttps://detect.halowerk.com/v1/workflow/workflow-exact-terminal-reliability
An agent that accepts a replicated artifact delivery topology needs its claimed terminal connectivity probability checked over all independently available supplied links.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow exclusive join deadlock
POSThttps://detect.halowerk.com/v1/workflow/workflow-exclusive-join-deadlock
An agent that imports a workflow needs all-of joins requiring members from distinct arms of an explicit exclusive fork detected.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow fanout amplification
POSThttps://detect.halowerk.com/v1/workflow/workflow-fanout-amplification
An agent that caps workflow execution counts needs propagated invocation counts across multiplicative all-fire edges compared with per-node limits.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow fcfs queue
POSThttps://detect.halowerk.com/v1/workflow/workflow-fcfs-queue
An agent that models a bounded worker queue needs claimed job acceptance reconciled with a single-server first-come policy and an explicit waiting-buffer capacity.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow fencing token transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-fencing-token-transcript
An agent that audits a finite fenced-write contract needs stale owner or epoch acceptance claims separated from merely monotone progress numbers.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow fifo protocol composition
POSThttps://detect.halowerk.com/v1/workflow/workflow-fifo-protocol-composition
An agent that composes two asynchronous workflow peers needs reachable blocked states identified with ordered bounded channels rather than unordered token counts.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow finite horizon policy value
POSThttps://detect.halowerk.com/v1/workflow/workflow-finite-horizon-policy-value
An agent that chooses adaptive artifact processing actions needs its claimed optimal expected finite-horizon reward checked across every supplied probabilistic transition rather than evaluating one fixed policy.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow finite temporal contract
POSThttps://detect.halowerk.com/v1/workflow/workflow-finite-temporal-contract
An agent that accepts an autonomous worker trace needs whether its complete finite event record satisfies the supplied temporal contract including next until eventually and always.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow fixed point pid actuator transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-fixed-point-pid-actuator-transcript
An agent that replays an autonomous admission or actuator controller needs supplied integer command claims checked against explicit proportional integral derivative gains and conditional anti-windup.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow fixed priority response
POSThttps://detect.halowerk.com/v1/workflow/workflow-fixed-priority-response
An agent that orders workflow task priorities needs least fixed-point interference bounds compared with explicit deadlines rather than an EDF or dependency-path result.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow generic port type unification
POSThttps://detect.halowerk.com/v1/workflow/workflow-generic-port-type-unification
An agent that connects generic tool input and output ports needs whether all supplied type equations have a finite first-order solution before any tool executes.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow global link cut certificate
POSThttps://detect.halowerk.com/v1/workflow/workflow-global-link-cut-certificate
An agent that reviews an autonomous replication topology needs whether its claimed separating vertex partition reaches the smallest total explicit link weight over every nontrivial partition.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow happens before access pairs
POSThttps://detect.halowerk.com/v1/workflow/workflow-happens-before-access-pairs
An agent that parallelizes autonomous artifact transformations needs conflicting supplied read/write pairs counted when fork join and mutex synchronization do not order them.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow hedged call policy correspondence
POSThttps://detect.halowerk.com/v1/workflow/workflow-hedged-call-policy-correspondence
An agent that budgets speculative autonomous provider calls needs claimed launches completion times cancellation counts and result states checked against one explicit hedge delay and deadline.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow hmm viterbi path
POSThttps://detect.halowerk.com/v1/workflow/workflow-hmm-viterbi-path
An agent that decodes a finite observation sequence needs whether its claimed hidden-state path reaches the exact maximum product likelihood under supplied integer transition and emission weights.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow hybrid logical clock transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-hybrid-logical-clock-transcript
An agent that merges autonomous worker event clocks needs supplied hybrid timestamp claims checked through physical clock reversals ties and remote logical counter merges.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow interval race determinism
POSThttps://detect.halowerk.com/v1/workflow/workflow-interval-race-determinism
An agent that chooses a timeout race contract needs whether independently selectable integer completion intervals can produce different winning outcomes.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow join semilattice laws
POSThttps://detect.halowerk.com/v1/workflow/workflow-join-semilattice-laws
An agent that publishes a finite merge policy needs exhaustive associativity commutativity and idempotence counts over its explicit binary operation table.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow language inclusion
POSThttps://detect.halowerk.com/v1/workflow/workflow-language-inclusion
An agent that changes a deterministic event contract needs whether every accepted old trace is still accepted by the new contract and the shortest counterexample length.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow lasso fairness
POSThttps://detect.halowerk.com/v1/workflow/workflow-lasso-fairness
An agent that specifies an infinite repeating schedule needs continuously or recurrently enabled tasks that never execute in the supplied loop counted.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow lower bound circulation
POSThttps://detect.halowerk.com/v1/workflow/workflow-lower-bound-circulation
An agent that allocates steady workflow throughput needs whether all directed lower and upper edge bounds can be satisfied while conserving flow at each declared junction.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow markov target probability
POSThttps://detect.halowerk.com/v1/workflow/workflow-markov-target-probability
An agent that deploys a probabilistic workflow needs its exact target reach probability compared with an explicit threshold including reachable nonterminating closed components.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow matrix chain cost certificate
POSThttps://detect.halowerk.com/v1/workflow/workflow-matrix-chain-cost-certificate
An agent that plans a finite chain of matrix artifact transformations needs whether its claimed scalar multiplication count reaches the exact minimum over every legal parenthesization.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow maximal end component family
POSThttps://detect.halowerk.com/v1/workflow/workflow-maximal-end-component-family
An agent that models nondeterministic worker recovery needs the claimed complete family of maximal indefinitely sustainable recurrent regions checked against every supplied action support.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow maximum closed build profit
POSThttps://detect.halowerk.com/v1/workflow/workflow-maximum-closed-build-profit
An agent that selects optional artifact builds needs its claimed maximum net benefit checked while every chosen build brings all of its declared prerequisite builds into the selected set.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow maximum cycle mean delay
POSThttps://detect.halowerk.com/v1/workflow/workflow-maximum-cycle-mean-delay
An agent that sizes a repeating autonomous pipeline needs its claimed maximum average cycle delay checked across all supplied strongly or weakly connected components without treating the workflow as a one-shot DAG.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow minimal ssa phi placement
POSThttps://detect.halowerk.com/v1/workflow/workflow-minimal-ssa-phi-placement
An agent that hands over a workflow compiler needs its claimed unpruned SSA phi placements checked against iterated dominance frontiers in the supplied control-flow graph.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow minimum adaptive diagnostic cost
POSThttps://detect.halowerk.com/v1/workflow/workflow-minimum-adaptive-diagnostic-cost
An agent that selects deterministic artifact diagnostics needs its claimed minimum weighted classification cost checked over every adaptive binary test tree allowed by the complete hypothesis table.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow minimum backbone tree certificate
POSThttps://detect.halowerk.com/v1/workflow/workflow-minimum-backbone-tree-certificate
An agent that chooses a sparse autonomous synchronization backbone needs whether its proposed supplied links form a spanning tree with the exact minimum total stated link cost.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow minimum cycle basis cost
POSThttps://detect.halowerk.com/v1/workflow/workflow-minimum-cycle-basis-cost
An agent that exports an independent loop basis for an undirected integration graph needs its claimed minimum total loop weight checked across the full binary cycle space.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow minimum feedback arc penalty
POSThttps://detect.halowerk.com/v1/workflow/workflow-minimum-feedback-arc-penalty
An agent that repairs a cyclic artifact build dependency graph needs its claimed minimum discarded-edge penalty checked over all total build orders rather than removing the first detected cycle.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow minimum isolation colors
POSThttps://detect.halowerk.com/v1/workflow/workflow-minimum-isolation-colors
An agent that assigns conflicting artifact transforms to isolation lanes needs its claimed minimum number of lanes checked when every supplied conflict pair must use different lanes.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow minimum live frontier bytes
POSThttps://detect.halowerk.com/v1/workflow/workflow-minimum-live-frontier-bytes
An agent that orders a DAG artifact pipeline under a retained-result budget needs its claimed minimum peak retained artifact weight checked over every topological completion order.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow minimum sequential chain cover
POSThttps://detect.halowerk.com/v1/workflow/workflow-minimum-sequential-chain-cover
An agent that partitions a precedence workflow into independent sequential work lanes needs its claimed lane count checked against the minimum chain cover of the complete transitive order.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow minimum weighted tardiness
POSThttps://detect.halowerk.com/v1/workflow/workflow-minimum-weighted-tardiness
An agent that orders one nonpreemptive autonomous worker queue needs whether its claimed complete order minimizes the supplied weighted lateness loss rather than merely meeting hard deadlines.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow modular phase intersection
POSThttps://detect.halowerk.com/v1/workflow/workflow-modular-phase-intersection
An agent that joins independently phased integer tick schedules needs its claimed first common tick and repeating period checked with noncoprime moduli.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow monotone transform
POSThttps://detect.halowerk.com/v1/workflow/workflow-monotone-transform
An agent that uses an explicit information order needs a supplied transfer table checked for order reversals before applying iterative dataflow.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow multiversion serialization
POSThttps://detect.halowerk.com/v1/workflow/workflow-multiversion-serialization
An agent that checks a versioned workflow history needs write-order read-from and anti-dependency edges derived from explicit versions rather than a single interleaved conflict trace.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow observed remove set merge
POSThttps://detect.halowerk.com/v1/workflow/workflow-observed-remove-set-merge
An agent that merges concurrent replicated set states needs whether a claimed visible member set agrees with the add-tag and observed-tombstone union rather than removing a concurrent unseen add.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow ordered dacl mask admission
POSThttps://detect.halowerk.com/v1/workflow/workflow-ordered-dacl-mask-admission
An agent that migrates an explicitly mapped discretionary ACL artifact needs its claimed access results checked against ordered remaining-mask grants denials and enabled or deny-only token groups.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow parity winning regions
POSThttps://detect.halowerk.com/v1/workflow/workflow-parity-winning-regions
An agent that hands over an indefinitely recurring workflow contest needs its claimed even-player winning region checked under the highest recurring priority rule.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow paxos acceptor transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-paxos-acceptor-transcript
An agent that replays a replicated commit acceptor needs promised ballot and acceptance claims checked across prepare requests higher promises and repeated proposals without executing a commit.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow periodic edf demand
POSThttps://detect.halowerk.com/v1/workflow/workflow-periodic-edf-demand
An agent that configures periodic workflow tasks needs explicit deadline-demand excess over a verified finite hyperperiod rather than a utilization-only guess.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow petri capacity
POSThttps://detect.halowerk.com/v1/workflow/workflow-petri-capacity
An agent that models a concurrent token workflow needs an explicit reachable marking that exceeds a declared place capacity or exhaustive confirmation within a finite exploration budget.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow petri unbounded growth
POSThttps://detect.halowerk.com/v1/workflow/workflow-petri-unbounded-growth
An agent that accepts a token-generating workflow needs its claimed unbounded-growth property checked by coverability acceleration instead of confusing a finite capacity overrun with mathematical unboundedness.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow piecewise backlog bound
POSThttps://detect.halowerk.com/v1/workflow/workflow-piecewise-backlog-bound
An agent that compares supplied arrival and service envelopes needs the exact finite-horizon maximum vertical gap checked against a declared buffer budget.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow planar dependency topology
POSThttps://detect.halowerk.com/v1/workflow/workflow-planar-dependency-topology
An agent that checks an abstract dependency topology before choosing a schematic representation needs its claimed graph planarity measured without rendering a layout.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow precedence realizer dimension
POSThttps://detect.halowerk.com/v1/workflow/workflow-precedence-realizer-dimension
An agent that represents a precedence contract by independent total-order keys needs its claimed minimum number of linear orders checked so their intersection equals the supplied partial order.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow preemptive deadline feasibility
POSThttps://detect.halowerk.com/v1/workflow/workflow-preemptive-deadline-feasibility
An agent that submits finite jobs with release windows needs a deadline-miss witness under ideal preemptive earliest-deadline execution without dispatching work.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow primal dual optimum certificate
POSThttps://detect.halowerk.com/v1/workflow/workflow-primal-dual-optimum-certificate
An agent that accepts a remote allocation optimizer result needs its supplied primal and dual certificate checked for feasibility and equal objective value before trusting an optimum claim.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow priority inheritance transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-priority-inheritance-transcript
An agent that audits a lock handover trace needs claimed effective worker priorities checked against transitive priority inheritance and priority-ordered mutex ownership transfer.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow quantified capability game
POSThttps://detect.halowerk.com/v1/workflow/workflow-quantified-capability-game
An agent that negotiates dependent capability choices needs its claimed contract feasibility checked with explicit universal provider choices and existential agent choices in the supplied observation order.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow raft append entries transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-raft-append-entries-transcript
An agent that replays a follower log needs whether supplied AppendEntries acceptance log lengths and commit-index claims follow term and previous-entry matching rules.
Technische Prüfungen & Formate0,002 USDC
workflow / workflow ranked choice selection transcript
POSThttps://detect.halowerk.com/v1/workflow/workflow-ranked-choice-selection-transcript
An agent that aggregates autonomous worker preference ballots needs the claimed elimination sequence and selected candidate checked under a supplied deterministic instant-runoff tie order.