Загрузка видео...

Не удалось загрузить видео

На главную

The loop runs one step past the array and subtracts four from the saved return address. When foo() returns, the CPU lands back on the instruction that called it. Stanford CS107, lecture 13

tetsuoai's profile picture

tetsuo

237,286 subscribers

11,453 просмотров • 29 дней назад •via X (Twitter)

LIVE

Anya Rossi• Live Now

Private livecam show

Комментарии: 0

Нет доступных комментариев

Здесь появятся комментарии из оригинального поста

Похожие видео

In C, `array[i]` does not add i to the address. It adds i times the size of one element. Assembly has to do that multiply. C hides it. Stanford CS107, lecture 9.
0:44

In C, `array[i]` does not add i to the address. It adds i times the size of one element. Assembly has to do that multiply. C hides it. Stanford CS107, lecture 9.

tetsuo

69,969 просмотров • 1 месяц назад

How memory, pointers, and data structures work under the hood. Professor Jerry Cain, Programming Paradigms, Stanford (CS107) lecture on generic stacks in C.
52:21

How memory, pointers, and data structures work under the hood. Professor Jerry Cain, Programming Paradigms, Stanford (CS107) lecture on generic stacks in C.

tetsuo

140,369 просмотров • 3 месяцев назад

What actually happens when a program calls write(). A program can't put bytes on the screen by itself. Only the kernel can drive hardware, and the only way in is a system call. On x86-64, that is one instruction, syscall, this video follows a single write, from the program's registers into the kernel, down to the serial port, and back. The request goes into rax, rdi, rsi and rdx. The syscall instruction saves the return address in rcx and the flags in r11, loads the kernel's entry point from LSTAR, and drops the processor to ring 0. entry_SYSCALL_64 runs swapgs, switches to the kernel stack, and hands the saved registers to do_syscall_64. The write handler goes down through the tty layer to the UART driver, one out instruction per byte. sysret brings the program back with the byte count in rax. Tools Used gdb, strace, ltrace, trace-cmd function_graph, KernelShark, and the same kernel booted under QEMU so gdb can step the entry code. Chapters 0:00 the request, in registers 2:27 what syscall does in the instant it runs 7:00 from sys_write to the wire 10:21 libc's write is the same instruction 11:38 43 crossings, the vDSO
13:22

What actually happens when a program calls write(). A program can't put bytes on the screen by itself. Only the kernel can drive hardware, and the only way in is a system call. On x86-64, that is one instruction, syscall, this video follows a single write, from the program's registers into the kernel, down to the serial port, and back. The request goes into rax, rdi, rsi and rdx. The syscall instruction saves the return address in rcx and the flags in r11, loads the kernel's entry point from LSTAR, and drops the processor to ring 0. entry_SYSCALL_64 runs swapgs, switches to the kernel stack, and hands the saved registers to do_syscall_64. The write handler goes down through the tty layer to the UART driver, one out instruction per byte. sysret brings the program back with the byte count in rax. Tools Used gdb, strace, ltrace, trace-cmd function_graph, KernelShark, and the same kernel booted under QEMU so gdb can step the entry code. Chapters 0:00 the request, in registers 2:27 what syscall does in the instant it runs 7:00 from sys_write to the wire 10:21 libc's write is the same instruction 11:38 43 crossings, the vDSO

tetsuo

19,187 просмотров • 5 дней назад

This is a common C bug. You write a MAX macro, then call MAX(m++, n++). The preprocessor pastes the text, so it becomes (m++ > n++) ? m++ : n++. The smaller one increments once. The larger one increments twice. Stanford CS107, lecture 12
1:04

This is a common C bug. You write a MAX macro, then call MAX(m++, n++). The preprocessor pastes the text, so it becomes (m++ > n++) ? m++ : n++. The smaller one increments once. The larger one increments twice. Stanford CS107, lecture 12

tetsuo

29,625 просмотров • 1 месяц назад

Anthropic just reliesed the best 1-hour workshop on Loop engineering: from one prompt to a Loop that improves itself 5:31 - loop memory 11:02 - check, build, commit 13:06 - one feature per loop 33:03 - MVP in 1 hour Free, the best thing on Loop engineering I've come across. Watch it, then try your first loop with the step-by-step guide below
42:20

