[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7AMZ1QC58DDWYF84H3AFFX1":3,"skill-same:01M7AMZ1QC58DDWYF84H3AFFX1":48},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":27,"repositoryHtmlUrl":28,"repositoryHomepageUrl":29,"ownerHtmlUrl":30,"ownerBlogUrl":31,"ownerDescription":32,"updatedAt":33,"install":34,"resources":47},"01M7AMZ1QC58DDWYF84H3AFFX1","logic-sequential-timing-metastability-cdc-and-hdl",null,"Use for sequential design and the failures that are hardest to debug: latches and flip-flops, timing with setup, hold, slack and metastability, state machine design and encoding, clock domain crossing and the synchronizer patterns that make it safe, HDL and synthesis and what the tool will and will not infer, and test and design for test including scan chains and fault coverage.","the-vibey-project\u002Fvibey","the-vibey-project","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F329298758?v=4","01M7AJHGZ9722CTJ4JNQZVRH0Q","the vibey project","01M7AJHGZVMG2K7TGXQ6XFHVG3",5,"MIT","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fdigital-logic-and-firmware-engineering\u002Fskills\u002Flogic-sequential-timing-metastability-cdc-and-hdl\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: logic-sequential-timing-metastability-cdc-and-hdl\ndescription: \"Use for sequential design and the failures that are hardest to debug: latches and flip-flops, timing with setup, hold, slack and metastability, state machine design and encoding, clock domain crossing and the synchronizer patterns that make it safe, HDL and synthesis and what the tool will and will not infer, and test and design for test including scan chains and fault coverage.\"\n---\n\n# Digital Logic and Firmware: Latches and Flip-Flops, Timing and Metastability, State Machines, Clock Domain Crossing, HDL and Synthesis, and Test and DFT\n\n> **Part 3 of 5** of the *CMOS, Logic Gates and Firmware Engineering* reference (plugin `digital-logic-and-firmware-engineering`), covering §14–§19. Sibling skills: `logic-devices-transistors-cmos-gates-and-power` (§0–§8), `logic-standard-cells-boolean-minimization-and-arithmetic` (§9–§13), `logic-firmware-boot-root-of-trust-embedded-practice-and-security` (§20–§25), `logic-reference` (§26–§31). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** Boolean algebra and CMOS circuit design do not change. Two things are moving. See §26 → `logic-reference` for the Secure Boot certificate expiry, and open-source firmware and silicon roots of trust.\n\n> **⚠️ SCOPE, because this sits between existing neighbours.** ⚠️ **A semiconductor\n> reference covers device physics and fabrication; a microarchitecture reference covers how\n> gates become processors. Neither covers the two layers here: HOW TRANSISTORS BECOME\n> BOOLEAN LOGIC, and HOW A MACHINE GETS FROM POWER-ON TO AN OPERATING SYSTEM.**\n>\n> **⚠️ These are the two ends of the stack where the abstractions are built, and where they\n> most often leak.**\n>\n> **⚠️ GOTCHA** boxes mark where the textbook idealization and the real circuit diverge.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ CMOS COMPUTES BY CONNECTING, NOT BY AMPLIFYING** (§5 → `logic-devices-transistors-cmos-gates-and-power`). **A static CMOS gate is two\n>    complementary switch networks, one connecting the output to power and one to ground,\n>    never both. Once you see this, gate construction becomes mechanical and the power\n>    behaviour becomes obvious.**\n> 2. **⚠️ TIMING IS THE REAL CONSTRAINT, NOT LOGIC** (§15, §17). **Getting the Boolean\n>    function right is the easy part. Setup and hold violations, clock skew and metastability\n>    are what actually make digital systems fail, and they fail intermittently.**\n> 3. **⚠️ TRUST IS A CHAIN THAT STARTS BEFORE ANY SOFTWARE RUNS** (§22 → `logic-firmware-boot-root-of-trust-embedded-practice-and-security`, §25 → `logic-firmware-boot-root-of-trust-embedded-practice-and-security`, §26 → `logic-reference`). **Every\n>    security property the OS provides rests on firmware that executed first. Firmware is\n>    the most privileged and least examined code in the machine.**\n\n---\n\n## §14. ⚠️ Latches and Flip-Flops\n\n```\n⚠️ ⚠️ THE DISTINCTION PEOPLE GET WRONG\n   ⚠️ LATCH  ⚠️ LEVEL-sensitive — transparent while enable is\n      asserted. Data flows through\n   ⚠️ FLIP-FLOP  ⚠️ EDGE-triggered — samples only at the clock\n      edge\n   ⚠️ \"Latch\" and \"flip-flop\" are used loosely in conversation\n      and mean genuinely different things in design\n⚠️ CONSTRUCTION  ⚠️ cross-coupled inverters for storage · SR\n   latch · gated D latch · ⚠️ MASTER-SLAVE (two latches on\n   opposite clock phases) = edge-triggered flip-flop\n⚠️ ⚠️ INFERRED LATCHES ARE A CLASSIC HDL BUG  ⚠️ an incomplete\n   if or case statement in combinational logic makes the\n   synthesizer infer a LATCH to hold the unassigned value.\n   ⚠️ Almost never intended, causes timing problems, and every\n   linter warns about it — heed the warning\n⚠️ RESET  ⚠️ synchronous vs asynchronous. ⚠️ Asynchronous reset\n   ASSERTION is fine; ⚠️ asynchronous DE-assertion is the\n   hazard, because it can violate recovery\u002Fremoval time —\n   hence reset synchronizers\n⚠️ ENABLE  ⚠️ use a proper enabled flip-flop, ⚠️ NOT a gated\n   clock hand-built from logic (§8's clock gating is done with\n   dedicated cells for exactly this reason)\n⚠️ REGISTERS, shift registers, counters (⚠️ binary vs GRAY —\n   Gray changes one bit at a time, which matters for §17)\n```\n\n---\n\n## §15. ⚠️ Timing and Metastability\n\n> **⚠️ §1 → `logic-devices-transistors-cmos-gates-and-power`'s second organizing idea. This is what actually makes digital hardware fail.**\n```\n⚠️ ⚠️ THE TWO CONSTRAINTS, and they fail differently\n   ⚠️ SETUP TIME  data must be stable BEFORE the clock edge.\n      ⚠️ Violated by a path being TOO SLOW.\n      ⚠️ FIXABLE BY SLOWING THE CLOCK\n   ⚠️ HOLD TIME  data must remain stable AFTER the edge.\n      ⚠️ Violated by a path being TOO FAST.\n      ⚠️ NOT FIXABLE BY SLOWING THE CLOCK — ⚠️ a hold violation\n      is a broken chip at any frequency, which is why hold\n      failures are far more serious\n⚠️ THE PATH EQUATION  ⚠️ clock period ≥ clock-to-Q + logic delay\n   + wire delay + setup time − clock skew\n⚠️ CLOCK SKEW  ⚠️ arrival time difference between flops.\n   ⚠️ It can HELP setup on one path while HURTING hold on\n   another — which is why clock tree synthesis targets balance\n⚠️ SLACK  ⚠️ the margin. Negative slack = failure. ⚠️ The\n   CRITICAL PATH is the worst one, and it sets the frequency\n⚠️ ⚠️ METASTABILITY  ⚠️ if setup\u002Fhold is violated, the flop can\n   enter a state between 0 and 1 and stay there for an\n   UNBOUNDED time before resolving randomly\n   ⚠️ THERE IS NO CIRCUIT THAT ELIMINATES IT. ⚠️ You can only\n   make it ARBITRARILY UNLIKELY by allowing resolution time —\n   which is what a two-flop synchronizer buys\n   ⚠️ MTBF is the metric, and it improves EXPONENTIALLY with\n   the time allowed — which is why adding one more flop stage\n   helps so much\n```\n\n---\n\n## §16. State Machines\n\n**⚠️ Moore versus Mealy**: ⚠️ **Moore outputs depend only on state (⚠️ registered, glitch\nfree, one cycle later); Mealy outputs depend on state AND inputs (⚠️ faster response,\ncombinational path from input to output, which can create timing problems across module\nboundaries).**\n**⚠️ State encoding**: ⚠️ **binary (fewest flops), ⚠️ ONE-HOT (⚠️ one flop per state,\nsimpler and faster decode logic, and usually the right choice in FPGAs where flops are\nplentiful), and Gray.**\n**⚠️ The design discipline**: ⚠️ **state diagram first, then a coded template — and separate\nthe next-state logic, the state register and the output logic into distinct blocks, because\nthat structure both reads clearly and synthesizes predictably.**\n**⚠️ Unreachable and illegal states** — ⚠️ **and for anything safety-related, a default case\nthat returns to a known state, because a glitch or upset can put a machine in a state your\ndiagram doesn't contain.**\n\n---\n\n## §17. ⚠️ Clock Domain Crossing\n\n> **⚠️ Where §15's metastability becomes a design discipline rather than an analysis.**\n```\n⚠️ THE PROBLEM  ⚠️ a signal generated in one clock domain and\n   sampled in another has NO timing relationship. ⚠️ Setup and\n   hold WILL be violated eventually — it is a matter of\n   probability, not possibility\n⚠️ ⚠️ THIS IS THE CLASSIC SOURCE OF \"WORKS ON THE BENCH, FAILS\n   IN THE FIELD\" BUGS. ⚠️ An unsynchronized crossing can run\n   correctly for days and then fail\n⚠️ THE TECHNIQUES\n   ⚠️ TWO-FLOP SYNCHRONIZER  ⚠️ for SINGLE-BIT LEVEL signals only\n   ⚠️ PULSE SYNCHRONIZER \u002F toggle synchronizer  for events\n   ⚠️ ⚠️ MULTI-BIT DATA CANNOT USE A SIMPLE SYNCHRONIZER —\n      ⚠️ each bit resolves independently, so you can capture a\n      value that never existed. ⚠️ THIS IS THE MOST DANGEROUS\n      CDC MISTAKE\n      ⚠️ Use: ⚠️ GRAY CODE (only one bit changes, so a bad\n      sample is at worst the old or new value) · ⚠️ handshake ·\n      ⚠️ ASYNCHRONOUS FIFO — the standard solution for streams\n   ⚠️ RESET SYNCHRONIZATION (§14)\n⚠️ ⚠️ CDC VERIFICATION TOOLS EXIST AND SHOULD BE RUN. ⚠️ Static\n   CDC analysis finds unsynchronized crossings that simulation\n   will not, because simulation does not model metastability\n```\n\n---\n\n## §18. HDL and Synthesis\n\n**⚠️ Verilog\u002FSystemVerilog and VHDL** — ⚠️ **and the mental correction that matters most:\n⚠️ HDL IS NOT A PROGRAMMING LANGUAGE. It DESCRIBES HARDWARE. ⚠️ Statements are concurrent\nby default, and \"assignment\" creates a wire or a register, not an action in time.**\n**⚠️ Blocking versus non-blocking assignment** is the canonical beginner trap:\n⚠️ **non-blocking (`\u003C=`) for sequential logic, blocking (`=`) for combinational — and mixing\nthem in one block produces simulation\u002Fsynthesis mismatch, where the simulation passes and\nthe chip doesn't work.**\n**⚠️ The synthesizable subset is much smaller than the language** — ⚠️ **delays, most\ninitial blocks and much of the type system exist for simulation and testbenches only.**\n**⚠️ The flow**: ⚠️ **RTL → synthesis to a gate netlist → place and route → static timing\nanalysis → sign-off** (see a microarchitecture reference §24).\n**⚠️ FPGA versus ASIC** targets differ enough to change coding style: ⚠️ **FPGAs have\nabundant flops and fixed block RAM and DSP resources; ASICs have a cell library and\nenormous NRE.**\n**⚠️ Verification is the majority of the effort**: ⚠️ **testbenches, constrained-random,\ncoverage, assertions (SVA), and formal equivalence checking against §10 → `logic-standard-cells-boolean-minimization-and-arithmetic`'s BDDs.**\n\n---\n\n## §19. Test and DFT\n\n**⚠️ Manufacturing test is not verification** — ⚠️ **verification asks \"is the design\nright?\", test asks \"was THIS die made correctly?\"**\n**⚠️ Fault models**: ⚠️ **stuck-at (the classic), transition\u002Fdelay faults, bridging — and\nATPG generates patterns against them.**\n**⚠️ SCAN CHAINS** are the enabling idea: ⚠️ **connect all flip-flops into a giant shift\nregister in test mode, so you can load any state and observe any state — converting an\nunobservable sequential problem into a tractable combinational one.**\n**⚠️ BIST** for memories and logic, ⚠️ **JTAG\u002Fboundary scan for board-level test** (see a\nperipherals reference §19), ⚠️ **and test compression to keep tester time affordable.**\n**⚠️ The cost**: ⚠️ **DFT consumes area and can affect timing, and it is always cheaper than\nshipping untestable silicon.**\n\n---\n\n# PART IV — FIRMWARE\n","# Digital Logic and Firmware: Latches and Flip-Flops, Timing and Metastability, State Machines, Clock Domain Crossing, HDL and Synthesis, and Test and DFT\n\n> **Part 3 of 5** of the *CMOS, Logic Gates and Firmware Engineering* reference (plugin `digital-logic-and-firmware-engineering`), covering §14–§19. Sibling skills: `logic-devices-transistors-cmos-gates-and-power` (§0–§8), `logic-standard-cells-boolean-minimization-and-arithmetic` (§9–§13), `logic-firmware-boot-root-of-trust-embedded-practice-and-security` (§20–§25), `logic-reference` (§26–§31). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** Boolean algebra and CMOS circuit design do not change. Two things are moving. See §26 → `logic-reference` for the Secure Boot certificate expiry, and open-source firmware and silicon roots of trust.\n\n> **⚠️ SCOPE, because this sits between existing neighbours.** ⚠️ **A semiconductor\n> reference covers device physics and fabrication; a microarchitecture reference covers how\n> gates become processors. Neither covers the two layers here: HOW TRANSISTORS BECOME\n> BOOLEAN LOGIC, and HOW A MACHINE GETS FROM POWER-ON TO AN OPERATING SYSTEM.**\n>\n> **⚠️ These are the two ends of the stack where the abstractions are built, and where they\n> most often leak.**\n>\n> **⚠️ GOTCHA** boxes mark where the textbook idealization and the real circuit diverge.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ CMOS COMPUTES BY CONNECTING, NOT BY AMPLIFYING** (§5 → `logic-devices-transistors-cmos-gates-and-power`). **A static CMOS gate is two\n>    complementary switch networks, one connecting the output to power and one to ground,\n>    never both. Once you see this, gate construction becomes mechanical and the power\n>    behaviour becomes obvious.**\n> 2. **⚠️ TIMING IS THE REAL CONSTRAINT, NOT LOGIC** (§15, §17). **Getting the Boolean\n>    function right is the easy part. Setup and hold violations, clock skew and metastability\n>    are what actually make digital systems fail, and they fail intermittently.**\n> 3. **⚠️ TRUST IS A CHAIN THAT STARTS BEFORE ANY SOFTWARE RUNS** (§22 → `logic-firmware-boot-root-of-trust-embedded-practice-and-security`, §25 → `logic-firmware-boot-root-of-trust-embedded-practice-and-security`, §26 → `logic-reference`). **Every\n>    security property the OS provides rests on firmware that executed first. Firmware is\n>    the most privileged and least examined code in the machine.**\n\n---\n\n## §14. ⚠️ Latches and Flip-Flops\n\n```\n⚠️ ⚠️ THE DISTINCTION PEOPLE GET WRONG\n   ⚠️ LATCH  ⚠️ LEVEL-sensitive — transparent while enable is\n      asserted. Data flows through\n   ⚠️ FLIP-FLOP  ⚠️ EDGE-triggered — samples only at the clock\n      edge\n   ⚠️ \"Latch\" and \"flip-flop\" are used loosely in conversation\n      and mean genuinely different things in design\n⚠️ CONSTRUCTION  ⚠️ cross-coupled inverters for storage · SR\n   latch · gated D latch · ⚠️ MASTER-SLAVE (two latches on\n   opposite clock phases) = edge-triggered flip-flop\n⚠️ ⚠️ INFERRED LATCHES ARE A CLASSIC HDL BUG  ⚠️ an incomplete\n   if or case statement in combinational logic makes the\n   synthesizer infer a LATCH to hold the unassigned value.\n   ⚠️ Almost never intended, causes timing problems, and every\n   linter warns about it — heed the warning\n⚠️ RESET  ⚠️ synchronous vs asynchronous. ⚠️ Asynchronous reset\n   ASSERTION is fine; ⚠️ asynchronous DE-assertion is the\n   hazard, because it can violate recovery\u002Fremoval time —\n   hence reset synchronizers\n⚠️ ENABLE  ⚠️ use a proper enabled flip-flop, ⚠️ NOT a gated\n   clock hand-built from logic (§8's clock gating is done with\n   dedicated cells for exactly this reason)\n⚠️ REGISTERS, shift registers, counters (⚠️ binary vs GRAY —\n   Gray changes one bit at a time, which matters for §17)\n```\n\n---\n\n## §15. ⚠️ Timing and Metastability\n\n> **⚠️ §1 → `logic-devices-transistors-cmos-gates-and-power`'s second organizing idea. This is what actually makes digital hardware fail.**\n```\n⚠️ ⚠️ THE TWO CONSTRAINTS, and they fail differently\n   ⚠️ SETUP TIME  data must be stable BEFORE the clock edge.\n      ⚠️ Violated by a path being TOO SLOW.\n      ⚠️ FIXABLE BY SLOWING THE CLOCK\n   ⚠️ HOLD TIME  data must remain stable AFTER the edge.\n      ⚠️ Violated by a path being TOO FAST.\n      ⚠️ NOT FIXABLE BY SLOWING THE CLOCK — ⚠️ a hold violation\n      is a broken chip at any frequency, which is why hold\n      failures are far more serious\n⚠️ THE PATH EQUATION  ⚠️ clock period ≥ clock-to-Q + logic delay\n   + wire delay + setup time − clock skew\n⚠️ CLOCK SKEW  ⚠️ arrival time difference between flops.\n   ⚠️ It can HELP setup on one path while HURTING hold on\n   another — which is why clock tree synthesis targets balance\n⚠️ SLACK  ⚠️ the margin. Negative slack = failure. ⚠️ The\n   CRITICAL PATH is the worst one, and it sets the frequency\n⚠️ ⚠️ METASTABILITY  ⚠️ if setup\u002Fhold is violated, the flop can\n   enter a state between 0 and 1 and stay there for an\n   UNBOUNDED time before resolving randomly\n   ⚠️ THERE IS NO CIRCUIT THAT ELIMINATES IT. ⚠️ You can only\n   make it ARBITRARILY UNLIKELY by allowing resolution time —\n   which is what a two-flop synchronizer buys\n   ⚠️ MTBF is the metric, and it improves EXPONENTIALLY with\n   the time allowed — which is why adding one more flop stage\n   helps so much\n```\n\n---\n\n## §16. State Machines\n\n**⚠️ Moore versus Mealy**: ⚠️ **Moore outputs depend only on state (⚠️ registered, glitch\nfree, one cycle later); Mealy outputs depend on state AND inputs (⚠️ faster response,\ncombinational path from input to output, which can create timing problems across module\nboundaries).**\n**⚠️ State encoding**: ⚠️ **binary (fewest flops), ⚠️ ONE-HOT (⚠️ one flop per state,\nsimpler and faster decode logic, and usually the right choice in FPGAs where flops are\nplentiful), and Gray.**\n**⚠️ The design discipline**: ⚠️ **state diagram first, then a coded template — and separate\nthe next-state logic, the state register and the output logic into distinct blocks, because\nthat structure both reads clearly and synthesizes predictably.**\n**⚠️ Unreachable and illegal states** — ⚠️ **and for anything safety-related, a default case\nthat returns to a known state, because a glitch or upset can put a machine in a state your\ndiagram doesn't contain.**\n\n---\n\n## §17. ⚠️ Clock Domain Crossing\n\n> **⚠️ Where §15's metastability becomes a design discipline rather than an analysis.**\n```\n⚠️ THE PROBLEM  ⚠️ a signal generated in one clock domain and\n   sampled in another has NO timing relationship. ⚠️ Setup and\n   hold WILL be violated eventually — it is a matter of\n   probability, not possibility\n⚠️ ⚠️ THIS IS THE CLASSIC SOURCE OF \"WORKS ON THE BENCH, FAILS\n   IN THE FIELD\" BUGS. ⚠️ An unsynchronized crossing can run\n   correctly for days and then fail\n⚠️ THE TECHNIQUES\n   ⚠️ TWO-FLOP SYNCHRONIZER  ⚠️ for SINGLE-BIT LEVEL signals only\n   ⚠️ PULSE SYNCHRONIZER \u002F toggle synchronizer  for events\n   ⚠️ ⚠️ MULTI-BIT DATA CANNOT USE A SIMPLE SYNCHRONIZER —\n      ⚠️ each bit resolves independently, so you can capture a\n      value that never existed. ⚠️ THIS IS THE MOST DANGEROUS\n      CDC MISTAKE\n      ⚠️ Use: ⚠️ GRAY CODE (only one bit changes, so a bad\n      sample is at worst the old or new value) · ⚠️ handshake ·\n      ⚠️ ASYNCHRONOUS FIFO — the standard solution for streams\n   ⚠️ RESET SYNCHRONIZATION (§14)\n⚠️ ⚠️ CDC VERIFICATION TOOLS EXIST AND SHOULD BE RUN. ⚠️ Static\n   CDC analysis finds unsynchronized crossings that simulation\n   will not, because simulation does not model metastability\n```\n\n---\n\n## §18. HDL and Synthesis\n\n**⚠️ Verilog\u002FSystemVerilog and VHDL** — ⚠️ **and the mental correction that matters most:\n⚠️ HDL IS NOT A PROGRAMMING LANGUAGE. It DESCRIBES HARDWARE. ⚠️ Statements are concurrent\nby default, and \"assignment\" creates a wire or a register, not an action in time.**\n**⚠️ Blocking versus non-blocking assignment** is the canonical beginner trap:\n⚠️ **non-blocking (`\u003C=`) for sequential logic, blocking (`=`) for combinational — and mixing\nthem in one block produces simulation\u002Fsynthesis mismatch, where the simulation passes and\nthe chip doesn't work.**\n**⚠️ The synthesizable subset is much smaller than the language** — ⚠️ **delays, most\ninitial blocks and much of the type system exist for simulation and testbenches only.**\n**⚠️ The flow**: ⚠️ **RTL → synthesis to a gate netlist → place and route → static timing\nanalysis → sign-off** (see a microarchitecture reference §24).\n**⚠️ FPGA versus ASIC** targets differ enough to change coding style: ⚠️ **FPGAs have\nabundant flops and fixed block RAM and DSP resources; ASICs have a cell library and\nenormous NRE.**\n**⚠️ Verification is the majority of the effort**: ⚠️ **testbenches, constrained-random,\ncoverage, assertions (SVA), and formal equivalence checking against §10 → `logic-standard-cells-boolean-minimization-and-arithmetic`'s BDDs.**\n\n---\n\n## §19. Test and DFT\n\n**⚠️ Manufacturing test is not verification** — ⚠️ **verification asks \"is the design\nright?\", test asks \"was THIS die made correctly?\"**\n**⚠️ Fault models**: ⚠️ **stuck-at (the classic), transition\u002Fdelay faults, bridging — and\nATPG generates patterns against them.**\n**⚠️ SCAN CHAINS** are the enabling idea: ⚠️ **connect all flip-flops into a giant shift\nregister in test mode, so you can load any state and observe any state — converting an\nunobservable sequential problem into a tractable combinational one.**\n**⚠️ BIST** for memories and logic, ⚠️ **JTAG\u002Fboundary scan for board-level test** (see a\nperipherals reference §19), ⚠️ **and test compression to keep tester time affordable.**\n**⚠️ The cost**: ⚠️ **DFT consumes area and can affect timing, and it is always cheaper than\nshipping untestable silicon.**\n\n---\n\n# PART IV — FIRMWARE\n",{"name":5,"description":7},"develop","ae32736a1aabddabca5d2c96d665aa0ebc7d8700","src\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fdigital-logic-and-firmware-engineering\u002Fskills\u002Flogic-sequential-timing-metastability-cdc-and-hdl",3,"https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey","https:\u002F\u002Fthe-vibey-project.github.io\u002Fvibey\u002F","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project","https:\u002F\u002Fvibewithadam.matthewsteinberger.com","freedom for software engineers","2026-11-15 05:47:42",{"source":8,"skillName":5,"commands":35,"prompt":45,"zipAvailable":46},[36,39,42],{"tool":37,"command":38},"npx","npx skills add the-vibey-project\u002Fvibey --skill logic-sequential-timing-metastability-cdc-and-hdl",{"tool":40,"command":41},"bunx","bunx skills add the-vibey-project\u002Fvibey --skill logic-sequential-timing-metastability-cdc-and-hdl",{"tool":43,"command":44},"pnpm","pnpm dlx skills add the-vibey-project\u002Fvibey --skill logic-sequential-timing-metastability-cdc-and-hdl","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fdigital-logic-and-firmware-engineering\u002Fskills\u002Flogic-sequential-timing-metastability-cdc-and-hdl\u002FSKILL.md",true,[],[49,56,63,70,77,84],{"skillNo":50,"name":51,"nameZh":6,"description":52,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":19},"01M7AT1FQJAE1FQYAMDTF490Y4","white-paper-writing","Use when writing white papers, technical reports, policy documents, thought leadership pieces, or any long-form authoritative document. Triggers on requests to write, structure, outline, or review white papers, technical reports, position papers, policy briefs, or evidence-driven arguments. Also use for B2B content marketing strategy, technical documentation requiring authority, academic-style reports, or any document that must educate while persuading. Use when someone asks \"how should I structure this\" for a long-form document.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fwhite-paper-writing\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":19},"01M7AT16BJRJJKK2MASXRZS76G","prose-technical-mechanics","Use when editing or writing prose at a technical\u002Fmechanical level: choosing between Anglo-Saxon and Latinate diction, placing information in topic vs stress positions, writing periodic vs cumulative sentences, handling sentence rhythm, punctuation as logic, transitions, paragraph structure, or phonesthetics. Use when someone wants to understand WHY prose works or doesn't, not just surface-level style advice. Triggers on word choice, sentence structure, emphasis, rhythm, diction, or any deep writing mechanics question.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-technical-mechanics\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":67,"categories":68,"keywords":69,"publishedAt":19},"01M7AT0W9HT0ZZ9Y287NW99MR3","prose-mechanics","Use when writing, editing, or analyzing prose style; when trying to avoid generic AI-sounding writing; when applying specific prose styles such as journalistic, academic, narrative, KJV biblical, Hemingway plain, Latinate\u002FJamesian, Orwellian, Augustan, Victorian, Early Modern (Bacon, Browne, Milton), or free indirect discourse; or when coaching someone on writing voice and mechanics. Triggers on any request to improve, analyze, or write in a specific prose style, to fix \"AI-sounding\" writing, to make prose more vivid or concrete, to vary sentence rhythm, or to understand how a particular writer achieves their effects.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-mechanics\u002FSKILL.md",[],[],{"skillNo":71,"name":72,"nameZh":6,"description":73,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":19},"01M7AT0KR635JX66X2X6F3E2CP","narrative-structure","Use when structuring stories, pitches, presentations, white papers, or any persuasive narrative; analyzing the hero's journey in fiction or non-fiction; applying StoryBrand for business communication; designing narrative arcs for thought leadership; or understanding Vogler, Snyder, Propp, or Campbell frameworks. Triggers on any narrative structure, storytelling, pitch structure, StoryBrand, hero's journey, three-act structure, Freytag, Save the Cat, narrative arc, or \"how should I structure this story\u002Fpitch\u002Fpresentation\" request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fnarrative-structure\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":19},"01M7AT0AKGW09NKKZDYBT8VRDE","legal-brief-writing","Use when writing legal briefs, motions, or any court filing; when analyzing judicial cognition and persuasion; when applying elite brief-writing techniques from Roberts, Clement, Kagan, Garner; or when structuring legal arguments for maximum persuasion. Also use for autistic\u002Fneurodivergent advocates who need to understand how their natural communication style maps to elite legal advocacy. Triggers on any legal writing, brief drafting, motion preparation, or legal argument structuring request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Flegal-brief-writing\u002FSKILL.md",[],[],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":19},"01M7AT00VWPS4Q8B5VEMXX9NQT","journal-publishability-criteria","Use whenever a research paper, article or preprint is being written, revised, reviewed or published, and specifically before every publication of docs\u002Fpaper.md. Covers what legitimate journals actually gate on, in order of gating — the editor's desk screen (scope, novelty, package problems), what reviewers judge (methodological soundness, claims the evidence can carry, statistical and qualitative reporting), EQUATOR reporting guidelines, the ICMJE authorship criteria, COPE's view of text recycling, the near-universal generative-AI policy (no AI author, disclosure, author responsibility), TOP 2025 transparency standards, how to verify a journal is legitimate, submitting without an institution, and a pre-submission checklist. Triggers on requests to evaluate, review, prepare or submit a paper, to judge publishability, to write a declarations or data-availability section, to disclose AI use, or to check a journal.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fjournal-publishability-criteria\u002FSKILL.md",[],[]]