Understanding IR Protocol Checksum generation
Here's my analysis, based on your small sample of data:

If you ignore the "Never changes" data, and also remove the zeroes before the checksum, your data looks like this:

00100100 11000000 00000000 01000000 01111110
00100100 11000000 00000000 01100000 01000001
00100100 11000000 00000000 00100000 00000001

00100100 11000000 10010000 00100000 10010001
00100100 11000000 10010000 00110000 10001001

00100100 11000000 11010000 01100000 10110001
00100100 11000000 11010000 01000000 10010001


So that's four bytes of data and one byte of checksum (or whatever).

Now, reverse the order of the bits within those four data bytes (checksum omitted), so I mean bit 0 becomes bit 7, bit 1 becomes bit 6, etc.:

00100100 00000011 00000000 00000010
00100100 00000011 00000000 00000110
00100100 00000011 00000000 00000100

00100100 00000011 00001001 00000100
00100100 00000011 00001001 00001100

00100100 00000011 00001011 00000110
00100100 00000011 00001011 00000010


Now sum each row, modulo 255, reverse the order of the bits again, and compare the result with your checksum:

01111110
10000010
10000000

10001001
10010001

10001101
10001001


It works for me, but maybe there's more of that data (like the zero padding) that's taken into account, but we'd need more samples to figure it out. For now, you can create the checksum byte by simply reversing the order of the bits of each data byte (i.e. ignore the "never changes") and taking the sum, modulo 255, then reverse the order of the bits of that sum.

All of this necessity for bit reversal suggests that the data is being sent the opposite way to how you're interpreting it. For example, it's being sent MSB first and you assume LSB first or vice versa. Other than that, the checksum is just a cumulative sum of the data, ignoring overflow.