That says everything there is to be said about your skills.
I don't need an apology from someone who can't even count properly, thanks.
You can simply continue existing thinking only 132 bits match. This will help you a lot in your high-level research on breaking SHA256 or whatever you believe you're doing...
I think the best strategy that exists is to simply by-pass whatever you're posting, just like McD's continuous deliration.
Look, I'm writing for you to learn. But you know, right?
Let other friends learn too.
19vkiEajfhuZ8bs8Zu2jgmC6oqZbWqhxhG
61eb8a50c86b0584bb727dd65bed8d2400d6d5aa
1100001111010111000101001010000110010000110101100000101100001001011101101110010
0111110111010110010110111110110110001101001001000000000011010110110101011010101
0
19vkiEakRjXGdd8qKkMV4nu9NuuEYzkFxy
61eb8a50c95b8484a2fa1bc67ae50f0c00dad5b3
1100001111010111000101001010000110010010101101110000100100001001010001011111010
0001101111000110011110101110010100001111000011000000000011011010110101011011001
1
a = "110000111101011100010100101000011001000011010110000010110000100101110110111001001111101110101100101101111101101100011010010010000000000110101101101010110101010"
b = "110000111101011100010100101000011001001010110111000010010000100101000101111101000011011110001100111101011100101000011110000110000000000110110101101010110110011"
match_count = sum(1 for x, y in zip(a, b) if x == y)
print(f"Number of matching bits: {match_count}")
I'm making one final exception.
No, I can't apologize for your screw up code that works on 159-bit numbers.
And I don't even care if you redact your majestic bit counting code to account for the missing 0 bit. It won't help any of us (you, me, or anyone else).