TRV-2026-1884Certified recordPeer-reviewed

Experiences developing structural biology tools with AI coding assistance

Large language models (LLMs) offer significant potential to accelerate scientific software development, yet their application to structural biology algorithms requires rigorous evaluation. This challenge is examined through the development of xcif, a new native parser for the crystallographic information file (CIF) format, designed to replace a stable but slow parser (ucif) in the Computational Crystallography Toolbox (cctbx). Using an expert-led, artificial intelligence (AI)-assisted workflow, implementation ti…

Science · The Trace — both readings · certified 2026-10-19 · v1 · article view · machine-readable

Current reading — gain

With expert-led AI assistance, a replacement CIF parser was built in about one week of active human effort instead of an estimated several months, and it runs much faster than the legacy parser.

Current reading — problem

AI-generated code was plausible but flawed, so the work depended entirely on domain experts to specify constraints, catch errors and design adversarial tests.

What this doesn’t fix

The efficiency gain relied entirely on domain expertise to constrain the AI, catch flawed code and design adversarial tests, so the result may not hold without such oversight.

Evidence

Reader signal

How should this claim be treated?

Cite this record

Truvace Impact Record TRV-2026-1884, v1: “Experiences developing structural biology tools with AI coding assistance.” Truvace, 2026-10-19. /record/TRV-2026-1884 (accessed at citation time). sha256 232bcc6c3d31fce8…

Calibration history

Every change to this record since certification, in the open. None yet — the reading has held since it entered the record.

  1. Certifiedv1232bcc6c3d31…

    Certified into the record

Verify this record
How to verify without trusting this page

Fetch the canonical text of any version from /api/record/TRV-2026-1884 and hash it yourself — for example shasum -a 256 on the saved canonical field. The result must equal content_hash, and each version’s text ends with prev:followed by the prior version’s hash (version 1 chains to 64 zeros). If a single character of any version had been altered since certification, the chain would not reproduce.