Frequently Asked Questions
When is serverless cheaper than EC2?
Serverless wins for: Variable, spiky traffic (scale to zero when idle). Low utilization (<20% of time active). Unpredictable demand. Event-driven workloads. EC2 wins for: Steady, high-volume traffic (>10M requests/day consistently). Long-running processes (>15 min). Specific hardware needs (GPU, high memory). Breakeven example: t3.medium ($30/month) handles ~10M requests/month at 100% utilization. Lambda at 10M requests, 200ms, 512MB: ~$35/month. Similar cost, but Lambda scales automatically; EC2 needs auto-scaling setup. At 50M requests, EC2 clearly cheaper ($30 vs $150+ Lambda).
What are the hidden costs of serverless?
Beyond Lambda: (1) API Gateway: $3.50/million (REST) or $1/million (HTTP). Often exceeds Lambda compute cost. (2) Data transfer: $0.09/GB out to internet. (3) CloudWatch Logs: $0.50/GB ingested + $0.03/GB stored. Verbose logging adds up. (4) NAT Gateway: $0.045/hour + $0.045/GB if Lambda in VPC accesses internet. (5) DynamoDB/RDS connections: DynamoDB pay-per-request or provisioned; RDS Proxy for connection pooling. (6) Step Functions: $0.025/1000 state transitions. Mitigation: Use HTTP APIs (not REST), compress logs, cache in CloudFront, avoid VPC unless necessary.
How does serverless scale during traffic spikes?
Lambda scales automatically: Concurrent executions increase as requests arrive. Default: 1,000 concurrent per region (can request increase). Provisioned concurrency: Pre-warmed instances (no cold start) at $0.015/GB-hour. Use for latency-sensitive endpoints. Burst limit: 3,000 (or 500-1,000 in some regions) initial burst, then 500/minute increase. Throttling: If limits exceeded, requests get 429 errors. Plan: Request limit increase before expected spike, use provisioned concurrency for critical paths, implement retry logic in clients. Compared to EC2: Auto-scaling takes 3-5 minutes; Lambda scales in milliseconds.
How do I calculate serverless cost per API call?
Total cost per call = (Lambda compute + Lambda invocation + API Gateway + Data transfer) / Invocations. Example: 1M API calls/month, 200ms duration, 512MB, 1KB response. Lambda invocation: (1M - 1M free) × $0.0000002 = $0 (within free tier). Lambda compute: 1M × 0.2s × 0.5GB = 100K GB-sec - 400K free = $0. API Gateway (HTTP): 1M × $0.000001 = $1. Data transfer: 1M × 1KB = 1GB × $0.09 = $0.09. Total: $1.09/month = $0.00000109/call. At 10M calls: Lambda $1.67, API $10, transfer $0.90 = $12.57 = $0.00000126/call. Economies of scale in invocation/compute; API Gateway scales linearly.
Is my data stored or sent to a server?
No. All calculations run entirely in your browser using JavaScript. No data you enter is ever transmitted to any server or stored anywhere. Your inputs remain completely private.
How do I interpret the result?
Results are displayed with a label and unit to help you understand the output. Many calculators include a short explanation or classification below the result (for example, a BMI category or risk level). Refer to the worked examples section on this page for real-world context.
Background & Theory
The Serverless Cost & Invocation Breakdown Estimator applies the following established principles and formulas.
Computers represent all information using binary, a base-2 number system consisting solely of the digits 0 and 1, each called a bit. Because long binary strings are unwieldy, programmers routinely use octal (base 8) and hexadecimal (base 16) as compact shorthand. Converting between bases follows a consistent algorithm: divide the source number repeatedly by the target base, collecting remainders in reverse order. Hexadecimal digits A through F represent the values 10 through 15, allowing a single character to encode four binary bits, making it the preferred notation for memory addresses, color codes, and bytecode.
Bitwise operations manipulate individual bits within integers. AND produces a 1 only when both input bits are 1, making it useful for masking. OR produces a 1 when either bit is 1 and is used for combining flags. XOR flips bits that differ, enabling simple toggle logic and efficient swap algorithms. NOT inverts every bit (one's complement), while left and right shifts multiply or divide by powers of two in constant time.
Data storage units ascend in binary multiples of 1024: 8 bits form one byte, 1024 bytes form one kibibyte (KiB), 1024 KiB form one mebibyte (MiB), and so forth. Hard-drive manufacturers historically use decimal prefixes (1 KB = 1000 bytes), creating the persistent confusion between binary and decimal interpretations of the same label. The IEC standardized the binary prefixes KiB, MiB, GiB, and TiB in 1998 to resolve this ambiguity.
Network bandwidth is measured in bits per second (bps), most commonly megabits per second (Mbps) or gigabits per second (Gbps). A 100 Mbps connection transfers 100 million bits every second, equating to roughly 12.5 megabytes per second. IP subnet masks define network boundaries; CIDR notation appends a prefix length (e.g., /24) to an address, indicating how many leading bits are fixed. A /24 subnet contains 256 addresses with 254 usable hosts.
Algorithm efficiency is described using Big-O notation, which characterises the worst-case growth of time or space relative to input size. O(1) is constant, O(log n) is logarithmic (binary search), O(n) is linear, and O(n²) is quadratic. Cryptographic hash functions like SHA-256 produce a fixed 256-bit (32-byte) digest regardless of input length. File compression algorithms exploit statistical redundancy to reduce storage footprint, and compression ratio equals the original file size divided by the compressed size.
History
The history behind the Serverless Cost & Invocation Breakdown Estimator traces back through the following developments.
The conceptual foundation of modern computing traces back to Charles Babbage, whose Analytical Engine design of 1837 introduced the idea of a general-purpose mechanical computer with separate storage and processing units, including what he called the Store and the Mill. Ada Lovelace wrote what many consider the first algorithm intended for machine execution while annotating a translation of Luigi Menabrea's account of Babbage's work, also recognising the machine's potential to manipulate symbols beyond mere numbers.
George Boole published "The Laws of Thought" in 1854, formalising a two-valued algebra of logic that would later map perfectly to electrical circuits. It remained largely a mathematical curiosity until Claude Shannon's landmark 1937 master's thesis demonstrated that Boolean algebra could describe switching circuits, laying the theoretical groundwork for all digital electronics.
Shannon's 1948 paper "A Mathematical Theory of Communication" defined the bit as the fundamental unit of information and established information theory as a rigorous discipline. The same year, the transistor was invented at Bell Labs by Bardeen, Brattain, and Shockley, eventually replacing vacuum tubes and enabling miniaturisation at scale. ENIAC, completed in 1945, was one of the first general-purpose electronic computers, occupying 1800 square feet and consuming 150 kilowatts of power while performing roughly 5000 additions per second.
The ASCII standard was ratified in 1963, assigning 7-bit codes to 128 characters and enabling interoperability between computers from different manufacturers. Through the 1970s, the microprocessor consolidated an entire CPU onto a single chip; Intel's 4004 in 1971 marked the beginning of this trend. The Apple II launched in 1977 and the IBM PC in 1981 brought computing to homes and offices, triggering a mass-market software industry.
Tim Berners-Lee proposed the World Wide Web in 1989 and launched the first website in 1991 at CERN, transforming the internet from an academic and military network into a global information infrastructure. Mobile computing accelerated through the 2000s with smartphones integrating powerful processors, wireless networking, and GPS into pocket-sized devices, extending computation into every facet of daily life and cementing TCP/IP as the universal communications fabric.