惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Forbes - Security
Forbes - Security
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
P
Palo Alto Networks Blog
Martin Fowler
Martin Fowler
T
Threatpost
D
Docker
S
Schneier on Security
M
MIT News - Artificial intelligence
G
Google Developers Blog
L
LINUX DO - 热门话题
J
Java Code Geeks
月光博客
月光博客
博客园 - 三生石上(FineUI控件)
IT之家
IT之家
博客园 - Franky
C
Cyber Attacks, Cyber Crime and Cyber Security
K
Kaspersky official blog
Google DeepMind News
Google DeepMind News
N
News and Events Feed by Topic
V
Vulnerabilities – Threatpost
CTFtime.org: upcoming CTF events
CTFtime.org: upcoming CTF events
人人都是产品经理
人人都是产品经理
Spread Privacy
Spread Privacy
T
Tailwind CSS Blog
爱范儿
爱范儿
阮一峰的网络日志
阮一峰的网络日志
U
Unit 42
C
CERT Recently Published Vulnerability Notes
The GitHub Blog
The GitHub Blog
Simon Willison's Weblog
Simon Willison's Weblog
NISL@THU
NISL@THU
MongoDB | Blog
MongoDB | Blog
Application and Cybersecurity Blog
Application and Cybersecurity Blog
H
Heimdal Security Blog
Recorded Future
Recorded Future
云风的 BLOG
云风的 BLOG
SecWiki News
SecWiki News
P
Privacy International News Feed
P
Proofpoint News Feed
O
OpenAI News
B
Blog
腾讯CDC
F
Full Disclosure
Apple Machine Learning Research
Apple Machine Learning Research
T
Tor Project blog
H
Hacker News: Front Page
Project Zero
Project Zero
Hugging Face - Blog
Hugging Face - Blog
C
Cisco Blogs
S
Security Affairs

Hacker News

