datenvertrag.halowerk.com

Check 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. In

Check a proposed Iceberg-V2 file-to-delete-file scan scope plan before a data reader applies deletes to supplied snapshot metadata. Pinned bounded V2 FILE-scope profile only; no row matching,file access or deletion. A schema-valid unknown costs the same fixed price. Invalid input requires nativeHTTP

Check 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

Check which buffered snapshot READ keys may remain after a supplied Debezium-style chunk window so a data consumer does not reapply superseded snapshot rows. Normalized one-chunk metadata only;no connector,SQL call or full-table truth. Missing evidence remains unknown;known impossible joint claims a

Check 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 con

Audit whether pre-resolved source actions for the same physical MERGE target row satisfy documented action-agreement conditions,or contain a provable UPDATE/DELETE or unequal-UPDATE conflict,before warehouse loading. Normalized physical target grouping and action resolution are caller-supplied. Equa

Audit the signed retraction/restoration ledger of structurally unmatched left tuples when supplied left/right bag changes cross the zero-match boundary, before applying a materialized-view delta. Only structural unmatched-extension coefficients, no normal join pairs or join-mode parameter. Missing e

A streaming-runtime fixture maintainer checks whether claimed blocked/unblocked completion requests follow from a reconciled global capability/message stock and a supplied finite graph of product-time location summaries. Additive two-coordinate model only; no delivery or real-runtime claim. Missing

An Iceberg-v3 reader fixture maintainer audits inherited row-lineage claims from ordered manifest entries and physical row positions,while retaining explicitly stored lineage values. Pinned Iceberg1.10.0 reader fragment only; semantic null and Capture-Unknown are distinct. No writer allocation or ge

Reconstruct bounded nonstreaming Begin/Commit transaction scopes and check Origin-before-DML plus announced-relation use in supplied normalized pgoutput messages. Null capture stops interpretation; earlier contradictions survive. No binary parsing,streaming,two-phase or database execution. Fixed0.00

Resolve SET CONSTRAINTS catalog targets using the first matching search-path schema and all same-name constraints; preflight retroactive checking and atomic mode transition from supplied pending-violation evidence. No SQL,trigger or database execution; incomplete evidence remains unknown. Fixed0.003

Compute a rational classic histogram quantile and a sorted/coalesced cumulative-bucket repair trace from bounded caller-supplied integer counts. Own exact rational specialization of the Prometheus3.2.1 classic rule; no native histogram, scrape, PromQL server or vendor float-bit conformance. Uniform-

Decide 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

From an already decoded rectangular integer-or-null array with explicit lower bounds, resolve PostgreSQL-style element or mixed rectangular slice access and return complete source offsets, coordinates and selected values. A colon switches every dimension to slice mode; scalar n then denotes1:n. Omit

Own bounded RFC2698 Informational trTCM replay. Full buckets at time0; integer-second normalized packet events and supplied IP-byte lengths; independent peak/committed refill and color-aware or blind marking. Return every interpreted mark, exact after-balances and whole claim correspondence. Lost pa

Canonicalize two supplied integer-range collections, merge overlap and integer adjacency, and return complete canonical inputs, union, intersection and left difference with finite or infinite cardinality. Inclusive/exclusive endpoints normalize by the next integer; null endpoints explicitly denote u

Own reflected IEEE CRC32 GF(2) operator composition, compatible with the zlib crc32_combine contract. Return all computable prefix CRCs and lengths plus whole claimed-prefix correspondence. Caller supplies segment lengths and externally conditioned CRC32 values; this does not verify unknown underlyi

Apply RFC6052 structural IPv4-embedded address layouts for prefix lengths32/40/48/56/64/96 from a caller-supplied canonical128bit prefix. Embed four IPv4 octets or extract them from a32lowercase-hex IPv6 address, checking prefix and reserved u octet, reporting ignored nonzero suffix and canonical ze

Own bounded numeric width_bucket evaluator from PostgreSQL18 public rules: equal-width ascending or mirror-descending bins, or strictly increasing integer threshold bins. Returns every row bucket and rational interval boundaries and compares whole claimed vector. Missing supplied evidence is null/un

