Hub · Entwicklung & APIs

Technische Prüfungen & Formate

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

detect.halowerk.com · Katalogstand 2026-11-01, 15:19 UTC

Endpunkte

361–420 von 1.910

Technische Prüfungen & Formate0,003 USDC
F N POOLED VARIANCES / bartlett pooled log variance
POSThttps://detect.halowerk.com/v1/F-N-POOLED-VARIANCES/bartlett-pooled-log-variance
API operation: F N POOLED VARIANCES bartlett pooled log variance. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F N PURCHASE COHORTS / purchase test cohort attribution
POSThttps://detect.halowerk.com/v1/F-N-PURCHASE-COHORTS/purchase-test-cohort-attribution
API operation: F N PURCHASE COHORTS purchase test cohort attribution. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F N RAKING TABLE / raking iterative margin balance
POSThttps://detect.halowerk.com/v1/F-N-RAKING-TABLE/raking-iterative-margin-balance
API operation: F N RAKING TABLE raking iterative margin balance. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F N RATER LATENT EM / dawid skene missing label em
POSThttps://detect.halowerk.com/v1/F-N-RATER-LATENT-EM/dawid-skene-missing-label-em
API operation: F N RATER LATENT EM dawid skene missing label em. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F N REPLICATE FIT / replicate regression lack of fit
POSThttps://detect.halowerk.com/v1/F-N-REPLICATE-FIT/replicate-regression-lack-of-fit
API operation: F N REPLICATE FIT replicate regression lack of fit. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F N RESIDUAL PORTMANTEAU / ljung box residual portmanteau
POSThttps://detect.halowerk.com/v1/F-N-RESIDUAL-PORTMANTEAU/ljung-box-residual-portmanteau
API operation: F N RESIDUAL PORTMANTEAU ljung box residual portmanteau. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F N RETRIEVAL EVALUATION / retrieval judgment rank metrics
POSThttps://detect.halowerk.com/v1/F-N-RETRIEVAL-EVALUATION/retrieval-judgment-rank-metrics
API operation: F N RETRIEVAL EVALUATION retrieval judgment rank metrics. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F N ROC COST HULL / roc cost supporting hull
POSThttps://detect.halowerk.com/v1/F-N-ROC-COST-HULL/roc-cost-supporting-hull
API operation: F N ROC COST HULL roc cost supporting hull. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F N SEQUENTIAL LIKELIHOOD / wald bernoulli likelihood stopping
POSThttps://detect.halowerk.com/v1/F-N-SEQUENTIAL-LIKELIHOOD/wald-bernoulli-likelihood-stopping
API operation: F N SEQUENTIAL LIKELIHOOD wald bernoulli likelihood stopping. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F N WEIGHT REGIONS / benchmark weight winner regions
POSThttps://detect.halowerk.com/v1/F-N-WEIGHT-REGIONS/benchmark-weight-winner-regions
API operation: F N WEIGHT REGIONS benchmark weight winner regions. Use the linked input schema for request fields and the hub documentation for response fields, coverage and limitations.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / abelian sandpile sink stabilization odometer
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/abelian-sandpile-sink-stabilization-odometer
An offline chip-firing model test agent needs the unique stabilized configuration, per-vertex toppling counts and chips absorbed by a sink. Not checking arbitrary Petri boundedness or a supplied transition trace.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / binary linear code complete weight enumerator
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/binary-linear-code-complete-weight-enumerator
A coding-theory test agent needs the complete distinct-codeword Hamming weight distribution and exact minimum distance of its supplied binary generator rows, including dependent rows, without a coding-library final answer.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / boolean truth table exact walsh nonlinearity
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/boolean-truth-table-exact-walsh-nonlinearity
A Boolean-algebra test agent needs exact affine-distance nonlinearity and algebraic degree of its complete anonymous Boolean truth table, without a crypto-library final answer or an avalanche-sample approximation.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / braid closure alexander burau polynomial
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/braid-closure-alexander-burau-polynomial
A knot-theory test agent needs the normalized Alexander polynomial of the knot closed from an explicit signed braid word. This computes one invariant and does not decide isotopy, unknot recognition or physical knot behavior.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / cograph cotree union join decomposition
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/cograph-cotree-union-join-decomposition
A graph-structure test agent needs a cograph union/join decomposition or an induced four-vertex-path counterexample for an explicit finite simple graph. Not graph connectivity, planarity or a generic degree profile.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / connected graph exact effective resistance matrix
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/connected-graph-exact-effective-resistance-matrix
A network-math test agent needs every exact rational pairwise effective resistance of a supplied connected resistor graph, including cycles and parallel paths, rather than hop distance or a tree count.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / convex integer polygon minkowski sum exact hull
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/convex-integer-polygon-minkowski-sum-exact-hull
A computational-geometry test agent needs the complete exact convex polygon boundary formed by summing two supplied polygons, not just area, vertex count or one-point containment.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / cooperative characteristic shapley marginal vector
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/cooperative-characteristic-shapley-marginal-vector
A finite cooperative-game test agent needs the exact Shapley marginal-contribution vector for its complete anonymous coalition value table; not proportional splitting, voting power presets, revenue advice or one coalition score.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / coprime dedekind sum exact euclidean reciprocity
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/coprime-dedekind-sum-exact-euclidean-reciprocity
A modular-forms arithmetic test agent needs the exact rational Dedekind sum and a rational claim check for supplied coprime integers, not a modular square root, gcd alone or raw floor-sequence count.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / dag markov equivalence skeleton collider witness
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/dag-markov-equivalence-skeleton-collider-witness
A graphical-model test agent needs formal equivalence of two supplied DAG conditional-independence models, plus exact missing skeleton/collider witnesses. Not comparing graph isomorphism or a single d-separation query.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / directed graph rooted arborescence exact count
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/directed-graph-rooted-arborescence-exact-count
A directed-network test agent needs the exact number of distinct rooted spanning out-arborescences in its supplied directed graph, not a single minimum tree or undirected spanning-tree count.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / ecmascript array length descending delete recovery
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/ecmascript-array-length-descending-delete-recovery
An offline JavaScript runtime-test agent needs successful deletion indices, final length/writability and DefineOwnProperty completion for an explicit Array length descriptor, including partial deletion before a blocker.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / ecmascript arraybuffer copy detach ownership result
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/ecmascript-arraybuffer-copy-detach-ownership-result
An offline binary-buffer lifecycle test agent needs the source ownership state, target resizability and exact copied/zero-filled/discarded byte counts after a requested ArrayBuffer transfer. Host detachment keys and allocation failure are o
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / ecmascript export star binding ambiguity
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/ecmascript-export-star-binding-ambiguity
An offline module-linker test agent needs null, ambiguous or resolved module/binding identity from a supplied source-text-module export graph, including repeated paths to the same binding and cycles; not source parsing, loading or evaluatin
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / ecmascript mapped arguments alias detachment
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/ecmascript-mapped-arguments-alias-detachment
An offline language-runtime test agent needs final parameter and argument-property states plus exact operation success from mapped-arguments mutations, including duplicate formals and alias detachment. No source evaluation or language-compa
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / ecmascript proxy ownkeys target invariants
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/ecmascript-proxy-ownkeys-target-invariants
An offline engine-test agent needs the TypeError-versus-normal key-list outcome and invariant violation indices for an explicit admitted Proxy ownKeys trap result and ordinary target descriptors.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / ecmascript resizable buffer typed view witness trace
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/ecmascript-resizable-buffer-typed-view-witness-trace
An offline JavaScript binary-view test agent needs fixed-length versus length-tracking TypedArray view dimensions and out-of-bounds recovery across supplied buffer resize/detach indications. One rule for all element sizes, no buffer I/O or
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / ecmascript toprimitive method completion trace
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/ecmascript-toprimitive-method-completion-trace
An offline coercion-test agent needs the normative method call trace and completion class from explicit primitive-hook and ordinary-method result classes. It does not execute callbacks, convert values or return source text.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / elliptic prime field character sum cardinality
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/elliptic-prime-field-character-sum-cardinality
An algebra test agent needs exact rational point cardinality and Frobenius trace of a small prime-field elliptic curve, independently of a cryptography SDK. Not point-on-curve validation, key derivation or a curve-name carrier.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / finite group cayley subgroup lattice
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/finite-group-cayley-subgroup-lattice
An algebra test agent needs the complete subgroup lattice of a small explicit finite group multiplication table, including normality and cover relations. Not a supplied subgroup member query, free-group word membership or Green principal-id
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / finite group cayley table automorphism permutations
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/finite-group-cayley-table-automorphism-permutations
An algebra test agent needs the complete automorphism permutation set of its supplied finite group, not merely subgroup normality, element order, or group membership.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / finite poset greene kleitman chain union partition
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/finite-poset-greene-kleitman-chain-union-partition
A poset test agent needs the full Greene-Kleitman partition and every maximum k-chain union size for its supplied order, not just a longest path or a one-k profile.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / finite rational lie bracket derived central series
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/finite-rational-lie-bracket-derived-central-series
An algebra test agent needs whether supplied rational structure constants define a Lie algebra and its complete derived/lower-central dimension sequences; not ordinary matrix rank or finite group commutators.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / finite semigroup green principal ideal classes
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/finite-semigroup-green-principal-ideal-classes
An algebra test agent needs the exact Green-class partitions and class counts of an explicit finite semigroup multiplication table, including nongroups; no SDK algebra wrapper.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / hensel simple root prime power lifting
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/hensel-simple-root-prime-power-lifting
An algebra test agent needs the unique simple-root lift through prime powers and its exact residue chain, independently of a modular arithmetic SDK. Not finite-field root enumeration or polynomial irreducibility.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / integer cyclotomic polynomial complete coefficients
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-cyclotomic-polynomial-complete-coefficients
A polynomial arithmetic test agent needs the complete exact integer cyclotomic polynomial for an explicit positive order n, not a prime-field irreducibility verdict or polynomial point samples.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / integer lattice exact lovasz size basis reduction
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-lattice-exact-lovasz-size-basis-reduction
A lattice-algebra test agent needs a deterministic exact LLL-reduced integer basis and its integer unimodular transformation for an explicit independent row basis; not matrix rank, shortest-vector certification or cryptographic approval.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / integer lattice polygon complete ehrhart polynomial
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-lattice-polygon-complete-ehrhart-polynomial
A lattice-geometry test agent needs the full rational-coefficient counting polynomial for every integral dilation of a supplied simple polygon, not just its area or one raster point count.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / integer planar lattice exact closest vector ties
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-planar-lattice-exact-closest-vector-ties
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, heurist
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / integer polynomial sylvester resultant exact
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-polynomial-sylvester-resultant-exact
A symbolic algebra test agent needs the exact signed integer resultant of two supplied integer polynomials, including the zero and sign cases, rather than a gcd, root count or approximate complex roots.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / integer row hermite unimodular normal form
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-row-hermite-unimodular-normal-form
An integer-lattice test agent needs the canonical exact row Hermite matrix and a unimodular row transformation for an explicit possibly rank-deficient matrix.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / integer smith determinantal divisor invariants
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/integer-smith-determinantal-divisor-invariants
An integer presentation test agent needs exact Smith invariant factors and cokernel structure of a small rectangular integer matrix, not only its rational rank, determinant or one lattice membership query.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / intuitionistic kripke monotone forcing model
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/intuitionistic-kripke-monotone-forcing-model
A constructive-logic test agent needs the exact forcing set of an explicit intuitionistic formula in a supplied finite monotone Kripke model. This evaluates one mathematical model, not validity in all models, a temporal trace or an actual d
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / lambda debruijn capture avoiding beta normalization
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/lambda-debruijn-capture-avoiding-beta-normalization
A programming-language semantics test agent needs the exact capture-avoiding beta normal form of an anonymous supplied lambda term and a normal-form claim check. No JavaScript execution, arbitrary rewrite rule input or external effects.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / ltl ultimately periodic trace fixedpoint truth
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/ltl-ultimately-periodic-trace-fixedpoint-truth
A temporal semantics test agent needs the full truth vector of a supplied LTL formula over an explicit infinite lasso word. This evaluates that mathematical trace and does not certify a real system, execution or security property.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / minimal absent contiguous factor basis
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/minimal-absent-contiguous-factor-basis
A finite sequence-index test agent needs the complete smallest-forbidden-factor basis of a supplied word, not one missing substring, shortest missing value or counts of present repeated factors.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / numerical semigroup apery frobenius genus
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/numerical-semigroup-apery-frobenius-genus
An arithmetic test agent needs the largest nonrepresentable nonnegative integer, total gap count and complete Apéry residue minima for supplied positive generators. Not a minimum coin count for one supplied target.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / oriented ribbon graph face cycles genus
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/oriented-ribbon-graph-face-cycles-genus
A topological graph test agent needs the complete face cycles and genus of the particular supplied rotation-system embedding, not only whether the underlying graph can be drawn planar.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / pell positive fundamental continued fraction solution
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/pell-positive-fundamental-continued-fraction-solution
A number-theory test agent needs the least positive fundamental Pell solution and a claim check for a supplied nonsquare integer. Not merely testing one supplied Diophantine equation solution.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / permutation schubert divided difference polynomial
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/permutation-schubert-divided-difference-polynomial
A flag-variety combinatorics test agent needs the complete Schubert polynomial coefficients for an explicit finite permutation, not its tableau, sign, descents or one evaluation.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / prime weierstrass affine scalar group result
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/prime-weierstrass-affine-scalar-group-result
An algebra conformance test agent needs the exact public mathematical multiple kP of a supplied nonsingular short-Weierstrass prime-field curve point and a point claim check; no key generation, security judgment or external signing.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / rational absorbing markov chain hitting law
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/rational-absorbing-markov-chain-hitting-law
A stochastic-process test agent needs the exact distribution of which absorbing state is hit and how many expected steps are needed from every transient state in a supplied rational chain, not a state-bisimulation or one-step transition che
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / rational buchberger polynomial ideal normal form
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/rational-buchberger-polynomial-ideal-normal-form
An algebra test agent needs exact ideal-membership and a polynomial remainder from supplied multivariate generators, without trusting a proposed Groebner basis or a computer-algebra final-answer API.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / rational cubic splitting field galois group
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/rational-cubic-splitting-field-galois-group
A field-theory test agent needs the actual Galois permutation-group type of a supplied separable integer cubic over Q, with rational-root and discriminant witnesses, not a numerical root approximation.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / rational formal power series compositional inverse
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/rational-formal-power-series-compositional-inverse
A generating-functions test agent needs the complete exact rational inverse jet of a supplied formal series and a complete-coefficient claim check, rather than polynomial gcd, reciprocal power series, or a numerical root.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / rational labelled markov probabilistic bisimulation
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/rational-labelled-markov-probabilistic-bisimulation
A stochastic-model test agent needs exact probabilistic bisimilarity classes and the quotient transition matrix of a supplied finite labelled rational Markov chain, not one target reachability probability or deterministic-automaton language
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / rational polynomial one form exact potential
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/rational-polynomial-one-form-exact-potential
A symbolic-calculus test agent needs whether its full supplied rational polynomial1form has a polynomial potential and the exact normalized potential coefficients, not a derivative value at one coordinate.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / rational quaternion hilbert ramification places
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/rational-quaternion-hilbert-ramification-places
An arithmetic-algebra test agent needs every ramified place and splitting status of a supplied abstract rational quaternion algebra (a,b), without a quaternion-library final answer, numerical matrix sample or cryptographic verdict.
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / regular routh array right half plane root count
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/regular-routh-array-right-half-plane-root-count
A polynomial test agent needs exact formal RHP root cardinality and first-column signs for a supplied real integer coefficient polynomial, without numerical roots. Not Sturm real-root counts, a matrix-rank question or control-system approva
Technische Prüfungen & Formate0,003 USDC
F NIGHT ECMA / schur product littlewood richardson tableau coefficient
POSThttps://detect.halowerk.com/v1/F-NIGHT-ECMA/schur-product-littlewood-richardson-tableau-coefficient
A symmetric-functions test agent needs the exact Schur-product structure coefficient for an explicit triple of partitions, including skew shape and content, rather than a standard-tableau cardinality or RSK word correspondence.