Project 1: eBPF¶
Note
The project is subdivided into multiple challenges. New challenges use new eBPF concepts and the difficulty generally increases with each challenge. However, you can attempt the challenges in any order you like.
New challenges will be added to the project over time (but all challenges will be available at the end of the week of tutorial 4).
Attention
The project is due on Tuesday, 8th April 2025, 11:59 PM. This is a soft deadline (see details in the submission section).
Note
You do not have to worry about race conditions for this project.
Statement updates¶
Important
The “eBPF challenges” project is a new project that we designed this year. As such, it may have some inaccuracies. The following section summarizes all the changes made to provide a clearer understanding of the project. Since this is the first year such project is given, it is advised to check this page once in a while for any updates.
20/03/2025: Challenge 2, LSM will be enabled when testing your code. Statement: Note about README.md.
24/03/2025: No need to consider race conditions (added to the “index” and “submission” pages).
26/03/2025: Challenge 3, added a note concerning slow VMs.
26/03/2025: Challenge 3, added “(the ancestor as determined by
ancestor_separations
)”.27/03/2025: Challenge 4 typo. In the example, the parameter was named “threshold” instead of “log_step”.
27/03/2025: Challenge 5, precision about pressing backspace when the buffer is empty.
27/03/2025: Challenge 5 improved example. The given example has more details and should be easier to understand.
31/03/2025: Challenge 5 modifications. Buffer is now 32 characters (instead of 32 bytes) + you can choose 3 different ways to enter numbers.