diff --git a/LeanEval/Geometry/PascalPappus.lean b/LeanEval/Geometry/PascalPappus.lean
new file mode 100644
index 0000000..c341780
--- /dev/null
+++ b/LeanEval/Geometry/PascalPappus.lean
@@ -0,0 +1,46 @@
+import Mathlib
+import EvalTools.Markers
+
+namespace LeanEval.Geometry.PascalPappus
+
+/-!
+# Pascal's theorem and Pappus's hexagon theorem
+
+`pascal` (Pascal 1639): six points on a non-singular conic give three collinear
+intersection points. `pappus` (Pappus, c. 320 AD): the degenerate-conic case
+with the six points on two lines. Trusted helpers (`SamePoint`, `OnConic`,
+`meet`, `Collinear3`) are non-holes. Mathlib has the cross product `⨯₃` and
+projective vocabulary but neither theorem.
+Category-(b) candidates from §146 of the Knill survey.
+-/
+
+open Matrix
+
+/-- Two homogeneous coordinate vectors represent the same projective point. -/
+def SamePoint (v w : Fin 3 → ℝ) : Prop := ∃ c : ℝ, c ≠ 0 ∧ w = c • v
+
+/-- `[v]` lies on the conic `xᵀ M x = 0`. -/
+def OnConic (M : Matrix (Fin 3) (Fin 3) ℝ) (v : Fin 3 → ℝ) : Prop :=
+  v ⬝ᵥ (M *ᵥ v) = 0
+
+/-- Intersection (meet) of line `[a][b]` and line `[c][d]`. -/
+def meet (a b c d : Fin 3 → ℝ) : Fin 3 → ℝ := (a ⨯₃ b) ⨯₃ (c ⨯₃ d)
+
+/-- Three projective points are collinear (vanishing triple product). -/
+def Collinear3 (p q r : Fin 3 → ℝ) : Prop := p ⬝ᵥ (q ⨯₃ r) = 0
+
+/-- **Pascal's theorem.** Six distinct points on a non-singular conic determine
+three collinear intersection points `Aᵢ Bⱼ ∩ Aⱼ Bᵢ`. -/
+@[eval_problem]
+theorem pascal
+    (M : Matrix (Fin 3) (Fin 3) ℝ) (hMsymm : M.IsSymm) (hMdet : M.det ≠ 0)
+    (a₁ a₂ a₃ b₁ b₂ b₃ : Fin 3 → ℝ)
+    (ha₁ : a₁ ≠ 0) (ha₂ : a₂ ≠ 0) (ha₃ : a₃ ≠ 0)
+    (hb₁ : b₁ ≠ 0) (hb₂ : b₂ ≠ 0) (hb₃ : b₃ ≠ 0)
+    (hdist : [a₁, a₂, a₃, b₁, b₂, b₃].Pairwise (fun v w => ¬ SamePoint v w))
+    (hA₁ : OnConic M a₁) (hA₂ : OnConic M a₂) (hA₃ : OnConic M a₃)
+    (hB₁ : OnConic M b₁) (hB₂ : OnConic M b₂) (hB₃ : OnConic M b₃) :
+    Collinear3 (meet a₁ b₂ a₂ b₁) (meet a₁ b₃ a₃ b₁) (meet a₂ b₃ a₃ b₂) := by
+  sorry
+
+end LeanEval.Geometry.PascalPappus
diff --git a/manifests/problems/pascal.toml b/manifests/problems/pascal.toml
new file mode 100644
index 0000000..5bc45ad
--- /dev/null
+++ b/manifests/problems/pascal.toml
@@ -0,0 +1,9 @@
+id = "pascal"
+title = "Pascal's theorem"
+test = false
+module = "LeanEval.Geometry.PascalPappus"
+holes = ["pascal"]
+submitter = "Kim Morrison"
+notes = "Six distinct points on a non-singular conic determine three collinear intersection points Aᵢ Bⱼ ∩ Aⱼ Bᵢ. Trusted helpers (SamePoint, OnConic, meet, Collinear3) are non-holes, built on the cross product ⨯₃. Mathlib has the projective vocabulary but not Pascal's theorem. Candidate from §146 of the Knill survey."
+source = "B. Pascal, *Essay pour les coniques* (1640). Knill, *Some fundamental theorems in mathematics*, §146."
+informal_solution = "Project-and-compute, or the classical synthetic proof. Algebraically: choose homogeneous coordinates; the conic is xᵀMx=0. The three meet points' collinearity is a polynomial identity in the six points' coordinates that holds on the conic — provable by a Gröbner/resultant computation, or synthetically via the converse of Menelaus applied to the hexagon, or as the d=2 Cayley–Bacharach instance (a cubic through 8 of the 9 base points of two degenerate cubics passes through the 9th). None of this packaging is in Mathlib."