For a complete supplied finite residue sequence, find its minimum linear recurrence order over one selected prime field. Return a particular coefficient vector, free-column-normalized nullspace basis, exact number of compatible coefficients, zero residual witnesses and conditional one-step value spa

Own bounded Prufer bijection decoder on labels0..n-1,n2..32. Return all canonical undirected edges, original degrees and smallest-leaf elimination trace, then compare whole claimed edge multiset ignoring endpoint orientation/list order. Duplicate claimed edges remain mismatches. Missing symbol preve

Apply RFC1982 wrapped32bit serial ordering to a supplied finite accept-strictly-newer receiver policy. Return every checked proposal, known accepted-prefix count and state; ignore equal/older proposals. Half-space ordering is undefined and missing updates halt the replay with unknown final state. An

Own bounded exact multinomial-prefix rank/unrank for numeric labels0..k-1, total multiplicity<=12. Return distinct permutation count, supplied wholeword rank, selected word at requested rank and complete selection-block trace; compare entire claim. Missing word/request leaves separate known fields a

Decode a supplied graph6 record of order0..16 into every labeled undirected edge, degree vector, exact upper-triangle bitstream and zero-padding width, and compare the complete supplied graph claim. Optional graph6 header accepted; record excludes line terminators. Missing record or claim returns ex

Own bounded BigInt polynomial convolution for <=12supplied Bernoulli marginals, denominators<=100; output reduced exact rational PMF/CDF and expectation; compare whole supplied PMF by rational equality. Independence must be explicitly supplied true, not inferred or observed. No realdata estimation,

For a supplied exact signed rational and base2..16, return integer digits, shortest nonrepeating fractional prefix, minimal repeating block, reduced fraction and full finite remainder-cycle witness, then compare the entire canonical expansion claim. Terminating expansions have an empty repeat block;

Own bounded TIFF6PackBits normalized-row decoder: unsigned0..127literal,129..255replicate,128noop; each row independently bounded. Return all complete-operation decoded prefixes, consumed offsets and literal/replicate/noop witnesses; compare whole supplied rows. Known rowoverrun/closed-capture trunc

Return the entire Hilbert index-to-coordinate path and row-major coordinate-to-index table for order0..4 on a2^order square integer grid. Bottom-left origin,yup; order1 path(0,0),(0,1),(1,1),(1,0), explicit recursive orientation. Check both entire supplied table claims; known contradiction remains n

Own bounded greatest arcconsistent closure on <=6discretevariables/domains<=6values with one explicitly supplied binaryrelation per unorderedpair. Output every remaining/removedvalue and leastsupport witness per directedarc/value; compare whole domainclaim assetvectors. Emptydomain proves unsatisfia

For2..6 indexed positive symbol weights and max code length1..5, synthesize exact minimum weighted bits, lexicographically first optimal original-index length vector, canonical MSB-first bitwords, exact number of optimal assigned length vectors and Kraft capacity witness. Report infeasibility when t

Own bounded exact rational bracketing, maxdenominator1024. Return all minimizing reduced fractions sorted numerically, exact absolute errors, greatest allowed lower and least allowed upper inclusive neighbors; compare whole claimlist by rational equivalence preserving duplicates. No Pythonlimit_deno

For anonymous labels0..size-1, count every step-th live item starting with the supplied start label, remove it from the abstract circle and resume at its next live successor. Return the entire Josephus selection order, inverse zero-based removal-round vector, final label and every live-rank transiti

Own complete all-pair-addition breadth-first search for target1..16. Return globally minimum multiplicationcount, countofdistinct optimal exponentsequences, lexleastoptimalchain and leastindexpair perstep. Operanddecomposition alternatives do not multiply the chaincount; no star-chain restriction. C

Own bounded palindromechart/dynamicprogramming for <=64numeric tokens0..15. Return global minimumnumberofnonempty palindromicpieces, exact countofalloptimalcutpatterns, lexleastendpositions, wholechosenchunks and everyprefixoptimum/count. Not distinctpalindromicsubstringcount; no language,Unicode or

