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

推荐订阅源

The GitHub Blog
The GitHub Blog
The Hacker News
The Hacker News
O
OpenAI News
TaoSecurity Blog
TaoSecurity Blog
Google DeepMind News
Google DeepMind News
Forbes - Security
Forbes - Security
Spread Privacy
Spread Privacy
SecWiki News
SecWiki News
V
Vulnerabilities – Threatpost
Latest news
Latest news
Y
Y Combinator Blog
Exploit-DB.com RSS Feed
Exploit-DB.com RSS Feed
S
Schneier on Security
Cloudbric
Cloudbric
Webroot Blog
Webroot Blog
G
Google Developers Blog
M
MIT News - Artificial intelligence
Cisco Talos Blog
Cisco Talos Blog
Blog — PlanetScale
Blog — PlanetScale
Attack and Defense Labs
Attack and Defense Labs
aimingoo的专栏
aimingoo的专栏
The Register - Security
The Register - Security
Martin Fowler
Martin Fowler
MongoDB | Blog
MongoDB | Blog
Simon Willison's Weblog
Simon Willison's Weblog
N
News and Events Feed by Topic
L
LINUX DO - 热门话题
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Jina AI
Jina AI
美团技术团队
C
Cyber Attacks, Cyber Crime and Cyber Security
H
Hackread – Cybersecurity News, Data Breaches, AI and More
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
Hacker News: Ask HN
Hacker News: Ask HN
有赞技术团队
有赞技术团队
N
Netflix TechBlog - Medium
H
Heimdal Security Blog
L
Lohrmann on Cybersecurity
The Last Watchdog
The Last Watchdog
MyScale Blog
MyScale Blog
C
CERT Recently Published Vulnerability Notes
Hugging Face - Blog
Hugging Face - Blog
Recent Commits to openclaw:main
Recent Commits to openclaw:main
T
The Exploit Database - CXSecurity.com
A
About on SuperTechFans
博客园 - 叶小钗
博客园_首页
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
F
Fortinet All Blogs
博客园 - 聂微东

DEV Community

