SilverSight/formal/CoreFormalism/LeanCopilotFill.lean
allaun 07e9b32284 feat: implement CMYK coloring generator, autoproof infrastructure, and conservation fix
All 9 agents completed work across 10 docket items:

1. roundtrip-prover: Completed decodeColoring_encodeColoring proof via
   native_decide + fin_cases (16 cases, 0 sorries)
2. build-integrator: Registered SilverSight.PIST.CMYKColoringCore in lakefile
3. systems-reviewer: Cross-reference audit (results pending)
4. sidon-sofa-computer: Direction A design (A*(n,x) computation)
5. gerver-colorer: Direction B design (chromatic number of Gerver's sofa)
6. pipeline-builder: CMYK -> UnitDistCandidateGen pipeline design
7. crt-formalizer: 2D CRT Sidon theorem scaffolding
8. lemma-prover: Monotonicity lemma proofs
9. golden-perturber: Golden-angle perturbation for coloring search

Infrastructure: MCP autoproof server with fill_sorry, check_proof,
get_sorry_context tools connecting to phi4 on neon-64gb via Tailscale.

Document: CONSERVATION_LAW_CORRECTION.md fixes the false inequality.
2026-07-04 01:05:14 -05:00

23 lines
816 B
Text
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

import LeanCopilot
import CoreFormalism.CRTSidon
open CoreFormalism.CRTSidon
/-- Configure the external model server on neon-64gb. -/
def modelConfig : LeanCopilot.ExternalConfig := {
url := "http://100.88.57.96:8765" -- neon's Tailscale IP, port 8765
modelName := "phi4:14b"
temperature := 0.3
maxTokens := 1024
}
/-- Register the external generator with LeanCopilot. -/
#eval do
let gen : LeanCopilot.ExternalGenerator ← LeanCopilot.ExternalGenerator.new modelConfig
LeanCopilot.registerGenerator "phi4" gen
/-- Use search_proof to fill the sidon_preserved theorem automatically. -/
theorem sidon_preserved_filled (A : List ) (hSidon : IsSidon A) (S : ) (L : List )
(hCoprime : PairwiseCoprime L) (hNonempty : L ≠ [])
(hLarge : ∀ a ∈ A, a < 2) : True := by
search_proof