Mohammad KeyhaniInteractive keynote

Vibe Coding the Future: Software Entrepreneurship After Generative AI

Mohammad Keyhani. A presentation that is itself software: 14 scenes, live seeded simulations, and the full argument in readable form below.

← All slides

Selected for stage: 14 of 14 slides · estimated 17:30 (minutes:seconds).

Stage keys: click the slide, → / Space / Page Down to reveal; ← / Page Up to go back; O for overview; P to pause; R to replay; F for fullscreen; Escape to return. Notes and elapsed timer are opt-in and appear on the same screen when enabled.

Clickers using Page Down / Page Up work even when a control is focused. Arrow keys remain available for editing focused inputs.

0100:00–01:00

Mohammad Keyhani

Vibe Coding the Future: Software Entrepreneurship After Generative AI

  • This presentation is software.

In short: A coded keynote about making better entrepreneurial experiments. Mohammad Keyhani is a Replit-certified Level 4 Advanced Builder and ranks in the Top 1% of Replit Agent users, as displayed on AIDrivenSites.com.

Replit-certified Level 4 Advanced Builder · Top 1% of Replit Agent users
0201:00–02:00

From waiting for a team to making a start

Software entrepreneurship is faster, cheaper, and more feasible now for more people than ever before

GenAI makes the whole entrepreneurial journey easier to attempt.

  • Research. Pitch. Build. Launch. Operate.
  • Fewer steps have to wait for someone else.

In short: GenAI can make the full entrepreneurship journey easier and faster: researching problems, shaping offers, creating prototypes, preparing outreach, launching and handling operating work. The supplied NoCodeDevs tweet and silent crowd clip illustrate the difficulty of recruiting technical help around an idea. More of the founder’s next steps can now begin without waiting for a complete team. The meme is an illustration, not an empirical measure of hiring or venture performance. Engineering expertise, human judgment and real customer demand remain important.

NoCodeDevs (@nocodedevs), August 1, 2024: “The Idea Guy” pitching his startup to developers. A crowd leaves a lone person isolated.
NoCodeDevs · Aug 1, 2024 · Open full tweet ↗
0302:00–03:00

Lower experiment costs · the small-bets movement

You can just build things.

Build fast. Automate. Make room for the next experiment.

  • Daniel Vassallo leads the Small Bets community.
  • Pieter Levels: build fast → automate → next experiment.

In short: Lower implementation costs let indie entrepreneurs turn more ideas into working products. Daniel Vassallo leads the Small Bets community; Pieter Levels exemplifies the approach of building fast, automating products and operations, and moving to another experiment. These practices motivate Keyhani’s research and portfolio. His Infinite Slop classroom composite illustrates speed: he describes an idea post on August 29, 2026 and a build announcement a few hours later. The composite supports a teaching example of rapid building; it does not independently verify timestamps or document all operational automation. Levels and Vassallo have much stronger distribution than Keyhani.

Example · Pieter Levels, “Infinite Slop”

Idea to public demo, in hours

Composite: two posts by Pieter Levels around the Infinite Slop livestream title card. Left, a post about faster AI video quoting another builder's livestream; right, his later post saying he built Infinite Slop.
  1. SparkSees another builder’s livestream experiment
  2. HoursBuilds his own version the same day
  3. ApproachAutomate, then start the next experiment
You can just build things. Build fast, automate operations, then try the next idea.
0403:00–04:00

My experience · SchoolStats.ca

About 1,000 hours of work a day.

