csmith VS ouroboros-network

Yes! Another well-known program reducer is C-Reduce [0]. When Csmith [1] started churning out very large programs that exhibited errors in C compilers, the compiler maintainers asked the researchers to please reduce the ~81KB files to a more manageable size so they could understand the errors better. C-Reduce was developed specifically to address that need.

[0] https://github.com/csmith-project/creduce

[1] https://github.com/csmith-project/csmith

Is CompCert actually safer in practice? One way to evaluate this is via fuzzing tools like CSmith. CSmith has a list of bugs they have found (hundreds total, in mainstream compilers like llvm and gcc). Here is a quote from the 2011 PLDI paper on CSmith:

If you are actually just going to use C, the easiest way is to just use this existing tool that does exactly what you want and has been used to find many, many existing bugs in many compilers: https://embed.cs.utah.edu/csmith/

Here's a list of bugs found by a similar project, Csmith: https://github.com/csmith-project/csmith/blob/master/BUGS_REPORTED.TXT

I'm one of the consensus team members at IOG. We maintain and extend the consensus layer of the Cardano blockchain, which provides a rich set of challenges related to distributed computing, type level programming, networking, concurrency, among others.

According to a document on pipelining I saw on Github they might be building a whole new Ouroboros protocol called Leios (https://github.com/input-output-hk/ouroboros-network/pull/3579/files) so there might be something we don't know yet

• cardano-node - top level integration code • ouroboros-network & ouroboros-consensus - network code & consensus (which integrates network, consensus and the ledger) • ledger - ledger(s) specifications and implementation • plutus - the smart contract language and related infrastructure

Check out cardano-ping.

This is non trivial, you can check an example how we generate valid subset of Haskell to check that our implementation of orElse is corect: https://github.com/input-output-hk/ouroboros-network/blob/master/io-sim/test/Test/STM.hs

So from what I gather the transaction fee is a fixed protocol parameter. I like how fees are distributed amongst the epoch, If I had to design a blockchain system I'd also have chosen this approach TBH. It addresses some of the issues and misaligned incentives if you only have to rely on fees for block rewards. However if the demand for transactions constantly outweighs the available space you get into other issues. I tried to find details on how Cardano handles transactions and manages its mempool. I believe somewhere here is the code? (https://github.com/input-output-hk/ouroboros-network/blob/master/ouroboros-consensus/src/Ouroboros/Consensus/Mempool/Impl.hs)

Ouroboros(the consensus algorithm's formal specification): https://github.com/input-output-hk/ouroboros-network