Introducing Claude Opus 4.7 Qwen Studio The Future of Everything is Lies, I Guess: Where Do We Go From Here? GitHub - SeanFDZ/macmind: Single-layer transformer in HyperTalk for the classic Macintosh Show HN: Agent-cache – Multi-tier LLM/tool/session caching for Valkey and Redis Moving a large-scale metrics pipeline from StatsD to OpenTelemetry / Prometheus GitHub - Nightmare-Eclipse/RedSun: The Red Sun vulnerability repository GitHub - SethPyle376/hiraeth: Local AWS emulator focused on fast integration testing, with SQS support, SQLite-backed state, and a debug-friendly web UI. GitHub - macOS26/Agent: Any AI, replaces Claude Code, Cursor, OpenClaw. Over 18 LLM providers (Claude, OpenAI, Gemini, Ollama, Zai, HF, Qwen) wired into a native Mac app that writes code, builds Xcode projects, bumps versions, manages git, automates Safari, use AppleScript, JS or Accessibility, extend Agent! w/ MCP Servers, run tasks from your iPhone via Messages. YouTube now lets you turn off Shorts I Made a Terminal Pager Burgers | マクドナルド公式 Commands — HackerNews CLI documentation ChatGPT for Excel PiCore - Raspberry Pi Port of Tiny Core Linux Live Nation illegally monopolized ticketing market, jury finds Google Broke Its Promise to Me. Now ICE Has My Data. Founding Engineer at Adaptional | Y Combinator CRISPR takes important step toward silencing Down syndrome’s extra chromosome GitHub - saffron-health/libretto: The AI toolkit for building reliable browser automations US v. Heppner (S.D.N.Y. 2026) no attorney-client privilege for AI chats [pdf] Unexpected €54k billing spike in 13 hours: Firebase browser key without API restrictions used for Gemini requests Retrofitting JIT Compilers into C Interpreters IPv6 – Google The Accursèd Alphabetical Clock Cybersecurity Looks Like Proof of Work Now Fragments: April 14 Cal.com Goes Closed Source: Why AI Security Is Forcing Our Decision | Cal.com - Scheduling Software for Online Bookings Laravel raised money and now injects ads directly into your agent When moving fast, talking is the first thing to break Too much Discussion of the XOR swap trick – Heather Cafe Introduction to Spherical Harmonics for Graphics Programmers The Grand Line Building a Z-Machine in the worst possible language High-Level Rust: Getting 80% of the Benefits with 20% of the Pain GitHub - duguyue100/midnight-captain: Inspired by Midnight Commander, tailored to my taste. How to build a `git diff` driver · Jamie Tanna | Software Engineer Center for Responsible, Decentralized Intelligence at Berkeley The Local Universe’s Expansion Rate Is Clearer Than Ever, but Still Doesn’t Add Up - A new synthesis of astronomical measurements confirms a persistent mismatch that could point to physics beyond current models The air throughout our homes is infused with microplastics. But there are things you can do to breathe less of them The disturbing white paper Red Hat is trying to erase from the internet – OSnews The Future of Everything is Lies, I Guess: Annoyances ‘Abhorrent’: the inside story of the Polymarket gamblers betting millions on war Productive procrastination — Max van IJsselmuiden maps, territory and LMs 447 Terabytes per Square Centimetre at Zero Retention Energy: Non-Volatile Memory at the Atomic Scale on Fluorographane Show HN: Pardonned.com – A searchable database of US Pardons 20 Years on AWS and Never Not My Job The Seasons are Wrong Artemis II crew splashes down near San Diego after historic moon mission We gave an AI a 3 year retail lease in SF and asked it to make a profit | Andon Labs How a dancer with ALS used brainwaves to perform live On filing the corners off my MacBooks Installing every* Firefox extension OpenClaw’s memory is unreliable, and you don’t know when it will break Steve Blank Nowhere Is Safe Chimpanzees in Uganda locked in vicious 'civil war', say researchers watgo - a WebAssembly Toolkit for Go linux/Documentation/process/coding-assistants.rst at master · torvalds/linux GitHub - callumlocke/json-formatter: Makes JSON easy to read. Founding Product Engineer at Bild AI | Y Combinator A compelling title that is cryptic enough to get you to take action on it GitHub - Keychron/Keychron-Keyboards-Hardware-Design: Industrial design files for Keychron keyboards and mice. 100+ models with CAD assets in STEP, DXF, DWG, and PDF. Source-available, with commercial use allowed for original compatible accessories within the license terms. [ANNOUNCE] WireGuardNT v0.11 and WireGuard for Windows v0.6 Released 1D-Chess Helium Is Hard to Replace Cooperative Vectors Introduction | Evolve Keeping a Postgres queue healthy — PlanetScale Our response to the Axios developer tool compromise Do Americans read print books, e-books or audiobooks more? The Zettelkasten Method in Obsidian: A Practical Setup Guide Artemis II Is Competency Porn and We Are Starving For It WeakC4 Flight Viz — Cockpit View A Mexican surveillance giant you’ve never heard of is now watching the U.S. border Surelock: Deadlock-Free Mutexes for Rust RISC-V 101 – what is it and what does it mean for Canonical? | Ubuntu The Problem That Built an Industry How Much Linear Memory Access Is Enough? | Solidean Investigating Split Locks on x86-64 Simplest hash functions Sybilproof reputation mechanisms (2005) [pdf] What is a property? How Complex is my Code? Static code analysis in Kotlin — tools overview Toffoli gates are all you need PGLite evangelism dcmake: a new CMake debugger UI Clojure on Fennel part one: Persistent Data Structures Fragments: April 2 Python Release Python install manager 26.1 The Life and Death of the Book Review - Liberties Introducing Database Traffic Control — PlanetScale Bitcoin miners are losing $19,000 on every BTC produced as difficulty drops 7.8% God sleeps in the minerals Building slogbox Apple Silicon and Virtual Machines: Beating the 2 VM Limit Who was “Not Even Wrong” first? Pokemon Evolution Vs Darwinian Evolution The APL Programming Language Source Code
How a Renaissance gambling dispute spawned probability theory
2026-04-19 · via Hacker News

