DalusX64 commited on
Commit
ca42489
ยท
verified ยท
1 Parent(s): 83bea6a

Upload README.md

Browse files
Files changed (1) hide show
  1. README.md +156 -0
README.md ADDED
@@ -0,0 +1,156 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # ChainMath Benchmark ๐Ÿ”—๐Ÿงฎ
2
+
3
+ > **Evaluating the reasoning chain integrity of large language models across multilingual arithmetic challenges.**
4
+
5
+ ---
6
+
7
+ ## What is ChainMath?
8
+
9
+ **ChainMath** is a procedurally generated benchmark designed to stress-test a model's ability to:
10
+
11
+ - **Track arithmetic state** across a sequence of dependent questions
12
+ - **Follow instructions in multiple natural languages** (English, Spanish, French, German, Italian)
13
+ - **Produce structured output** (JSON) reliably on the first attempt
14
+ - **Handle distractors** โ€” irrelevant information embedded to mislead the model
15
+ - **Resolve cross-question references** using natural language anaphora
16
+
17
+ Unlike benchmarks that evaluate questions in isolation, ChainMath questions are **interdependent**: the correct answer to question *N* is often a function of the answers to earlier questions. A model that loses track of the chain โ€” even once โ€” will propagate errors forward.
18
+
19
+ ---
20
+
21
+ ## Why ChainMath?
22
+
23
+ Existing mathematical reasoning benchmarks (GSM8K, MATH, etc.) largely test **independent problems**. Real-world tasks, however, require models to maintain coherent state over long contexts.
24
+
25
+ ChainMath was built on the hypothesis that **current large language models struggle with context-dependent arithmetic chains**, particularly when:
26
+
27
+ - Questions switch between languages mid-sequence
28
+ - Irrelevant numeric information is injected as noise
29
+ - Conditional logic branches based on the parity or magnitude of a prior result
30
+ - The chain spans more than 10 dependent steps
31
+
32
+ > **Hypothesis:** Models that perform well on standard math benchmarks may significantly underperform on ChainMath due to poor chain-state tracking โ€” regardless of raw computational ability.
33
+
34
+ The first evaluation round supports this hypothesis. Two out of five models scored below 30%.
35
+
36
+ ---
37
+
38
+ ## Benchmark Format
39
+
40
+ Each ChainMath instance consists of **200 questions** generated from a numeric **seed**. The seed deterministically reproduces the entire question set, ensuring reproducibility without exposing the answer key.
41
+
42
+ Questions range across 5 difficulty levels:
43
+
44
+ | Level | Description |
45
+ |-------|-------------|
46
+ | โ˜…โ˜†โ˜†โ˜†โ˜† | Simple arithmetic on a standalone value |
47
+ | โ˜…โ˜…โ˜†โ˜†โ˜† | Two-step chains, single language |
48
+ | โ˜…โ˜…โ˜…โ˜†โ˜† | Multi-step chains, possible language switch |
49
+ | โ˜…โ˜…โ˜…โ˜…โ˜† | Conditional/comparison logic, anaphora, distractors |
50
+ | โ˜…โ˜…โ˜…โ˜…โ˜… | Cross-language anaphora, inverse operations, high-depth chains |
51
+
52
+ The score is **difficulty-weighted**: harder questions contribute more to the final score.
53
+
54
+ ---
55
+
56
+ ## Scoring
57
+
58
+ ChainMath uses a transparent, multi-component scoring system:
59
+
60
+ ```
61
+ Final Score = Weighted Correctness ร— (1 โˆ’ Order Penalty) โˆ’ JSON Penalty
62
+ ```
63
+
64
+ | Component | Detail |
65
+ |-----------|--------|
66
+ | **Weighted Correctness** | Each correct answer earns points proportional to its difficulty weight |
67
+ | **Correctness Tolerance** | ยฑ0.01 absolute **or** ยฑ0.1% relative โ€” whichever is satisfied |
68
+ | **Order Penalty** | Up to โˆ’15% for answers not returned sorted by question ID |
69
+ | **JSON Format Penalty** | โˆ’10% flat if the model failed to produce valid JSON on the first attempt |
70
+ | **Score Range** | Clamped to [0, 100] |
71
+
72
+ ---
73
+
74
+ ## Validated Results โ€” Round 1 (October 2026)
75
+
76
+ Five models were evaluated on the same benchmark seed.
77
+
78
+ | Model | Provider | Thinking | Tools | Final Score |
79
+ |-------|----------|----------|-------|-------------|
80
+ | **Claude Haiku 5.5** | Anthropic | โœ… | โœ… | **84.29%** |
81
+ | Gemini 3.6 Flash | Google | โœ… | โŒ | 75.36% |
82
+ | DeepSeek V4.1 Flash | DeepSeek | โœ… | โœ… | 71.19% |
83
+ | ChatGPT 5.6 Luna | OpenAI | โŒ | โœ… | 26.42% |
84
+ | Qwen 3.8-Max | Alibaba | โœ… | โœ… | 10.56% |
85
+
86
+ > **Note:** Scores reflect the combined effect of correctness, JSON discipline, and ordering compliance. Raw correctness percentages differ from final scores for models that incurred penalties. See [`validated_results.json`](./validated_results.json) for full breakdown.
87
+
88
+ ### Key Observations
89
+
90
+ - **Thinking / extended reasoning mode** is a strong predictor of performance. The only model evaluated *without* thinking mode (ChatGPT 5.6 Luna) scored significantly below models with it โ€” even when given tool access.
91
+ - **JSON discipline matters.** Two models (ChatGPT 5.6 Luna, Qwen 3.8-Max) failed to produce valid JSON on the first attempt, incurring a โˆ’10% penalty. This is a real-world capability gap.
92
+ - **Tool access is not sufficient.** All low-scoring models had tool access but still struggled with chain tracking โ€” suggesting this is a reasoning problem, not a tool availability problem.
93
+ - **High difficulty (โ˜…โ˜…โ˜…โ˜…โ˜…) is the main differentiator.** Most models performed reasonably at difficulty โ˜…โ˜…โ˜…, but diverged sharply at โ˜…โ˜…โ˜…โ˜…โ˜….
94
+
95
+ ---
96
+
97
+ ## Evaluation Methodology
98
+
99
+ Evaluation is fully automated via the provided comparator script. Steps:
100
+
101
+ 1. Generate a benchmark from a seed: produces `benchmark_<seed>.txt` (prompt) and `benchmark_<seed>.json` (answer key, not shared with the model).
102
+ 2. Send the `.txt` prompt to the model in a single turn (no mid-session hints).
103
+ 3. Record whether the model returned valid JSON **on the first attempt**.
104
+ 4. Run the comparator against the model's JSON output and the answer key.
105
+ 5. Record the full result including per-question breakdown.
106
+
107
+ No human judgment is involved in scoring. All answers are numeric.
108
+
109
+ ---
110
+
111
+ ## Participating with Your Model
112
+
113
+ We welcome submissions from AI labs, developers, and researchers. To have your model evaluated:
114
+
115
+ 1. **Contact us** via GitHub Issues on this repository.
116
+ 2. We will provide you with a **benchmark seed** (the question set is procedurally generated โ€” each submission can use a different seed to prevent data contamination).
117
+ 3. You run the model against the prompt and share the JSON output.
118
+ 4. We run the comparator and publish the results with full transparency.
119
+
120
+ > Results are published alongside methodology details. We do not publish the answer key or the generator source code in order to prevent benchmark gaming.
121
+
122
+ ---
123
+
124
+ ## Repository Structure
125
+
126
+ ```
127
+ chainmath-benchmark/
128
+ โ”œโ”€โ”€ README.md โ† This file (public)
129
+ โ”œโ”€โ”€ validated_results.json โ† Round 1 validated scores
130
+ โ”œโ”€โ”€ comparator.py โ† Public scoring script
131
+ โ””โ”€โ”€ SUBMISSION_GUIDE.md โ† How to submit your model
132
+ ```
133
+
134
+ > The **generator** is kept private to prevent answer contamination. Benchmark seeds are issued per-submission.
135
+
136
+ ---
137
+
138
+ ## Citation
139
+
140
+ If you use ChainMath in your research or evaluation pipeline, please cite:
141
+
142
+ ```
143
+ ChainMath Benchmark v1.0 (2026)
144
+ Author: [Your Name / Organization]
145
+ URL: https://github.com/[your-handle]/chainmath-benchmark
146
+ ```
147
+
148
+ ---
149
+
150
+ ## License
151
+
152
+ This benchmark and its tooling are released under the **MIT License**. See `LICENSE` for details.
153
+
154
+ ---
155
+
156
+ *ChainMath โ€” Does your model know where it left off?*