fuzzcheck-rs VS talent-plan

Fuzzcheck is a structure-aware fuzzer for rust. "Fuzzing" means feeding large amounts of data into a program and checking for crashes (Fuzzcheck also checks to make sure that all the properties your program should uphold – e.g. a sorting algorithm applied to a list of n items should always return a list of n items – are upheld). Fuzzcheck is an "evolutionary" fuzzer – this means that it generates a set of random inputs, sees what percentage of the program is executed for each input, and keeps inputs which have high levels of percentage of program executed. It then "mutates" these inputs – whereas fuzzers such as AFL/Hongfuzz/etc mutate raw bytes in place (e.g. they swap bytes at different positions, or insert a random byte at a given position to generate inputs similar to the chosen "high coverage" inputs), Fuzzcheck works directly on the Rust types (so it might swap the order of two items in a vec, or randomly insert a new item). It's a really powerful tool for finding lots of bugs.

If you want help with Win support (issues/8) maybe post it here to get it added to TWIR.

I am working on a code coverage viewer for my fuzzer (fuzzcheck). I described what I've done so far in this issue and I am hoping to release the first version within two weeks.

The implications for my fuzzer, fuzzcheck, are huge! Compiling fuzz tests is a lot easier. There should be no more need to create a separate fuzz folder, fuzz tests can be regular #[test] functions, private implementation details can be fuzz-tested as well, rust-analyser works as expected, documentation can be easily generated, etc. I can also attach a human-readable coverage report to every test case :)

Since I graduated, I have had a lot more time to work on fuzzcheck. I am trying to flesh it out, test it, and document it for a new release. It has always felt a bit rushed/experimental and now I am hoping to make it into something solid. I have also played with an egui interface for it, to visualise the tested code coverage, understand how the fuzzer’s decisions are made, and also to interactively tweak the fuzzer’s behaviour. It's a lot of work but it's slowly all coming together! :)

fuzzcheck-rs is really cool. It combines property-testing with fuzzing, getting the nice, structured nature of the former, and the coverage-driven search of the latter, but it works by mutating the structure directly instead of going through a bit string. So if you have a binary tree, going from A(B, C) to A(C, B) can be a single mutation away if that makes sense in your use case, instead of being arbitrarily far away in the bitstring approach.

Pls check this course: https://github.com/pingcap/talent-plan . It includes how to implement sql and key value store. It’s an awesome course

- https://hackattic.com/ : Interesting programming Problems.

- https://sadservers.com/ : Learn Linux by solving problems.

- https://fly.io/dist-sys/ : Distributed Systems Problems.

- https://github.com/pingcap/talent-plan/ : System Programming / Distributed System Challenge.

- https://protohackers.com/ : Server Programming Challenges.

- https://codecrafters.io/ : Implement server tech / softwares from scratch.

- https://hyperskill.org/ : Lots of projects based tutorials.

- https://github.com/pingcap/talent-plan/ : System Programming / Distributed System Challenge.

Awesome stuff!

Just to share in the way: open source training courses about distributed database and distributed systems by PingCap.

https://github.com/pingcap/talent-plan

You should try this lab by PingCAP (write a serde implementation for redis serialization protocol) ; you can find answers/seek help in github if you really don't know to figure out it.

I am doing pingcap's talent plan recently, where you need to implement a custom Deserializer for REdis Serialization Protocol for the building block 3. What confuses me most is the implementation of `EnumAccess` and `VariantAccess`. One of my attempt looks like the following:

Looking at your project, I would recommend following this tutorial that makes you write key-value store in Rust. They don't provide you with a solution and make you come up with most stuff yourself, but give you some direction and structure for learning. You seem to have come up with most of this yourself already, but it might still be useful for you.

If you are interested in network programming and distributed system, checkout https://github.com/pingcap/talent-plan