Adaptive rateless coded blockchain for dynamic IoV scenarios
Shuo Zhang, Yuan-Yuan Song, Ming-Gang Zheng, Jie Li, Han Liang · 2025
Read Adaptive rateless coded blockchain for dynamic IoV scenarios by Shuo Zhang, Yuan-Yuan Song, Ming-Gang Zheng, Jie Li, Han Liang (2025) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-12808210.txt.
Description
Zhang and co-authors redesign the blockchain for the internet of vehicles, where cars generate mountains of data but cannot store a full ledger each. Classic blockchains demand every full node keep everything, an impossible ask for vehicle hardware. Coded chains compress blocks, but fixed codes cope badly when cars join and leave. Their scheme uses rateless Raptor codes, which can spin out the redundancy the moment needs, and adjusts its settings on the fly, without re-encoding stored data.
A lightweight consensus method based on verifiable randomness keeps agreement cheap. The authors report storage savings near 98 percent, a vanishingly small chance of failed decoding, and a system holding up as the network churns. The work is a design with analysis rather than a road trial. For engineers building vehicle data networks, it offers a ledger whose storage cost bends with the fleet instead of breaking.
Catalog record
| CREATOR | Shuo Zhang, Yuan-Yuan Song, Ming-Gang Zheng, Jie Li, Han Liang |
|---|---|
| YEAR | 2025 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 67 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |