Discussed here: [#11522](https://github.com/fastapi/fastapi/pull/11522) and here: [#11525](https://github.com/fastapi/fastapi/discussions/11525)

### Docs

### Breaking Changes

* <DOCUMENT BREAKING CHANGES HERE>
* <THIS SECTION SHOULD CONTAIN API, ABI AND BEHAVIORAL BREAKING CHANGES>

### Known Caveats

* <CAVEATS REGARDING THE RELEASE (BUT NOT BREAKING CHANGES).>
* <ADDING/BUMPING DEPENDENCIES SHOULD GO HERE>
* <KNOWN LACK OF SUPPORT ON SOME PLATFORM, SHOULD GO HERE>

### Major Features and Improvements

a time and need to finish at -1, so -1 + 5 * 51 = 254. index := 254 sel, sign := boothW5(s.Rsh(index)) // sign is always zero because the boothW5 input here is at // most two bits long, so the top bit is never set. _ = sign // Neither Select nor Add have exceptions for the point at infinity / // selector zero, so we don't need to check for it here or in the loop. table := new(p256Table).Compute(q) table.Select(p, sel) t := NewP256Point() for index >= 4 { index -= 5 p.Double(p) p.Double(p) p.Double(p)...

a time and need to finish at -1, so -1 + 5 * 51 = 254. index := 254 sel, sign := boothW5(s.Rsh(index)) // sign is always zero because the boothW5 input here is at // most two bits long, so the top bit is never set. _ = sign // Neither Select nor Add have exceptions for the point at infinity / // selector zero, so we don't need to check for it here or in the loop. table := new(p256Table).Compute(q) table.Select(p, sel) t := NewP256Point() for index >= 4 { index -= 5 p.Double(p) p.Double(p) p.Double(p)...