crypto-protocol-diagram

Point the skill at the source directory; it greps for handshake, round, send, and recv entry points, identifies parties from struct and class names, traces message flow, and writes a Mermaid sequenceDiagram file plus an inline ASCII diagram with a protocol summary.

Yes. The spec workflow handles RFCs, pseudocode, informal prose, ProVerif (.pv), and Tamarin (.spthy) files. It extracts parties, message ordering, and crypto operations using format-specific parsing rules, then flags ambiguities with warning annotations.

Yes. ProVerif out/in channel pairs are matched to message arrows, and Tamarin rules are ordered via state facts. Because Tamarin uses a Dolev-Yao attacker model, diagrams are annotated to note that all messages transit the adversary network.

crypto-protocol-diagram extracts protocol semantics: who sends what to whom and which cryptographic operations occur at each step. diagramming-code visualizes code structure such as call graphs, class hierarchies, and module dependencies.

Common causes are colons inside message labels, special characters in participant IDs, unclosed rect/loop/alt blocks, and labels containing the word end. The mermaid-sequence-syntax reference lists fixes for each pitfall.

Do not use it for call graphs or module dependency maps, for formally verifying a protocol, or when the input has no protocol semantics such as parties exchanging messages. Formal verification is a separate downstream step.