Projects

Systematic investigation of how ESBuild, Rolldown, Vite, Webpack, and RsBuild resolve conditional exports in package.json. Motivated by bundler issues integrating the Prisma 6/7 Query Compiler (WebAssembly) with metaframeworks that each use their own bundlers and configuration.

Built the data and execution layer for a MILP-based optimizer that plans multi-product pipeline flows, tank constraints, and train imports for CEPRO with CTU Prague researchers.

Sole-engineered warehouse system for Vivaldi srl. Operators would scan an order, and the app would choose stock locations, compute the walking order, and apply Excel/CSV inventory changes atomically. The route core would use compile-time floor data and Rust/WASM modules in the Node.js service, returning answers in microseconds with route quality effectively identical to exact mathematical solutions that can take hours to prove.

Co-designed a binary protocol with Vivaldi's R&D team and built two Windows desktop apps in C++17 and Qt 6: one for a paging microphone station (PM2), one for a conference AV controller (Cpointer). Same protocol, same command queue infrastructure, two different hardware products. Shipped to hundreds of customers with CI/CD, code signing, and Italian localization.

One TypeScript API for ten ID formats. Byte-backed strategies round-trip between readable strings and Uint8Array values, letting databases store compact binary keys without sacrificing readable IDs at application boundaries. Tree-shakeable across Node.js, Deno, Bun, browsers, and edge runtimes.

Personal bridge between Claude Code and Telegram. Hooks send session events to a local daemon, which maps each session to a Telegram forum topic and forwards replies, questions, tool approvals, prompts, and stop commands back to the matching tmux pane.

Header-only C++20 library providing generic data structures (K-ary heaps, union-find with path splitting, sparse byte sets) and functional programming abstractions (fmap, zip) that complement the standard library. Uses CMake and GoogleTest.

University project comparing an exact MILP model (IBM CPLEX) against a metaheuristic combining Genetic Algorithms, Local Search, and Farthest Insertion for symmetric TSP. Benchmarked on instances up to 1,665 nodes with C++17 and Python.