diff --git a/.github/workflows/low-hanging-fruit-audit.yml b/.github/workflows/low-hanging-fruit-audit.yml
new file mode 100644
index 0000000000..61bbda292b
--- /dev/null
+++ b/.github/workflows/low-hanging-fruit-audit.yml
@@ -0,0 +1,68 @@
+name: Low-hanging fruit focused audit
+
+on:
+  pull_request:
+    branches: [main]
+    paths:
+      - '.github/workflows/low-hanging-fruit-audit.yml'
+      - 'FormalConjectures/Other/LowHangingFruitAudit.lean'
+
+concurrency:
+  group: low-hanging-fruit-focused-audit
+  cancel-in-progress: true
+
+permissions:
+  contents: read
+
+jobs:
+  verify:
+    runs-on: ubuntu-latest
+    timeout-minutes: 45
+    steps:
+      - uses: actions/checkout@v6
+        with:
+          repository: DomTheDeveloper/formal-conjectures
+          ref: agent/low-hanging-fruit-audit
+          fetch-depth: 1
+      - name: Install Lean
+        run: |
+          curl -fsSL https://raw.githubusercontent.com/leanprover/elan/master/elan-init.sh | sh -s -- -y --default-toolchain none
+          echo "$HOME/.elan/bin" >> "$GITHUB_PATH"
+      - uses: actions/cache@v4
+        with:
+          path: |
+            .lake/packages
+            .lake/build
+          key: low-hanging-${{ runner.os }}-${{ runner.arch }}-${{ hashFiles('lean-toolchain', 'lake-manifest.json', 'lakefile.toml') }}
+          restore-keys: low-hanging-${{ runner.os }}-${{ runner.arch }}-
+      - name: Get Mathlib cache
+        run: |
+          set -euo pipefail
+          for attempt in 1 2 3; do
+            lake exe cache get && exit 0
+            sleep 10
+          done
+          exit 1
+      - name: Compile audit module
+        run: |
+          set -o pipefail
+          lake build FormalConjectures.Other.LowHangingFruitAudit 2>&1 | tee /tmp/low-hanging-compile.log
+      - name: Audit clean theorem axioms
+        if: success()
+        run: |
+          cat > /tmp/LowHangingAxioms.lean <<'EOF'
+          import FormalConjectures.Other.LowHangingFruitAudit
+          #print axioms DedekindNumber.M_eq_via_antichains
+          #print axioms MovingSofa.no_literal_volume_unique
+          EOF
+          lake env lean /tmp/LowHangingAxioms.lean 2>&1 | tee /tmp/low-hanging-axioms.log
+          ! grep -E 'sorryAx|Lean\.ofReduceBool|Lean\.trustCompiler' /tmp/low-hanging-axioms.log
+      - name: Upload diagnostics
+        if: always()
+        uses: actions/upload-artifact@v4
+        with:
+          name: low-hanging-fruit-${{ github.run_id }}
+          path: |
+            /tmp/low-hanging-compile.log
+            /tmp/low-hanging-axioms.log
+          if-no-files-found: warn
diff --git a/FormalConjectures/Other/LowHangingFruitAudit.lean b/FormalConjectures/Other/LowHangingFruitAudit.lean
new file mode 100644
index 0000000000..a69d045159
--- /dev/null
+++ b/FormalConjectures/Other/LowHangingFruitAudit.lean
@@ -0,0 +1,64 @@
+/-
+Copyright 2026 The Formal Conjectures Authors.
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    https://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+-/
+
+import FormalConjectures.Wikipedia.DedekindNumber
+import FormalConjectures.Wikipedia.MovingSofa
+
+/-!
+# Low-hanging fruit audit
+
+Clean formal consequences found while auditing two apparently easy open declarations.
+-/
+
+namespace DedekindNumber
+
+/-- A clean formal answer to the underspecified `M_eq` declaration using the already-proved
+antichain characterization. This does not prove the intended efficient Kisielewicz formula. -/
+@[category test, AMS 5 6]
+theorem M_eq_via_antichains : M = answer(M') := by
+  exact M_eq_M'
+
+end DedekindNumber
+
+namespace MovingSofa
+
+open MeasureTheory
+open scoped ENNReal EuclideanGeometry
+
+/-- No set can be the literal unique set with maximal volume: deleting one point preserves volume. -/
+@[category test, AMS 49]
+theorem no_literal_volume_unique (g : Set ℝ²) :
+    ¬ (∀ s : Set ℝ², sofaConstant = volume s ↔ s = g) := by
+  intro h
+  have hvol : sofaConstant = volume g := (h g).2 rfl
+  have hpos : 0 < volume g := by
+    rw [← hvol]
+    exact lt_of_lt_of_le (by norm_num) one_le_sofaConstant
+  have hne : g.Nonempty := by
+    by_contra hne
+    have hempty : g = ∅ := Set.not_nonempty_iff_eq_empty.mp hne
+    simp [hempty] at hpos
+  obtain ⟨p, hp⟩ := hne
+  have hmeasure : volume (g \ ({p} : Set ℝ²)) = volume g := by
+    exact measure_diff_null (by simp)
+  have hsvol : sofaConstant = volume (g \ ({p} : Set ℝ²)) := hvol.trans hmeasure.symm
+  have hset : g \ ({p} : Set ℝ²) = g := (h (g \ ({p} : Set ℝ²))).1 hsvol
+  have hp' : p ∈ g \ ({p} : Set ℝ²) := by
+    rw [hset]
+    exact hp
+  exact hp'.2 (by simp)
+
+end MovingSofa