Zach Jones is a backend engineer with nine years of experience building resilient, cloud-native services, currently focused on payment infrastructure at Monzo Bank from his base in Melbourne, Florida. He has deep Go expertise, having designed and operated microservices at LUSH Digital using GCP, CockroachDB, Redis, and Pub/Sub, and contributed substantive optimizations to the Go compiler’s SSA pass—improving prove analyses around bounds checks. Zach brings a multidisciplinary background from roles in public sector IT, legal technology, and entrepreneurship, which helps him translate complex domain requirements into pragmatic technical solutions. His career spans systems design, CI/CD, and operational ownership, with hands-on experience in containerization, secret management, and event-driven architectures. Comfortable tackling problems “far above his head,” he pairs curiosity with disciplined engineering and a track record of shipping reliable, test-covered changes. Outside engineering, his international studies and languages hint at an ability to work across cultures and ambiguous requirements.
9 years of coding experience
6 years of employment as a software developer
BA, International Studies, Political Science, BA, International Studies, Political Science at University of Wisconsin-Madison
Master of International Public Administration - MIPA, Development Economics and International Development, Master of International Public Administration - MIPA, Development Economics and International Development at La Follette School of Public Affairs at UW-Madison
Summer Institute for Intensive Arabic Language and Culture, Arabic Language, Summer Institute for Intensive Arabic Language and Culture, Arabic Language at Lebanese American University
Contributions:4 commits, 55 comments, 3 issues in 1 month
Contributions summary:Zach made significant contributions to the Go compiler's SSA (Static Single Assignment) optimization pass. Their work focused on improving the `prove` optimization, which analyzes and propagates value information for more efficient code generation, particularly around index bounds checks. The user's commits include changes to the `prove` algorithm for handling non-negativity, handling extensions, and improving its interaction with the partially ordered set (poset). The user's contributions included additional test cases.
Contributions:11 pushes, 1 branch in 3 years 4 months
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.