Video yükleniyor...

Video Yüklenemedi

Ana Sayfaya Dön

LLMs vs. Jev, clearly explained! LLMs are great, and the ceiling is one you can watch scroll past: an LLM writes the answer one token at a time. give it a failed deploy and four decisions, and it produces a small JSON object where every token depends on the...

42,632 görüntüleme • 2 gün önce •via X (Twitter)

11 Yorum

Ivan Khokhlov profil fotoğrafı
Ivan Khokhlov2 gün önce

This infographic explains it so well. Thank you! Are you using it in production yet?

hitu profil fotoğrafı
hitu2 gün önce

the four questions stuck in a queue because of how llms write token by token, never thought about it that way

AI Mastery Guide profil fotoğrafı
AI Mastery Guide2 gün önce

Four answers at once is smart

Charlie Hills profil fotoğrafı
Charlie Hills2 gün önce

the schema-valid mistake warning is HUGE

Modelplane profil fotoğrafı
Modelplane2 gün önce

The token-by-token framing is the part people skip. It means the model can't backtrack mid-answer, so a wrong decision at step two quietly constrains everything after it. Chunking the deploy failure into separate calls with a check between them usually beats one big prompt.

Dominik profil fotoğrafı
Dominik2 gün önce

the expensive model is often just one seat in the loop. trace the decisions, preserve the evidence, and the system can earn trust without pretending the generator did everything.

slash1s profil fotoğrafı
slash1s2 gün önce

insane combo haha

Hrundel75 🐷 profil fotoğrafı
Hrundel75 🐷2 gün önce

hellyeah

Eric Kang profil fotoğrafı
Eric Kang2 gün önce

Typed output removes malformed shapes, not bad judgment, so thresholds and verification still belong in code. That's the honest boundary. JEV examples showing that split are collected here:

Leliu profil fotoğrafı
Leliu2 gün önce

Interesting explanation of LLM limitations and Jev's approach.

Globen profil fotoğrafı
Globen2 gün önce

good skill i use it

Benzer Videolar

Orchestrators vs. Graphs, clearly explained! orchestrators are great, and everyone builds one first. here is the ceiling: an orchestrator sits above the work and routes every message. five agents report to it. it reads all five. it decides what each one does next, and reads all five replies. that is ten trips through one context, and by the fifth agent that context has read four reports, five instructions and its own reasoning about all of them. Graph engineering fixes this by removing the seat: not a better router, but no router at all. you need both, and here is the sentence that resolves the whole confusion: an orchestrator sits above the work and holds all of it. a graph is the shape of the work, and holds none of it. ↳ above the work: one context that has to see everything before anything ships ↳ inside the work: a splitter that hands out and lets go, and a merge that reads nothing Prompts → Context → Harness → Loops → Graphs the coordination did not disappear. it moved into the edges, where it costs nothing and cannot get tired. the trick is noticing what you actually built. if one node has to see every result before the run can finish, you did not remove the bottleneck. you hired it, gave it the longest context in the system, and made it the thing you were counting on to stay sharp. one thing to know before you scale it. an orchestrator degrades in the one way nothing catches. ↳ it does not crash, time out or return an error. it stays up and keeps routing ↳ it just starts routing worse, somewhere around the fifth report, and every downstream agent does exactly what it was told that last one catches careful people. you can have perfect isolation on every worker and still have one window quietly drifting at the top, and the traces will all look clean because each worker did its job. and the one that eats whole nights: the merge is where this shows up first. ranking five findings is not judgment, it is a sort. if a model is doing it, you are paying a model to read five reports so it can put them in an order that three lines of code would have got right, and now that model has read everything too. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

43,781 görüntüleme • 8 gün önce

