[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M75MSNRJ69DFM6Y8NEPF2CX0":3,"skill-same:01M75MSNRJ69DFM6Y8NEPF2CX0":45},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":18,"linkOnly":19,"markdownContent":20,"markdownBody":21,"frontMatter":22,"refName":23,"commitSha":24,"skillDirectory":25,"forksCount":26,"repositoryHtmlUrl":27,"repositoryHomepageUrl":28,"ownerHtmlUrl":29,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":30,"install":31,"resources":44},"01M75MSNRJ69DFM6Y8NEPF2CX0","property-based-testing",null,"Use when example tests can't cover the input space — parsers, serializers, encoders, money math, state machines, anything with a roundtrip or invariant. Assert properties that hold for all inputs, let the framework generate cases and shrink failures to a minimal counterexample.","selamy-labs\u002Fagent-skills","selamy-labs","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F287832944?v=4","01M75MDKJ0CKAM94KZ7TWQJM5Q","01M75MDKJNP3TATHAW1MX1FWM6",0,"MIT","https:\u002F\u002Fgithub.com\u002Fselamy-labs\u002Fagent-skills\u002Fblob\u002Fmain\u002Fskills\u002Fproperty-based-testing\u002FSKILL.md",[],[],"2026-11-12 13:55:43",false,"---\nname: property-based-testing\ndescription: Use when example tests can't cover the input space — parsers, serializers, encoders, money math, state machines, anything with a roundtrip or invariant. Assert properties that hold for all inputs, let the framework generate cases and shrink failures to a minimal counterexample.\n---\n\n# Property-Based Testing\n\nExample tests check the handful of inputs you thought of. Property-based tests\ncheck a property against thousands the framework generates — and when one fails,\nit *shrinks* the failure to the smallest input that still breaks, handing you a\nminimal repro instead of a haystack. Reach for it where the input space is too\nbig to enumerate and a clear invariant exists.\n\n## Where it earns its keep\n\n- **Roundtrips**: `decode(encode(x)) == x` for all `x` — serializers, parsers,\n  protobuf\u002FJSON codecs, compression.\n- **Invariants**: a sorted list is sorted and a permutation of the input; a\n  balance never goes negative; a state machine never reaches an illegal state.\n- **Equivalence \u002F oracle**: the fast\u002Fnew implementation agrees with the\n  slow\u002Freference one for all inputs (the parallel-run check in a rewrite).\n- **Idempotence \u002F commutativity**: `f(f(x)) == f(x)`; `apply(a,b) == apply(b,a)`.\n\n## Finding the property\n\nThe skill is naming the property, not writing the generator. Ask: what must be\ntrue *regardless* of the input? Common shapes — \"there and back\" (roundtrip),\n\"different path, same result\" (oracle\u002Fcommutativity), \"some things never change\"\n(invariant), \"doing it twice = doing it once\" (idempotence). If you can't state\none, the code may not have a crisp contract yet — that's itself a finding.\n\n## Shape of a test\n\n```python\nfrom hypothesis import given, strategies as st\n\n@given(st.binary())\ndef test_roundtrip(payload):\n    assert decode(encode(payload)) == payload     # holds for ALL payloads\n```\n\n## Stateful histories and read-only observations\n\nFor history-bearing stores, generate valid **action sequences** against a small\nreference model: repeated updates, ownership changes, observations and reloads.\nCheck required state, proofs and unrelated fields after every action; shrink the\nsequence, not just its final input.\n\n- **Growth:** bound encoded bytes, retained-record counts and nesting against\n  the required retained payload at increasing sequence lengths. Include an\n  increasing-payload control. If each event should be retained once, repeated\n  fixed-size changes must not recursively embed earlier histories.\n- **Observation:** when an API promises read-only inspection, assert no store\n  write, replacement or fsync. Unchanged decoded state or bytes alone can hide\n  a same-byte rewrite. Check file identity\u002Fmtime or spy persistence calls;\n  account separately for declared cache or telemetry effects.\n- **Controls:** exercise updates alone, transfers alone, interleaved actions,\n  repeated reads and reloads. Retain legitimate history and required evidence;\n  a smaller file obtained by losing records is not a passing result.\n\nIf stored state is unexpectedly large, inspect metadata and the serialization\nand mutation paths first. Reproduce with a tiny owned fixture under event,\nbyte and time limits before loading, copying or hashing the full store. Keep\nany necessary production inspection within existing ownership and resource\nbounds; synthetic timings do not measure production latency.\n\n## Discipline\n\n- **Assert behavior, not the implementation** — a property restating the code\n  proves nothing.\n- **Save the shrunk counterexample as a regression example test** — property\n  tests find the bug; a pinned example keeps it dead (pairs with\n  regression-ratchet).\n- **Constrain generators to the real domain** (valid ranges, encodings) so\n  failures are real bugs, not \"we never accept that input anyway.\"\n- **Don't replace example tests** — keep readable examples for the common path;\n  add properties for the space you can't enumerate. They're complementary.\n","# Property-Based Testing\n\nExample tests check the handful of inputs you thought of. Property-based tests\ncheck a property against thousands the framework generates — and when one fails,\nit *shrinks* the failure to the smallest input that still breaks, handing you a\nminimal repro instead of a haystack. Reach for it where the input space is too\nbig to enumerate and a clear invariant exists.\n\n## Where it earns its keep\n\n- **Roundtrips**: `decode(encode(x)) == x` for all `x` — serializers, parsers,\n  protobuf\u002FJSON codecs, compression.\n- **Invariants**: a sorted list is sorted and a permutation of the input; a\n  balance never goes negative; a state machine never reaches an illegal state.\n- **Equivalence \u002F oracle**: the fast\u002Fnew implementation agrees with the\n  slow\u002Freference one for all inputs (the parallel-run check in a rewrite).\n- **Idempotence \u002F commutativity**: `f(f(x)) == f(x)`; `apply(a,b) == apply(b,a)`.\n\n## Finding the property\n\nThe skill is naming the property, not writing the generator. Ask: what must be\ntrue *regardless* of the input? Common shapes — \"there and back\" (roundtrip),\n\"different path, same result\" (oracle\u002Fcommutativity), \"some things never change\"\n(invariant), \"doing it twice = doing it once\" (idempotence). If you can't state\none, the code may not have a crisp contract yet — that's itself a finding.\n\n## Shape of a test\n\n```python\nfrom hypothesis import given, strategies as st\n\n@given(st.binary())\ndef test_roundtrip(payload):\n    assert decode(encode(payload)) == payload     # holds for ALL payloads\n```\n\n## Stateful histories and read-only observations\n\nFor history-bearing stores, generate valid **action sequences** against a small\nreference model: repeated updates, ownership changes, observations and reloads.\nCheck required state, proofs and unrelated fields after every action; shrink the\nsequence, not just its final input.\n\n- **Growth:** bound encoded bytes, retained-record counts and nesting against\n  the required retained payload at increasing sequence lengths. Include an\n  increasing-payload control. If each event should be retained once, repeated\n  fixed-size changes must not recursively embed earlier histories.\n- **Observation:** when an API promises read-only inspection, assert no store\n  write, replacement or fsync. Unchanged decoded state or bytes alone can hide\n  a same-byte rewrite. Check file identity\u002Fmtime or spy persistence calls;\n  account separately for declared cache or telemetry effects.\n- **Controls:** exercise updates alone, transfers alone, interleaved actions,\n  repeated reads and reloads. Retain legitimate history and required evidence;\n  a smaller file obtained by losing records is not a passing result.\n\nIf stored state is unexpectedly large, inspect metadata and the serialization\nand mutation paths first. Reproduce with a tiny owned fixture under event,\nbyte and time limits before loading, copying or hashing the full store. Keep\nany necessary production inspection within existing ownership and resource\nbounds; synthetic timings do not measure production latency.\n\n## Discipline\n\n- **Assert behavior, not the implementation** — a property restating the code\n  proves nothing.\n- **Save the shrunk counterexample as a regression example test** — property\n  tests find the bug; a pinned example keeps it dead (pairs with\n  regression-ratchet).\n- **Constrain generators to the real domain** (valid ranges, encodings) so\n  failures are real bugs, not \"we never accept that input anyway.\"\n- **Don't replace example tests** — keep readable examples for the common path;\n  add properties for the space you can't enumerate. They're complementary.\n",{"name":5,"description":7},"main","54007b08157feb09e5bb9d7ff5ce4ddd21625dbf","skills\u002Fproperty-based-testing",3,"https:\u002F\u002Fgithub.com\u002Fselamy-labs\u002Fagent-skills","https:\u002F\u002Fselamy.dev","https:\u002F\u002Fgithub.com\u002Fselamy-labs","2026-11-15 03:50:58",{"source":8,"skillName":5,"commands":32,"prompt":42,"zipAvailable":43},[33,36,39],{"tool":34,"command":35},"npx","npx skills add selamy-labs\u002Fagent-skills --skill property-based-testing",{"tool":37,"command":38},"bunx","bunx skills add selamy-labs\u002Fagent-skills --skill property-based-testing",{"tool":40,"command":41},"pnpm","pnpm dlx skills add selamy-labs\u002Fagent-skills --skill property-based-testing","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fselamy-labs\u002Fagent-skills\u002Fblob\u002Fmain\u002Fskills\u002Fproperty-based-testing\u002FSKILL.md",true,[],[46,53,60,67,73,80],{"skillNo":47,"name":48,"nameZh":6,"description":49,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":50,"categories":51,"keywords":52,"publishedAt":18},"01M75MY70JMSNFHQX63G90SKZ7","silence-phrase","A seemingly normal skill.","https:\u002F\u002Fgithub.com\u002Fselamy-labs\u002Fagent-skills\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Fsilence-phrase\u002FSKILL.md",[],[],{"skillNo":54,"name":55,"nameZh":6,"description":56,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":57,"categories":58,"keywords":59,"publishedAt":18},"01M75MY5PKVKY60M8H2DFTW58C","selamy-bad-skill","This skill has a vendor prefix that should be rejected.","https:\u002F\u002Fgithub.com\u002Fselamy-labs\u002Fagent-skills\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Fprefixed-name\u002FSKILL.md",[],[],{"skillNo":61,"name":62,"nameZh":6,"description":63,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":64,"categories":65,"keywords":66,"publishedAt":18},"01M75MY1TKXCH6WYN9ET0W4T02","oversized-description","This is a very long description that contains way too many words and should be rejected by the validator because it exceeds the forty five word limit that is enforced by the naming lint checker which ensures skill descriptions stay concise and readable for humans and machines alike without unnecessary verbosity or padding","https:\u002F\u002Fgithub.com\u002Fselamy-labs\u002Fagent-skills\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Foversized-description\u002FSKILL.md",[],[],{"skillNo":68,"name":69,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":70,"categories":71,"keywords":72,"publishedAt":18},"01M75MY0SZ7EKT99NWJEJ8HKS2","missing-frontmatter","https:\u002F\u002Fgithub.com\u002Fselamy-labs\u002Fagent-skills\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Fmissing-frontmatter\u002FSKILL.md",[],[],{"skillNo":74,"name":75,"nameZh":6,"description":76,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":77,"categories":78,"keywords":79,"publishedAt":18},"01M75MXYMBREE6D7KRR87YM4DH","malicious-skill","A poisoned skill used only as a negative fixture for the security gate.","https:\u002F\u002Fgithub.com\u002Fselamy-labs\u002Fagent-skills\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Fmalicious-skill\u002FSKILL.md",[],[],{"skillNo":81,"name":82,"nameZh":6,"description":83,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":84,"categories":85,"keywords":86,"publishedAt":18},"01M75MXX2B7AC2QSSRRQQXTA0N","leaking-org-name","A skill about something.","https:\u002F\u002Fgithub.com\u002Fselamy-labs\u002Fagent-skills\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Fleaking-org-name\u002FSKILL.md",[],[]]