检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘凤 王欣 Liu Feng;Wang Xin(College of Information Engineering,Hebei Geo University,Shijiazhuang 050000,Hebei,China;Faculty of Electrical Engineering and Computer Science,VSB-Technical University of Ostrava,Ostrava 70800,Czech Republic;Hebei Software Evaluation Center,Shijiazhuang 050000,Hebei,China)
机构地区:[1]河北地质大学信息工程学院,河北石家庄050000 [2]奥斯特拉发技术大学电气工程与计算机科学学院,捷克奥斯特拉发70800 [3]河北软件评测中心,河北石家庄050000
出 处:《计算机应用与软件》2023年第10期345-349,共5页Computer Applications and Software
基 金:河北省科技支撑计划项目(16210347)。
摘 要:目前区块链状态机研究较少,存在模型建立粗、逻辑不清晰、应用性不强问题。通过分析区块链底层常见的工作量证明(PoW)、权益证明(PoS)、拜占庭容错(BFT)、实用拜占庭容错(PBFT)共识机制进行状态机研究。设定区块链处于同步可靠网络环境时,从中抽象出分布式账本系统(DLT),构建并定义任一时间点时DLT的状态机模型。给出状态机的强状态无关、弱状态无关、随机态三种定义。使用状态机分别对不同的共识机制进行识别分析,分别得到PoW为随机态、BFT和PBFT为强状态无关、PoS为非弱状态无关的推论,并对其进行证明。At present,there are few researches on Blockchain state machine,such as rough model building,unclear logic and weak applicability.By analyzing the common consensus mechanisms of proof of work(POW),proof of rights(POS),Byzantine fault tolerance(BFT) and practical Byzantine fault tolerance(PBFT) at the bottom of the Blockchain,its state machine was studied.The distributed ledger system(DLT) was abstracted from the blockchain in a synchronous and reliable network environment,and the state machine model of DLT at any time point was constructed and defined.Three definitions of strong state independence,weak state independence and random state were given.Different consensus mechanisms were identified and analyzed by using state machine.The inference that pow was random state,BFT and PBFT were strong state independent and POS was not weak state independent was obtained and proved.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.239