Division check for arith component

[hecmas]

This PR adds the constraint to the arith component where a division check is performed:

// Check that remainder (d) is lower than divisor (b) when division is performed
// Specifically, we ensure that 0 <= |d| < |b|
lookup_assumes(operation_bus_id, [debug_main_step,
                                      (1 - nr) * (1 - nb) * LTU_OP + nr * (1 - nb) * LT_ABS_NP_OP + (1 - nr) * nb * LT_ABS_PN_OP + nr * nb * GT_OP,
                                      (d[0] + CHUNK_SIZE * d[1]), (d[2] + CHUNK_SIZE * d[3]) + m32 * nr * 0xFFFFFFFF, // remainder
                                      (b[0] + CHUNK_SIZE * b[1]), (b[2] + CHUNK_SIZE * b[3]) + m32 * nb * 0xFFFFFFFF, // divisor
                                      1, 0, 
                                      1], sel: div * (1 - div_by_zero));

For this, we needed to implement three new binary operations:

• LT_ABS_NP_OP: Checks that the first input, assumed to be negative, is strictly lower than the second input, assumed to be positive, in absolute value.
• LT_ABS_PN_OP: Checks that the first input, assumed to be positive, is strictly lower than the second input, assumed to be negative, in absolute value.
• GT_OP: Check that the first input is strictly bigger than the second input.

Adding these binary operations incurred in doubling the size of the binary table, so that all possible combinations regarding them are included in the table.