Protein Folding Prediction
Predict the structures of proteins and their molecular partners.
Task & evaluation
- Objective
- Predict biomolecular structures with one model across nine folding tracks.
- Input
- Protein sequences and molecular partners.
- Output
- 3D structures of monomers and molecular complexes.
- Data
- FoldBench; a prepared 73.1 GB release with 1,522 evaluation requests.
- Evaluation
- Track-specific structural agreement and docking success, including lDDT and DockQ.
- Research challenge
- Share structural knowledge across molecule types while preserving valid geometry and interfaces.
Understanding the task
Predicting a fold is different from assembling a molecular partnership. Explore why both chemistry and partner placement matter.
Folding is only half the problem
A protein must fold into a useful shape, but it often works by meeting another molecule. An antibody must fit its antigen; a DNA-binding protein must approach the right surface of the double helix. Predicting each partner separately cannot tell us whether they assemble correctly.
FoldBench tests one shared model in nine settings: isolated proteins, RNA and DNA, plus six kinds of molecular partnership. The challenge is to learn common rules of molecular geometry without neglecting the less familiar partners.
A good chain is only part of a good complex
Move one rigid partner. Its internal geometry stays unchanged, but the interface can disappear. All coordinates and scores below are illustrative, not benchmark predictions.
Move the slider to inspect retained reference contacts.
The two diagonal blocks stay unchanged. Local distance agreement and partner placement ask different questions. This schematic is a distance-change map, not an lDDT or DockQ calculation.
Inspect the mean and the profile
Choose a synthetic score profile, then edit any track. Each track has weight 1/9, regardless of its number of examples.
Nine-track mean 0.500
A 0.09 improvement in one track lifts the mean by only 0.01. A higher mean alone does not establish improvement across all settings.
Protein, RNA and DNA monomers: mean lDDT, with missing values scored as zero. The five protein/protein-or-nucleic-acid interface tracks: fraction with DockQ ≥ 0.23. Protein–ligand: fraction with RMSD < 2 Å and lDDT-PLI > 0.8. The final reward averages these nine scores equally. Stereochemistry checks also matter; intact schematic chains here do not establish valid all-atom geometry.
What the model can learn from
The training pool contains 100,000 molecular records. Protein sequences also arrive with fixed features from a protein language model: numerical descriptions learned from sequence patterns. RNA, DNA and small molecules require their own descriptions. The model must turn this mixed information into positions for individual atoms.
Evaluation structures are visible for diagnosis, but cannot be used for training. Repeatedly choosing models using these results makes the benchmark part of development, so it is not an untouched test of generalization. The interactive structures above are schematic.
Technical reference
| Object | Concrete representation | Meaning |
|---|---|---|
| Protein entity | E1 · sequence ACDEFG · copies 1 | A six-residue sequence; no native coordinates are supplied. |
| Frozen protein features | values [6,2560] INT8 + scales [6,40] | Groups of 64 channels share a scale; dequantize before the learned projection. |
| RNA / DNA / ligand partners | Sequences, or CCD codes / SMILES for ligands | These entities have no ESMC feature tensor. Molecular identity must still enter the shared model. |
| Assembly context | Copies, modifications, optional covalent bonds | Chain identities and atom names must survive into the output. |
| Prediction | All-atom mmCIF + ranking_score | A Cα trace alone is insufficient; ranking cannot use the native structure. |
From molecular identity to a possible assembly
The starter first represents individual atoms and relationships between molecular positions. These relationships let information cross a chain boundary: the location of one partner can influence the predicted shape of another.
A diffusion module then turns noisy coordinates into a proposed structure. Think of gradually resolving an initially blurred arrangement of atoms while keeping track of their identities. The folding model is trained from scratch; fixed protein-language features provide useful inputs without supplying a trained structure predictor.
Learn both positions and distances
Training asks the model to recover structures after their coordinates have been disturbed, and to predict how far pairs of atoms should be apart. These two signals teach complementary aspects of geometry.
Neither signal guarantees chemistry. Atoms can occupy approximately the right region while bonds have impossible angles or handedness. That is why a visually convincing fold must still pass atomic checks.
Check the fold, the interface and the chemistry
For isolated molecules, lDDT measures agreement in local atomic distances. For complexes, success depends on how accurately the partners meet. Each of the nine settings contributes equally to the final score; a failed prediction remains in the denominator.
This distinction is visible in the starter: its protein folds have a moderate overall shape score of 0.53, yet their scored local accuracy is zero after stereochemical checks. A recognizable silhouette is insufficient if the atomic structure is invalid.
Technical reference
| Question | Example | Scored outcome |
|---|---|---|
| Local geometry | A broadly correct fold with invalid stereochemistry | The recorded starter has TM-score 0.53 but monomer lDDT 0.000. TM-score is not the reward. |
| Protein interface success | 7 of 10 examples pass DockQ ≥ 0.23; 1 missing prediction remains in the 10 | Track score = 7/10 = 0.70; not the mean DockQ. |
| Ligand success | RMSD 1.8 Å and lDDT-PLI 0.79 | Fails: both RMSD < 2 Å and lDDT-PLI > 0.8 must hold. |
| Nine-track aggregation | Eight tracks at 0.50 and one at 0.59 | Reward = (8 × 0.50 + 0.59)/9 = 0.51. |
| Coverage | A difficult target fails inference | Keep it in the denominator; dropping it would inflate performance. |
The first bottleneck is valid atomic geometry
Across 1,522 requests, the starter averages 0.037 out of one. A pretrained ESMFold2-Fast reference reaches 0.545, but it uses a different training history and is not an eligible from-scratch competitor. The comparison shows room for improvement; it does not identify which architectural change would close the gap.
The starter occasionally succeeds at interfaces, especially protein–peptide binding, while all three isolated-molecule scores are zero. The most useful next step is to repair atomic geometry while checking that partner placement also improves.
Detailed results
| Measurement | Starter | Frozen ESMFold2-Fast | Native oracle |
|---|---|---|---|
| Protein monomer lDDT | 0.000 | 0.822 | 1.000 |
| RNA monomer lDDT | 0.000 | 0.569 | 1.000 |
| DNA monomer lDDT | 0.000 | 0.372 | 1.000 |
| Protein–protein success | 0.057 | 0.552 | 0.993 |
| Antibody–antigen success | 0.017 | 0.291 | 0.965 |
| Protein–peptide success | 0.118 | 0.608 | 0.941 |
| Protein–RNA success | 0.086 | 0.529 | 1.000 |
| Protein–DNA success | 0.058 | 0.649 | 0.964 |
| Protein–ligand success | 0.000 | 0.511 | 0.998 |
| Nine-track mean | 0.037 | 0.545 | 0.985 |
Compute and resources
Training, prediction and scoring
Reported measurement
- Time
- ≈5 h 37 min
- Hardware
- 6 × H100 training; 1 × H100 inference; scoring allocation unreported
- GPU allocation
- Not established for all stages
Reported stages for the reference model.
Elapsed time by stage
- Training
- 222 min
- Inference
- 105 min
- Scoring
- 10 min
Elapsed times are added across sequential stages, not GPU allocations. Training includes a restart; 24 oversized assemblies were recorded as inference failures.
Timing and hardware details
Starter training
Reported measurement
- Time
- 3.7 h
- Hardware
- 6 × H100
- GPU allocation
- ≈22.2 GPU-h
One recorded training run, including a restart.
Evaluation is additional.
Prediction and scoring
Reported measurement
- Time
- 1 h 45 min inference + ≈10 min scoring
- Hardware
- 1 × H100 for inference
- GPU allocation
- Not separately reported
Predicting 1,498 structures, followed by about 10 minutes of scoring.
24 assemblies above the inference limit were recorded as failures. GPU allocation during scoring is not reported; scoring time is not converted into GPU-hours.
Resource details
- Large-assembly inference
- 80 GB H100Even this GPU can run out of memory on the largest assemblies; it is not a guarantee that every target fits.
What would count as progress?
Compare a geometry-aware model with the starter, measuring both chemical violations and structural accuracy. Then ask whether a more balanced mixture of molecular partners improves RNA, DNA and ligand cases without harming proteins. All nine results matter: a higher average can conceal a newly neglected task.
References and provenance
Benchmarking all-atom biomolecular structure prediction with FoldBench
Introduces the benchmark for predicting biomolecular structures, including interactions between different molecular components.
Task definition and experimental evidence
Defines this environment’s compact model budget and fixed protein-language inputs. The starter results are separate from the paper’s full model comparisons.
Code links require access to the project’s GitHub repository.
Leaderboard
SimulatedDesign preview · leaderboard values and research histories are simulated.
| # | Method | Type | Monomer lDDT ↑ | PPI DockQ (illustrative) ↑ | Ligand success ↑ | Research time | Run |
|---|---|---|---|---|---|---|---|
| 1 | Agent search | 0.5533 | 0.4728 | 0.6338 | 76 h | ||
| 2 | Agent search | 0.5519 | 0.4716 | 0.6322 | 60 h | ||
| 3 | ESMFold2-Fast (frozen reference) · simulated | Reference | 0.5500 | 0.4700 | 0.6300 | — | — |
| 4 | ESMFold2 graph (49.2M, from scratch) · simulated | Reference | 0.4510 | 0.3854 | 0.5166 | — | — |
How to read these leaderboard metrics
These leaderboard values and research histories are simulated design examples. The leaderboard is ranked by Monomer lDDT. The research curves show relative improvement in this metric over ESMFold2-Fast (frozen reference) · simulated; only accepted new-best results update the retained trajectory. A positive gain means a better result, with the sign adjusted for metrics where lower is better. The task protocol is described in Task & evaluation above. These preview columns and trajectories are not measured benchmark results and must not be compared with the recorded experiments. Actual reward is the equal-weight mean of nine tracks: monomer lDDT, DockQ success (≥0.23), and ligand success (RMSD <2 Å and lDDT-PLI >0.8). The simulated leaderboard’s monomer primary metric and PPI DockQ summary do not reproduce that protocol. See the complete measured replay table in Results.
- Monomer lDDTPrimary metric · Higher is better
- Local distance difference test for predicted monomer structures. It assesses local structural agreement; FoldBench’s stereochemistry checks can zero the reported score for invalid structures.
- PPI DockQ (illustrative)Higher is better
- Simulated display metric. The actual track uses the fraction of interfaces with DockQ ≥ 0.23, not mean DockQ; see the measured nine-track table below.
- Ligand successHigher is better
- The fraction of ligand predictions passing the benchmark’s pose and interaction-quality criteria. The exact thresholds are defined by the FoldBench protocol.
AI4AI research progress
Research trajectory
Runtime–performance frontier
How improvement is measured
Simulated relative improvement over the displayed reference in monomer lDDT; this illustrative curve is not a measured nine-track reward or evidence of compliant training.
Accepted new-best experiments raise the trajectory. The frontier includes evaluated candidates; trial, partial and stopped experiments are excluded.