Gonum is a set of numeric libraries for the Go programming language. It contains libraries for matrices, statistics, optimization, and more
This report summarizes scanner evidence for gonum/gonum, a Go project with 8,454 GitHub stars. SynthScan examined 322,284 lines of code across 1431 source files, recording 984 pattern matches distributed across 7 syntactic categories. The legacy adjusted pattern signal is 3.1 (Low pattern signal); it is not an authorship estimate.
Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.
Use each vector to guide manual verification of the underlying findings.
Payload schema: 1.0.0 · Engine: 2.0.0 · Scoring: heuristic-density-v1 · Scan date: 2026-10-31.
Can maintainers explain intent, assumptions, and trade-offs? 981 finding(s).
Are imports declared and package/API names verified? 0 finding(s).
Are wrappers, guards, and repeated structures necessary? 3 finding(s).
Which changes need focused human review? 984 finding(s).
This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.
Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.
This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.
The scanner identified 984 distinct pattern matches across 7 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.
Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | doc.go | 1 | // Copyright ©2019 The Gonum Authors. All rights reserved. | COMMENT |
| LOW | unit/unittype.go | 21 | // Dimension is a type representing an SI base dimension or a distinct | COMMENT |
| LOW | unit/doc.go | 1 | // Copyright ©2013 The Gonum Authors. All rights reserved. | COMMENT |
| LOW | unit/doc.go | 21 | // | COMMENT |
| LOW | unit/doc.go | 41 | // while the corresponding code using float64 runs without error. | COMMENT |
| LOW | unit/doc.go | 61 | // | COMMENT |
| LOW | unit/doc.go | 81 | // of the dimensional types should be used. From will return an error if the | COMMENT |
| LOW | unit/doc.go | 101 | // const Slide unit.Volume = 0.1 * unit.Micro * unit.Litre | COMMENT |
| LOW | unit/constant/doc.go | 1 | // Copyright ©2019 The Gonum Authors. All rights reserved. | COMMENT |
| LOW | mat/symband.go | 61 | // NewSymBandDense creates a new SymBand matrix with n rows and columns. If data == nil, | COMMENT |
| LOW | mat/cmatrix.go | 21 | // It will panic if i or j are out of bounds for the matrix. | COMMENT |
| LOW | mat/cmatrix.go | 121 | } | COMMENT |
| LOW | mat/inner.go | 1 | // Copyright ©2014 The Gonum Authors. All rights reserved. | COMMENT |
| LOW | mat/vector.go | 841 | // Permute rearranges the elements of the n-vector v in the receiver as | COMMENT |
| LOW | mat/symmetric_example_test.go | 41 | // ⎢ 3 7 10 11 12⎥ | COMMENT |
| LOW | mat/band.go | 101 | COMMENT | |
| LOW | mat/band.go | 121 | // from the rows outside the band and aligning the diagonals. For example, the matrix | COMMENT |
| LOW | mat/gsvd_example_test.go | 41 | q.Mul(&zR, &q) | COMMENT |
| LOW | mat/gsvd_example_test.go | 61 | // . | COMMENT |
| LOW | mat/gsvd_example_test.go | 81 | // ⎣-14262.7217 -10902.1488 15762.8719⎦ | COMMENT |
| LOW | mat/matrix.go | 161 | // the view. Similarly, if the matrix shares backing data with another variable, using | COMMENT |
| LOW | mat/svd_test.go | 321 | }, wm: 4, wn: 2, | COMMENT |
| LOW | mat/svd.go | 61 | // A = U * Σ * Vᵀ | COMMENT |
| LOW | mat/svd.go | 281 | // minimize over n-element vectors x: |b - A*x|_2 and |x|_2 | COMMENT |
| LOW | mat/svd.go | 361 | func (m repVector) T() Matrix { return Transpose{m} } | COMMENT |
| LOW | mat/eigen_example_test.go | 61 | // ⎣ 1 1⎦ | COMMENT |
| LOW | mat/cholesky_example_test.go | 101 | fmt.Printf("\nU'ᵀ * U' = %0.4v\n", mat.Formatted(&au, mat.Prefix(" "))) | COMMENT |
| LOW | mat/cholesky.go | 41 | // particular finding solutions to linear equations. It is very inefficient | COMMENT |
| LOW | mat/cholesky.go | 481 | c.cond = orig.cond // Scaling by a positive constant does not change the condition number. | COMMENT |
| LOW | mat/cholesky.go | 501 | panic(badSliceLength) | COMMENT |
| LOW | mat/cholesky.go | 541 | } | COMMENT |
| LOW | mat/cholesky.go | 581 | } | COMMENT |
| LOW | mat/cholesky.go | 601 | // | COMMENT |
| LOW | mat/cholesky.go | 941 | COMMENT | |
| LOW | mat/io.go | 41 | // SymmetricBand 'S' 'B' ul false n n k k | COMMENT |
| LOW | mat/io.go | 121 | if err != nil { | COMMENT |
| LOW | mat/io.go | 181 | for i := range m.mat.Data { | COMMENT |
| LOW | mat/io.go | 241 | return n, err | COMMENT |
| LOW | mat/dense.go | 641 | // A[i,0:n] is moved to A[p[i],0:n] for i=0,1,...,m-1. | COMMENT |
| LOW | mat/hogsvd_example_test.go | 41 | // Africa | COMMENT |
| LOW | mat/hogsvd_example_test.go | 61 | // ⎢-0.0008 -0.0081 -0.0009⎥ | COMMENT |
| LOW | mat/hogsvd_example_test.go | 81 | // ⎢-0.0003 -0.0130 0.0025⎥ | COMMENT |
| LOW | mat/hogsvd_example_test.go | 101 | // ⎢-0.1238 -0.0054 0.0313⎥ | COMMENT |
| LOW | mat/hogsvd_example_test.go | 121 | // ⎢-0.0178 -0.0208 -0.0075⎥ | COMMENT |
| LOW | mat/triband.go | 161 | // NewTriBandDense creates a new triangular banded matrix with n rows and columns, | COMMENT |
| LOW | mat/triband.go | 181 | // 1 2 3 | COMMENT |
| LOW | mat/triband.go | 261 | COMMENT | |
| LOW | mat/triband.go | 661 | // dst is upper triangular, s is stored in lower triangle. | COMMENT |
| LOW | mat/product.go | 1 | // Copyright ©2015 The Gonum Authors. All rights reserved. | COMMENT |
| LOW | mat/lu.go | 21 | COMMENT | |
| LOW | mat/lu.go | 381 | COMMENT | |
| LOW | mat/lu.go | 421 | t = blas.Trans | COMMENT |
| LOW | mat/doc.go | 1 | // Copyright ©2015 The Gonum Authors. All rights reserved. | COMMENT |
| LOW | mat/doc.go | 21 | // the FooDense types implemented in this package. We use "Matrix" to | COMMENT |
| LOW | mat/doc.go | 41 | // Operations involving matrix data are implemented as functions when the values | COMMENT |
| LOW | mat/doc.go | 61 | // An empty matrix is one that has zero size. Empty matrices are used to allow | COMMENT |
| LOW | mat/doc.go | 81 | // returns the dimensions of the Matrix, At, which returns the element in the | COMMENT |
| LOW | mat/doc.go | 101 | // | COMMENT |
| LOW | mat/doc.go | 121 | // *LU.RankOne. | COMMENT |
| LOW | mat/doc.go | 141 | // c.Mul(a, b) | COMMENT |
| 913 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM⚡ | spatial/curve/hilbert_test.go | 106 | // ═══════════════╬════════════════╬════════════════╬═══════════════ | COMMENT |
| MEDIUM⚡ | spatial/curve/hilbert_test.go | 111 | // ═══════════════╬════════════════╬════════════════╬═══════════════ | COMMENT |
| MEDIUM⚡ | spatial/curve/hilbert_test.go | 116 | // ═══════════════╬════════════════╬════════════════╬═══════════════ | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | blas/testblas/dgemv.go | 623 | // TODO: Add tests for dimension mismatch | COMMENT |
| LOW | blas/testblas/dger.go | 190 | // TODO: Add tests where a is longer | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | lapack/testlapack/dgetrs.go | 25 | // number in this test to make it more robust to code changes in other | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | lapack/gonum/dgghrd.go | 101 | // Step 1: rotate rows jrow-1, jrow to kill A[jrow,jcol]. | COMMENT |
| LOW | lapack/gonum/dgghrd.go | 113 | // Step 2: rotate columns jrow, jrow-1 to kill B[jrow,jrow-1]. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | lapack/gonum/dgghrd.go | 101 | // Step 1: rotate rows jrow-1, jrow to kill A[jrow,jcol]. | COMMENT |
| LOW | lapack/gonum/dgghrd.go | 113 | // Step 2: rotate columns jrow, jrow-1 to kill B[jrow,jrow-1]. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | spatial/transform/umeyama.go | 35 | // Example usage: | COMMENT |