Anthropic just reliesed the best 1-hour workshop on Loop engineering: from one prompt to a Loop that improves itself 5:31 - loop memory 11:02 - check, build, commit 13:06 - one feature per loop 33:03 - MVP in 1 hour Free, the best thing on Loop engineering I've come across. Watch it, then try your first loop with the step-by-step guide below

Mahax

94,658 просмотров • 3 дней назад

Andrew Ng at Stanford: “Stop waiting for the perfect model. Build the iteration "loop" and "graphs" around it.” move from prompt → loop → graph → self-improving system • 00:05 - why every AI project needs an iteration loop • 04:08 - the full cycle: data → model → deploy → monitor • 16:02 - why faster iteration can decide who wins • 26:09 - using error analysis to improve the right data • 39:39 - why shipping a simple system beats waiting for perfection • 54:26 - monitoring drift and improving models after deployment 67-minute Stanford lecture, and it’s one of the clearest playbooks on why experienced AI engineers optimize the loop around the model, not just the model itself. It's watch today, then read the full step by step roadmap in the article below
1:06:59

Andrew Ng at Stanford: “Stop waiting for the perfect model. Build the iteration "loop" and "graphs" around it.” move from prompt → loop → graph → self-improving system • 00:05 - why every AI project needs an iteration loop • 04:08 - the full cycle: data → model → deploy → monitor • 16:02 - why faster iteration can decide who wins • 26:09 - using error analysis to improve the right data • 39:39 - why shipping a simple system beats waiting for perfection • 54:26 - monitoring drift and improving models after deployment 67-minute Stanford lecture, and it’s one of the clearest playbooks on why experienced AI engineers optimize the loop around the model, not just the model itself. It's watch today, then read the full step by step roadmap in the article below

Morlex

22,601 просмотров • 1 месяц назад

ONE OF THE WORST CALLS IN CFB HISTORY: Throwback when Cooper DeJean had an insane punt return touchdown but somehow the refs called it back for a fugazi fair-catch call. 😳😳😳 One of the best returns ever — that should’ve counted.
0:22

ONE OF THE WORST CALLS IN CFB HISTORY: Throwback when Cooper DeJean had an insane punt return touchdown but somehow the refs called it back for a fugazi fair-catch call. 😳😳😳 One of the best returns ever — that should’ve counted.

MLFootball

1,702,835 просмотров • 1 год назад

You cannot add to a void pointer in C. The compiler does not know the size. The everyday fix is to cast it to char* so the math is in bytes, then multiply by the element size yourself. Stanford CS107, lecture 4
1:37

You cannot add to a void pointer in C. The compiler does not know the size. The everyday fix is to cast it to char* so the math is in bytes, then multiply by the element size yourself. Stanford CS107, lecture 4

tetsuo

25,772 просмотров • 1 месяц назад

The loop has a name. And it runs in five steps. 1.Something feels heavy. 2. You reach for your poison. 3. You get the hit. 4. The relief dissipates, and you're lower than square one. 5. You start over. That circle, on repeat, is the loop. And notice: I didn't say feet. The endless scroll. The news. The 1am rabbit hole. A game. A pint. The machine runs the same either way. What's your poison? Tell me below. The FREE Kink Shame Exit Kit walks you out of it, step by step. 👉
0:38

The loop has a name. And it runs in five steps. 1.Something feels heavy. 2. You reach for your poison. 3. You get the hit. 4. The relief dissipates, and you're lower than square one. 5. You start over. That circle, on repeat, is the loop. And notice: I didn't say feet. The endless scroll. The news. The 1am rabbit hole. A game. A pint. The machine runs the same either way. What's your poison? Tell me below. The FREE Kink Shame Exit Kit walks you out of it, step by step. 👉

Command Within | Build Self-Command

32,348 просмотров • 26 дней назад

Someone built a Chromium browser that runs entirely in your terminal. It's called Carbonyl, and it renders actual web pages in your command line. The best part is it runs with 0% CPU usage when idle. - Full Chromium engine in the terminal. - dles at exactly 0% CPU. - Fast, lightweight, and completely terminal-native. 100% Open Source.
0:27

