What happens if code was already written without tests?

The algorithm mandates a recovery path where any implementation code written without a preceding failing test must be deleted via git reset or rm to ensure no 'sunk cost' exceptions.

Why does the algorithm include a self-test section?

The self-test ensures the AI agent demonstrates total comprehension of the rules before proceeding, catching potential compliance failures before they enter the codebase.

Can I use this for exploratory prototyping?

Yes, but only if a 'throwaway prototype exception' is explicitly approved by the user; otherwise, the standard TDD enforcement rules apply.

Is this compatible with other testing frameworks?

Yes, this algorithm focuses on the 'when' and 'why' of TDD compliance and is designed to work upstream of any specific testing methodology or library.

How does this skill differ from standard TDD instructions?

While standard instructions use 'must' or 'should,' this skill uses a boolean decision tree that leaves no room for AI interpretation or excuses like 'this code is too simple to test.'

TDD Enforcement Algorithm

Name: TDD Enforcement Algorithm
Author: cipherstash

bycipherstash

•

보안 및 테스팅

Enforces strict test-first development through a deterministic algorithmic decision tree that eliminates rationalizations for skipping tests.

소개

The TDD Enforcement Algorithm provides a rigorous framework for ensuring 100% compliance with Test-Driven Development (TDD) principles during AI-assisted coding. Unlike standard imperative instructions which agents often bypass under pressure, this skill uses a binary decision tree to remove interpretation and subjectivity. It forces a 'stop and test' workflow before any implementation code is written and includes a strict recovery protocol that mandates the deletion of any code created without a preceding failing test, effectively eliminating technical debt at the source.

주요 기능

Deterministic boolean decision trees for 100% TDD compliance
4 GitHub stars
Explicit invalidation of rationalizations like 'code is too simple'
Mandatory recovery path requiring the deletion of untested code
Self-test comprehension checks for deterministic agent execution
Integration path with existing RED-GREEN-REFACTOR methodologies

사용 사례

Preventing 'tests-after' habits during new feature implementation
Enforcing rigorous engineering standards in mission-critical software
Auditing and cleaning up codebases where implementation preceded testing

소개

주요 기능

Deterministic boolean decision trees for 100% TDD compliance
4 GitHub stars
Explicit invalidation of rationalizations like 'code is too simple'
Mandatory recovery path requiring the deletion of untested code
Self-test comprehension checks for deterministic agent execution
Integration path with existing RED-GREEN-REFACTOR methodologies

사용 사례

Preventing 'tests-after' habits during new feature implementation
Enforcing rigorous engineering standards in mission-critical software
Auditing and cleaning up codebases where implementation preceded testing