Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

Anthropic's graphics team automated Blender so one request builds a structure, and most of the run finishes before a vertex exists. The geometry was never the hard half. Deciding what counts as one object is where the time actually goes. > PLAN - what the structure depends on, ordered...

17,714 Aufrufe • vor 3 Tagen •via X (Twitter)

19 Kommentare

Profilbild von monokern
monokernvor 3 Tagen

thats insane

Profilbild von Insomnia
Insomniavor 3 Tagen

new model fable can make it

Profilbild von Kitsui
Kitsuivor 3 Tagen

oh,motion is well done

Profilbild von tsukiema
tsukiemavor 3 Tagen

this is a serious procedural workflow

Profilbild von familiar_ggs
familiar_ggsvor 3 Tagen

Trying to do this exact thing in unreal engine so characters can walk through them. I had my forge bot read this and it took some ideas from it. I’ll let you know how it goes

Profilbild von Ridark
Ridarkvor 3 Tagen

Really appreciate seeing terminals built with care

Profilbild von Nekt0
Nekt0vor 3 Tagen

claude is growing in buildung 3d objects and arhitecture

Profilbild von Gipp 🦅
Gipp 🦅vor 3 Tagen

split by what needs to move, not visual appearance

Profilbild von Neurivex
Neurivexvor 3 Tagen

Agreed, defining the object boundary is the real work here

Profilbild von shmidt
shmidtvor 3 Tagen

amazing view

Profilbild von Dekos
Dekosvor 3 Tagen

These guys at Anthropic never cease to amaze me

Profilbild von 🐐
🐐vor 3 Tagen

LOL which members of the "graphics team" ?

Profilbild von Lummox
Lummoxvor 3 Tagen

really good staff

Profilbild von Fokki
Fokkivor 3 Tagen

better than google maps

Profilbild von Codio
Codiovor 3 Tagen

entire structure was built right before our eyes

Profilbild von kiosa
kiosavor 3 Tagen

Insane

Profilbild von J.S. Earls
J.S. Earlsvor 3 Tagen

👏 Excellent 👍

Profilbild von bobaaa
bobaaavor 3 Tagen

will you teach me how to build houses like these?

Profilbild von rompasso
rompassovor 3 Tagen

the request holding at the scale of a building instead of a single props is such an impressive demonstration of capability

Ähnliche Videos

THIS IS F*CKING OBSCENE opus 5.5 got Fortnite running inside Minecraft and Minecraft running inside GTA 5, with nobody's permission and nobody's documentation three engines, three completely different ways in, and one of them has no way in at all THREE GAMES, THREE DIFFERENT WAYS IN → Minecraft is Java and ships a loader on purpose. that one is the front door. you write against an interface somebody meant for you to use → GTA 5 has no modding api and no front door. you get a compiled binary and nothing else, and the only route in is to read it → Fortnite is a live service with anti cheat sitting on top. there is no way in at all, and that single fact changes the entire job WHAT READING A BINARY ACTUALLY MEANS → no source, no comments, no function names. you recover what code does from what it is, which is the opposite direction from how it was written → the exact build gets pinned before anything else, because one patch moves every address underneath you, and a different version is a different game → nothing counts until it is confirmed inside the running process. launch it, play it, look at it. opus 5.5 does the reading, the pinning and the checking, and that loop is the part that used to be a team and a year WHAT THIS ACTUALLY CHANGES → reverse engineering was the most expensive skill in modding. one person, one binary, months of evenings, and the knowledge died with the project → now it is a loop that runs while you sleep, and what comes out of it is not a guess, it is something that got checked against the game while the game was running → so the hard question stopped being whether you can get into an engine. it is what you do once you are standing in three of them at once one layer was read out of a binary one came through the front door one was never touched at all, and it still had to land right

Roxx

195,977 Aufrufe • vor 25 Tagen

context engineering vs graph engineering. every few months the list gets a new word and everyone treats it as a replacement for the last one. these two are not on the same list. one decides what the model sees this turn, the other decides what exists at all. the cleanest way to tell them apart is to ask what a single unit of work looks like. > context engineering is the window the window opens empty, every single time. you assemble what goes in it. the prompt, the docs, the history, the tool results. the assembling is the work. the window only grows. it never shrinks on its own, so eventually something gets dropped. usually from the middle. usually without telling you. then the turn ends and the window is thrown away. not archived, thrown away. the next turn opens empty again and you re-explain what you already explained. good context engineering is knowing what to leave out, not what to pack in. the unit of work is one window. > graph engineering is the structure the same material arrives from the same sources. instead of packing it into a window, you pull entities out of it, resolve the duplicates into one node, and write typed edges between them. nothing here is stored as text you hope to find again. it is stored as a thing with a name and its connections to other things. when the turn ends, the graph is still there. the next turn does not start from zero. it starts by querying what already exists, and the query walks edges instead of guessing at similarity. good graph engineering is deciding what counts as the same thing twice. the unit of work is one relationship. > they are not alternatives the graph is what refills the window. context engineering decides what fits. graph engineering decides what there is to choose from. remove the graph and every session starts blind. remove the context work and the best structure in the world arrives as an unreadable dump. that also tells you which one broke. the answer drifted from what you actually said, or forgot something from this same session. that is the window. the answer is coherent but invents a connection that does not exist, or cannot join two facts it has clearly seen. that is the structure. people debug the prompt because the prompt is the easiest thing to edit. it keeps taking the blame for failures that live a layer down. save this - then read the full breakdown below

Hanako

19,160 Aufrufe • vor 3 Monaten

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 Aufrufe • vor 2 Monaten

Anthropic's modelling stack writes ribosome scripts that run the translation instead of animating it Most ribosome visuals are choreographed, which means the animation can only ever show what someone already believed. Here the ribosome is a script with rules, and what you watch is whatever those rules produce when you feed it a real sequence: > Encode: each step is written as a condition, not a keyframe > Feed: an actual mRNA sequence goes in, codon by codon > Run: the ribosome moves because the rules fire, not because a timeline says so • What emerges that nobody animated > It stalls on rare codons, exactly where the tRNA pool runs thin > A frameshift happens on its own when the sequence sets one up > Two ribosomes on one transcript collide, because nothing stopped them • Why a script beats an animation > Change the sequence and you get a different movie, not a re-render request > A behaviour that surprises you is a result, not an artistic choice > The same script runs 10,000 sequences overnight and reports the odd ones • Where it stays honest > Every rule traces to a measured rate, not a guess > A step with no rate in the literature refuses to run silently > The output logs which rules fired, so a weird result is debuggable One sequence translates in real-time-equivalent in about 40 seconds. And the part that broke my brain: Every animation I'd seen showed translation running at one smooth constant speed. Fed a real gene, the script stalled three times and one of the stalls is documented. Same process. One version could only show what its animator knew. The hard part was never drawing the ribosome. It was letting it do something nobody scripted ↓

Codio

25,889 Aufrufe • vor 19 Tagen

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

44,226 Aufrufe • vor 1 Monat