Harness vs. Graphs, clearly explained! a harness is great, and most people think it is the whole thing: retries, timeouts, a sandbox, a log, the context it assembles before every call. all of that is real work, and all of it wraps exactly one call. run it a hundred times and you have one call, made very safely, a hundred times. Graph engineering fixes this by moving the decision up a layer: not how safely one call is made, but which calls exist to be made at all. you need both, and here is the sentence that resolves the whole confusion: the harness is everything around one call. the graph is everything between them. ↳ around one call: retry, timeout, sandbox, log, assemble the context, hand back a result ↳ between calls: split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs the harness does not go away when you build a graph. it moves under each node, and now there are five of them, each wrapping a call you would never have made by hand. the trick is knowing which layer a failure belongs to. turn a piece off and run it again. if the call still works, it was the harness. if the wrong step runs at all, it was the graph. people spend weeks hardening a harness around a node that should not have existed. one thing to know before you scale it. most of what people call their agent is a harness with a chat box on it. ↳ it retries, it times out, it logs, it assembles context, it holds one call up beautifully ↳ it has never once decided that a second call should exist, and that is the entire difference that last one catches careful people. a harness that never fails is not evidence the system is right. it is evidence one call went well, which is the smallest possible claim. and the one that eats whole nights: a harness cannot save you from the wrong step running. you can retry a bad decision three times with a clean log and perfect isolation, and all you bought was three copies of it. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

50,770 görüntüleme • 11 gün önce

Loops vs. Graphs, clearly explained! loops are great, but they have a ceiling: a loop makes one unit of work better. it cannot decide which units exist. so you end up with a very good agent running the wrong three steps, in the wrong order, one at a time. Graph engineering fixes this by moving the decision up a layer: what runs, what runs at the same time, and what never runs at all. you need both. here's how it works: a graph splits your system into two kinds of decision. ↳ inside a unit: the loop. produce, check, correct, repeat until green ↳ between units: the graph. split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs you get parallel work, isolated contexts, and steps that stop running when nothing needs them. the trick is being selective about what becomes a node. only spend a model where judgment lives. merging, ranking, deduping and schema checks are edges, and edges are code. free, instant, and they cannot be argued out of a verdict. a graph where every edge is an agent pays rent on its own wiring. one thing to know before you scale it. a graph has two return paths, and almost everyone builds one. ↳ the correction edge is short. a gate rejects one unit back to the step that produced it, and it fixes the run you are in ↳ the learning edge is long. an accepted result goes back to the splitter as a constraint, and it fixes every run after skip the second and you get a graph that is fast and never gets smarter. next week it starts from the same place with the same blind spots. and a smaller one that eats whole nights: when a unit fails, return that unit, not the batch. send back four slices because one failed and you have just rewritten three correct ones. do it twice in a run and the run never converges. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

73,867 görüntüleme • 1 ay önce

Jev is cool. So is it's OSS companion, Laya. The Latest Cool Thing In AI™ tends to get a lot of hype, sometimes without everyone even understanding it. So... what is this thing? Jev is an AI model that consumes input and produces output VERY differently than chat, claude, grok. The input is two things: 1) Text state to assess. Email, html, code, whatever. 2) A set of questions which will be asked about the attached state. The canonical example from TypeSafe's docs is to identify the urgency of a support ticket. We pass the model the customer text + a single noul question "is this urgent?". Jev returns a full set of JSON. This JSON is not generated with token-by-token autoregression. Jev is not trained to produce sequences of text tokens, rather to answer questions, and guarantees well-formed responses. In the example below, we see it produces a 0.99 probability (on a 0-1.0 scale) that the answer is "yes." Jev supports exactly three types of questions (seconds example in video): a) Noul: 0–1 probability that the answer to a yes/no question is "yes." b) Choice: Ask question with pre-defined set of answers. Jev chooses the best and assigns probabilities to each. c) Score: Ask question with pre-defined scale of answers. Jev produces a position on the scale. Jev computes answers for all questions in parallel, making responses super fast even for many questions in a single request. This might seem like a narrow set of capabilities, but in the right contexts leads to incredible potential. It also makes for a useful API / primitive for programming, since the outputs are... *ahem*... type-safe and predictable in structure. Jev is not going to replace LLMs for writing your code, auto-generating your docs, or being at the core of an agent harness. But Jev IS incredibly cool, and will be used to build a lot of amazing tech. Hope this helps.

