I am interested in efficient and performant Rust implementations in general, and specifically for set-theoretic types.
My PhD topic is the implementation of an efficient set-theoretic type checker in Rust. Areas of research for this topic are:

• representations of integers, floats, strings, etc. which are both efficient and precise (e.g., while standard languages like C represent integers only as base types, verifiers track them with higher precision)
• maps/structs/lists/tuples with the same trade-off
• DNF representations
• hashing of co-inductive data structures
• benchmarking (both throughput and response time)
• standardized data formats for set-theoretic types
• parallelization

If you are interested in a Bachelor's/Master's thesis or a guided research and any of these topics interest you, or you have another idea that you feel is adjacent to these, please contact me.