1. Bloc 1 - Fundamental Concept Facile · Firedancer
What architectural overhaul developed by Jump Crypto aims to significantly reduce Solana's consensus latency and achieve sub-200ms finality?
En savoir plus sur ce sujet
A. FiredancerB. Solana 2.0C. AgaveD. Proof of History2. Bloc 1 - Fundamental Concept Facile · 150-millisecond finality
What specific finality time does the Solana Firedancer upgrade target for its October 2026 mainnet deployment?
En savoir plus sur ce sujet
A. 12-second finalityB. 150-millisecond finalityC. Sub-1 millisecond finalityD. 400-millisecond finality3. Bloc 1 - Fundamental Concept Facile · Speed-of-light constraints
Which fundamental physical constraint is cited by critics as a hard lower bound on global message propagation for permissionless blockchains?
En savoir plus sur ce sujet
A. Internet bandwidth limitsB. Moore's Law of processing powerC. Speed-of-light constraintsD. The Byzantine Generals Problem4. Bloc 2 - Academic Theory Moyen · Practical Byzantine Fault Tolerance (pBFT)
Under the Practical Byzantine Fault Tolerance (pBFT) model, why is treating voting and message propagation as separable, additive durations considered architecturally flawed?
En savoir plus sur ce sujet
A. Because pBFT relies on a single leader to tally all votes instantly before propagating the final block.B. Because Nakamoto Consensus proves that longest-chain rules eliminate the need for distinct voting phases.C. Because cryptographic hashing algorithms take a deterministic amount of time regardless of network topology.D. Because pBFT requires multiple overlapping phases of all-to-all communication where voting and propagation are deeply intertwined.5. Bloc 2 - Academic Theory Moyen · Speed-of-Light Latency Bound
Applying the Speed-of-Light Latency Bound to a globally distributed validator set, what is the theoretical minimum round-trip communication time between antipodal nodes?
En savoir plus sur ce sujet
A. Approximately 133 to 200 milliseconds, depending on fiber optic routing.B. Exactly 0 milliseconds, as quantum entanglement allows for instantaneous data transfer.C. Approximately 10 to 20 milliseconds, matching local data center latency.D. Exactly 21 million milliseconds, reflecting the maximum supply cap of Bitcoin.6. Bloc 2 - Academic Theory Moyen · Amdahl's Law of Parallel Computing
According to Amdahl's Law of Parallel Computing, what strictly limits the theoretical speedup of Firedancer's 80ms parallel voting mechanism during consensus?
En savoir plus sur ce sujet
A. The diminishing returns of adding more validators to a decentralized network.B. The total number of GPU cores added to the validator network.C. The proportion of the consensus process that must be executed sequentially, such as cryptographic signature verification bottlenecks.D. The total amount of staked SOL securing the network.7. Bloc 3 - Contextual Application Difficile · AI capex boom
How might the ongoing AI capex boom indirectly challenge Firedancer's network optimization by affecting the hardware supply chain for validators?
En savoir plus sur ce sujet
A. By causing AI agents to flood the Solana network with spam transactions, crashing the Firedancer client.B. By monopolizing high-end GPU and networking hardware manufacturing, driving up costs and limiting availability for independent validators.C. By accelerating the development of quantum computers that easily break Solana's cryptographic security.D. By forcing regulators to classify all high-performance computing nodes as artificial intelligence entities.8. Bloc 3 - Contextual Application Difficile · Data sovereignty regulations
In what way could emerging data sovereignty regulations and cross-border data flow restrictions directly disrupt Firedancer's regional clustering and 30ms propagation targets?
En savoir plus sur ce sujet
A. They could require all validators to switch to Proof of Work consensus to comply with energy mandates.B. They could mandate that all transactions be fully encrypted, making parallel processing impossible.C. They could require validators to pay cross-border tariffs using central bank digital currencies (CBDCs).D. They could force validators to route data through mandatory national firewalls or localized hubs, adding artificial latency hops.9. Bloc 4 - Expert Synthesis Expert · Speed-of-Light Latency Bound vs Practical Byzantine Fault Tolerance (pBFT)
When evaluating Firedancer's benchmarks, how do the Speed-of-Light Latency Bound vs Practical Byzantine Fault Tolerance (pBFT) differ in modeling non-deterministic global propagation delays?
En savoir plus sur ce sujet
A. The Speed-of-Light Bound provides a strict, deterministic physical floor for latency, while pBFT must account for variable, non-deterministic delays caused by node failures and network congestion.B. The Speed-of-Light Bound assumes data travels instantly in a vacuum, while pBFT assumes data travels at the speed of sound.C. The Speed-of-Light Bound focuses on the probabilistic finality of longest-chain rules, while pBFT guarantees instant finality without network delays.D. The Speed-of-Light Bound is calculated using smart contract gas fees, while pBFT relies on validator staking yields.10. Bloc 4 - Expert Synthesis Expert · CAP Theorem (Brewer 1998) vs Amdahl's Law of Parallel Computing
How do the CAP Theorem (Brewer 1998) vs Amdahl's Law of Parallel Computing contrast when evaluating the trade-offs between Firedancer's regional clustering and global decentralization?
En savoir plus sur ce sujet
A. CAP Theorem proves that blockchains can never be decentralized, while Amdahl's Law proves that more nodes always make a network faster.B. CAP Theorem focuses on the economic incentives of clustering, while Amdahl's Law focuses on the cryptographic security of parallel chains.C. CAP Theorem addresses the systemic trade-off between consistency and availability during network partitions, whereas Amdahl's Law limits the internal processing speedup of an individual clustered node.D. CAP Theorem dictates the maximum block size in megabytes, while Amdahl's Law dictates the maximum number of validators.