For two weeks. Building SchoolStats.ca.

    In short: For SchoolStats.ca, Keyhani reports roughly 150 hours of building over two weeks with parallel Replit agents and under $10K in AI tokens. An AI agent estimated about 15,000 hours of equivalent pre-AI effort and a multi-million-dollar conventional build. About 1,000 equivalent hours a day is rounded shorthand over those two weeks. The counterfactual effort and build-cost figures are AI-agent estimates, not independent quotes or an audited productivity benchmark. Token spend excludes founder time and other project costs.

    ~15,000pre-AI hours · AI-agent estimate
    150 hoursof my time building with AI
    Multi-million-dollarconventional project · AI-agent estimate
    Under $10Kin AI tokens
    Two weeks. Parallel AI agents on Replit.
    0504:00–05:00

    One draw versus the best of ten · Normal

    Draw ten. Keep the best.

    The distribution of the best outcome is a different distribution.

    • Draw 10 independent outcomes; highlight the largest.
    • Repeat the whole group. Keep one maximum each time.

    In short: Standard Normal N(0,1), as in Figure 1. Compare individual draws with maxima of groups of ten: the maximum CDF is F(x)^10 and its density is 10 f(x) F(x)^9. The theoretical median moves from 0 to about 1.50. Histograms are simulations, not the paper’s original samples.

    0605:00–06:00

    One draw versus the best of ten · Pareto

    Sampling the tail.

    Different attempts create exposure to rare outcomes.

    • Pareto outcomes: minimum 1, tail shape 2.5.
    • Best-of-n is exposure. Who can afford enough attempts?

    In short: Sampling the tail means using genuinely different attempts to gain exposure to rare outcomes. In this Pareto illustration (minimum 1, shape 2.5), the theoretical median rises from 1.32 for one draw to 2.95 for the best of ten. The maximum CDF is F(x)^10; values beyond the linear 1–8 window stay counted. This is conditional exposure, not guaranteed entrepreneurial success. Every attempt uses time, money and attention. The runway scene returns to who can afford to keep sampling.

    0706:00–08:00

    The probability distribution of your best outcome

    More distinct attempts, more exposure.

    Increase exposure. Count the cost.

    • Take n independent attempts. Keep the best.
    • Watch the distribution shift as n increases from 1 to 40.

    In short: A fixed blue best-of-1 Pareto curve provides a baseline while a yellow maximum-distribution curve changes as the number of independent attempts increases from 1 to 40. Only n and the yellow curve geometry change during playback. The underlying distribution, axis limits and density scale remain fixed. The model uses median 1, minimum 2^(−1/α), and selected tail shape α. The maximum CDF is F(x)^n; log-outcome density includes the logarithmic Jacobian. The finite logarithmic display ends at 1000, with its continuing tail disclosed and no renormalization. This is an analytic distribution, not a random sample or a promise that a particular portfolio hits. The original seeded sampling comparison remains available in exploration.

    0808:00–09:30

    Kickstarter · one creator’s best campaign

    More chances explain much.

    What if repeat creators got more draws?

    • Benchmark: one-time creators’ pledged amounts.
    • Compare each repeat creator’s best campaign.

    In short: Filtered U.S. Kickstarter campaigns, 2009–2017; outcome: amount pledged, not profit or funding-goal success. Share whose best campaign beats the one-time creators’ 90th percentile, model versus observed: 2 projects 19% versus 18.1%; 3 projects 27.1% versus 27.1%; 4 projects 34.4% versus approximately 34%; 5 projects 41.0% versus approximately 39%. Four- and five-project model rates use 1−0.9^n; their observed rates are approximate readings reconstructed from Figure 5’s model-minus-observed discrepancy plot, rounded to whole percentages, not tabulated values. At the 95th and 99th percentiles, observed outliers exceed predictions. Compatible with exposure benefits, not causal proof against learning.

    0909:30–11:00

    Uncorrelated search · correlated focus

    Explore or exploit? Read the landscape.

    Different landscapes reward different patterns of bets.

    • Spread bets to search; cluster bets around a shared lead.
    • The value of focus depends on the landscape and the evidence.

    In short: A 2×2 simulation compares independent global proposals with shared-lead clustered proposals. Both receive the same imperfect prior lead and 20 equal-cost tests; their coordinate sequences are reused across rows. The top terrain has eight dispersed high-value pockets and a weak central pocket. The bottom has two compact, centrally arranged clusters, replacing the former oversized basin. Discoveries count distinct dominant pockets reached at score 0.20 or higher; repeat visits count once. Dashed rings identify discovered pockets. Accumulated value separately sums all test scores, including repeat returns. Broad search is useful for discovering scattered opportunities; focus is useful for earning repeat value near a useful lead. These are constructed conditions with different opportunity counts and total reward areas, rather than a controlled causal test of correlation alone. Topography is shown only to the audience. No seed or winner is selected. The manuscript’s common-shock model remains a separate exploration tool.

    1011:00–12:00

    The conditions for experimentation

    When do more small bets make sense?

    GenAI shifts the cost of trying; markets still set the opportunity.

    • Fit the number of bets to the conditions.
    • GenAI can make smaller software tests affordable.

    In short: More small experiments make sense when rare large payoffs are possible, credible tests are affordable, bets differ meaningfully, early signals are noisy, and losses are small and reversible. Fewer, deeper tests fit tightly bounded upside, expensive evidence, shared premises, clear signals worth pursuing, or large irreversible commitments. GenAI can lower the implementation cost of some software experiments and reduce the build commitment needed to try them. The diagram illustrates that qualitative shift; it assigns no scores, optimal trial counts or measured productivity multipliers. Market upside, independence and evidence quality remain case-dependent. A useful test still needs customer access, safe delivery, observable evidence and follow-through.

    Fewer, deeper testsMore, smaller bets
    1. UpsideUpside is tightly boundedA rare hit could cover many misses
    2. Cost of a real testCredible evidence is expensiveCredible tests are affordableGenAI · Can lower the build cost
    3. DistinctnessShared assumptions and channelsDifferent problems, audiences and channels
    4. Early evidenceClear signals favor deepeningNoisy signals favor trying alternatives
    5. DownsideLarge, hard-to-reverse commitmentsSmall, reversible stakesGenAI · Can shrink the build commitment

    GenAI can lower software build costs and commitments. Upside, distinctness and signal quality stay market-dependent.

    Real tests still need customer access, safe delivery and capacity to follow through.

    1112:00–13:00

    New capabilities · beyond cheaper code

    Judgment-powered software.

    Keep calculation exact. Adapt the explanation.

    • Rules give the same correct calculation every time.
    • LLMs adapt how that answer is explained to a learner.

    In short: A calculator applies exact rules: 2 × 2 should always equal 4. An LLM can adapt how that answer is explained to a five-year-old without requiring a separately programmed lesson for each new request. Rules-based educational software can already deliver lessons built for it; the new opportunity is flexible interpretation and adaptation across contexts. Combine the capabilities: the LLM calls a calculator for arithmetic and shapes a child-friendly explanation around the result. Judgment remains fallible, with outputs to check and people accountable for consequential decisions. The illustration is a metaphor and the comparison is a teaching example.

    Illustration: a robot holds up an apple and studies it closely, as if deciding what the apple is and what to do with it.

    One answer. Two kinds of software.

    2 × 2 = 4

    Rules-based software

    Compute 2 × 2. Get 4, every time.

    Fixed rules are exactly what this task needs.

    Judgment-powered software

    “Explain 2 × 2 so my five-year-old can learn.”

    Adapt to the learner without a custom-coded lesson for every new request.

    Use both togetherLLM → calculator → 4 → child-friendly explanation

    OpportunityAutomate parts of workflows whose inputs resist a complete rulebook.

    BoundaryLLM judgment is fallible. Check outputs and retain human responsibility.

    1213:00–14:15

    Where I see the opportunity

    What harness will you build?

    Compose rules and judgment around a valuable task.

    • Code sets permissions and checks outputs.
    • Other models can classify or critique; people handle consequential exceptions.

    In short: A harness is the surrounding system of context, tools, permissions, workflow logic, output checks and escalation. Three illustrative compositions: an agent chooses among code-enforced tools; a rules-owned invoice workflow calls an LLM at a defined step and checks its output; and monthly-close rules contain an investigating agent, a read-only ledger tool and a classifier LLM. Another model can critique a proposal, while conventional code enforces hard constraints. Model checks can share errors, so evaluation and appropriate human approval remain necessary. The refund cap is an illustrative tool policy. These diagrams explain architecture patterns rather than a deployed product or a security guarantee.

    Rules-based codeModel judgmentPerson

    AJudgment on top

    Agent chooses tools and sequence
    • Look up orderRead only
    • Issue refundEligibility check · ≤ $100
    • Draft replySending disabled

    Code validates inputs and enforces each tool’s limits.

    BRules on top

    1. Rules: Select the next invoice
    2. Model: Match invoice to purchase order
    3. Rules: Check totals and vendor
    4. Rules: Escalate exceptions to a person

    The workflow owns the sequence and checks the model’s output.

    CNesting

    Rules: Monthly close procedure
    Model: Agent investigates a variance
    Rules: Read-only ledger tool
    Model: Classifier LLM tags transactions

    Rules and model calls can sit inside one another. Other models can classify or critique; their checks remain fallible.

    Use code for hard limits, models for interpretation, and people for consequential exceptions.

    1314:15–16:45

    My work · Selected software projects

    Why I’m building a portfolio.

    More affordable ways to find out.

    • Honeybee Logic · AI for schools
    • CheckIt.so · document review
    • HelperBat · coordination by email
    • AIScholar.cc · studying LLM behavior
    • SchoolStats.ca · usable school data
    • AIs Roast Humans · reader attention

    In short: Six current projects: Honeybee Logic—AI lesson planning deployed in Alberta schools; CheckIt.so—document review; HelperBat—email coordination; AIScholar.cc—systematic studies of LLM behavior; SchoolStats.ca—aggregated school data for education research; AIs Roast Humans—a free-to-read AI publication. Advance through six dedicated landing-page views with project-specific QR codes. The images are saved homepage snapshots, not live demos. GenAI lowers build friction, but users and routes to demand differ. The publication tests readership, not proven willingness to pay. Shared platforms, research networks and founder attention mean these are not independent draws. Proposed evidence tests are distinct from any dated deployment claims. Bound effort and decide whether to stop, change or deepen on evidence; the mix is not proof of an optimal portfolio.

    Real projects · what GenAI enables

    • Honeybee Logic · Company · deployed in Alberta. Schools · curriculum-aware lesson planning. What GenAI enables: Draft curriculum-aware lesson plans for each teacher’s context, beyond fixed templates.
    • CheckIt.so · Document AI · launched 2025. Teams · repetitive document review. What GenAI enables: Interpret document meaning for structured reviews, beyond keyword matching and fixed extraction rules.
    • HelperBat · AI scheduling assistant. Busy teams · email coordination. What GenAI enables: Interpret requests and replies in email, turning conversational context into scheduling actions.
    • AIScholar.cc · Research platform. Researchers · systematic studies of LLM behavior. What GenAI enables: Study LLMs as experimental subjects, automating comparisons of their responses and behavior.
    • SchoolStats.ca · SSHRC-supported data project. Education research · fragmented school data. What GenAI enables: Parallel AI agents made a data-intensive research platform feasible for me to build.
    • AIs Roast Humans · Free-to-read AI publication. Readers · satire and model perspectives. What GenAI enables: Publish model-authored satire and commentary, comparing different AI perspectives on the same subject.
    Explore all my building projects →

    For each test: cap effort in advance, preserve maintenance and attention, and decide whether to stop, change, or deepen based on what customers actually do.

    Project01/ 06

    Honeybee Logic

    Company · deployed in Alberta

    For
    Schools · curriculum-aware lesson planning
    What GenAI enables
    Draft curriculum-aware lesson plans for each teacher’s context, beyond fixed templates.

    Project02/ 06

    CheckIt.so

    Document AI · launched 2025

    For
    Teams · repetitive document review
    What GenAI enables
    Interpret document meaning for structured reviews, beyond keyword matching and fixed extraction rules.
    Top section of the checkit.so homepage, captured November 2026

    Project03/ 06

    HelperBat

    AI scheduling assistant

    For
    Busy teams · email coordination
    What GenAI enables
    Interpret requests and replies in email, turning conversational context into scheduling actions.
    Top section of the helperbat.com homepage, captured November 2026

    Project04/ 06

    AIScholar.cc

    Research platform

    For
    Researchers · systematic studies of LLM behavior
    What GenAI enables
    Study LLMs as experimental subjects, automating comparisons of their responses and behavior.
    Top section of the aischolar.cc homepage, captured November 2026

    Project05/ 06

    SchoolStats.ca

    SSHRC-supported data project

    For
    Education research · fragmented school data
    What GenAI enables
    Parallel AI agents made a data-intensive research platform feasible for me to build.
    Top section of the schoolstats.ca homepage, captured November 2026

    Project06/ 06

    AIs Roast Humans

    Free-to-read AI publication

    For
    Readers · satire and model perspectives
    What GenAI enables
    Publish model-authored satire and commentary, comparing different AI perspectives on the same subject.
    1416:45–17:30

    The end

    Key takeaways

    What was useful? What could be clearer?

      In short: Three takeaways: Assess the opportunity landscape. Be deliberate about experimentation strategy. Build previously impossible software and rethink all legacy systems for the GenAI era. Give Mohammad feedback at https://mohammadkeyhani.com/feedback/ using the large QR. The smaller QR keeps this interactive deck and its references accessible.

      1. Assess the opportunity landscape
      2. Be deliberate about experimentation strategy
      3. Build previously impossible software and rethink all legacy systems for the GenAI era

      Models & assumptions

      Judgment-powered software: A teaching contrast between exact calculation and adapting an explanation to a learner. Rules-based educational software can deliver predesigned lessons; LLMs can generalize across new requests without a bespoke lesson for each. A calculator tool provides the arithmetic result; model interpretation and explanations still need checking. Earlier software also used statistical inference. The illustration is a metaphor; the arithmetic/teaching comparison and three architectures are illustrative, with no model calls or deployed integrations.

      A harness can combine context, model instructions, tools, permissions, validation, monitoring and escalation. Conventional code can enforce specific permissions and limits. The example refund tool validates eligibility and an illustrative $100 ceiling. Invoice arithmetic and vendor checks stay in code; exceptions reach a person.

      Another model may classify information or critique an output, but its errors can be correlated with the first model’s errors. Evaluate the whole system, test failure paths, log actions and retain appropriate human approval. These diagrams show composition patterns rather than a correctness, security or autonomy guarantee.

      Qualitative decision guide: Compare payoff upside, the cost of obtaining credible evidence, dependence between bets, information in early signals and downside reversibility. These are conditional guides rather than a scored model or a rule for choosing an optimal number of ventures.

      The two arrows illustrate how GenAI can reduce software implementation costs and build commitment. They show a qualitative possibility rather than measured before-and-after values. Customer access, validation, safe delivery, operating costs and follow-through remain part of the whole experiment.

      The other conditions stay market-dependent. Use strong evidence to deepen a direction; use affordable, distinct tests when early evidence leaves real uncertainty. Broad experimentation and learning can complement each other. This is a conceptual application of the experimentation mechanisms and boundary conditions discussed in the cited research, including the supplied manuscripts; it is not a validated GenAI forecast.

      Project pages: Six local landing-page snapshots captured November 15, 2026 show the top section of each real homepage, cropped above cookie notices where necessary. They are not live websites or product demonstrations; screenshot copy reflects the capture date, not independently validated performance. Each QR encodes that project’s public homepage URL, also shown as a normal link. Images and QR codes are preloaded when the keynote opens; following a link or QR requires internet access.

      Best-of-ten figure comparisons: Standard Normal N(0,1) and Pareto with minimum 1, shape 2.5, matching the parameter choices in Figures 1–2 of Keyhani & Jamshidi (2025). These are separate from the median-1 calibration below. Choose 1–1,000 independent batches on screen; the default is 20 batches of ten draws. The second frame reveals individual draws and briefly holds each completed batch’s maximum. A maximum enters the histogram only after all ten draws are revealed. At high batch counts or speeds, rendering may combine draws; all observations remain in the calculations. Changing the batch count changes the simulated histograms, while the theoretical best-of-ten law stays fixed. For continuous independent identical draws, F_max(x)=F(x)^10 and f_max(x)=10 f(x) F(x)^9. Lines are exact theoretical densities, not fitted GEV curves; bars use new seeded samples, not the paper’s original data. Baseline and maxima histograms use their own sample counts and bin widths as density denominators. Display windows are linear −4 to 4 and 1 to 8; off-window observations are retained and counted without renormalizing visible bins. More attempts cost resources and never guarantee demand.

      Sampling: Normal median/mean 1, standard deviation 0.5; Pareto minimum 2^(−1/α), median 1. Common median does not imply equal variance. At α ≤ 1 the Pareto population mean does not exist; at α ≤ 2 its variance does not exist. Reported maxima describe finite samples, not population averages. Outcomes are illustrative units, not startup forecasts.

      Reading the theater: Turquoise bars are empirical bin counts; the dashed curve is theoretical bin probability × draws shown. Height is count per bin, not density per outcome unit. Bins are equal-width on the displayed axis (logarithmic for Pareto). Each draw is computed individually; animation may reveal several draws per frame. Up to five recent sampling trails are rendered. Full outcomes, including overflow, remain in the calculations.

      Threshold odds: q = P(X ≥ 5) from the selected distribution. P(at least one hit) = 1 − (1 − q)^n for independent identical trials. Equal q and n give identical hit odds across distributions. Additional attempts cost resources and generally give diminishing probability increments, not certainty.

      Maximum distributions: Independent median-1 Pareto outcomes have minimum xₘ = 2^(−1/α). For the maximum of n draws, Fₘₐₓ(x) = F(x)^n and fₘₐₓ(x) = n f(x) F(x)^(n−1). The plotted density is with respect to z = log₁₀(x), so g(z) = ln(10) · x · fₘₐₓ(x). Stage playback shows exact distributions, with no sampled maxima or histogram.

      Best-of-n curve playback: The stage shows a yellow analytic maximum-distribution curve against a fixed blue best-of-1 baseline, with integer n increasing from 1 to 40 and brief endpoint holds. Both axes and all other content are fixed during playback. The log-density is bounded above by α·ln(10) for every n≥1, so one analytic y-axis bound covers all 40 curves without per-frame autoscaling. The finite display window is not renormalized; probability beyond 1000 is at most 1−F(1000)^40 for this range of n. Pause, speed and replay affect only playback. Reduced motion shows n=40.

      Dependence: P(hit) = (1 − ρ)[1 − (1 − q)^n] + ρq. Each of 24 simulated portfolios gets one mixture draw: independent Bernoulli trials with probability 1−ρ, otherwise a shared Bernoulli(q) realization for all 20 trials. ρ is this model’s common-shock parameter, not a universal payoff correlation. Each map shows the fixed first portfolio. The separately labelled repeated-portfolio estimate is noisy; the formula is the model probability.

      Landscape rendering: Background shading samples the analytic surface on a 40×40 grid in seven brightness bands. Test scores use the continuous analytic surface at their actual locations. Brighter shading means higher illustrative value. The same scale is used in all four cells; no winner or favorable seed is selected. Dashed circles show the score≥0.20 contour of discovered peak components.

      Opportunity landscapes: This constructed spatial model uses the unit square. Both fields are geometrically centered at (0.5,0.5), independently of proposal outcomes. A shared imperfect prior lead is uniform in [0.465,0.535]². Both policies receive it and 20 equal-cost tests. Independent proposals are uniform across the domain. Clustered proposals use Gaussian offsets with standard deviation 0.075 around that shared lead, reflected at boundaries. The exact proposal sequences are reused across rows. The dispersed terrain has a weak central peak (height 0.25, width 0.035) and eight peaks (heights 0.8–1, width 0.06) on a randomly rotated radius-0.30 ring. The concentrated terrain has two height-1, width-0.06 peaks at opposite radius-0.11 offsets on the same orientation. This replaces the earlier width-0.2 basin whose area made even random search productive. A test’s score is the maximum Gaussian peak value at its location. A distinct discovery is recorded when that score reaches 0.20, assigning the test to its highest-scoring peak; repeated discoveries of the same peak count once. Accumulated value sums every score, explicitly assuming additive repeat returns. Neither opportunity count nor integrated reward mass is matched across terrains: cross-row differences also reflect available opportunity area. This demonstrates conditional exploration/focus strategies in specified environments, rather than the isolated causal effect of payoff correlation. The audience sees the surface; policies receive only the prior lead. There is no adaptive learning, empirical calibration, forecast or optimal-strategy claim. Single runs vary. The manuscript’s common-shock model remains separate.

      Reproducibility: Rehearsal seed 17112026. Replay repeats computed outcomes; speed and pause only affect animation. “New random run” explicitly chooses and displays a new seed. Reset restores rehearsal parameters. Presentation never advances itself. Core playback needs no external API, video, or media request after the page has loaded.

      References & status

      1. Judgment-powered software and harness compositions · Conceptual teaching examples · Mohammad Keyhani

        Three compositions recreated from the speaker’s supplied diagram: judgment on top, rules on top and nesting. Support/refund, invoice and ledger flows are illustrative; the $100 cap is an example tool policy. Judgment means fallible model-based interpretation. The contrast with explicit rules does not imply that earlier software never used statistical inference. Model reviewers can share errors; harnesses require evaluation, code-enforced permissions and appropriate human oversight. The supplied robot/apple illustration is a visual metaphor, served as an optimized local image.

      2. SchoolStats.ca build account and AI-agent estimates · Speaker-reported inputs · AI-agent counterfactual estimates

        The speaker reports about 150 hours of building over roughly two weeks with parallel Replit agents and under $10K in AI tokens. He attributes the estimated 15,000 equivalent pre-AI hours and multi-million-dollar conventional build cost to an AI agent. The daily 1,000-hour figure is rounded shorthand. These estimates are not independently audited measurements or quotes. Token spend excludes founder time and other costs.

        https://schoolstats.ca/
      3. Build in parallel · Replit documentation · Platform workflow documentation

        Background on parallel tasks, isolated work and reviewing changes. Supports the workflow explanation, not the speaker’s time estimate or a productivity guarantee.

        https://docs.replit.com/learn/build-in-parallel
      4. Selected building projects · Mohammad Keyhani · First-person project context

        Current project descriptions and roles; portfolio examples illustrate a research-informed design rationale, not independent trials or a claim of validated traction.

        /building/
      5. Turning side projects into profitable startups · Pieter Levels · First-person account · January 24, 2018

        Bootstrapping, launching side projects, and observing feedback. An influence on the research and the speaker’s approach, not causal evidence that copying the strategy reproduces the results.

        https://levels.io/startups/
      6. Infinite Slop · Pieter Levels classroom example · Classroom visual supplied by Mohammad Keyhani

        Composite of a product screenshot and two posts attributed to Levels. Keyhani describes an idea on August 29, 2026 followed by a build announcement a few hours later. Individual post timestamps and embedded technical performance claims were not independently verified. Illustrates implementation speed, not demand, revenue or a universal benchmark.

        https://infiniteslop.ai/
      7. Small Bets · Community and educational resource · Daniel Vassallo

        An influence on the speaker’s research and entrepreneurial approach. Practitioner experience complements, but does not replace, evidence or access to customers.

        https://smallbets.com/
      8. Small Bets is joining Gumroad · Gumroad announcement · April 22, 2025 · Daniel Vassallo

        First-party confirmation of Small Bets joining Gumroad. No acquisition price, membership totals, or follower-count comparison is needed for the argument.

        https://gumroad.com/blog/p/small-bets-is-joining-gumroad
      9. Random Experimentation and Exceptional Outcomes in Entrepreneurship · Published · Keyhani & Jamshidi · 2025 · Academy of Management Perspectives

        Journal p. 7: model assumptions and limits. pp. 9–10: Kickstarter comparison at the 90th percentile; greater underprediction at higher cutoffs. Observational, not causal identification.

        https://doi.org/10.5465/amp.2023.0514
      10. Three Essays on Entrepreneurial Experimentation under Heavy-Tailed Randomness · Doctoral thesis · Zahra Jamshidi · University of Calgary · November 2025

        Chapter 3, §§3.4–3.6 and Figures 3.16–3.17: U.S. Kickstarter campaigns, 2009–2017; pledged amounts, the one-time-creator baseline, best-of-N comparisons, and greater observed outlier frequency than predicted at higher cutoffs. Used as explanatory context for the single Kickstarter slide; the numerical pairs above are cited to the published paper. The supplied thesis is not redistributed here.

      11. Extreme Value Experimentation Under Heavy Tails · Research manuscript · unpublished

        Portfolio-level common-shock mixture and conditions involving dependence, low costs, weak signals and heavy tails. The keynote illustrates one mechanism, not the full Bayesian theory.

      12. The New Makers · GCEC virtual lecture, 2026 · Lecture materials · Mohammad Keyhani

        Citizen development, technical co-founder dependencies, APIs, and human judgment.

      13. AI-powered entrepreneurship · University of Regina, 2026 · Lecture materials · Mohammad Keyhani

        Building with AI versus AI-powered products; planning before code; responsible implementation.

      14. Related recording · CIrc_Dgw7-A · Further viewing

        Optional lecture recording; not required for playback.

        https://www.youtube.com/watch?v=CIrc_Dgw7-A
      15. Related recording · mQ3z_yITDKY · Further viewing

        Optional related recording; not required for playback.

        https://www.youtube.com/watch?v=mQ3z_yITDKY
      QR code for this keynote

      Share this experience

      https://mohammadkeyhani.com/slides/vibe-coding-the-future/

      Simulations use a seeded pseudo-random generator (rehearsal seed 17112026). Windows: bell world linear −1 to 8; heavy tail log 0.1 to 1000. Off-window draws are counted and their true maxima reported.