BESTDiNER: Blockchain-Enabled System for Tackling Distributed Networking and Extracting Rainbow-tables

Proof-of-Work (PoW) quickly became one of the most well-known algorithms as the consensus-building method powering the blockchain. However, consensus-building algorithms based on PoW have the issue of wasting a substantial amount of power on hash computation. Many algorithms proposed as alternatives to PoW aim to improve power efficiency, addressing the key issue with PoW.The proposed method, BESTDiNER (Blockchain-Enabled System for Tackling Distributed Networking and Extracting Rainbow-tables), creates a rainbow table instead of relying on conventional blockchain’s repeated hash calculations. Rainbow tables and Bitcoin share the characteristic of repeated hash calculations in a brute-force manner. Leveraging this feature, BESTDiNER modifies the original Bitcoin protocol so that mining results in the creation of a rainbow-table.The BESTDiNER protocol use two types of parameters for mining difficulty adjustment. Adjustable parameters are traditional bitcoin-style difficulty adjustment method and width of rainbow table.Experiments using real computers were conducted to estimate computation time based on the number of hash calculations. Additional approximate were also conducted using parameters obtained from the real-computer experiments. The results of the two-stage experiment analyze the characteristics of rainbow-table creation through mining.