English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Light nodes in blockchain systems are known to be vulnerable to dataavailability (DA) attacks where they accept an invalid block with unavailableportions. Previous works have used LDPC and 2-D Reed Solomon (2D-RS) codes withMerkle Trees to mitigate DA attacks. While these codes have demonstratedimproved performance across a variety of metrics such as DA detectionprobability, they are difficult to apply to blockchains with large blocks dueto generally intractable code guarantees for large codelengths (LDPC), largedecoding complexity (2D-RS), or large coding fraud proof sizes (2D-RS). Weaddress these issues by proposing the novel Polar Coded Merkle Tree (PCMT)which is a Merkle Tree built from the encoding graphs of polar codes and aspecialized polar code construction called Sampling-Efficient Freezing (SEF).We demonstrate that the PCMT with SEF polar codes performs well in detecting DAattacks for large block sizes.

Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain Systems