1F106         ; disallowed_STD3_mapped ; 0035 002C     # 5.2  DIGIT FIVE COMMA
1F107         ; disallowed_STD3_mapped ; 0036 002C     # 5.2  DIGIT SIX COMMA
1F108         ; disallowed_STD3_mapped ; 0037 002C     # 5.2  DIGIT SEVEN COMMA
1F109         ; disallowed_STD3_mapped ; 0038 002C     # 5.2  DIGIT EIGHT COMMA
1F10A         ; disallowed_STD3_mapped ; 0039 002C     # 5.2  DIGIT NINE COMMA

wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit of the multiplier, T[i:n+i] is the shifted // position of the product of that digit, and T[n+i] is the final carry. // Note that T[i] isn't modified after processing the i-th digit. // // Instead of running two loops, one for Step 1 and one for Steps 2–6, // the result of Step 1 is computed during the next loop. This is // possible because...