 Are you concerned about your memory being tampered by polynomial size circuits? Are existing non-mallable code solutions not explicit enough for you? Do you lie awake at night wondering if cryptography really exists? Are you ready to bring the power of non-deterministic reductions into your life? If so, then you should read hardness, non-deterministic hardness, versus non-mallability. In this paper you will learn how to build non-mallable codes and much more from de-randomization type assumptions. Learn what a non-mallable code actually is and what these assumptions actually are. In particular, you will see the following theorem. If e is hard for exponential size non-deterministic circuits, then for any constant c, explicit non-mallable codes for circuits of size n to the c exist with statistical security n to the minus c. Note that 1 over poly security is optimal from such assumptions under black box reductions. However, negligible security is still possible for certain applications. Consult a full version or your friendly cryptographer to see if these constructions are right for you.