Papers › CodeChain: Towards Modular Code Generation Through Chain of Self-revisions with...
CodeChain: Towards Modular Code Generation Through Chain of Self-revisions with Representative Sub-modules
Hung Le, Hailin Chen, Amrita Saha, Akash Gokul, Doyen Sahoo, Shafiq Joty
Large Language Models (LLMs) have already become quite proficient at solving simpler programming tasks like those in HumanEval or MBPP benchmarks. However, solving more complex and competitive programming tasks is still quite challenging for these models - possibly due to their tendency to generate solutions as monolithic code blocks instead of decomposing them into logical sub-tasks and sub-modules. On the other hand, experienced programmers instinctively write modularized code with abstraction for solving complex tasks, often reusing previously developed modules. To address this gap, we propose CodeChain, a novel framework for inference that elicits modularized code generation through a chain of self-revisions, each being guided by some representative sub-modules generated in previous iterations. Concretely, CodeChain first instructs the LLM to generate modularized codes through chain-of-thought prompting. Then it applies a chain of self-revisions by iterating the two steps: 1) extracting and clustering the generated sub-modules and selecting the cluster representatives as the more generic and re-usable implementations, and 2) augmenting the original chain-of-thought prompt with these selected module-implementations and instructing the LLM to re-generate new modularized solutions. We find that by naturally encouraging the LLM to reuse the previously developed and verified sub-modules, CodeChain can significantly boost both modularity as well as correctness of the generated solutions, achieving relative pass@1 improvements of 35% on APPS and 76% on CodeContests. It is shown to be effective on both OpenAI LLMs as well as open-sourced LLMs like WizardCoder. We also conduct comprehensive ablation studies with different methods of prompting, number of clusters, model sizes, program qualities, etc., to provide useful insights that underpin CodeChain's success.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2310.08992")
Code
Syntology Ran 3 of 3 code samples harvested from 1 repository linked to this paper; 0 have no recorded run. Of those that ran: 2 ran · our draft was wrong; 1 ran with no contract checked.
By repository: official repository: 3 samples from 1 repository, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
3 samples harvested; 3 ran; 0 honoured the contract we drafted; 0 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 0 of the 3 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from SalesforceAIResearch/CodeChain. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
f34f883bb6fb5e60 · report
55cffac4dad16773 · report
7396327c9cd9f836 · report
Tasks
1 archive task tag without a task page not shown.
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Code Generation | APPS | CodeChain+WizardCoder-15b | Competition Pass@1 | 2.5% | #7 of 18 | Archive leaderboard | report |
| Code Generation | APPS | CodeChain+WizardCoder-15b | Competition Pass@any | 14.5% | #7 of 18 | Archive leaderboard | report |
| Code Generation | APPS | CodeChain+WizardCoder-15b | Interview Pass@1 | 6.4% | #7 of 18 | Archive leaderboard | report |
| Code Generation | APPS | CodeChain+WizardCoder-15b | Interview Pass@any | 25.4% | #7 of 18 | Archive leaderboard | report |
| Code Generation | APPS | CodeChain+WizardCoder-15b | Introductory Pass@1 | 29.3% | #7 of 18 | Archive leaderboard | report |
| Code Generation | APPS | CodeChain+WizardCoder-15b | Introductory Pass@any | 60.9% | #7 of 18 | Archive leaderboard | report |
| Code Generation | APPS | WizardCoder-15b | Competition Pass@1 | 3.75 | #8 of 18 | Archive leaderboard | report |
| Code Generation | APPS | WizardCoder-15b | Interview Pass@1 | 7.49 | #8 of 18 | Archive leaderboard | report |
| Code Generation | APPS | WizardCoder-15b | Introductory Pass@1 | 26.29 | #8 of 18 | Archive leaderboard | report |
| Code Generation | CodeContests | CodeChain + WizardCoder-15B | Test Set pass@1 | 2.35 | #7 of 8 | Archive leaderboard | report |
| Code Generation | CodeContests | CodeChain + WizardCoder-15B | Test Set pass@5 | 3.29 | #7 of 8 | Archive leaderboard | report |
| Code Generation | CodeContests | CodeChain + WizardCoder-15B | Val Set pass@1 | 2.48 | #7 of 8 | Archive leaderboard | report |
| Code Generation | CodeContests | CodeChain + WizardCoder-15B | Val Set pass@5 | 3.30 | #7 of 8 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections