{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreic6vwv3h6vb7mue3igrpbnaraezp4ds6hmf4dcwz2ul5rv4oabbfq",
    "uri": "at://did:plc:ivbknywyskln22er3nkssdhl/app.bsky.feed.post/3mnto6wbmgz52"
  },
  "path": "/t/infinite-precision-intermediate-arithmetic-how-much-would-break/24383#post_14",
  "publishedAt": "2026-06-09T06:59:36.000Z",
  "site": "https://internals.rust-lang.org",
  "textContent": "While this might work for arithmetic (though not when retrofitted), what about bit twiddling? It seems error prone to me if the compiler tries to guess the integer width in that type of code.\n\nPersonally that is common for me (SWAR and SIMD code with lots of bit twiddling), so I would rather that sort of code has less footguns, as such code is far trickier than general arithmetic code to begin with.",
  "title": "Infinite precision intermediate arithmetic: how much would break?"
}