Ben Dicken

40,810 görüntüleme • 3 gün önce

Workflows vs. Graphs, clearly explained! workflows are great, and almost everyone has one. here is the ceiling: a workflow decides every step before it runs. you drew eight boxes in March. six months later the same three fire, every single time, and the other five have never once been reached. then a case arrives that nobody drew, and it goes to the closest wrong box. quietly, with a green status, because from the inside that looks exactly like success. Graph engineering fixes this by moving the decision: not what the steps do, but when the steps get chosen. you need both, and here is the sentence that resolves the whole confusion: a workflow decides the steps before it runs. a graph decides them while it runs. ↳ drawn in advance: the boxes, the branches, the order, the error path ↳ decided at runtime: how many units exist, what each one is allowed to see, which ones get created at all Prompts → Context → Harness → Loops → Graphs branches do not make it a graph. the branches were drawn in advance too, which means every one of them is a case you already thought of. the trick is knowing which part is allowed to be fixed. the node kinds are fixed. a splitter is a splitter, a gate is a gate, a merge is code. what is not fixed is how many of them exist this run, and that is decided after something has been read. one thing to know before you scale it. a workflow fails in a way that never pages anyone. ↳ the wrong branch ran, every check inside it passed, and the output is well formed ↳ nothing errored, because routing to the wrong box is not an error, it is a route that last one catches careful people. you cannot test your way out of it either, because the test suite was written from the same diagram that has the gap in it. and the one that eats whole nights: a workflow that has never surprised you is not stable, it is narrow. if it has run four hundred times and produced the same three shapes, it is not handling your work. it is handling the part of your work that fits it, and you have quietly stopped sending it the rest. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

16,810 görüntüleme • 9 gün önce

Loops vs. Graphs, clearly explained! loops are great, and they have a ceiling you can watch happen: a loop goes around. it produces, checks, corrects, and goes around again. after six passes you have one job, done very well. after six hundred passes you still have one job, done very well. Graph engineering fixes this by moving the decision up a layer: not how well one job gets done, but which jobs exist to be done at all. you need both, and here is the sentence that resolves the whole confusion: the loop lives inside a node. the graph lives between them. ↳ inside one unit: produce, check, correct, repeat until green ↳ between units: split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs the loop does not go away when you build a graph. it moves inside, and now there are three of them running at once on three things you would never have thought to run. the trick is being selective about what becomes a node. only spend a model where judgment lives. merging, ranking, deduping and schema checks are edges, and edges are code. free, instant, and they cannot be argued out of a verdict. one thing to know before you scale it. a loop that cannot fail is not a loop, it is a repeat with a bill attached. and the check people write is almost always the wrong kind. ↳ the test suite exits 0 is a check. the diff touches only the files in the plan is a check ↳ the output looks good, the model says it is confident, no errors were raised, none of those are checks that last one catches careful people. absence of an error is not evidence of correctness, and a loop built on it will confidently repeat a mistake until the budget runs out, with a clean log the whole way. and the one that eats whole nights: when a unit fails, return that unit, not the batch. send back four slices because one failed and you have just rewritten three correct ones. do it twice in a run and the run never converges. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

128,054 görüntüleme • 17 gün önce

