Laurent retweeted
async await async await
async await async await
async await async await
🎶 In the browser, the mighty browser, the main thread sleeps tonight! 🎵
🎵 In the browser, the mighty browser, the main thread sleeps toniiiiiight! 🎶
Laurent retweeted
As a 31yo Principal Engineer with 20 years of programming experience and 15 years in the industry, I I would add that you should know
Vacuum fluctuations
Planck-scale quantum foam
Feynman path integrals
Quantum electrodynamics
Quantum chromodynamics
The Standard-Model Lagrangian
Spontaneous symmetry breaking
Renormalization-group flows
Higgs mechanism fundamentals
Inflationary cosmology
Semiconductor band structure
PN-junction physics
MOSFET threshold behavior
CMOS logic design
SPICE circuit simulation
Register-transfer-level (RTL) design in Verilog and VHDL
Static-timing analysis and timing closure
RISC-V privileged and unprivileged specifications
ARM architecture and big.LITTLE scheduling
x86 micro-op pipelines and fusion
Cache-coherence protocols (MESI, MOESI, MESIF)
Translation-lookaside-buffer (TLB) management
Weak memory-ordering models
Kernel scheduling and pre-emption
Virtual-memory subsystems
Non-Uniform Memory Access (NUMA) architectures
Executable and Linkable Format (ELF) internals
Linker-script construction
Static Single Assignment (SSA) form
Register allocation strategies
LLVM intermediate representation
Continuation-passing style
Algebraic effects
Monads and comonads
Homotopy type theory basics
Category-theory adjunctions
Galois connections
Differential geometry and geodesics
Tensor calculus
Gibbs, Shannon, and von Neumann entropy
Kolmogorov complexity
NP-completeness and reductions
Paxos consensus algorithm
Raft consensus algorithm
Byzantine-fault tolerance
Zero-knowledge proofs
Side-channel-attack mitigation
Spectre and Meltdown mitigations
Tenstorrent Wormhole micro-architecture
SPARC, POWER, and Itanium ISA overviews
Zig comptime mechanics
Rust borrow-checker operation
Unicode normalization forms
Regular-expression back-references and look-arounds
Nix flakes and Guix packaging
Dockerfile layer optimization
OCI runtimes (runc, crun)
cgroups v2 and namespaces
Kubernetes CustomResourceDefinitions (CRDs) and operators
Terraform state management
Ansible idempotent playbooks
Linux perf profiling and flame graphs
eBPF uprobes and kprobes
Prometheus promQL fundamentals
Grafana dashboard design
OpenTelemetry tracing APIs
Kafka in-sync-replica management
RabbitMQ flow control
Redis eviction policies
SQLite write-ahead logging
PostgreSQL multiversion concurrency control (MVCC)
Cassandra gossip protocol
DynamoDB partition-key design
LevelDB compaction strategies
SPARQL query language
WebSocket handshake and framing
HTTP/3 over QUIC
TLS 1.3 handshake flow
JSON Schema validation
YAML parsing rules
HTML5 semantic elements
WebGPU shader model
Transformer attention mechanisms
Diffusion-model latent-space representations
Reinforcement-learning value and policy iteration
Graph neural networks
Functors, applicatives, profunctors
Lambda calculus and Church numerals
Turing-machine theory
Agile, Scrum, Kanban, and Scrumban frameworks
SAFe program-increment planning
DevOps, DevSecOps, and MLOps principles
Site-reliability-engineering error budgets
JIRA workflow configuration
Confluence documentation practices
ISO 9001:2015 quality-management guidelines
ITIL v4 incident-management processes
Stakeholder-management techniques
Blameless post-mortem methodology
Psychological-safety practices in teams
Empathetic code-review techniques
Laurent retweeted
“Mom, how did we get so rich?”
“Your dad kept getting poached back and forth by the top AI labs without actually doing any work.”
Laurent retweeted
If you studied algorithms, I'm sure you've heard of Dijkstra’s algorithm to find the shortest paths between nodes in a weighted graph. Super useful in scenarios such as road networks, where it can determine the shortest route from a starting point to various destinations. It's been the most optimal algorithm since 1956!
Until now.
The O(E + V log V) complexity just went down to O(E log^(2/3) V) for sparse graphs.
It would be amazing if this kind of breakthrough came through AI that can code but I guess we're not there yet..
Laurent retweeted
Hahahahhahahaha
Unironically a good idea. It's so unbelievably stupid and it works. Depending on explorer layout, the .exe might not be visible.
Filename.mp4 + ??? spaces + .exe
Hahahahahaha UNC6032 is wild as hell
Laurent retweeted
Replying to @honour_can_code
Those rows are saddened by the row you deleted. That's why it says it affected them. They'll get over it soon.
Laurent retweeted
I tried deleting a row on a production database,
please what does
“(9341243) rows affected” mean?😭
Laurent retweeted
“So. we stack layers where each does Wx + b followed by a nonlinearity e.g. ReLU. This builds a deep function. We train it by minimizing loss using backpropagation and gradient descen-“
Laurent retweeted
The new Pope has a degree in mathematics from Villanova University.
This guy doesn’t just understand sin. He understands cos.
Laurent retweeted
- On ne partage pas qqch à qqn : on le partage avec lui
- On n'insulte pas qqn de qqch : on l'insulte tout court ou on le traite de qqch
- On ne rabat ni ne rabâche les oreilles : on rebat les oreilles
- On n'enjoint pas qqn à faire qqch : on enjoint à qqn de faire qqch
Laurent retweeted
As well as being St. George's Day, the 23rd April is the day we celebrate the birth of William Shakespeare, one of England's finest sons.
Shakespeare mentioned cats more than 40 times in his works; this, from Henry IV, is my favourite:
"I am as vigilant as a cat to steal cream."
Yum.
Laurent retweeted
"President Trump, during your first term, you told 30,573 lies.
Which one is your favorite?"
"I don't lie."
"That one is my favorite, too."
Laurent retweeted
Unfortunately someone has stolen the wheels from our police vehicles
We are working tirelessly to catch them
Laurent retweeted
This tariff pause is going to be very bad for the factory I started building last week
































