agent.halowerk.com

Takes two state documents — target (what the twin should look like) and observed (what was measured) — and returns a leaf-by-leaf comparison. Every leaf path carries one of five states: in_tolerance, out_of_tolerance, missing_in_observed, unexpected_in_observed or type_mismatch.

Searches the public x402 discovery catalogue for services able to replace a broken dependency. Give the failed URL and, better still, a short description of what it did and the fields you need back; matches are scored on overlap between your task words and the candidate name, description and path, then ordered by score and price. Every hit carries the reason it matched, its price in USDC, its network and when the catalogue last saw it.

Takes a message history and a character budget and returns a shortened history together with a full account of what it cost. Four stages run in fixed order: pin protects messages that must survive (roles listed in keep_roles, the last keep_last_n messages, and anything you marked pin), dedupe removes later near-duplicates of an earlier message of the same role using word-overlap similarity, trim shortens unprotected survivors to max_message_chars at the last sentence boundary, and drop removes…

Replays a grading scale through the native OpenOLAT implementation and compares, for each assessment, the grade that was recorded against the grade the scale actually yields. Every discrepancy comes back with the score, the band it falls into, the expected value and the recorded one, so a wrong entry can be corrected at the row instead of being argued about in the aggregate.

The paid HTTP request is accepted asynchronously with HTTP 202 and an unguessable result URL; poll that URL about every 20 seconds for the result, normally available after about 130 seconds. Settlement happens only after a successful native run while the authorization is still valid. The run passes a course structure and a set of learners through the pinned OpenOlat learning-path implementation and reports, per learner, which nodes the original code actually unlocks and in what order.

Reconciles a column of names against a reference catalog that you supply — your catalog, not a public knowledge base — using native OpenRefine reconciliation with a caller-set edit distance and an optional required type. The result separates rows with a single candidate, rows with several, and rows with none, and it leaves the ambiguous ones ambiguous: an automatic pick would be the cheapest possible way to introduce a wrong identity into a reference dataset.

Clusters a key column with native OpenRefine fingerprinting and returns a consolidation plan tied to actual row ids. The plan distinguishes the two cases that matter: rows that repeat an identical value and can simply be merged, and rows that collide on the key but disagree in other fields — those are flagged as unresolved rather than silently collapsed, because merging them would destroy information. Excluded rows and singletons are reported too, so the plan accounts for every input row.

Executes a caller-directed sequence of table operations in native OpenRefine and returns the transformed table together with the exported recipe. What distinguishes it from simply transforming data is the evidence: the recipe is persisted, the project is reopened, and the whole thing is replayed from the original input, with hashes reported at each stage.

Relocates a Java package across a bounded set of source files using OpenRewrite, which works on a type-attributed syntax tree rather than on text. That is the difference that matters: a textual search and replace hits strings, comments and same-named symbols from other packages, while this changes only what actually refers to the package. Both the before and after state are compiled and the result is reported, so a refactoring that breaks the build says so instead of being handed over as done.

Takes an OpenTofu state snapshot and a passphrase, encrypts the snapshot through the pinned OpenTofu state-encryption code, then proves the result three ways: the authorized key recovers the state with an identical semantic hash, a wrong key is rejected, and a tampered payload is rejected. What comes back is the encrypted artifact plus those proofs and the resource-instance count, never the plaintext.

Walks a staged product-catalog import through the pinned OpenCart source in a private, non-root database and reports what the native code makes of it at each stage: how many masters and variants survive, whether option values stay attached to the right products, and how the resulting catalog behaves in a localized cart. The point is to find the damage before the import touches a live shop, where a broken option mapping shows up as a customer ordering a variant that does not exist.

Runs your simple-product checkout cases against the pinned OpenCart source in a private, non-root database that exists only for the length of the request. For each case it reports the totals the native code actually produces, which expectations were missed, and where a cart path diverged, rather than a single pass or fail.

Rebuilds the orders you supply inside a private, non-root OpenCart database and checks your export against what the native code computes. Each export row is matched to a ledger order, and every difference is named: a total that does not add up under the stated arithmetic policy, a currency conversion applied at the wrong point, a localized status that maps to nothing.

Takes a before and an after picture of your OpenDocMan rights setup and asks the pinned native code what each one actually grants. Every user-document pair is evaluated in both states, and what comes back is which decisions changed, which of your declared expectations were violated in each state, and whether the seeded state survived untouched.

Executes a question-bank assessment against answer fixtures you supply — an answer plus the score it should produce — using the native OpenOLAT QTI engine rather than a reimplementation of the scoring rules. Each fixture comes back with expected and actual score, and the discrepancy count says at a glance whether the bank behaves as its author believed. This is the regression test for a question bank before it goes in front of learners, where a mis-scoring item is expensive and hard to undo.