Imagine you and I are playing a simple game of chance. We each throw $50 into a pot and start flipping a coin. Heads, you get a point; tails, I get one. The first person to reach 10 points walks away with the full $100. The game gets underway, and the score is currently eight to six in your favor. Suddenly my phone rings: there’s an emergency, and I must leave in a hurry. Now we have a problem. You don’t want to just hand me my $50 back because you’re winning. But I’m reluctant to give you the whole pot because I still have a chance to hit a lucky streak and mount a comeback. What is the fairest way to split the cash?

Known as the “problem of points,” or “problem of the division of the stakes,” this puzzle stumped mathematicians for more than 150 years. And it did so for good reason: probability theory hadn’t been invented when the problem was first posed. Two greats of 17th-century math, Blaise Pascal and Pierre de Fermat, corresponded about the problem in a famous series of letters. They not only discovered the correct way to share the pot but also created the foundations of modern probability theory in the process. To this day, the solution is the basis for risk assessments of all kinds, helping us make smarter bets on everything from buying a stock to insuring a home along a coastline.

In 1494, Italian mathematician Luca Pacioli first took an early crack at the problem of points in his textbook, the title of which translates to Summary of Arithmetic, Geometry, Proportions and Proportionality. He proposed that players should split the pot in proportion to how many points they each have at the time of interruption. In our running example, you have won eight of the 14 flips thus far. According to Pacioli’s solution, you would take eight fourteenths of the pot, which equals about $57.14. I would take the remaining six fourteenths. The solution sounds sensible, but more than 50 years later, Niccolò Fontana “Tartaglia” noticed that it failed in cases where the point ratio between players was extreme. What if the interruption came after a single coin toss? Under Pacioli’s rule, the winner of that one flip would take the entire pot, even though the game was far from decided. This would be clearly unfair—and the problem of points is all about seeking a fair split.


On supporting science journalism

If you're enjoying this article, consider supporting our award-winning journalism by subscribing. By purchasing a subscription you are helping to ensure the future of impactful stories about the discoveries and ideas shaping our world today.


Tartaglia proposed an alternative method. Imagine that, in our hypothetical game, you’re ahead by two flips. You have one fifth of the 10 flips needed to win. Because that’s one fifth closer to the goal, Tartaglia reasoned that you should get your full stake back and take one fifth of my stake: the original $50 you put in plus one fifth of my $50, for a total of $60. This new approach seems to operate more equitably, especially at the extremes. Now if the game got interrupted after one flip, then the winner of that flip would take only one tenth of their opponent’s stake instead of all of it. While Pacioli’s method rewards the winning player based on the size of their lead relative to the number of flips thus far, Tartaglia’s method rewards them based on the size of their lead relative to the total length of the game. Tartaglia doubted his own innovation, though, writing, “In whatever way the division is made there will be cause for litigation.” He believed that no perfect mathematical solution existed and that the problem was designed to cause arguments. It turns out he was at least right to doubt his own solution. Imagine that one player had 199 points and that the other had 190 points during a game with a goal of 200 points. Tartaglia would award the first player only nine two-hundredths of their opponent’s stake, or $2.25, even though their opponent would need 10 tails in a row to win. The first player’s measly payout hardly seems to reflect their overwhelming likelihood of winning at that stage of the game.

The debate went nowhere until the mid-17th century, when a French gambler and intellectual socialite enlisted the help of mathematician Blaise Pascal. Pascal immediately saw that the solution lay not in the score at the time of interruption but in the future possibilities of the score, and he wrote to his friend and fellow mathematician Pierre de Fermat to help him prove it. Their correspondence yielded two completely unique approaches to the problem. Amazingly, their disparate approaches always arrived at the same solution. This convergence sealed their confidence in their results, and mathematicians now agree that they had found the fairest way to divide the stakes.

