8 ▁byte ▁state , ▁uses ▁wide ▁pipe ▁construction , ▁and ▁is ▁AR X ▁based . ▁Message ▁blocks ▁are ▁X OR ed ▁into ▁the ▁initial ▁bits ▁of ▁a ▁ 1 2 8 - byte ▁state , ▁which ▁then ▁goes ▁through ▁an ▁r - round ▁bi jective ▁transformation ▁between ▁blocks . ▁The ▁initial ▁N IST ▁proposal ▁(" C ube hash 8 / 1 ") ▁required ▁about ▁ 2 0 0 ▁cycles ▁per ▁byte . ▁After ▁clar ifications ▁from ▁N IST , ▁the ▁author ▁changed ▁the ▁proposal ▁to ▁C ube hash 1 6 / 3 2 , ▁which ▁" is ▁approximately ▁ 1 6 ▁times ▁faster ▁than ▁C ube Hash 8 / 1 , ▁easily ▁catch ing ▁up ▁to ▁both ▁S HA - 2 5 6 ▁and ▁S HA - 5 1 2 ▁on ▁the ▁reference ▁platform " ▁while ▁still ▁maintain ing ▁a ▁" com fort able ▁security ▁margin ". ▁ ▁C ube Hash ▁advanced ▁to ▁the ▁second ▁round ▁of ▁the ▁competition , ▁but ▁was ▁not ▁chosen ▁as ▁one ▁of ▁the ▁ 5 ▁final ists . ▁Bern stein ▁has ▁since ▁tun ed ▁the ▁parameters ▁further ▁and ▁his ▁main ▁recommendation ▁is ▁C ube Hash 5 1 2 , ▁defined ▁as ▁C ube Hash 1 6 + 1 6 / 3 2 + 3 2 – 5 1 2 . ▁ ▁How ▁it ▁works ▁ ▁This ▁description ▁refers ▁to ▁the ▁latest ▁specification , ▁and ▁not ▁the ▁N IST ▁submission . ▁ ▁C ube Hash ▁has ▁ 5 ▁parameters , ▁a ▁certain ▁instance ▁is ▁denoted ▁by ▁C ube Hash