ye

sup /prog/

what do you think of my checksum algorithm?

int PrimeSum(char* buffer, int start, int size)
{
     int sum = 1;
     int prime = 0x2468ACF0;

     for (int i = start; i < (start + size); i++)
     {
          sum ^= ((sum << 8) | buffer[i]) * prime;
     }
    
     return sum;
}

Since when did primes become evenly dividable by 2?

>>2
oops... meant to type 0x0x2468ACF9

im a homo

>>2
One of them is. Ergo your wrong bitch

>>3

$ factor $((0x2468ACF9))
610839801: 3 3 11 13 17 27919

>>6
//echo $factor($base(2468ACF0,16,10))
[1, 610839792], [2, 305419896], [3, 203613264], [4, 152709948], [6, 101806632], [8, 76354974], [9, 67871088], [12, 50903316], [16, 38177487], [18, 33935544], [24, 25451658], [27, 22623696], [36, 16967772], [48, 12725829], [54, 11311848], [72, 8483886], [81, 7541232], [108, 5655924], [144, 4241943], [162, 3770616], [216, 2827962], [243, 2513744], [324, 1885308], [432, 1413981], [486, 1256872], [648, 942654], [972, 628436], [1296, 471327], [1944, 314218], [3888, 157109]

>>7
//echo $factor($base(2468ACF9,16,10))
[1, 610839801], [3, 203613267], [9, 67871089], [11, 55530891], [13, 46987677], [17, 35931753], [33, 18510297], [39, 15662559], [51, 11977251], [99, 6170099], [117, 5220853], [143, 4271607], [153, 3992417], [187, 3266523], [221, 2763981], [429, 1423869], [561, 1088841], [663, 921327], [1287, 474623], [1683, 362947], [1989, 307109], [2431, 251271], [7293, 83757], [21879, 27919]

>>8
//echo $factor($base(2468ACEF,16,10))
[1, 610839791]