Buchwald et al., 2025 - Google Patents
Snowman for partial synchronyBuchwald et al., 2025
View PDF- Document ID
- 9572256270985879373
- Author
- Buchwald A
- Buttolph S
- Lewis-Pye A
- Sekniqi K
- Publication year
- Publication venue
- arXiv preprint arXiv:2501.15904
External Links
Snippet
Snowman is the consensus protocol run by blockchains on Avalanche. Recent work established a rigorous proof of probabilistic consistency for Snowman in the\emph {synchronous} setting, under the simplifying assumption that correct processes execute …
- 238000000034 method 0 abstract description 206
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30575—Replication, distribution or synchronisation of data between databases or within a distributed database; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Guo et al. | Dumbo: Faster asynchronous bft protocols | |
Gasieniec et al. | Fast space optimal leader election in population protocols | |
Naor et al. | Expected linear round synchronization: The missing link for linear byzantine smr | |
Coulouma et al. | A characterization of oblivious message adversaries for which consensus is solvable | |
Xiang et al. | Strengthened fault tolerance in byzantine fault tolerant replication | |
Aştefanoaei et al. | Tenderbake--A Solution to Dynamic Repeated Consensus for Blockchains | |
CN111723406A (en) | Consensus algorithm and system of block chain | |
CN112862490B (en) | Output consensus method under asynchronous network | |
Babel et al. | Mysticeti: Low-latency dag consensus with fast commit path | |
WO2021190179A1 (en) | Synchronous processing method and related apparatus | |
Cong et al. | A blockchain consensus protocol with horizontal scalability | |
CN117478301B (en) | Block chain consensus achieving method and device based on directed acyclic graph | |
CN110809042A (en) | Intelligent contract fragmentation storage method based on de bruijn sequence generation technology | |
Buchwald et al. | Snowman for partial synchrony | |
Hitron et al. | Counting to ten with two fingers: Compressed counting with spiking neurons | |
Li et al. | Quorum subsumption for heterogeneous quorum systems | |
Yu et al. | Tetrabft: Reducing latency of unauthenticated, responsive BFT consensus | |
Ooshita et al. | Randomized gathering of mobile agents in anonymous unidirectional ring networks | |
Kuo et al. | Fair byzantine agreements for blockchains | |
Lewis-Pye et al. | Lumiere: Making optimal bft for partial synchrony practical | |
Tzinas et al. | On-chain timestamps are accurate | |
Buchwald et al. | Frosty: Bringing strong liveness guarantees to the snow family of consensus protocols | |
Zindros et al. | Rollerblade: Replicated Distributed Protocol Emulation on Top of Ledgers | |
Bacciottini et al. | Redip: Ranked entanglement distribution protocol for the quantum internet | |
Berenbrink et al. | A population protocol for exact majority with $ O (\log^{5/3} n) $ stabilization time and asymptotically optimal number of states |