Fermat’s solution was to look at all possible continuations of the game after the point at which it was interrupted and count the number of those continuations that result in a win for each player. A fair percentage of the total pot awarded to a player should be the percentage of possible futures in which that player wins the game. Take our recent example game’s score of eight to six with a goal of 10 points; Fermat would notice that the game must end within five coin flips. If the first player won one flip and the second won three, then they would be tied at nine to nine, and the game would end on the next flip. If the game stopped at this point, Fermat’s method for dividing the pot would list all possible outcomes of those five coin flips and then tally the ones that amassed 10 points for each player. In some of those possible futures a player will win in fewer than five flips, but that’s okay: we can imagine that if the game ends early, the players flip the coin a few extra times just to make the accounting easier. The figure below reveals the answer to our puzzle. The first player wins in 26 out of the 32 possible continuations of the game, so they are due 26 / 32 = 81.25 percent of the pot, or $81.25.

Graphic shows the results of 14 coin flips (eight heads and six tails), along with all 32 possible sequences for the next five flips. In 26 of the sequences, Player 1 wins. And in six of them, Player 2 wins.

Amanda Montañez

Fermat’s solution, though elegant, suffered from one major drawback: What if there were too many possible continuations to list? Even if only 20 flips remain in our game, we would have to consider more than a million imaginary futures to uncover a fair split. Pascal offered a genius answer and, in the process, provided the earliest reasoning on what would become the concept of expected value, which remains a fundamental pillar of modern probability theory.

Pascal’s method begins with an uncontroversial claim: if the game is tied at the time of interruption, then the two players should split the pot equally. If the score were nine to nine when the interruption happened, then each player would take $50 back. Now we work backward from there. If the score were nine to eight in favor of the first player, Pascal’s approach would ask what would happen after one more flip. There would be a 50 percent chance that the player in the lead would win that coin flip, reach 10 points and take the entire pot. On the other hand, there would be a 50 percent chance that the other player would win the flip and tie the game at nine to nine, which would mean they should split the pot. The first player’s winnings would average out to:

50 percent of $100 + 50 percent of $50 = $75

So if the game is interrupted at a nine-to-eight score, then the first player should take $75. We can apply this type of reasoning recursively to work out the appropriate split for any situation.

The key is to look at what your fair winnings would be if one more heads’ flip came up and what they would be if one more tails’ flip came up. You then find the average of those two possibilities. With a nine-to-seven score, the first player should take $87.50: one more heads would earn them $100, and one more tails would earn them $75 because that would be the nine-to-eight case we just analyzed. With a nine-to-six score, they’d take $93.75. An eight-to-seven score would bestow $68.75, the average of their fair take on a nine-to-seven score with their fair take on an eight-to-eight score. And finally, with an eight-to-six score, the first player should take: 50 percent of $93.75 + 50 percent of $68.75 = $81.25

This is exactly the same solution as Fermat’s method. Both Fermat and Pascal had the same insight: a fair split depends on the possible futures, and you should weigh each possible future by its likelihood of occurring. Today we recognize these equations as expected values, or weighted averages of all possible future outcomes. Fermat listed these future outcomes exhaustively, considering each possible way the next five coin flips could land. Pascal devised a clever way to work backward: you calculate the fair split when you have five coin flips to go based on the fair splits with four coin flips to go, which you in turn calculate based on three flips to go, and so on.

The concept of expected value didn’t stay confined to 17th-century parlor games. It is the mathematical engine that drives almost all modern risk assessment. When an actuary prices a life insurance premium, a Wall Street analyst evaluates a stock portfolio or a gambler weighs the risks of a wager, they are performing the exact same calculation. They multiply the financial effect of every possible scenario by its probability and then find the sum of those outcomes to quantify the worth of a decision. Uncertainty is inescapable, and we owe much of our current technological stature to our ability to confront it with rigor. For millennia, mathematicians treated problems of chance with unsystematic guesswork. Pascal and Fermat’s correspondence replaced that guesswork with a framework. While we still can’t predict the future, we at least know how to price it.