Hacker Timesnew | past | comments | ask | show | jobs | submitlogin

No, I won’t have checks on every dereference. The monotonicity of Fil-C’s capabilities makes it possible to do a lot of redundant check elimination.

That’s what I’m working on now. Should have some early results soon.



Obviously, removing repeated/redundant bounds checks is a basic optimization. That's not what I meant. My point still stands.


I think that check on every access is a lot different than check on some accesses.

That plateau might not be any different than the CHERI plateau, since at the microarch level, CHERI will have more checks since it cannot benefit from a compiler’s static reasoning about redundant check elimination.




Consider applying for YC's Summer 2026 batch! Applications are open till May 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: