Hoto: Bayanin Tsarin Hash na FNV-1a 32-bit
Buga: 12 Janairu, 2026 da 13:28:35 UTC
An sabunta ta ƙarshe: 9 Janairu, 2026 da 21:34:53 UTC
Bayanin shimfidar wuri wanda ke bayyana tsarin hash na FNV-1a 32-bit a gani, yana nuna bayanan shigarwa, tushen farko na offset, kowane-byte XOR da matakai ninkawa, da kuma fitowar hash da aka samu.
FNV-1a 32-bit Hash Algorithm Overview
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 bayanai ne mai faɗi wanda ya dace da yanayin ƙasa wanda ke bayyana ra'ayin gabaɗaya na tsarin hash na FNV-1a 32-bit ta hanyar abokantaka, ba ta fasaha ba. Bayan bangon yana da santsi mai launin shuɗi tare da layuka marasa ƙarfi na lambobi biyu suna gudana a kwance a saman da ƙasa, suna ba da yanayi mai sauƙi na "bayanai" ba tare da janye hankali daga babban abun ciki ba. A saman, wanda aka tsakiya da manyan haruffan fari da cyan, shine kanun labarai "FNV-1a 32-bit Hash Algorithm.
A gefen hagu, wani murabba'i mai siffar lemu mai laƙabi da "Input Data" ya gabatar da tsarin. A ƙarƙashinsa, an nuna misali mai sauƙi a matsayin tayal masu launin toka-toka ɗaya ɗaya waɗanda ke rubuta kalmar "MISALAI," wanda a bayyane yake wakiltar jerin bytes maimakon ƙimar kirtani ta gaske. Kibiya fari tana nuna daga wannan misalin zuwa tsakiyar zane, tana nuna kwararar bayanai daga hagu zuwa dama.
Tsakiyar yankin akwai akwatin shuɗi mai suna "Initial Hash Value." A cikin wannan ɓangaren akwai wani akwati mai suna "Offset Basis," wanda ke ɗauke da allon rawaya mai suna "32-bit Hash." Wannan yana nuna ra'ayin cewa tsarin algorithm ya fara ne daga ƙimar farawa da aka riga aka ayyana, ba tare da nuna wasu takamaiman lambobi waɗanda za su iya zama tsofaffi ko ruɗani ba.
A gefen dama na wannan akwai sashe mai taken "Tsarin Kowane Baiti." Faifai biyu masu launin rawaya suna bayyana ayyukan da aka maimaita da aka yi wa kowane baiti na shigarwar. Faifan saman yana karanta "XOR tare da Byte" kuma yana tare da ƙaramin alamar salon kwan fitila don nuna aikin ma'ana. Faifan da ke ƙasa yana karanta "Multiply by Prime" kuma an haɗa shi da alamar ninkawa mai sauƙi. Waɗannan matakai biyu an haɗa su da kibiyoyi, suna samar da gani mai kama da madauki wanda ke nufin maimaitawa ga kowane baiti a cikin jerin shigarwar, amma ba tare da ƙayyade cikakkun bayanai game da aiwatarwa ba.
Gefen dama, wani akwati mai kore mai suna "Hash Output 32-bit" yana saman babban allon rawaya mai rubutu "Sabon Darajar Hash." Kibiya mai ƙasa tana haɗa alamar kore zuwa allon rawaya, yana nuna cewa bayan an sarrafa duk bytes, tsarin yana samar da ƙimar hash ta ƙarshe da aka sabunta. Kibiya mai lanƙwasa daga allon "Multiply by Prime" yana kaiwa cikin wannan akwatin ƙarshe, yana ƙarfafa ra'ayin cewa maimaitawa ta ƙarshe yana shiga cikin sakamakon.
A ƙasan infographic ɗin akwai babban tuta mai launin shuɗi mai rubutu "Sakamakon Hash na Ƙarshe na 32-bit" da fari, yana taƙaita dukkan bututun daga bayanan shigarwa zuwa hash ɗin fitarwa. Tsarin gabaɗaya yana da tsabta, hagu-dama, kuma yana da sauƙin bi, yana amfani da launuka masu daidaito da manyan lakabi don wanda bai saba da hashing ba har yanzu zai iya fahimtar babban kwararar algorithm ba tare da fuskantar rashin daidaiton madaidaitan bayanai ko cikakkun bayanai na musamman na lamba ba.
Hoton yana da alaƙa da: Fowler-Noll-Vo FNV1a-32 Kalkuleta na Lambar Hash