Agents vs. Graphs, clearly explained! spawning more agents is great, but it has a ceiling nobody says out loud: five agents is a count. a graph is a shape. only one of them changes the answer. point five agents at the same pile with the same window and they converge. the first one writes a finding, the rest read it, and all five reports centre on the same thing. you paid five times for one opinion with four echoes. Graph engineering fixes this by moving the decision up a layer: not how many agents, but who is allowed to look at what. you need both. here's how it works: ↳ the count buys you throughput. five things happening instead of one ↳ the shape buys you coverage. five different things happening instead of the same one five times Prompts → Context → Harness → Agents → Graphs the node that does this is the splitter, and it decides more than any other node in the system. cut a repository by folder and four workers audit the same three files. cut it by blast radius and each one sees something the others cannot. the trick is being selective about what each lane is allowed to see. separate contexts are not a nice-to-have, they are the mechanism. if two agents are meant to produce different things, they must not share a window. if they are meant to produce the same thing, you did not need two agents. one thing to know before you scale it. a branch that throws does not reject the batch. it resolves to null, and that is the containment. which means your merge quietly receives a short list. ↳ filter the nulls before the merge, or one dead lane poisons the whole result ↳ never index a merge by position. eight good branches and one failure will shift everything by one, silently skip that and the run looks like it worked. the output is just missing a lane, and nothing errored. and the one that eats whole nights: multi-agent setups can use up to fifteen times the total tokens of a single chat, because every lane reloads its own core. you are trading total tokens for a clean main window. usually the right trade, always a choice. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

96,967 görüntüleme • 1 ay önce

Loops vs. Graphs, clearly explained! loops are great, and the ceiling is one you can watch turn: a loop is a gear. it produces, checks, corrects, and comes back around. after six turns you have one job, done very well. after six hundred turns you still have one job, done very well. the teeth are perfect. they are touching nothing. Graph engineering fixes this by moving the decision up a layer: not how well one gear turns, but what it is meshed into. you need both, and here is the sentence that resolves the whole confusion: the loop lives inside a node. the graph lives between them. ↳ inside one unit: produce, check, correct, repeat until green ↳ between units: split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs the loop does not go away when you build a graph. it moves inside, and now there are three of them turning at once on three things you would never have thought to run. the trick is being selective about what becomes a node. only spend a model where judgment lives. merging, ranking, deduping and schema checks are edges, and edges are code. free, instant, and they cannot be argued out of a verdict. one thing to know before you scale it. a loop that cannot fail is not a loop, it is a repeat with a bill attached. ↳ the test suite exits 0 is a check. the diff touches only the files in the plan is a check ↳ the output looks good, the model says it is confident, no errors were raised, none of those are checks that last one catches careful people. absence of an error is not evidence of correctness, and a loop built on it will confidently repeat a mistake until the budget runs out, with a clean log the whole way. and the one that eats whole nights: when a unit fails, return that unit, not the batch. send back four slices because one failed and you have just rewritten three correct ones. do it twice in a run and the run never converges. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

31,867 görüntüleme • 6 gün önce

BlackRock runs on 20,000 people. Elon's Grok Bot runs the same shape for $300 a month, and it hires its own staff. You do not get an assistant. You get a company that hires. It does not throw ten agents at your problem and hand you the pile. It makes one agent that makes 10, and those ten make a 100. > LAYER ONE is one agent, the chief of staff, and it never touches the market > LAYER TWO is six desk heads, one job each, every one on its own computer with its own logins > LAYER THREE is whatever those six decide they need, spun up on the spot and shut down when the work is done Nobody writes a task list. You hand out job titles and the org fills itself in underneath. The swarm is never the same twice. Agents get spun up for one job, finish it, and are gone before I ever read their names. Not one of them sees the whole picture. The answer only exists after they hand off to each other. Wall Street cannot copy that. You cannot hire a hundred people for eleven minutes. BlackRock holds that shape together with a risk system called Aladdin. Mine holds it together with one agent that is only allowed to say no. I gave it $1,000 and told it to grow the money or get deleted. 15 hours later it was holding $3,900, on an address anyone can open and read. I was asleep for most of it, and I have still not written a line of code. The whole thing runs with my laptop shut, because none of it lives on my laptop. Setup is one evening. Create the chief, hand out the titles, run one trade on your screen while they watch, connect Telegram. Ten years ago a machine this shape had its name on a tower. Mine has a name I typed into a box. Save this while the whole thing still fits on one screen.

cvxv666

45,488 görüntüleme • 22 gün önce

