We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e30b390 commit 9e73c4bCopy full SHA for 9e73c4b
contracts/utils/math/Math.sol
@@ -144,7 +144,7 @@ library Math {
144
function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
145
unchecked {
146
// 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
147
- // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
+ // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
148
// variables such that product = prod1 * 2²⁵⁶ + prod0.
149
uint256 prod0 = x * y; // Least significant 256 bits of the product
150
uint256 prod1; // Most significant 256 bits of the product
0 commit comments