Authentication Security Deep Dive: From Brute Force to Salted Hashing (With Java Examples) Why AI Systems Don’t Fail — They Drift Spilling beans for how i learn for exam😁"Reinforcement Learning Cheat Sheet" I Replaced Chrome with Safari for AI Browser Automation. Here's What Broke (and What Finally Worked) How Python Borrows Other People's Work The $40 Architecture: Processing 1 Billion API Requests with 99.99% Uptime Vibe Coding: A Workflow Guide (From Zero to SaaS) Most webhook security guides protect the wrong side. The scary part is delivery. Headless CMS for TanStack Start: Build a Blog with Cosmic EU Age Verification App "Hacked in 2 Minutes" — What Actually Happened Comfy Cloud’s delete function does not actually remove files Running AI Models on GPU Cloud Servers: A Beginner Guide Event-driven media intelligence with AWS Step Functions and Bedrock I scored 500 AI prompts across 8 quality dimensions — here's what broke How to Call Google Gemini API from Next.js (Free Tier, No Backend Needed) The Portal Protocol: Reclaiming Human Connection in the Age of AI How to Fix Your Team's Scattered Knowledge Problem With a Self-Hosted Forum Intro to tc Cloud Functors: A Graph-First Mental Model for the Modern Cloud Designing Multi-Tenant Backends With Both Ownership and Team Access I Built a Neumorphic CSS Library with 77+ Components — Here's What I Learned PostgreSQL Performance Optimization: Why Connection Pooling Is Critical at Scale Cómo construí un SaaS multi-rubro para gestionar expensas en Argentina con FastAPI + Vue 3 🚀 I Built an Ethical Hacking Scanner Tool – Open Source Project I Replaced /usage and /context in Claude Code With a Single Statusline A Pythonic Way to Handle Emails (IMAP/SMTP) with Auto-Discovery and AI-Ready Design I Collected 8.9 Million Polymarket Price Points — Here's What I Found About How Markets Really Move EcoTrack AI — Carbon Footprint Tracker & Dashboard Everyone's Using AI. No One Agrees How. 5 self-hosted ebook managers worth trying in 2026 Building Your First AI Agent with LangChain: From Chatbot to Autonomous Assistant Common SOC 2 Failures (Real World) Stop Vibe-Checking Your AI App: A Practical Guide to Evals How to Use SonarQube and SonarScanner Locally to Level Up Your Code Quality Your Next To-Do App Is Dead — I Replaced Mine with an OpenClaw AI Sign a Nostr event in 60 lines of Python using coincurve — no nostr-sdk, no nbxplorer, no rust toolchain ITGC Audit Explained Like You’re in Big 4 Patch Tuesday abril 2026: Microsoft parcha 163 vulnerabilidades y un zero-day en SharePoint Stop scraping everything: a better way to track competitor price changes Listing on MCPize + the Official MCP Registry while routing payments OUTSIDE the marketplace — how I kept 100% of my x402 revenue Building an AI-Powered Risk Intelligence System Using Serverless Architecture Why We Ripped Function Overloading Out of Our AI Toolchain Testing AI-Generated Code: How to Actually Know If It Works SaaS Churn Is Killing Your Business. Here Is What to Do About It (Without a Support Team) The Speed of AI Is No Longer Linear - And Self-Improving Models Are Why How to Implement RBAC for MCP Tools: A Practical Guide for Engineering Teams From Standard Quote to Persuasive Proposal: AI Automation for Arborists I built a CLI that scaffolds complete multi-tenant SaaS apps Axios CVE-2025–62718: The Silent SSRF Bug That Could Be Hiding in Your Node.js App Right Now The dashboard that ended our friendship Data Pipelines Explained Simply (and How to Build Them with Python) The Hidden Cost of AI Systems Nobody Talks About. undefined vs undeclared, and how typeof behaves Switching from file-based jobs to NATS/Kafka in Rust without changing code io_uring Adventures: Rust Servers That Love Syscalls Why Agentic AI is Killing the Traditional Database The POUR principles of web accessibility for developers and designers Quantum Neural Network 3D — A Deep Dive into Interactive WebGL Visualization How To Install Caveman In Codex On macOS And Windows Automation Pipeline Reliability: Why Your Workflow Breaks When Nobody Is Watching I Built an 'Open World' AI Coding Agent — It Works From ANY Folder From Freelancing to Product: A Tech Service Company's SaaS Transformation China's AI Giants: Adding Tencent Hunyuan & ByteDance Doubao to AI University (74 Providers) On the Vibe Coders and Their Lies clerk: Auto-Summarize Your Claude Code Sessions AI Weekly — 2026/04/10–04/17 | The Model Lockdown Is Here, but the Toolchain Is the Real Battleground AI 週報 — 2026/04/10–2026/04/17 模型封鎖潮來了,但工具鏈才是真戰場 Maybe this is how Open-Source apps are born... 🚀 Fine-Tune LLMs with LoRA and QLoRA: 2026 Guide tRPC v11 + Next.js App Router: End-to-End Type Safety Without the Boilerplate ShadCN UI in 2026: Why I Stopped Installing Component Libraries and Started Owning My Components SaaS Billing in React Server Components: Stripe + Supabase Without a Single `useEffect` Join our DEV Weekend Challenge — $1,000 in Prizes Across TEN winners! Submissions Due April 20 at 6:59 AM UTC. Implementing FSRS Spaced Repetition in Flutter + Supabase — Adding Memory Science to an AI Learning App "I Texted My Localhost From the Train — Claude Code Fixed the Bug Before I Got Home" I Built a Sales Prep AI and It Went Deeper Than Expected Design to Code #2: One JSON, Eleven Outputs Solving the 100M-Row Problem: A Summary Table Pattern for High-Volume Push Notification Logs Flutter Web With Wasm: What Actually Changes For Developers I Built 50 Royalty-Free Soundtracks for My Side Project in a Weekend Using AI Music Generation The Vibe Coding Security Checklist: 7 Things to Check Before You Ship Stop Letting Googlebot Guess Fix Your React App's SEO Right Desconstruindo o Streaming do LinkedIn: Como Criar um Engine de Extração de Vídeo de Alta Performance com HLS e FFmpeg (EDA Part-1) EDA (Exploratory Data Analysis) Explained With Real Life — Why Looking at Your Data Is the Most Important Step in Machine Learning Brand Relationship Management at Scale: Our 4-Touch Outreach System for 200+ Brands Why String.fromEnvironment() Might Return an Empty String in Dart JGuardrails 1.0.0 — Hardening Java LLM Apps Against Jailbreaks, Toxicity, and Prompt Injection Plan and Schedule a Full Week of Threads Content From One Claude Conversation Coding Cat Oran Ep3, Five Tables Changed Everything Updated: BFF Pattern I'm done watching freelancers get buried by 200 proposals. So I'm building the alternative. This is my first post BFS Algorithm in Java Step by Step Tutorial with Examples Tracking LLM Pricing Monthly: An Open Dataset for 22 AI Models How We Measure Content ROI on a Comparison Site: Revenue Attribution Without Perfect Data Introducing Nova AI Ops: The AI-Native Operating System for SRE Teams I built a free desktop video downloader for Windows — Grabbit How Talkie OCR Helps Vision-Impaired & Dyslexic Users Read the World Around Them VRCFaceTracking安装和iPhone面捕配置教程,有bug Even CrowdStrike Can't See Your Agents The Automation Gold Rush: What n8n Workflows and Claude Are Opening Up for Developers Right Now
How hard is your idea? Strength is what survives an honest attempt to break it
Pavel Ishchin · 2026-06-24 · via DEV Community