Someone built a Chromium browser that runs entirely in your terminal. It's called Carbonyl, and it renders actual web pages in your command line. The best part is it runs with 0% CPU usage when idle. - Full Chromium engine in the terminal. - dles at exactly 0% CPU. - Fast, lightweight, and completely terminal-native. 100% Open Source.

Oliver Prompts

451,944 просмотров • 5 месяцев назад

Most C Programmers don't have a clue as to how the CPU works. Here is a lecture from my course on the C Language that introduces how to visualise the CPU as a C (or general software) Programmer.... More Details are at: Being able to model the behaviour of CPU provides a solid base to reason about your code. The summary is - - The CPU is a state machine which maintains it's states in registers. - It has busses to memory for requesting data/instruction read/writes. - Interrupts to attend to events. I discuss this and more in my course on the C Language.
11:41

Most C Programmers don't have a clue as to how the CPU works. Here is a lecture from my course on the C Language that introduces how to visualise the CPU as a C (or general software) Programmer.... More Details are at: Being able to model the behaviour of CPU provides a solid base to reason about your code. The summary is - - The CPU is a state machine which maintains it's states in registers. - It has busses to memory for requesting data/instruction read/writes. - Interrupts to attend to events. I discuss this and more in my course on the C Language.

Piyush Itankar

28,019 просмотров • 1 год назад

See the CPU execution, Pipeline stages and Caches in action. This emulator animates the high level CPU and Cache state-machine. You can track the state (fetch, decode, execute, memory access, write back and ) of a given instruction... Try it here:
0:24

See the CPU execution, Pipeline stages and Caches in action. This emulator animates the high level CPU and Cache state-machine. You can track the state (fetch, decode, execute, memory access, write back and ) of a given instruction... Try it here:

Piyush Itankar

110,522 просмотров • 1 год назад

SOMEONE OPEN-SOURCE A CHROMIUM BROWSER THAT RUNS ENTIRELY IN YOUR TERMINAL. It's called Carbonyl. It renders actual web pages in your command line. The best part is it runs with 0% CPU usage when idle. → Full Chromium engine in the terminal. → Dles at exactly 0% CPU. → Fast, lightweight, and completely terminal-native. 100% Open Source.
0:27

SOMEONE OPEN-SOURCE A CHROMIUM BROWSER THAT RUNS ENTIRELY IN YOUR TERMINAL. It's called Carbonyl. It renders actual web pages in your command line. The best part is it runs with 0% CPU usage when idle. → Full Chromium engine in the terminal. → Dles at exactly 0% CPU. → Fast, lightweight, and completely terminal-native. 100% Open Source.

Aman

36,001 просмотров • 5 месяцев назад

Back in April, my wife and I launched Spondle to be the family hub that takes shopping, chores, calendars and everything the home runs on from your head into one shared system. I've never posted it here, but this is the video from when we launched, and the why behind it. 👇
5:19

Back in April, my wife and I launched Spondle to be the family hub that takes shopping, chores, calendars and everything the home runs on from your head into one shared system. I've never posted it here, but this is the video from when we launched, and the why behind it. 👇

Ayomide Ajayi-John

142,107 просмотров • 29 дней назад

Many of us know this already but how do we get the sheep to understand and see what they are actually doing in their efforts of trying to take control? This video points out what they are doing and is straight to the point. Step one: train the people only to consume. Step two: infiltrate the adults on the news. Step three: indoctrinate the children through the schools and the music and the apps on the phones that they use. Step four: separate the right from the left. Step five: separate the white from the black. Step six: separate the rich from the poor. Use religion and equality to separate them more. Step seven: fabricate a problem made of lies. Step eight: put it on the news every night. Step nine: when people start to fight and divide take control, this is called situational design.
0:30

Many of us know this already but how do we get the sheep to understand and see what they are actually doing in their efforts of trying to take control? This video points out what they are doing and is straight to the point. Step one: train the people only to consume. Step two: infiltrate the adults on the news. Step three: indoctrinate the children through the schools and the music and the apps on the phones that they use. Step four: separate the right from the left. Step five: separate the white from the black. Step six: separate the rich from the poor. Use religion and equality to separate them more. Step seven: fabricate a problem made of lies. Step eight: put it on the news every night. Step nine: when people start to fight and divide take control, this is called situational design.

