{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreid2jaggjxd3fw4dhp4mlkqip6shczo4lxua22rr347cpatfbeuvbq",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mjqikkz6dii2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.14355v1",
  "publishedAt": "2026-04-17T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Ravi Kini",
    "David Doty"
  ],
  "textContent": "**Authors:** Ravi Kini, David Doty\n\nChemical reaction networks, or CRNs, are known to stably compute semilinear Boolean-valued predicates and functions, provided that all reactions are irreversible. However, this property does not hold for wet-lab implementations, as all chemical reactions are reversible, even at very slow rates. We study the computational power of CRNs under the reverse-robust computation model, where reactions are permitted to occur either in forward or in reverse up to a cutoff point, after which they may only occur in forward. Our main results show that all semilinear predicates and all semilinear functions can be computed reverse-robustly, and in fact, that existing constructions continue to hold under the reverse-robust computational model. A key tool used to prove correctness under the reverse-robust computation model is invariants: linear (or linear modulo some $m$) combinations of the counts of the species that are preserved by all reactions.",
  "title": "Reverse-Robust Computation with Chemical Reaction Networks"
}