How Technology Fundamentals 2 Changed in 2026

Periodic jobs should be safe to run twice, because they will be. This is most visible in cost controls. Consider cost controls specifically. You rarely need a new component to fix a boundary problem. Cost Controls: The signal you want is often already logged, just not aggregated.

Release Process: You can often replace a coordination problem with an idempotency key. Release Process: Anything that grows without a bound will eventually hit one. Release Process: Documentation that is not tested tends to describe the previous version.

For cost controls, the constraint matters more than the feature list. If a metric has no owner, it will drift until it causes an incident. Teams working on cost controls usually discover this the hard way. The cheapest optimisation is usually removing work nobody asked for. Aggregating at write time trades flexibility for predictable read cost. This is most visible in cost controls.

Edge Caching: A queue smooths spikes but also hides how far behind you are. Retries without jitter turn a small outage into a large one. That applies to edge caching as well. In practice, edge caching behaves differently: Separating the reads from the writes buys room to change either side.

It can help to prepare a short sentence and a next step. For instance: “I want to take things slowly, so let’s check in before anything changes,” or “I don’t want photos taken or shared.” If you are unsure what you want, say so. “I’m still working that out, and I want to pause for now” communicates a limit without requiring you to settle every future question.

Teams working on storage tiers usually discover this the hard way. The interesting number is not the average, it is the 99th percentile. Adding a cache in front of a slow query is a fix; fixing the query is a cure. This is most visible in storage tiers. Consider storage tiers specifically. Every abstraction you add is a place where behaviour can differ from intent.

For schema migration, the constraint matters more than the feature list. The first thing to settle is the failure mode, not the happy path. Teams working on schema migration usually discover this the hard way. Measurements taken once are anecdotes; you need a baseline that repeats. Costs usually concentrate in a small number of operations, so find those first. This is most visible in schema migration.

In practice, search indexing behaves differently: The first thing to settle is the failure mode, not the happy path. Measurements taken once are anecdotes; you need a baseline that repeats. The same reasoning holds for search indexing. For search indexing, the constraint matters more than the feature list. Costs usually concentrate in a small number of operations, so find those first.

The interesting number is not the average, it is the 99th percentile. The same reasoning holds for load balancing. For load balancing, the constraint matters more than the feature list. Adding a cache in front of a slow query is a fix; fixing the query is a cure. Teams working on load balancing usually discover this the hard way. Every abstraction you add is a place where behaviour can differ from intent.

Rate Limiting: The interesting number is not the average, it is the 99th percentile. Rate Limiting: Adding a cache in front of a slow query is a fix; fixing the query is a cure. Rate Limiting: Every abstraction you add is a place where behaviour can differ from intent.

API Design: A queue smooths spikes but also hides how far behind you are. API Design: Retries without jitter turn a small outage into a large one. API Design: Separating the reads from the writes buys room to change either side.

Backup Strategy: Configurations should be reviewable in a diff, not only in a console. The best time to add an index is before the table gets large. That applies to backup strategy as well. In practice, backup strategy behaves differently: Failures are usually correlated, so plan for the shared dependency.

Search Indexing: The first thing to settle is the failure mode, not the happy path. Search Indexing: Measurements taken once are anecdotes; you need a baseline that repeats. Search Indexing: Costs usually concentrate in a small number of operations, so find those first.

Queue Design: You can often replace a coordination problem with an idempotency key. Queue Design: Anything that grows without a bound will eventually hit one. Queue Design: Documentation that is not tested tends to describe the previous version.

In practice, crawl budget behaves differently: If a metric has no owner, it will drift until it causes an incident. The cheapest optimisation is usually removing work nobody asked for. The same reasoning holds for crawl budget. For crawl budget, the constraint matters more than the feature list. Aggregating at write time trades flexibility for predictable read cost.

Log Analysis: If a metric has no owner, it will drift until it causes an incident. Log Analysis: The cheapest optimisation is usually removing work nobody asked for. Log Analysis: Aggregating at write time trades flexibility for predictable read cost.

Teams working on release process usually discover this the hard way. Serving static bytes is the cheapest thing you can do at the edge. A schema is an interface; changing it is a migration, not an edit. This is most visible in release process. Consider release process specifically. Track the denominator as carefully as the numerator.

For cloud infrastructure, the constraint matters more than the feature list. A queue smooths spikes but also hides how far behind you are. Teams working on cloud infrastructure usually discover this the hard way. Retries without jitter turn a small outage into a large one. Separating the reads from the writes buys room to change either side. This is most visible in cloud infrastructure.

For load balancing, the constraint matters more than the feature list. Periodic jobs should be safe to run twice, because they will be. Teams working on load balancing usually discover this the hard way. You rarely need a new component to fix a boundary problem. The signal you want is often already logged, just not aggregated. This is most visible in load balancing.

Storage Tiers: A design that cannot be rolled back is a design that cannot be changed safely. Storage Tiers: Latency budgets are easier to defend when every hop has a stated ceiling. Storage Tiers: Caching helps only until the invalidation rules become the bottleneck.

Access Control: The first thing to settle is the failure mode, not the happy path. Access Control: Measurements taken once are anecdotes; you need a baseline that repeats. Access Control: Costs usually concentrate in a small number of operations, so find those first.

Storage Tiers: If the rollback plan needs a meeting, it is not a rollback plan. Storage Tiers: Small pages that stay small are easier to keep fast than large ones made fast. Storage Tiers: Write the invariant down; otherwise it lives only in someone's memory.

Monitoring Alerts: Periodic jobs should be safe to run twice, because they will be. Monitoring Alerts: You rarely need a new component to fix a boundary problem. Monitoring Alerts: The signal you want is often already logged, just not aggregated.

Schema Markup: Configurations should be reviewable in a diff, not only in a console. Schema Markup: The best time to add an index is before the table gets large. Schema Markup: Failures are usually correlated, so plan for the shared dependency.