Reconstruct 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 canonica

Own exact intervalDP on ordered keyranks0..n-1,n<=8. Keys are INTERNAL successnodes with rootdepth/comparisoncost1, not ordered leafdecisiontree. Return minimumweightedcost,countalloptimalBSTshapes,lexleastpreorder,parents,comparisondepths,perkeycontributions and normalizedmeanifweighttotal>0. Succe

For an anonymous supplied integer(-2147483647..2147483647) and width2..8 reconstruct the entire canonical window nonadjacent signed binary expansion. Return little-endian signed digits, all nonzero positions/count and per-bit exact before/digit/after residuals. Nonzero digits are odd with abs(d)<2^(

Own rational sorting/threshold projection for <=12coordinates y_i=integercoordinate_i/commonscale. Return whole fittedvector,threshold,strictpositive activeindices,dualnonnegative slacks,squaredEuclideandistance and wholevectorclaimcheck. This solves sum(x)=1,x>=0 leastsquares; not normalization/cli

For numeric alphabet0..k-1 with k1..4 and order1..4, construct the entire lexicographically least de Bruijn cycle containing each order-length word exactly once cyclically. Return full cycle, linearization obtained by cyclically appending order-1 symbols, every lexicographic word-rank position and e

Own rational intervalDP for sorted suppliedintegerpoints n<=12 and exactlyknonemptycontiguousindexclusters. Full minimumSSE,optimalpartitioncount,lexleastendvector,exactcenters/perclustersse and labels. Equal-valuedobservations remain distinctorderedindices; no silentlysortinginput. No heuristic/R/R

Construct the complete four-level wavelet matrix for an original0..64item sequence of numeric symbols0..15. Return levelbitmaps, prefixonecounts, zero_counts, stable original-index witnesses, finalpermutation/values and up to8prefixrank plus8occurrence-select answers. Rank uses half-open original pr

For 2 to 16 supplied paired integer observations, returns all unordered pairs classified as concordant, discordant, x-only tied, y-only tied or jointly tied, exact tie-corrected tau-b numerator/sqrt(denominator_squared), sign and reduced squared tau. A zero denominator is a known undefined coefficie

For 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-im

For supplied total n0..24, counts all nonincreasing positive-integer partitions and reconstructs zero-based lexicographically descending index. Returns full chosen partition, its Ferrers conjugate and complete skipped/selected branch-count rank trace. n0 has one empty partition. Out-of-range known i

Construct and audit the whole Elias-Fano bit layout of an original nondecreasing0..64item integer sequence0..65535. U=max+1 for nonempty and0 for empty; lowwidth=max(0,floor(log2(U/n))) else0. Own explicit convention: low blocksLSB-first; upper onepositions=floor(value/2^lowwidth)+originalindex, fol

For two equally sized sides n1..6 with complete strict preference permutations, independently runs deferred acceptance from each side. Returns both entire left-indexed assignments and each side personal rank vectors, and whether the stable assignment is unique. Audit supplied entire proposer-optimal

Reconstruct the exact Calkin-Wilf positive rational tree bijection. Root1/1; left child a/(a+b), right(a+b)/b. Own heap-index convention root1,left2n,right2n+1. Reduce supplied positive numerator/denominator1..128 by gcd; return exact decimal-string index, complete root-to-target ancestors and L/R p

For1..16 supplied planar integer points with coordinates between-100 and100, returns reduced exact minimum squared distance between enclosing parallel lines, every optimal canonical primitive normal and both support lines with every original supportpoint index. One unique point location has zero wid

For a supplied length1..10 generate ALL binary necklaces under cyclic rotation, represented by lexicographically least0/1word, in increasing lexical order. Return each full word, its least positive cyclic period and orbit size; total necklaces, primitive necklaces with period=n and ascending divisor

For supplied prime modulus2..251, nonzero basis and target residue, returns exact multiplicative order, all powers in exponent order0..order-1, target subgroup membership and canonical least nonnegative discrete logarithm if one exists. Targetzero is a known no-solution; null facts remain unknown. A