Monad Quiz

1. What is MonadBFT?

A consensus mechanism for achieving agreement about transaction ordering

A blockchain protocol with quadratic communication complexity

A derivative of HotStuff with a reduction from three rounds to two rounds

All of the above

2. What is the significance of the 2-chain commit rule in MonadBFT?

Validators commit to two adjacent certified blocks

It triggers the assembly of a Timeout Certificate (TC)

Validators multicast a timeout message

None of the above

3. How are transactions shared among validator mempools to ensure all validators have the necessary transactions when voting on proposals?

By directly sending transactions to each validator

By using a broadcast tree after erasure-coding the transactions

By relying on a centralized server to distribute transactions

Both A and C

4. In Monad blockchain, what is the novel aspect regarding the relationship between execution and consensus?

Execution and consensus are tightly coupled

Execution is independent of consensus

Consensus precedes execution

Execution determines the consensus

5. What is the main advantage of decoupling execution and consensus in Monad?

It ensures deterministic execution

It allows for a more conservative gas limit

It facilitates efficient cross-globe communication

It unlocks significant speedups and scalability

6. What is the purpose of the delayed merkle root in Monad block proposals?

To speed up the finality of transactions

To prevent reordering of transactions

To enforce strict consensus

To address concerns about malicious nodes and execution errors

7. How does Monad execute transactions in terms of parallelism?

Sequential execution for optimal consistency

Parallel execution with merged state updates

Independent execution without state tracking

Randomized execution for improved efficiency

8. How does Monad manage dependencies between transactions to avoid wasted effort in parallel execution?

By randomly scheduling transactions for execution

By executing transactions in a fixed order

By employing a static code analyzer to determine dependencies

By allowing each transaction to independently decide its execution timing

9. What is the main advantage of MonadDb's implementation over typical Ethereum clients' databases?

MonadDb uses key-value databases for faster transaction processing.

MonadDb implements the Merkle Patricia Trie (MPT) data structure natively

MonadDb embeds multiple data structures for increased flexibility

MonadDb relies on B-Tree and LSM-Tree for efficient state storage

10. Why does MonadDb implement the Patricia Trie data structure natively for storing blockchain state?

To simplify the database design

To embed different data structures for improved performance

To avoid suboptimal embedding of one data structure into another

To support B-Tree and LSM-Tree structures simultaneously

11. How does communication proceed in MonadBFT during each round?

Validators send signed responses to the leader

The leader sends a signed message to the voters

Validators multicast a timeout message to their peers

Both A and B

12. In MonadBFT, what triggers the assembly of a Timeout Certificate (TC)?

Failure to receive a valid block within a specified time

Unanimous voting by validators for a block

The leader sends an invalid block proposal

Both A and C

13. How are pending user transactions handled in the MonadBFT network?

They are immediately included in a finalized block

They are stored in the mempool of each validator

They are communicated directly to the next leader

Both A and C

14. How does Monad handle the potential issues of malicious nodes or execution mistakes?

By enforcing strict consensus rules

By relying on supermajority votes for execution

By including a delayed merkle root in block proposals

By limiting the gas budget for execution

15. What is the base level execution strategy employed by Monad?

Pessimistic execution

Sequential execution only

Optimistic execution

Parallel execution without state checking

16. How does Monad handle the potential issue of incorrect execution due to parallel processing?

It ignores incorrect executions for efficiency

It rolls back the entire block and re-executes all transactions

It permanently discards transactions with incorrect execution

It uses optimistic execution and re-executes the specific transaction with correct data

17. How does MonadDb handle asynchronous I/O for the database?

By spawning a large number of kernel threads

By utilizing the latest kernel support for async I/O, such as io_uring

By avoiding any async I/O to simplify the process

By relying on traditional file system handling

18.What portability features does Monad offer for Ethereum compatibility?

Full compatibility with Bitcoin scripting language

Full support for Ethereum scripting language (Solidity)

Full bytecode compatibility for the Ethereum Virtual Machine (EVM)

Full compatibility with Hyperledger Fabric

19. What areas does Monad introduce pipelining and optimizations for?

MonadCoin consensus and storage

MonadBFT consensus and deferred execution

Parallel Execution and MonadDb state backend

Monad's client and blockchain scripting

20. What performance advantages does Monad offer over existing blockchains?

100 transactions per second (tps) with 10-second block times

1 million transactions per second (tps) with 1-minute finality

500 tps with 5-second block times

10,000 tps with 1-second block times and 1-second finality

How Nad are you

On with the questions...