This page contains supplementary files for the paper Maximum Likelihood Estimation on the Grassmannian of Lines. We study the positive Grassmannian through the lens of algebraic statistics. A closed formula is presented for the maximum likelihood degree of the Grassmannian of lines. We conjecture that the probability simplex contains a unique local maximum, and we present computational evidence for this. This page contains the computational proof of Theorem* 2.4 (gr36.jl) along with code to reproduce the experiments in Section 3 (real_positive.jl) and the full logarithmic discriminant in Example 3.1 (gr24-log-disc.jl).