snarkdown

Summary resolves each link's by rewriting the entire output string on every closing : grows with the input, and rescans it from the start each time, so a document with N links is O(n²). Because Markdown is untrusted input by definition, this is a CPU-exhaustion / DoS vector (CWE-407): a single link-heavy field can block the event loop for seconds. Measured on the current code, input : Fix Instead of rewriting on every , record the offset of each `outnpm test` in the source — output is byte-for-byte identical before and after. Timing is now linear (see table); 128k links parse in ~131 ms. Notes Found and fixed with AI assistance (Claude). Happy to adjust naming/comments or add a regression test if you'd like.

input actual expected* https://babelmark.github.io/?text=this%5Cis%5C*important

Adds GFM-style table parsing as a new tokenizer alternative and a single handler branch, keeping with snarkdown's one-regex design. What it does Consecutive lines starting with are parsed as a `---:---:codetheadtbodynode:16`.