Unbounded mutual recursion in the TOML parser of github.com/pelletier/go-toml/v2. "unstable.Parser.parseVal" dispatches nested arrays and inline tables to "parseValArray" and "parseInlineTable", which loop back into "parseVal" with no depth limit. A TOML document with deeply nested arrays or inline tables supplied to "toml.Unmarshal" or "toml.Decoder.Decode" exhausts the goroutine stack and triggers "fatal error: stack overflow", a Go runtime fatal that terminates the process and cannot be recovered. Fixed in v2.4.3, which bounds nesting at 10000 levels. The same unbounded recursion is present from v2.0.0 and in the v2.0.0 alpha and beta prereleases.