🌸𝓐𝓾𝓭𝓻𝓮𝔂🌸

10,822 просмотров • 4 месяцев назад

the loop is not the whole agent it is only one layer of the system LOOP vs GRAPH vs HARNESS ENGINEERING LOOP ENGINEERING controls iteration turns retries budgets stop conditions success checks stalled progress use durable execution when the run must survive crashes → GRAPH ENGINEERING controls structure nodes edges state branches checkpoints routing handoffs build stateful agents as explicit graphs → inspect the topology without putting a model in the loop → HARNESS ENGINEERING controls exposure tools permissions memory sandboxes evals traces humans isolate generated code from the host machine → test behavior before users ever see it → preserve one trace across every model step and tool call → without loop control it keeps running without graph structure the path stays invisible without harness control it can reach anything the loop runs inside the graph the graph runs inside the harness the model is only one component debug the layer that actually owns the failure save this then read the article below
0:20

the loop is not the whole agent it is only one layer of the system LOOP vs GRAPH vs HARNESS ENGINEERING LOOP ENGINEERING controls iteration turns retries budgets stop conditions success checks stalled progress use durable execution when the run must survive crashes → GRAPH ENGINEERING controls structure nodes edges state branches checkpoints routing handoffs build stateful agents as explicit graphs → inspect the topology without putting a model in the loop → HARNESS ENGINEERING controls exposure tools permissions memory sandboxes evals traces humans isolate generated code from the host machine → test behavior before users ever see it → preserve one trace across every model step and tool call → without loop control it keeps running without graph structure the path stays invisible without harness control it can reach anything the loop runs inside the graph the graph runs inside the harness the model is only one component debug the layer that actually owns the failure save this then read the article below

rari

20,934 просмотров • 1 месяц назад

THE ANATOMY OF A SECOND BRAIN THAT WRITES ITSELF one Obsidian vault, three layers, and a loop that files every good answer back into a wiki you never touch the structure: > CLAUDE.md + AGENTS.md - the constitution. same rules whether Claude or Codex runs the loop > raw/ - inbox, articles, assets. frozen and read-only, you feed it and walk away > wiki/ - index.md, entities/, concepts/, synthesis.md. the agent grows this on its own > log.md - append-only, every move timestamped 47 sources in -> 210 pages out the agent typed 96% of it. you typed zero the cost trick: point Opus 5 only at synthesis.md, the one file that needs frontier reasoning. everything else runs fine on cheaper models under the hood it's loop engineering: you ask -> a good answer gets filed back -> the wiki grows start linking entities to each other and you're one step from a full graph your research compounds while you sleep. the full blueprint is below 👇
0:24

THE ANATOMY OF A SECOND BRAIN THAT WRITES ITSELF one Obsidian vault, three layers, and a loop that files every good answer back into a wiki you never touch the structure: > CLAUDE.md + AGENTS.md - the constitution. same rules whether Claude or Codex runs the loop > raw/ - inbox, articles, assets. frozen and read-only, you feed it and walk away > wiki/ - index.md, entities/, concepts/, synthesis.md. the agent grows this on its own > log.md - append-only, every move timestamped 47 sources in -> 210 pages out the agent typed 96% of it. you typed zero the cost trick: point Opus 5 only at synthesis.md, the one file that needs frontier reasoning. everything else runs fine on cheaper models under the hood it's loop engineering: you ask -> a good answer gets filed back -> the wiki grows start linking entities to each other and you're one step from a full graph your research compounds while you sleep. the full blueprint is below 👇

Annatar.md

22,801 просмотров • 3 дней назад

THE FORMULA BEHIND EVERY BAYESIAN TRADE ON POLYMARKET - FREE STANFORD LECTURE Stanford teaches Bayes' Theorem in a free 1-hour lecture this is the exact math behind the 5 formulas in that article save this 👇
1:14:36

THE FORMULA BEHIND EVERY BAYESIAN TRADE ON POLYMARKET - FREE STANFORD LECTURE Stanford teaches Bayes' Theorem in a free 1-hour lecture this is the exact math behind the 5 formulas in that article save this 👇

Mr. Buzzoni

104,637 просмотров • 5 месяцев назад