You have 100 dollars and you want 200. Betting red one dollar at a time, your chance is one in 33,171. Betting the whole 100 on a single spin, it is 47.4 percent. The careful version is fifteen thousand times worse. This is also the arithmetic of your trading account, and it means almost everything you have been taught about managing risk is, in the strict mathematical sense, a method for losing more reliably. An MIT professor works this out on a blackboard in a lecture on random walks. The result is called gambler's ruin. Two and a half points of disadvantage is nothing on one spin. But a dollar at a time you are not making one spin, you are making hundreds, and the edge gets a fresh attempt at you on every one of them. It was never the size of the disadvantage. It is the number of times you agree to face it. One hundred on red, once: 47.4 percent. Twenty dollar bets: 37.3 percent. Five dollar bets: 11.1 percent. One dollar bets: 0.003 percent. Mathematicians call the right answer bold play. It was proved optimal for unfavourable games in 1965. It is not a strategy for winning. It is the least ruinous way to play a game you should not be in. If your edge after spread and fees is negative, and for most active retail accounts it is, then your position sizing rule is not protecting you. Risking one percent per trade is the one dollar bet. It arrives at zero with near certainty, just politely, over a longer period, with a spreadsheet. Discipline does not beat a negative edge. It schedules it. All of this reverses if you have a real edge. Then small and frequent is correct and bold play is madness. So the only question that has ever mattered is whether you have one, and the number of people certain they do has never resembled the number who do. Your broker does not need you to be wrong. It needs you to be frequent.

Verax

85,235 görüntüleme • 20 gün önce

Memory vs. Graphs, clearly explained! memory is great, and the ceiling arrives quietly: it stores what happened. it does not store what to do about it. six runs later your file has fifty lines, and the model reloads all of them before it does anything. Graph engineering fixes this by changing what memory is: not a place things are kept, but an edge that runs backwards. you need both, and here is the sentence that resolves the whole confusion: a store keeps what happened. an edge keeps what to do about it. ↳ a store grows with every run, and every line is reloaded before the next one ↳ an edge carries one derived rule, and the rule replaces the run that produced it Prompts → Context → Harness → Loops → Graphs the transcript goes away, the constraint stays. and the constraint is smaller, because "adapters preserve keyword args exactly" is four hundred tokens shorter than the run that proved it. the same four blocks work on anything you can cut into lanes. i pointed them at token launches on Robinhood Chain, open source, nothing leaves your terminal the trick is knowing what deserves to survive. an output is not memory. "ported the utils slice, green on first pass" tells the next run nothing it can act on. the rule you derived from it does. one thing to know before you scale it. what you write down is not what comes back. ↳ the root rules file and auto memory are re-injected from disk. they come back intact, every time ↳ path-scoped rules live in message history. they get summarized away and do not return until a matching file is read again so a rule that must persist cannot be path-scoped. move it to the root and pay the always-loaded cost, or accept that it is advisory in any long session. and the one that eats whole nights: a memory file that has never had a line deleted is not memory. it is a tax on every run you will ever make, and nobody reads it back. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this, and the repo that runs it is below ↓

Hanako

47,766 görüntüleme • 16 gün önce

your agent has thirty tools. it calls two of them. the other twenty eight are not sitting idle somewhere. they are in the request, every request, and they are doing damage in two places at once. first the obvious one. tool schemas go into the prompt, and a schema is not a name. it is a description, a parameter list, types, required fields, an example. thirty of those is a few thousand tokens that ship with every single call, including the ones where the agent just says thanks and stops. you are paying rent on twenty eight tools that have never fired. second, and this is the one that costs more. when the request says cancel the order, the model picks by matching against everything available. four of your tools are plausible: cancel_order, refund_order, update_order, void_order. it is choosing among them based on the descriptions you wrote, one afternoon, months ago. every tool you add is another candidate in that shortlist. the twenty eight you never call are not neutral. they are noise in the one decision that determines whether the run works. > why it grows without anyone deciding to nobody adds thirty tools on purpose. you add one for a task, it works, it stays. six months later the registry is a catalogue and no one has ever removed anything, because removing a tool feels risky and adding one feels free. and there is no feedback telling you otherwise. the unused ones never error. they never appear in a failing trace. they are invisible in exactly the way that lets them accumulate. > what to actually do count calls per tool over the last thousand runs. this is one group-by and it usually shocks people. the ones at zero are pure cost. ship the tools the task needs, not the whole registry. a research phase does not need deploy. a writing phase does not need the database. swap the set between phases instead of loading everything up front. same agent, different tools, depending on where the run is. and when two tools could both plausibly answer the same request, that is not redundancy you can ignore. it is a coin flip you built into the system. the twenty eight tools are not unused. they are used every time, by the part of the run you cannot see.

