Encryption in 325 Characters or Less with Bennett!

What encryption scheme is this?

def e(s,d,r=""):
 p=lambda j,d:53>(k:=d.index(j))and d[:k]+[d[k+1],j]+d[k+2:]
 or[d[0],j]+d[1:k];d=p(54,p(54,p(53,d)));l,h=sorted([d.index(53)
 ,d.index(54)]) d=d[h+1:]+d[l:h+1]+d[:l];b=min(d[-1],53);d=d[b:-1]
 +d[:b]+[d[-1]];o=d[min(d[0],53)];return s and(53>o and e(s[1:],d,
 r+chr(97+(ord(s[0])-97+o)%26))or e(s,d,r))or r
encrypt=e

See Bennett's post here!

Doing First Grade Math in Rust's Type System

Arithmetic is hard. Luckily, we can fix that using Rust's Expressive Type System™️.

Write Yourself a Concurrent Vector

Book detailing the process, techniques, and challenges associated with implementing a lock-free, thread-safe vector: Writing a Concurrent Vector in Rust