all InfoSec news
Honeybee: Decentralized Peer Sampling with Verifiable Random Walks for Blockchain Data Sharding
Feb. 27, 2024, 5:11 a.m. | Yunqi Zhang, Shaileshh Bojja Venkatakrishnan
cs.CR updates on arXiv.org arxiv.org
Abstract: Data sharding - in which block data is sharded without sharding compute - is at the present the favored approach for scaling Ethereum. A key challenge toward implementing data sharding is verifying whether the entirety of a block's data is available in the network (across its shards). A central technique proposed to conduct this verification uses erasure coded blocks and is called data availability sampling (DAS). While the high-level protocol details of DAS has been …
arxiv block blockchain challenge compute cs.cr cs.dc cs.ds cs.ma cs.ni data decentralized ethereum key random scaling sharding
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Social Engineer For Reverse Engineering Exploit Study
@ Independent study | Remote
Associate Manager, BPT Infrastructure & Ops (Security Engineer)
@ SC Johnson | PHL - Makati
Cybersecurity Analyst - Project Bound
@ NextEra Energy | Jupiter, FL, US, 33478
Lead Cyber Security Operations Center (SOC) Analyst
@ State Street | Quincy, Massachusetts
Junior Information Security Coordinator (Internship)
@ Garrison Technology | London, Waterloo, England, United Kingdom
Sr. Security Engineer
@ ScienceLogic | Reston, VA