Hanako

24,656 görüntüleme • 1 ay önce

Context vs. Graphs, clearly explained! context engineering is great, but it has a ceiling: you can make one window perfect. there is still only one of it. every technique on that layer is rationing the same scarce thing. compact, retrieve less, delete, defer. all of it is deciding what to drop. Graph engineering fixes this by moving the decision up a layer: not what goes in the window, but how many windows there are and what each one is for. you need both. here's how it works: ↳ inside a window: context engineering. what loads, in what order, what gets compacted ↳ between windows: the graph. how many lanes, what each one is allowed to see, what comes back Prompts → Context → Harness → Loops → Graphs each lane gets a clean window, nothing in one competes with anything in another, and your main thread stops filling up. the trick is being selective about what comes back. a subagent reads six thousand tokens of files and hands you a four hundred token summary. that ratio is the whole point. send back the raw material instead and you have moved the problem, not solved it. one thing to know before you scale it. not everything survives compaction equally, and almost nobody knows the table. ↳ the project-root rules file and auto memory are re-injected from disk. they come back intact ↳ path-scoped rules and nested rules files live in message history. they get summarized away and do not return until a matching file is read again so a rule that genuinely must persist cannot be path-scoped. move it to the root and pay the always-loaded cost, or accept that it is advisory in any long session. and the one that eats whole nights: shared context makes parallel agents converge. four auditors on one window produce one opinion with three echoes. you paid four times for it. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

36,970 görüntüleme • 1 ay önce

A woman who spent nine years gluing paper models in a print shop just told a room of physicists their whole field stands on a mistake, one line, no hedging: "Every theory we have takes space and time for granted, like a bagel that forgot it was once a flat sheet of paper." That's Bianca Dittrich. She has a free lecture course that asks one question: what is left of geometry once you quantize it? The answer is: far less than you can picture. Quantum gravity looks like one more field theory. Buried inside is something stranger. Every quantum theory we have puts fields on a fixed stage, flat or curved, and does the physics on top of it. Here the stage itself is the thing being quantized. Your gut reads an atom of spacetime as a tiny grain sitting somewhere. Wrong. It cannot sit anywhere, because it is the somewhere. The move is invisible to human intuition, which is exactly why the people who get anywhere stop asking where the pieces are and start asking what a measurement even means. In 3D the whole thing collapses in a way that should scare you. No matter, no cosmological constant, and gravity is locally flat everywhere. Six degrees of freedom per point, all of them eaten by diffeomorphism symmetry. A field theory that ends up with finitely many real degrees of freedom, sometimes zero. None of it is hidden. Cut a parallelogram out of paper, glue the edges, and you have a torus. Flat everywhere, and yet two numbers survive that no local measurement can see. The lecture is free. Here is the trap: you feel every equation you can solve, every geometry you can draw, as progress. What you cannot feel is the gap you have to cross. Ten to the forty-one, from the Planck scale back up to the world you live in. And crossing it is the only thing that pays. Almost every approach still cannot show it recovers ordinary physics at the far end, and almost everyone quits long before then. The math is free to learn. The nerve to stop trusting your picture of space, that part you still have to bring yourself.

Zyron

110,850 görüntüleme • 2 ay önce

