Przejdź do treści
Biblioteka skilli
Programowanie · Planowanie

define-goalstate

/define-goalstate

Ustala kontrakt gotowego systemu dla pracy: zachowanie, dozwolone i zabronione stany oraz dowód przestrzeni stanów.

Repozytorium
dalcom-skills ↗
Licencja
Apache-2.0
Ostatnia zmiana repozytorium
10.11.2026

Ocena i bezpieczeństwo

90/ 100Klasa: dobry
Format25 / 25
Frontmatter z nazwą i opisem, poprawna nazwa, opis do 1024 znaków, nazwa zgodna z folderem.
Odkrywalność25 / 25
Opis mówi, kiedy użyć skilla, ma sensowną długość i jest w 3. osobie.
Treść25 / 35
Co najmniej 150 słów i do 500 linii, nagłówki, listy kroków, przykłady albo kod.
Higiena15 / 15
Bez zaślepek typu TODO, bez ścieżek Windows, z licencją.
Ryzykobrak sygnałów w skanie
Pliki w paczce
2
Skrypty
0
Komentarze HTML
0
Adresy URL w SKILL.md
0
Przestarzałość

Brak sygnałów. Repozytorium zmienione 10.11.2026, bez odwołań do wycofanych modeli i API.

Licencja

Apache-2.0, otwarta: można używać i zmieniać, z zachowaniem licencji i informacji o zmianach.

Co robi i kiedy

Ustala kontrakt gotowego systemu dla pracy: zachowanie, dozwolone i zabronione stany oraz dowód przestrzeni stanów.

Oryginalny opis (EN)

Use when the user wants the finished-system contract for a piece of work: behavior, protocols, allowed, forbidden, and impossible states with a state-space proof. Not for runtime verification.

Jak działa

  1. What the user must supply
  2. Three kinds of state
  3. Building the contract with the user
  4. The document you hand back
Sekcje z nagłówków SKILL.md, w oryginale · 31 linii, 521 słów
Podgląd SKILL.md
---
name: define-goalstate
description: 'Use when the user wants the finished-system contract for a piece of work: behavior, protocols, allowed, forbidden, and impossible states with a state-space proof. Not for runtime verification.'
---

# Define goalstate

Before building, write the finished-system contract: what the system must do, the protocols governing it, which states it may occupy, which it must never reach, and which it structurally cannot reach, plus a concrete proof that the classification holds and a checkable predicate for success. Downstream wayfinding consumes this document, so make it precise enough to test decisions against.

The skill's only write is the named local contract document itself (reversible by deleting or overwriting it), and nothing is written until the user approves the draft. No remote mutation, no other file touched.

## What the user must supply

The intended finished system: the behavior it must exhibit and the protocols governing its interactions, stated concretely. The user also classifies the states; you never invent states they did not name.

## Three kinds of state

- Allowed: a concrete, observable configuration the finished system may legitimately occupy while honoring the contract.
- Forbidden: a concrete, observable configuration that violates the contract. Every forbidden state is paired with an explicit terminal failure behavior (halt, rollback, bounded retry, degrade-to-safe-mode) named without ambiguity about what the system observably does.
- Impossible: a configuration the design, protocol, or environment structurally excludes. Each one must name the invariant or boundary that makes it unreachable; "unlikely" or "undesired" is not enough. If no invariant can be named, reclassify the state as forbidden or allowed. Never accept "impossible" as a wish.

## Building the contract with the user

1. Elicit the behavior and protocols as concrete statements.
2. Enumerate allowed states: at least one, each concrete and reachable through a named protocol step or input from an initial allowed state.
3. Enumerate forbidden states: for each, the concrete violation, the boundary it breaches, and the terminal failure behavior the system exhibits on observing it.
4. Enumerate impossible states: for each, the structural invariant or boundary that makes it unreachable, or stop and reclassify.
5. Prove the partition over the state space. For each allowed state, show the protocol-step sequence reaching it from an initial allowed state. For each forbidden state, show the allowed-step sequence that could reach it, then the boundary or failure behavior that intervenes. For each impossible state, show that no allowed protocol sequence can reach it because of the named invariant.
6. Write the success predicate: a concrete, checkable condition true if and only if the system satisfies the contract. Test it mentally (true for at least one allowed state, false for at least one forbidden state). If it cannot tell allowed from forbidden apart, reject the draft and ask the user to sharpen it.
7. Present the complete draft (behavior, protocols, all three state classes with invariants, proof, predicate, and failure behaviors) for approval. On approval, write it to the named local document; on rejection, revise per feedback and re-present. Never persist a rejected or unapproved contract.

## The document you hand back

A local finished-system contract in this order: behavior, protocols, allowed states, forbidden states, impossible states with the invariant or boundary behind each, the concrete state-space proof, the falsifiable success predicate, and terminal failure behavior for every forbidden state.
Pliki w paczce (2)
  • SKILL.md 4 KB
  • agents/openai.yaml 1 KB

Wersje

RepozytoriumWynikLicencja
Ta strona · gosuda/dalcom-skills90Apache-2.0
OutlineDriven/outline-driven-development90Apache-2.0

Migawka bazy z 13.11.2026 · wersja paczki 7768cc1d856c (skrót SHA-256 całej paczki)

Pobrania w ostatnich 30 dniach: 0 · ranking

Zgłoś problem z tym skillem: szkodliwa treść, błędny opis albo prośba autora o usunięcie.

Podobne skille

Uwagi i zgłoszenia

Wiadomość trafi do Bartosza Sokolińskiego. Adres e-mail jest potrzebny tylko do odpowiedzi. Szczegóły w polityce prywatności.