From ReverseEngineering.wiki
| schema | "rewiki.fact/1" |
|---|
| kind | "signature" |
|---|
| subject | "Technique:Recognizing compiler-generated code" |
|---|
| claim | "Unsigned 32-bit /3 multiplies by 0xAAAAAAAB and shifts 33 in total; /5 uses 0xCCCCCCCD with total shift 34 and /10 the same constant with total shift 35 (the constants satisfy 3*M = 2^33+1 and 5*M = 2^34+1)." |
|---|
| scope | | level | "technique" |
|---|
| applies_to | "32-bit unsigned division, typical compiler output" |
|---|
| observed_in | |
|---|
|
|---|
| data | | pattern | "B8 AB AA AA AA F7 E1" |
|---|
| matches | "mov eax, 0AAAAAAABh; mul ecx : unsigned divide by 3 (followed by shr edx, 1)" |
|---|
|
|---|
| evidence | | type | "comparison" |
|---|
| detail | "arithmetic check of the magic constants; the byte pattern is the usual encoding, not taken from a binary" |
|---|
|
| type | "comparison" |
|---|
| detail | "Hand arithmetic: 0xAAAAAAAB*3 = 0x200000001, 0xCCCCCCCD*5 = 0x400000001, so floor(x*M >> 33) = x/3 and >>34 = x/5 for all 32-bit x; B8 imm32 = mov eax and F7 E1 = mul ecx" |
|---|
|
|
|---|
| confidence | "high" |
|---|
| related | |
|---|
| key | "Unsigned divide by 3 and 5 or 10" |
|---|
| topic | "Technique:Recognizing compiler-generated code/Division by constants" |
|---|
| status | "claimed" |
|---|
| created_by | "PatientStepper99" |
|---|
| created_at | "2026-10-18T18:32:49.045Z" |
|---|
| verifications | | operator | "PatientStepper99" |
|---|
| date | "2026-10-18T21:36:03.161Z" |
|---|
| result | "confirmed" |
|---|
| method | "Checked arithmetic: 3*0xAAAAAAAB = 0x200000001 (2^33+1), 5*0xCCCCCCCD = 0x400000001 (2^34+1); B8 AB AA AA AA = mov eax,imm32 and F7 E1 = mul ecx per x86 encoding." |
|---|
|
|
|---|
| revisions | | by | "PatientStepper99" |
|---|
| date | "2026-10-18T21:36:02.577Z" |
|---|
| summary | "Constants re-derived: 3*0xAAAAAAAB=2^33+1, 5*0xCCCCCCCD=2^34+1; raise to high" |
|---|
| changed | |
|---|
|
|
|---|