David Jerison, the mathematician who spent decades teaching the exact method for finding the optimal choice when the odds are stacked against you: "I used to think the best decision was whichever option looked strongest at first glance. Then I proved that the real answer almost always hides at a point nobody would guess just by looking, and checking only the obvious choices gets you the worst possible outcome, not the best." this is the exact method quant desks lean on to find the one allocation that survives every constraint thrown at it, and it's been sitting free in a public MIT lecture for almost twenty years. strip away the notation and the mechanism is simple. every optimization problem has a handful of candidate points where the best or worst answer could be hiding, and the obvious middle-of-the-road guess is almost never one of them. check only the points that feel natural, and you don't just miss the best answer. you can land on the exact opposite, the worst possible one, without ever realizing it. nobody presenting a "risk-optimized" portfolio out loud admits how easy it is to stop checking one step too early. zoom out to how this plays out sizing a position or allocating risk under real constraints today. the instinct is to test the option that feels balanced and call it done, when the actual edge is almost always sitting at an extreme nobody thought to check. the industry sells a clean, confident number as proof an allocation is optimal. but that number means nothing until every boundary has been checked, because the same method that finds the best case can just as easily hand you the worst one in disguise. the right answer was never the one that looked most reasonable. it was the one nobody bothered to check.

MindArch

16,232 görüntüleme • 1 ay önce

Jeff Bezos looked at a government waiting room and priced it at a hundred billion dollars. Bezos: “This is a $100 billion business, by the way. This is huge business.” That number is not ambition. It is a measurement. A company that size does not create a hundred billion dollars of new value here. It recovers a hundred billion that is already being destroyed, on schedule, in public, by a process everyone has agreed to call normal. The size of the opportunity is the size of the wound. Bezos: “They almost always say yes, they just make you wait a long time.” So the verdict was never in question. Only the delivery date. Which means the months bought nothing. They were storage. Your project sat in a room while the word yes waited its turn to be said. Nobody in there was deciding. Someone was scheduling. And the room bills by the day. Suarez: “The daily carrying cost, one day of interest, 200 to $400,000 per day.” Now find the recipient. There isn’t one. No school funded, no inspector paid, no safety review performed. A tax at least moves money into someone’s hands. This deletes it at four hundred thousand a day, and every dollar was real before the queue touched it. Bezos: “And that doesn’t count the frustration.” Count it anyway. It lands on a body long before it lands on a spreadsheet. Suarez: “Which is infinite. I have some white hairs as a result of this stuff.” That is the invoice. The money has a rate. The rest gets charged to the man, and he pays it whether the answer comes back yes or no. No one has ever been refunded a year. Every other cost in this economy can be hedged, insured, refinanced, or written off. Waiting is the only one that is final. A man will forgive being told no. He will never get back the time he spent standing there waiting to be told yes. We built a civilization that can move a decision at the speed of light and still schedule it at the speed of a man’s hair turning white. Bezos: “It should give you a yes or a no in 10 seconds. And if the answer is no, it should tell you the 6 things you have to change to get a yes.” For four thousand years the wait was honest. Someone had to hold the entire code in one head and walk it line by line against your drawings. Reading was slow because reading was human. That stopped being true in less time than it takes to approve one building. Bezos: “Maybe with AI it can just read all the plans. And it knows all the codes. Spit it out.” The constraint is gone. The wait stayed. Anything still moving at the old speed after the cost of thinking collapsed is not slow. It is choosing. The queue never protected you from a bad building. It protected a signature from a bad outcome. Nobody gets fired for the wait. They get fired for the answer. An institution has no lifespan, so time costs it nothing. You have one, so time is the only thing it can take. Every queue is a trade between something that dies and something that doesn’t, and only one side is ever charged. That trade held for the whole of recorded history because the mortal side had no leverage. It does now. Somebody is going to build this. A hundred billion does not sit in a waiting room forever. And the day it exists, the wait stops being a fact of the world and becomes a decision with a name attached. The hundred billion was never the prize. It is the receipt for how long we agreed to stand there. We are the first people alive who get to stop signing it.

Dustin

17,133 görüntüleme • 1 ay önce