¬ V ⇒ ¬ C
Code ⊆ Verifiable
∀x: Code(x) ⇒ Verifiable(x)
If you can’t verify it, you can’t code it means:
before building a feature, you must know how to prove that it works correctly.
before building a feature, you must know how to prove that it works correctly.
Examples:
“The app should be fast.” - Not enough.
Verifiable: “The app loads in under 1 second.”
“The UX should be intuitive.” - Not enough.
Verifiable: “80% of users complete the task without help.”
“The AI should give good answers.” - Not enough.
Verifiable: “In 95% of test cases, the answer is factually correct.”
“Checkout should be simple.” - Not enough.
Verifiable: “The order can be completed in 3 steps.”
“The system should be secure.” - Not enough.
Verifiable: “Access is denied without a valid token.”
“The feature is done.” - Not enough.
Verifiable: “It passes tests and meets acceptance criteria.”
Inspired by and based on:
VibeCoding Constitution: No verification, No code, licensed under CC BY-SA 4.0.
Czech version
Verze dokumentu: 0.01_26-06-15 CC BY 4.0
Download
C ≤ V
V = 1 ověřeno, V = 0 neověřeno
C = 1 kód, C = 0 žádný kód
0 0 = No verification, No code
V=0 ⇒ C=0
01 = No verification, but code
Kód projde jen tehdy, když současně platí:
Záměr ∧ Kritéria ∧ Testy ∧ Diff-check = PASS
CodeAllowed = Intent ∧ AcceptanceCriteria ∧ Tests ∧ Review
Verification = proof that it works as intended
VibeCoding Ústava: Co neověříš, nekóduj
Verifikace = ověření důkazem
1 komentář:
N = 01001110
o = 01101111
= 00100000
v = 01110110
e = 01100101
r = 01110010
i = 01101001
f = 01100110
i = 01101001
c = 01100011
a = 01100001
t = 01110100
i = 01101001
o = 01101111
n = 01101110
, = 00101100
= 00100000
N = 01001110
o = 01101111
= 00100000
c = 01100011
o = 01101111
d = 01100100
e = 01100101
. = 00101110
Okomentovat