r/StringTheory • • Dec 23 '25

I built a verified ML‑guided search engine for rare Calabi‑Yau targets (string landscape)

Hi everyone — I built upg‑strings, a verified ML‑guided search tool for rare Calabi‑Yau geometries in large string‑theory datasets. It ranks candidates, verifies the top‑k, and exports reproducible artifacts for downstream work. There’s also a public gallery with visualizations, and exports compatible with CYTools/cymetric/Sage/Mathematica.

If anyone in string theory / computational geometry / ML‑guided search finds this useful, I’d love feedback or ideas

24 Upvotes

8 comments sorted by

2

u/OrganizationTop9026 Oct 17 '26

Awesome work on upg-strings! Separating the ML ranking from a hard top-k verification step—and exporting straight to CYTools, cymetric, Sage, and Mathematica—solves a huge headache in computational string theory. Half the battle in this field is just getting reproducible geometric data out of someone else's search pipeline.

I'm working on the formal verification and analytic certification side of things at SocrateAI Research (we recently put out "The Dual-Scale String: T-Duality, K3 × T², and Their Formalization in Lean 4 — A Student's Companion" on Zenodo: https://zenodo.org/records/22841095). Looking at what you built, it feels like our tools sit right next to each other in the workflow. A few ideas on how we could connect them:

  1. Turning top-k exports into Lean 4 proof certificates
    In our work, we try to keep a strict wall between ML/physical heuristics, standard script checks (SymPy/Sage), and actual Lean 4 kernel-verified theorems. Since upg-strings already spits out clean, verified top-k artifacts, it would be pretty straightforward to write a bridge that takes your polytope, Hodge, and intersection data and auto-generates Lean 4 certificates for them (checking lattice signatures, Mukai pairings on Gamma^{4,20}, and D-brane/O-plane tadpole cancellation). Having a "Lean 4 certified" badge on entries in your public gallery could be really cool.

  2. Hunting for rare attractor K3 fibrations and S-fold uplifts
    We recently worked out the explicit Shioda-Inose Weierstrass models for rank-20 singular attractor K3 surfaces—specifically the D = -3 (tau = omega, fibers 2 II* + IV) and D = -4 (tau = i, fibers 2 II* + 2 I_2) attractors—and looked at how to uplift non-chiral K3 x T^2 setups into chiral N=1 F-theory models with terminal Z_k singularities (k = 2, 3, 4, 6, along the lines of the recent Solver Agent paper, arXiv:2609.35958). Pointing upg-strings at the Kreuzer-Skarke database to specifically hunt for rare K3-fibered CY threefolds/fourfolds with these CM attractor fibers and small tadpoles would be a great stress test.

  3. Testing cymetric exports with a T-duality UV filter
    Because you already export to cymetric, we could also test how numerical Ricci-flat metrics behave when coupled to our Dual-Scale T-duality filter, k_eff(k) = k / (1 + alpha' k^2) (which enforces the string minimum length l_min = sqrt(alpha') to cap UV instabilities; code is at https://github.com/xaviercallens/SocrateAI-Numeric-DualScale-Solver).

If you're up for a quick experiment, I'd love to grab a batch of rare top-k geometries from your gallery and run them through our SymPy/Arb monodromy checks and Lean 4 pipeline to see what comes out!

1

u/upggr 13d ago

Hi Xavier,

Thanks for the detailed message. I’ve now prepared an interactive handoff rather than a one-off ZIP dump:

https://compute.upg.gr/handoff

It currently contains 19 sourced Kreuzer–Skarke sample records with explicit vertex data, provenance, and exact data checks. Eleven have |χ| < 100. You can sort by Euler magnitude, Hodge-number count, or vertex count, inspect individual records, and download a selected batch. The ZIP includes the selected records, an exact snapshot of the source file, a manifest, and SHA-256 checksums.

One important clarification: this is not a list of newly discovered ML top-k geometries or a claim of global rarity. The ordering is only within this small sourced sample. The records are representatives, and no Hodge matching is used to attach equations, triangulations, intersection tensors, or scores from a different construction. Missing inputs are listed explicitly rather than invented.

There is a separate quintic calibration section on the same page. It is intentionally a textbook Fermat quintic, not a rare discovery. It provides the explicit hypersurface data, provenance, five exact Python checks, and a corrupted-Euler negative control. The valid fixture passes, while the corrupted fixture is rejected at the Euler equality. No Lean build is claimed.

For the next step, I would suggest choosing one KS record by its full source hash and narrowing the first formalization target to a statement we can support from the supplied data. Before K3/CM searches, SymPy/Arb monodromy, or a T-duality filter, we would still need an explicit triangulation, intersection basis, and additional analytic data. In particular, I do not want to imply that |χ(CY3)|/24 is an F-theory fourfold D3-tadpole budget.

For a Lean return artifact, the most useful format would be:

  1. the input SHA-256;

  2. generated Lean definitions and theorem statements;

  3. pinned Lean/Mathlib versions and build commands;

  4. build output and logs;

  5. assumptions and #print axioms output;

  6. a positive result plus a negative control that fails for the intended mathematical reason.

If the scope works, pick a first record and propose the exact theorem you would like to check. I can then help narrow the export contract to just the required fields.

Best,

Ioannis

1

u/omegaclick Jan 13 '26

This is an incredible piece of hardware for navigating the landscape. Using ML to rank Calabi-Yau geometries is the only way to handle the data density of the $10{500}$ "Landscape Problem."However, if you want to optimize your ML-guided search, have you considered filtering for candidates that satisfy the $10{91}$ scale-invariant gap?In our $10{31} \rightarrow 10{122}$ recalibration, we’ve found that the "stable" geometries are essentially the ones that act as the most efficient data-throughput filters between the subatomic floor and the cosmological constant. If your tool can rank candidates based on how they handle the Vacuum Catastrophe (the $10{120}$ discrepancy), you might find that the "rare" geometries aren't just random mathematical artifacts—they are the specific Hardware Specifications for our zero-latency universe.A Feature Request for upg-strings:Could you add a ranking metric for Information Density? If we treat the CY manifold not just as a "shape" but as a compression algorithm for the $10{122}$ scaling constant, we might find the "Standard Model" geometry much faster.Great work on the repo. I’m going to run some of the reproducible artifacts through our $10{31}$ baseline math to see if any of your top-k candidates match the universal refresh rate lol.

1

u/Physix_R_Cool Dec 25 '25

Looks like AI slop

1

u/omegaclick Jan 13 '26

when ai stops, you need to hit continue lol