TL;DR. A hypothesis is strong only to the degree it has survived deliberate, competent attempts to break it. Call that its hardness. Confirmation cannot establish a claim, since one counterexample can refute it while no amount of agreement ever finishes proving it, so strength has to be read off the breaking side. This restates Popper's corroboration (a claim earns standing by surviving refutation and is never verified) and Mayo's severity (a test counts only if it would very probably have caught the error, had one been present).

Here is a trap that gets easier to fall into every year. You have a claim. You check it against a few sources, or you ask a couple of capable assistants, and they agree. It reads cleanly. It sounds settled. And none of that means the claim is any good, because agreement is cheap and you never put the claim at risk.

The deeper you work by synthesis, pulling many sources and instruments together, often with AI in the loop, the sharper this trap gets. A good synthesis is coherent by design, and coherence feels like strength. So you need a way to tell a claim that has earned its standing from one that merely sounds finished. The way is to stop asking how settled a claim looks and start asking how hard it is to break.

Why confirmation is not proof: strength lives on the breaking side

Testing is lopsided. One solid counterexample can sink a general claim, while no amount of agreement ever finishes proving it. That sounds like bad news, and it is actually the whole method: since you can never finish confirming, you measure strength by how hard you have tried to break the thing and failed.

Philosophy of science has two precise versions of this. Karl Popper called it corroboration: a claim earns standing by surviving serious attempts to refute it, and it never graduates to "proven," it only ever reaches "has held so far under hard testing." Deborah Mayo sharpened the bar with severity: a claim is well tested only to the degree it passed a check that very probably would have caught the error, if there were one. Passing a weak check, one that would have waved the error through, tells you almost nothing.

Put those together and you get a single, usable word. Call a claim hard to the degree it has resisted competent attempts to break it. A claim that was restated, agreed with, or fitted to numbers you already had is not hard at all, no matter how confident it sounds. Hardness is bought only by passing tests the claim could have failed.

Skeptic vs hater: which criticism makes your idea stronger?

Once you measure strength this way, two kinds of attack on a claim stop looking alike, and the difference has nothing to do with how polite either one is.

The skeptic cuts toward a test. They tell you the condition under which your claim would fail, and that condition can be checked. Run it. If the claim falls, good, it deserved to. If it survives, it is now harder than it was an hour ago, because a real chance to break it has been spent and it held. A skeptic leaves you better off either way.

The hater cuts toward the conclusion. They want the thing to collapse, and they hand you no test it could have passed or failed. Survive a hater and you have gained nothing, because there was no test to survive. So the question to put to any objection is plain: what test does this propose, and could my claim have failed it? If there is no answer, you are looking at rhetoric in skeptic's clothing, and you can set it aside without guilt.

This also tells you how to be useful to other people's ideas. Offering a way the claim could fail, with a way to check it, is a gift. Swinging at the conclusion is noise. The first builds, the second only knocks down.

"I don't see a way through from here," not "this is a wall"

There is one more habit that hardness discipline forces, and it is about language. When you get stuck, it is tempting to write the stall down as a fact about the world: this is impossible, this is a wall. But "impossible" is one of the strongest claims you can make, and being tired is not evidence for it.

The honest version is positional: "I do not see a way through from here." That keeps the limit where it actually sits, in your current vantage, which can move with a new method, a fresh instrument, or a better question. A wall declared from exhaustion is just an untested guess wearing the costume of a result. This matters most in exactly the setting that tempts the trap at the top: when you can always ask one more assistant and get one more confident answer, the difference between a charted limit and a tired one is the only thing keeping you honest.

What this looks like in practice

A severe test is one your idea could have flunked. When general relativity predicted that starlight passing the Sun would bend by about double what older physics allowed, the 1919 eclipse could have come back with the smaller, older number, and the theory would have been in real trouble. It came back the other way. The test counted because failure was on the table.

A non-test is one nothing could have flunked. Tuning knobs until your model matches data you already hold cannot fail by construction, so it buys no hardness. The version of this that bites synthetic work is agreement among assistants that were trained alike: that can be one test wearing several hats, and treating it as several independent confirmations is the mistake to watch for.

So the prediction, and the bet, is this: sort your claims by how many real attempts to break them they have survived, and separately by how many soft confirmations they have collected. The first sort will track which ones hold up later. The second will not. If soft confirmations predicted durability just as well, hardness would be an empty word, and you could go back to counting nods. I do not think you can.

Sources

  • Popper, K. (1959). The Logic of Scientific Discovery. Corroboration: a claim earns standing by surviving attempts at refutation, and is never verified.
  • Popper, K. (1963). Conjectures and Refutations. Routledge.
  • Mayo, D. G. (2018). Statistical Inference as Severe Testing. Cambridge University Press. Severity: a claim is warranted to the degree it passed a test that probably would have found an error, had one been there.