Hoto: Tsarin Bayani na Tsarin CRC-32
Buga: 12 Janairu, 2026 da 09:15:06 UTC
An sabunta ta ƙarshe: 9 Janairu, 2026 da 22:07:41 UTC
Nunin ilimi na tsarin hash na CRC-32, yana nuna yadda bits ɗin shigarwa ke gudana ta cikin rajistar canji tare da ra'ayoyin XOR don samar da checksum.
CRC-32 Algorithm Overview Diagram
Sigar da ake da ita ta wannan hoton
Fayilolin hotunan da ake da su don saukewa a ƙasa ba su da matsewa kuma suna da ƙuduri mafi girma - kuma sakamakon haka, inganci mafi girma - fiye da hotunan da aka saka a cikin labarai da shafuka akan wannan gidan yanar gizon, waɗanda aka fi inganta su don girman fayil don rage yawan amfani da bandwidth.
Girman yau da kullun (1,536 x 1,024)
Babban girma (3,072 x 2,048)
Girma mai girma sosai (4,608 x 3,072)
Girman da ya fi girma (6,144 x 4,096)
Girman barkwanci mai girma (1,048,576 x 699,051)
- Har yanzu ana lodawa... ;-)
Bayanin Hoto
Hoton wani faffadan zane ne na ilimi mai taken "CRC-32 Hash Algorithm" wanda aka saita a kan bango mai tsabta da haske tare da kanun shuɗi mai launin shuɗi. Babban kwararar yana gudana daga hagu zuwa dama don jaddada yanayin yawo na tsarin. A gefen hagu na nesa, akwatin mai siffar lemu mai siffar lemu mai lakabin "Input Data (Bits)" yana wakiltar kwararar bayanai masu shigowa ta binary. Kibiya mai kauri tana nuna daga wannan akwatin zuwa wani dogon tubali a kwance a tsakiyar sama mai lakabin "Shift Register". An kwatanta rajistar canzawa a matsayin layin ƙananan ƙwayoyin da ke kusa, yana nuna cewa bits ɗin bayanai suna motsawa mataki-mataki ta cikin rajista maimakon gaba ɗaya.
Daga gefen dama na rajistar canjin, kibiya mai lanƙwasa ta lanƙwasa ƙasa zuwa dama, tana kaiwa ga babban akwati kore mai suna "CRC-32 Checksum". Wannan akwatin ƙarshe an fi mayar da hankali a kai a matsayin sakamakon ƙarshe na aikin. A ƙarƙashin akwatin kore akwai maki biyu da ke taƙaita sakamakon a cikin jumla gabaɗaya: ɗaya yana nuna cewa sakamakon ƙimar hash ne mai 32-bit, ɗayan kuma yana bayyana cewa ana amfani da ƙimar don gano kurakurai.
Ƙarƙashin rajistar canjin akwai wata hanya ta biyu da ke bayyana yadda ra'ayoyin da dabaru na bitwise ke tasiri ga rajistar yayin da ake sarrafa bayanan. Wani kapsul mai zagaye, mai haske-shuɗi mai lakabin "Bit Stream" yana gudana a kwance, yana nuna cewa an ɗauki ɓangarorin da ke barin rajistar a matsayin rafi mai ci gaba. Daga wannan rafi, hanya tana kaiwa ga babban allon shuɗi mai haske mai haske mai lakabin "Ayyukan XOR". A cikin wannan allon akwai alamomin ƙofar dabaru da yawa waɗanda aka haɗa da kibiyoyi. Waɗannan ƙofofi wakilci ne na ɗabi'a ta musamman-OR, waɗanda aka zana su cikin salo mai sauƙi, mai kama da gunki maimakon tare da daidaiton fasaha.
Cikin sashin XOR, kibiyoyi suna haɗa ƙofofin a jere don nuna cewa an haɗa guntu-guntu, sannan a tura su ta matakai da yawa na haɗa ma'ana. Wani babban kibiya mai suna "Ra'ayi" madaukai daga gefen dama na toshe XOR zuwa sama zuwa rajistar canji, yana nuna cewa wani ɓangare na bayanan da aka sarrafa an mayar da su cikin rajistar. Wannan kibiya mai lanƙwasa ta yi kauri da duhu, tana sa ra'ayin ra'ayi ya bayyana a sarari ba tare da ƙayyade ainihin cikakken bayani ko aiwatarwa ba.
Wani kibiya mai suna "Shift" daga ƙasan hanyar kuma yana nuna zuwa akwatin kore "CRC-32 Checksum", yana ƙarfafa cewa bayan maimaita sauyawa da amsawa, sakamakon da aka tara yana fitowa a matsayin checksum. Tsarin launi gabaɗaya yana amfani da orange don shigarwa, shuɗi don sarrafawa da dabaru, da kore don fitarwa, yana taimaka wa mai kallo ya bambanta matakai cikin sauri. Tsarin yana guje wa takamaiman fasaha na ƙananan matakai kuma maimakon haka yana mai da hankali kan isar da ra'ayi mai girma: ragowa suna shiga, suna motsawa ta cikin rajistar canji, an haɗa su da dabaru na XOR a cikin madauri na amsawa, kuma a ƙarshe suna samar da checksum na CRC-32 da ake amfani da shi don gano kurakurai.
Hoton yana da alaƙa da: CRC-32 Hash Code Kalkuleta