AgentStack
Browse Sign in
Browse Why AgentStack Sell Docs
Sign in
SKILL verified MIT Self-run

Decompose By Verification Boundary

skill-ariaxhan-the-agent-library-decompose-by-verification-boundary · by ariaxhan

>-

No reviews yet
0 installs
10 views
0.0% view→install

Install

$ agentstack add skill-ariaxhan-the-agent-library-decompose-by-verification-boundary

✓ scanned · ✓ verified, works with Claude Code, Cursor, and more.

Security review

✓ Passed

No issues found. Passed automated security review. · v0.1.0 How review works →

  • Prompt-injection patterns
  • Secret / credential exfiltration
  • Dangerous shell & filesystem operations
  • Untrusted network calls
  • Known-malicious package signatures

What it can access

  • Network access No
  • Filesystem access No
  • Shell / process execution No
  • Environment & secrets No
  • Dynamic code execution No

From automated source analysis of v0.1.0. “Used” means the capability is present in the source — more access means more to trust, not that it’s unsafe.

View the full security report →

Verified badge

Passed review? Show it. Paste this badge into your README, it links to the public security report.

AgentStack Verified badge Links to your public security report.
[![AgentStack Verified](https://agentstack.voostack.com/badges/verified.svg)](https://agentstack.voostack.com/security/report/skill-ariaxhan-the-agent-library-decompose-by-verification-boundary)

Reliability & compatibility

Security review passed
0 installs to date
no reviews yet
29d ago

Declared compatibility

Claude CodeClaude Desktop

Compatibility is declared by the source manifest. End-to-end runtime verification is coming, see below.

Preview Execution monitoring

We're building live execution health for every listing: tool-call success rate, median latency, uptime, and last-checked timestamps, measured, not self-reported. It isn't live yet, so we don't show numbers we can't stand behind.

How agent discovery & health will work →
Are you the author of Decompose By Verification Boundary? Claim this listing to set pricing, connect Stripe payouts, and keep 70% of every sale.
Sign up to claim

About

Decompose by Verification Boundary

The natural ways to split work, by file, by feature, by layer, all share a flaw: the pieces have no independent proof. You build for hours and only find out whether any of it works at the end, when everything composes. Splitting by verification boundary inverts that. Each unit carries its own gate, lands green, and becomes solid ground for the next one. Observed across production agent runs, this is the difference between a tree that stays green and a big-bang integration that fails in ways nobody can attribute.

1. Define the unit: smallest change with its own gate

A unit of work is the smallest change that has a named, runnable check proving it works on its own: a test count ("these 34 new tests pass"), a compile or typecheck, a render check, a schema validation, a live request. Not a file. Not a feature. A validation module with its own tests is a unit; "the backend half of search" is not, because nothing can pass or fail until the frontend half exists.

2. The naming test

For each proposed piece, write down its gate before writing any code: the exact command and the expected result. If you cannot name the gate, the piece is too big or wrongly shaped. Split it until every piece has one. This test is the whole method; everything else is consequences of applying it honestly.

3. Land each unit green before the next starts

Finish a unit, run its gate, see it pass, commit. Only then start the next. Never stack a second half-done unit on top of a first, because when something breaks you can no longer attribute the failure to a change. A composed feature (the route that wires three verified modules together) is itself a unit, with its own gate: integration tests over the seam.

4. Order by risk, not by convenience

Do the riskiest unit first, while judgment and context are freshest: the concurrency seam, the streaming path, the irreversible migration, the third-party integration nobody has exercised. Easy visible work first (screens, copy, wrappers) feels productive and teaches nothing; if the hard part fails, everything built around it was waste. Rank units by "what would hurt most to discover late" and schedule in that order.

5. Decide product questions in writing before building

If a unit contains an open product or design question (what happens on the miss path, which of two behaviors is correct), decide it in writing before implementation: state the options, pick one, record where the decision lives. Building both branches "to be safe" doubles the code and defers the decision to whoever reads it next. A written one-line decision is cheaper than either branch.

Anti-patterns

  • Splitting by file or by layer. "Do the models, then the services, then the routes"

produces pieces that cannot be verified alone. Split so each piece proves itself.

  • A plan step with no named check. "Implement search" is not a unit; "search returns

ranked results for these five fixture queries" is.

  • Starting unit two while unit one is red. Failures become unattributable and the tree

stops being trustworthy ground.

  • Convenience ordering. Doing the pleasant 80% first leaves the risk exactly where it

started, but with less time and context to absorb it.

  • Deferring a product decision into the code. Flags, dual paths, and "configurable for

now" are unmade decisions wearing an abstraction.

Output

Return an ordered plan where each unit states:

  • The change, in one line.
  • The gate: exact command or check, plus the expected result (counts where possible).
  • Why it sits at this position in the risk order.
  • Any product decision it depends on, with the decision made and recorded before the unit starts.

Source & license

This open-source skill is cataloged on AgentStack and links to its original source — we do not rehost the code.

Install and usage instructions live in the source repository linked above.

Reviews

No reviews yet, be the first.

Versions

  • v0.1.0 Imported from the upstream source.