14:55 Grant: "Clever ideas often look deceptively simple in hindsight, which makes them easy to under-appreciate." Me: *still can't fathom how anyone could ever figure out something so clever and elegant*
My mind was absolutely blown when it was shown how turning the results from the parity checks into binary-booleans gave you the exact location of the error and it just clicked for me why you placed the redundancy bits at powers of two! Dear god I love this channel and please please please don't stop producing content.
honestly. the guys and gals who worked in comuting and hardware at the start of the field are absolute geniuses. I am always left speechless when learning about the tricks they used, the methods they developed, the brilliance of it all We have some smart tech people now too, but the people who started the field from nothing will always be amazing to me
I find the vertical columns split to horizontal rows quite interesting. I mean binary numbers is really one dimensional. Watching the first video I thought that this grid layout actually provides additional benefits. But now I realize that the systematic lexicographic placement of one dimensional addresses in a two dimensional grid results into higher digits in the one dimensional address space mapping to rows in the 2 dimensional address space. And since bits are modular (i.e. circular/wave-like in a way), it seems much more obvious to me, why a simple fourier transform on pictures might result in interesting insights. So my mind was blown at the same time about a different topic.
Bell Labs deserves a documentary series of its own. How it was funded, what they let their people do. So, so much of what we all depend on had foundations laid down there.
Its not that incredible when you think about it. Most of these fundamentals were designed in the early era of computers when there simply weren't that many players involved -- a couple of major companies like Bell and IBM and a handful of the most technical universities like MIT and that was about it. If you wanted to work on an actual computer, you had to be at one of those places -- the devices simply didn't exist elsewhere. Its kind of like being surprised that advances in rocket tech have mostly come out of Space-X, Blue Origin and Virgin Galactic in the past 5 years or so. Even NASA isn't really working on rocket tech these days (they seem to focus more on satellites now and farm the lift out to private industry.) Maybe 50 years from now rocketing will be so cheap and commonplace that there are hundreds or thousands of competing companies employing smart people, but right now there's only a fairly small group of employers so its not too unusual for most work in the field to come from people working for one of those employers.
@@thealienrobotanthropologist NASA was chartered under the 1958 Space Act to develop space technology and transfer it to US industry. That Act forbids NASA to compete with private companies. NASA's serious engineering focuses on making the impossible, possible. Do it first, document the lessons, and teach industry. Then get out of the business and engineer something harder. Sadly the organization's funding is a shadow ( about 10%) of its former level. That's the response to your comment, by an old friend and co-worker still working at JPL.
@@TinkerAssist_ Not really the point. The point is simply that there are few places doing the research, so research related to the subject necessarily comes from those places. Whether that research is "fundamental" or "leveraging a convergence of technologies" is kind of beside the point.
I really love what you said at the end. Too often we learn the end results from textbooks without any indication of how insanely clever their discoverers were. This channel is great at telling the story of that discovery process for us.
This is something I've always tried to describe to teachers and people designing curriculum (most of my family is involved in education, so this isn't super weird): I used to phrase it like "we need to teach math, but like the *history* of math." I probably should have found a better way to describe it lol. But it was the same as this point you're talking about.
@@delphicdescant When tutoring students in the STEM field at my college, I always re-derive it for the students. Often times the students don't entirely understand the significance of a derivation or the professor doesn't have the time to explain it to the students (class pacing is brutal). Sometimes all a student needs is a different perspective than the one they're given.
The video actually does NOT tell the story of that discovery process. (It's a very long story!) That's the point he was trying to make at the end of the video, that we under appreciate the amount of effort put into the process because we only see the result, i.e. what is explained in these two videos.
@@delphicdescant I think sciences like chemistry and physics should be the same way. It makes it much more interesting to hear the story of how things developed the way they did, what problems the minds of the time were facing and how they solved them, especially when you get to late 19th and early 20th century. (@mike) 3b1b might not have told the full story, but he at least set up the problem at hand with the punch cards, and showed the book where you can read all about it.
I am very very ignorant in geology but I'm pretty sure data processing plays a huge part in this field. Like idk when reading height data from satellites or measuring seismic activity :)
Geology is good, but be careful of the political brainwashing and follow the money. Stick with the good science and when new information comes, be ready to change your indoctrinated beliefs in geology. this is a youtube guy who is brilliant at predicting earthquakes with science. /user/dutchsinse
It's pretty unlikely that exact situation would happen to you or anyone specifically, but given how often he uploads and how many people are excited for the uploads and say "It'd be awesome if", it's pretty likely to happen to someone eventually. I bet there's a 3B1B video on that idea lol
I was bored sitting in hospital bed after playing tons of Earthbound and Final Fantasy , I pulled out the phone and watched Computerphile, Numberphile and 3B1B videos. Don't regret it at all, time well spent
The interesting thing about the error correcting idea is that it was used as a card trick people may have seen before (I know I saw it when young). Each card has a list of numbers written on them, and another person is asked to pick a number between 1-60 and pick out each card with that number printed on it. The cards each were a binary class as shown in this video, so all you had to do to guess their number was sum the top left number on each card.
@jalel @3blue1brown thanks to your comment i grabbed a pack of cards and realized one trick i remembered from childhood functioned was exactly this. i knew this algorithm when i was like 9 or 10 or 11? but i did never connect math with it. this makes it even more beautiful- and to shows me complex stuff can be thought and learned way earlier. you two together invoked beautiful childhoodmemories, thank you guys =)
Yeah I had that when I was younger, and I thought it was so amazing that I saved it from the magic set it came with. I found them again a few weeks ago and figured out the trick, and I gotta say figuring out the solution to something I know baffled young me was a really nice experience.
@@jaishkhan7442 you'll have to print out certain cards. First one for example will have 1,3,5,...,59 (only odd numbers). Second will have 2,3,6,7,... (2 or 3 mod 4). And so on. Your last card will be 32, 33, ...
I think that the best part about your videos is that you won't understand something completely unless you pause and work on it yourself. I've seen comments asking you to slow down but I think your pace is perfect for telling me that something is going beyond my head. Then, when I pause and figure it out myself, I'm never going to forget it. Keep up the great content :D
Grant is amazing. So often watching his videos, he explains something and my mind goes "yeah but what about if this strange edge case thing happens??", then every time, grant addresses that exact edge case thing precisely. In short, he leaves no stone unturned, that is, unless the stone is redundant, and doesn't need turning. Super satisfying.
This reminds me of the following riddle: The King of a small country invites 1000 senators to his annual party. As a tradition, each senator brings the King a bottle of wine. Soon after, the Queen discovers that one of the senators is trying to assassinate the King by giving him a bottle of poisoned wine. Unfortunately, they do not know which senator, nor which bottle of wine is poisoned, and the poison is completely indiscernible. However, the King has 10 prisoners he plans to execute. He decides to use them as taste testers to determine which bottle of wine contains the poison. The poison when taken has no effect on the prisoner until exactly 24 hours later when the infected prisoner suddenly dies. The King needs to determine which bottle of wine is poisoned by tomorrow so that the festivities can continue as planned. Hence he only has time for one round of testing. How can the King administer the wine to the prisoners to ensure that 24 hours from now he is guaranteed to have found the poisoned wine bottle?
Exactly! I remember this riddle from my childhood - and during the video it immediately sprang to mind. It's kind of shocking to realize that an important concept as this, only discovered in the 50' - can still be compacted into a riddle for school children.
I'd never heard this riddle! There's my solution below for those who don't want to get spoiled. It turns out that 999 in binary has 10 digits: 1111100111 So the king just has to label the bottles in binary, from 0000000000 to 1111100111. Then he gives the first prisoner a glass filled from all the bottles starting with a 1, the second prisoner all the bottles which second digit is a 1, etc. until the 10th prisoner who's given all the odd labelled bottles. 24 hours later, the king writes 1 if the first prisoner died, or 0 if he's alive. To the right of that digit, he writes 1 if the second prisoner died, and 0 if he's alive, and so on to the tenth prisoner. At the end of this process, the king has written the label of the bottle containing the poison.
@@maxsnts Well, how do you know which bottle to take out? You can only have them drink once. Edit: I see what you mean. The bottle you take out is actually the one labelled 0000000000. That one will be in none of the prisoners' glasses. Incidentally you could also have them drink that bottle. The trick works with up to 1024 bottles. If you have just one more, you'll need 11 prisoners.
I was reminded of a whole family of puzzles involving, say, 100 coins, one of which is counterfeit and weighs less than the rest, and all you have is a balance scale. The most efficient way of weighing them is with a clever grouping which is effectively the same thing as your puzzle's solution
This feels almost too elegant. I mean that I would never expect it to work out this nicely so I would not even put my effort into it and I would never discover all these last tricks.
The feeling when some problem that you thought was terribly complex, simplifies down to something so concise, is pretty special. It's almost like you've discovered something fundamental about the universe, the first explorer gazing at a new continent. I'm no Hamming, but I've had a few moments like that writing code, where some long block reduces down to a simple formula and you're just like, "aw yeah" hehe
It’s elegant, but very pedestrian. The single bit flip assumption is rather weak. There are much stronger codes in terms of error correction and detection capacities. They involve harder math as well. Hamming codes were good for the time and a nice intro to coding theory.
I swear the explanations that you make are impossibly elegant, just like some of the things you explain. kinda crazy as I consider myself to be a very slow person and I can absolutely understand the flow of your videos w/o having to rewind. the videos always seem to have immensely powerful lessons as well, where we not only learn about a fun fact but also how it was thought of, how amazing it was, and a separate takeaway other than the thing we're learning. honestly amazing, it's so appreciated, and I absolutely love this channel for it.
Man. When I watch other educational content creators, I usually set the playback speed to 2x. Just because I either don't want to waste time with their overexplaining or the content is so boring but I have to somehow go through it for the lack of other material. This channel has done such an unbelievable job in avoidng both!!! The content and the explaining method are so engaging but without going into too much / too little details that I see myself watching the same video many times on 1x speed. Thank you for being so amazing. You're literally everything I aspire to be.♥♥♥
Woah realized 'the why' of the relation between the binary bisection and the fact that it actually spells out the position of the cell in binary just before you explained it, that has never happened to me before in one of these videos.
My "naive" implementation started from the top to keep all possible error locations within a solid interval: "Error is somewhere between 0 (included) and 16 (excluded). Now is the error in the 2nd half? If not, the new endpoint becomes (0+16)/2 = 8. If it is, the new starting point becomes 8. Then, in which quarter of the array (i.e. which half of the interval) is the error? Halve the interval again, etc. until you have an endpoint that's 1 more than the starting point, and the error is pinned down. But the solution in the video is even more elegant. For hardware, one could run the data through a circuit where you have 4 XOR gates, and you'd use the index of the bit to turn the gates on/off, so that each gate XORs only half the data. In software, one would XOR the indices of all bits which are 1. Essentially, that's two ways to XOR, by column in hardware and by row in software.
this channel makes so many complicated or high-level topics easily accessible for no cost; you've helped me really *understand* topics that daunted me just reading the video titles. you're fighting the good fight of information accessibility!
Although I studied electrical engineering with focus on communications and most of this is really familiar, it's still fascinating to see it explained and visualized so beautifully. I wish this channel already existed during my studies, that would have made thing so much easier.
In the early 1970's, Hamming spent a year at U C Irvine, working on the second edition of his book. He also taught a class. I'm one of the survivors of that year-long experience. I remember Hamming talking about being forced to invent error correcting codes so he could do (reliable) computation on unreliable hardware. He was brilliant, and a curmudgeon who did not suffer fools well -- I also remember his rant one morning in class when he discovered that some of us had not had a class in complex variable... And then proceeded to give us poor folks an amazingly lucid explanation (that astounded those in the class that had completed complex variable). Hamming's year-long class was one of the highlights of my time at UCI.
reduce() will raise an exception if the list of values to reduce is empty (i.e. all bits were 0 in the Hamming-encoded message). So technically, you should pass 0 (the identity for XOR) as an additional argument: reduce(ops.xor, (i for i, bit in enumerate(bits) if bit), 0)
@@hidroman1993 how ist it unnecessary? It points out a bug in the code and povides a bugfix. The video didn't state the precondition of the message not being all 0
@@hidroman1993 I don't understand why you're upset. Even if the point of a video is to communicate the concept and to induce curiosity. The comment wasn't rude or condescending, it just presented the facts. Even if the simplified version is in the video on purpose there's nothing useless about posting the fully correct version.
Hey Grant! Absolutely love your channel, though I'm an electronics and communication engineering grad and now work in consulting, your videos have reignited my love for advanced math and coding. Please never stop making these amazing videos and do upload more topics as your method of explaining such advanced topics is so amazing that even a 6year old can understand them pretty well. LOADS OF Love and Respect for you!
The Haskell programmer in me loved the "one line" reduction (though wanted to write it pointfree), but the C++ programmer in me hated it and wanted to write the 32-bit version as a fixed series of operations in the most efficient manner possible.
You can rewrite the program in Haskell as a hylomorphism. Making use of the Recursion Schemes library, we can write it as the following; hammingAlgebra :: ListF Int Int -> Int hammingAlgebra Nil = 0 hammingAlgebra (Cons i1 i2) = xor i1 i2 hammingCoalgebra :: (Int, [Bool]) -> ListF Int (Int, [Bool]) hammingCoalgebra (_, []) = Nil hammingCoalgebra (i, (b : r)) = Cons (if b then i else 0) (i + 1, r) hamming :: [Bool] -> Int hamming = hylo hammingAlgebra hammingCoalgebra . (0,) This rendition is also, in some ways, more efficient than the one given in the video, as it avoids using the linear space required to store the enumeration list, only using constant space instead. We can turn this into a point-free implementation, but it won't look too good as the position (i) needs to be copied for both keeping track of position and being fed into xor. I personally hate list comprehension syntax as it obscures the algebraic structure of what's going on behind seemingly clear but in-fact obscuring syntax sugar.
@@shershahdrimighdelih I've been using Scratch for a few years, and yes, *everything* must be as efficient as possible. Because else it just won't work or will be too slow or non-scalable...:)
xor is a single clock cycle operation, I'm not sure how something like this could possibly be written inefficiently with something that compiles natively. unless you'd do memory allocations in a loop while checksumming something large
Learning about Hamming Codes was such a cool moment in my computer science education along with learning about compression and learning about encryption. They were so intuitive when someone shows you but mindblowing when you think about it.
I used to play a game called Mastermind where I had to guess the location and colours of 4 pegs using a series of guesses. My method for winning looks a lot like using parity bits.
@@shantanunene4389 Depends on the version. I had a version with 8 colors and 5 spaces; I don't know what the number of moves is for that version, but I doubt it's 4
Wow. Oh my goodness. I don't know if I have ever been as blown away by the simplicity and elegance of an explanation of any topic on TH-cam. Thank you so much for this video! I understand Hamming codes, and error detection and correction as a whole, far better than I ever have before. I will definitely be "liking and subscribing"!
I watched this around when it first came out and I didn't get a thing out of it about a year later, having been knees deep in trying to make a simple image rendering system using ASCII characters, and I came upon this video again. And it really hits me way harder than it did before, both because I have more coding experience and because that experience told me to truly follow along with the video and play the guessing game as I watched along. Thank you 3B1B, it truly is elegant.
I've done grad study work on quantum error correcting codes and the concept of code switching between two qubit codes with "gauge qubits" to achieve a fault tolerant gate set. This pair of videos is really well put together, and I selfishly wish you could take your expertise in presenting these elegant ideas, and go much much deeper for the sake of people like me. But alas, you do the best work for reaching a wide audience. For the deep dives at the same level of quality, I guess I have to be the change I wish to see in this world.
This style of thinking is beautiful, Hamming you absolute genius. A big thank you to 3 blue 1 brown for the simplicity of the explanation, you make difficult subjects understandable for people like me.
Great video! The clear and eloquent way you explain it is admirable! The very process of learning give an incredible sense of pleasure, giving another different perspective of the way of thinking and to see the result! Bravo!
Man, this is art. Literally got goosebumps wondering what hamming would have felt when it all came together and made sense. Ignoring the fact that >2errors is not possible but that the redundancy decreases with scale is quite a rewarding feeling to think about.
I've always love Grant's math and style in teaching math (everyone needs more animated Pi's in their life!) but I also appreciate the occasional dips into philosophy and having creative/intuitive/inquisitive worldview, like he did at the end of this pair of videos.
We learned this in class the last year with the more matematical approach and without any sort of explanation of what the calculation we were doing mean. With 40minutes of vidéo you have explained it much more clearly than 25 hours of course. So thank you !
I think I dropped a tear when I saw the blue line crossing the whole maze of paths at the end, as I only got where you were going with that animation when you actually finished stating your last message... That's very true to me, and the way you so simply represented it is so simple yet beautiful ; with all those little pi-searchers going into wrong/forgotten directions, and this only pi-stein which is remembered as the big hero of a simplified story.
I like how all of this spawned because of a hardware error nobody wanted to fix. Side note. This video series was outstanding, and to somebody has has a moderate familiarity with computers a lot of it clicked with very deliberate and careful guiadances. Thank you
Your videos keep impressing me. After spending 18 years in school, and quite a few working in software, I have never seen anyone explain technical stuff as well as you. It's amazing...
@@hugodaniel8975 Used to be a lot of women in high-level maths. Never been a lack of talent there. Sexism is stupid :( On race, Europeans never had a monopoly, but there's a very strong cultural component (which is why Inida and Persia were way more advanced on maths than Europe for most of history.) Most of the great work comes from ideas someone has when they are pretty young, so it really helps to grow up around maths. It isn't common anywhere, but in some places there are sort of math-is-cool subcultures. Black nerds sort of 'coming out' these days is promising on that front, but it is a generation timescale thing. LGBT... Yeah, no reason not. Actually, thinking about it, LGBT might already be fairly or even over-represented. It's more of a case of them always being there, just not being obvious. The norms have shifted really quickly, and the majority of folks in the maths and sciences react to LGBTQ with a sort of shrug... So Jim became Joan, ok, they are still an expert on using differential equations to model ecosystem dynamics (that's a real example BTW).
My mind got blown when you explained how taking the xor of all the 1 bits, using the parity bits to even out to 0000, will give you the position of the error. Beautiful
I usually don't subscribe to channels, but for you I made an exception. I am a teacher and cannot think of a better way to explain all materials you discuss in your videos :) So I decided to give your videos to my students and I build my lessons on top of your materials. Thank you for your videos and keep up with the good work!
FEEL FREE TO MESSAGE ONE OF MY MOST TRUSTED TRADER DAVID NATHAN TO MAKE GREAT PROFITS IN CRYPTO +..1...2...0...1.....4.. .1...6....3.....5....7....0... His strategies are top notch 100% risk free.
The money quote of the video: "Ironically the ideas that most profoundly shape the ways that a future generation thinks will end up looking, to that future generation, simpler than they really are."
I am so glad you referenced Ben Eater. Also a very good source. You fellows are among the very many brilliant stars in the night sky. Generally a gift to humanity. Thank you for being there for us, and yourselves of course. There should be an encyclopedia of humanities brilliant sources. Again thanks. Actually these days there are so many showing up, they begin to be hard to keep track of!
Hey. I tried to visualize a (7, 4) bit problem as a 2x2x2 cube, then expandable to higher dimensions, and not a 2x4 rectangle. Instead of the band patterns I get cool half cube divisions in each dimension. It is basically the same, but it is a cool visualization. In case I wasn't clear I can try explaining it better :)
3b1b did mention that idea in the Chessboard video as "a really satisfying way of coloring a hypercube", which is analogous to the (15, 11) Hamming block.
Yep, and visualising a (255,247) Hamming Block is as simple as visualising halves of an 8-dimensional hypercube. It's simple, I really don't get what all the fuss is about.
Amazing! I love how you built it up in two videos, one the long, but intuitive way, and then the other one just breaking it down into literally two operations.
In the small place where I lived, I believe I was the only kid to study binary over more than 500. But I can't be sure... I was not telling anyone... Considering those children unlikely to do anything beyond class
I was greatly surprised about his relationship with Shannon. I always thought of Shannon as a forgotten genius who published all his results in a 3 page paper and wasn't heard from again. In stark contrast to modern scientists that publish endless pages and articles to boost those citation counts imposed by bureaucrats.
Hey Grant, I just wanted to thank you for framing your videos from the point of view of the discoverer. I hope to one day invent crazy new ideas and your videos strengthen the mental muscles required for such leaps of logic and discovery. I also love that you mentioned the struggle and redundancy of all the things he tried before arriving to this. I used to work at Pixar (which I remember you visiting) in which I took a machine learning class from Tony Derose in which I asked "what does it feel like to invent math" (In relationship to polygon subdivision), and it warmed my heart how the often somewhat stoic Tony beamed with energy like a 10 year old saying 'It was the greatest feeling in my life'
Yep! If you've studied digital logic circuits at all, here are two more ways to think about it: 1. XOR is the output of a half adder. 2. Hamming codes work on the same principle as using Karnaugh maps to create boolean algebra expressions from bit tables. Exceedingly cool to see these connecting points between things I think!
7:43 This also beautifully explains why this method can't find an error in position 0: XORing 0000 doesn't change the result, and with the 'correct' result being 0000 from the start, there's just no way to detect a flip there. I'm a CS grad student, and I find your work nothing short of amazing; really, your videos make my days better, even if I already know the topics at hand. And your linear algebra series *saved* me. Thank you so much, and keep it up! 🙏
"The ideas that most profoundly shape how a future generation thinks will look simple to that generation" That's an awesome idea and I can only wonder how future generations will think about tech like quantum computers and generic engineering, complicated subjects today, but possibly beautifully understood tomorrow.
This is barely related, but the thought of how simple something seems once you’ve seen the final solution, made me think of lightning bolts. In slow motion you can see that lightning doesn’t start out as the perfect, single line bolt (albeit pretty squiggly) we usually imagine, but has thousands of tiny “feeler” bolts before it meets the ground. The final thing we think of is just whichever bolt found the ground first, which is cool to me how that’s like how the correct solution is just the one attempt of thousands that succeeded. The animation at 15:10 is what really brought it home for me :)
i was initially very unhappy with standupmaths explanation of the chessboard puzzle solution, but i spent about 2 hours working through the problem and figured it out. best decision ever, it made this and the previous two videos extremely digestible :)
3:50 Ah, that's the bit I found missing in part 1. The fact that the four parity locations are the ones which are only in one group wasn't immediately obvious, at least not to me.
As someone who's familiar with binary codes and such, placing things at powers of 2 did seem to make intuitive sense to me, but I didn't realize that each parity bit was _only_ in its group until I started working through the 256-bit version myself.
Hey 3b1b, I just wanted to say thank you for these videos. I was suggesting your work and as I explained why it worked for me, being a visual learner, the more I realized it is because of people like you, who give visual form to the data, that I have had any improvement. Thank you so much!
I'd abolutely take a good visual explanation for reed solomon from you, just the fact that you showed a polynomial and you called it an interpolation have sparked me again with some ideas and interest to go check it out again even if theCD specs and wikipedia make it sounds like black magic.
I loved the lesson, but the way he concludes his videos are so amazing. "Ironically, the ideas that most profoundly shape the way future generations think, will end up looking, to that future generations, simpler than they really are."
This man has a such a great talent on making this mathematical animations. I hope that, in a near by future they put this software more accessible to other users and professors that would be a revolution in mathematical education.
This is very interesting. I can't say that it feels obvious to me. I'm amazed that somebody came up with something so efficient and elegant. without the first video i would not have understood any of this at all, so I'm glad you made a version of this explanation that is understandable to somebody with no coding experience.
I remember Grant said this in one of the videos--maybe he didn't say it first, but I first heard it from him... It is paraphrased like this, "a lot of the times genius ideas and impressive discoveries to problems don't come out of nowhere(it does, when you are just naturally gifted), but comes from continuously seeing similar patterns and problems and having that laying somewhere in your subconsciousness. " So practice is the way to go...meaningful and intentional practice.
The final takeaway message is so important and highly relevant to the current zeitgeist, as it doesn't only apply to scientific thinking but also moral thinking. What we know now makes it really easy to assume people in the past were stupid, racist, etc, but it couldn't be further from the truth. "The ideas that most profoundly shape the ways a future generation thinks, will end up looking to that future generation simpler than they really are"
No, people were racist and less intelligent in the past, those facts have been researched thoroughly. It's the entire reason why you can't compare an IQ score from say 1950 to one from 2010 without knowing how µ and σ have shifted. What Grant is saying is: "Hindsight is 20/20"
@@Ruhrpottpatriot What you are talking about with IQ is called the Flynn Effect and it is highly disputed. What I'm saying is that people in the past used the best tools they had available and built the foundation for the tools and ideas we use today. You're basically saying a caveman is stupid to use a rock to crack open a nut when he should just go to walmart and buy a nutcracker.
People in the past weren't stupid, why would they be? People in the past WERE racist, but I don't think it has to do with the fact they were figuring out the ins and outs of morality. After all, people opposed slavery for example even then. I think it relates more to the status quo and how hard it is to go against the grain. Since people in power benefited from the status quo, they worked to maintain it, and didn't really think of the moral implications or just tried to justify them. I assure you that even then, if people were made to take a hard look at their stance, and to critically examine it, they would've arrived at the same conclusion as we do now. You see it at present time too. Veganism is obviously the way to go if we want to protect our planet's resources, even more so if you want to reduce the aggregate suffering in this world because pumping chicken full until their legs break is evidently not moral. However, people are willing tto gloss over that, not think it through because they enjoy meat.
@@HeythemMD Only that Veganism is _actually_ harmful to the human body as you're missing key ingredients, e.g. Vitamin B12 which is *only* found in animal products. Nobody of sane mind disagrees with people needing to eat _less_ meat (although the type of meat has vast implications for climate, e.g. pork is way better than beef), but no animal products is just as stupid as one steak every day.
@@Ruhrpottpatriot People are not more intelligent, we can't evolve so fast that the brains of our species are more capable after only half a century. IQ tests are far from perfect, and you can score higher on them with study, not to mention they are known to have had cultural biases. The *knowledge* that we have in the modern day is greater because of information passed down to us, but our raw mental ability has not changed. You cannot claim that you are smarter than newton because you learned the results of his life's work while you were in highschool. You would in no way be able to discover those things on your own were you to live in his time with the resources available to him. It is only easy to understand now because of efficient education techniques used to pass the information on to you.
I’ve been pausing this video to work things out and rewinding to make sure I really understand what I’m hearing. It’s been really elucidating - thanks!!
This is amazing. It really blown my mind how smart all these people are..thanks for telling this story !! Please bring more like this, appreciated so much !
At the college no one believed I was able to do the hamming correction by plain sight, and I told them it was like a sudoku. I figured out it was all about regions intersections and xor's and it just clicked for me. That's one of the reasons I love information theory.
There's a professor in my university that can always make students feel how clever an invention is and how one could work towards it without going out of topic (which is very useful, not just for understanding, but also for solving exercises). That's just a part of his ability to make any mathematical topic interesting and only one of the reasons most students in my university like his courses so much.
This, again, illustrates an idea that has developed in my head over the past several years. It takes a genius to create something new: a new model of physics, a new "math" (such as calculus), a new artistic style, etc. However, it doesn't take a genius to be able to understand and/or USE that new thing.
Thank you so much for the intuitive way of thinking as well as an overview of how it came into being. I must say I have learned in this 16 min more than a 90 min lecture. If only there were more inspiring teachers like you!
It never ceases to amaze me to how powerful the XOR truly is; it's such a simple operation, by virtue of being its own inverse, and not causing under- or overflow, it is so powerful.
Thanks a lot for this videos. I am teaching discrete math at Moscow State University. Even though it's not the hardest topic I'm grateful for having a new way to intriduce my students to Hammg codes
I am by no means a math/coding person, and this (along with the first part) was the first thing about coding I’ve actually been able to follow, thanks for going through each and every step!
14:55
Grant: "Clever ideas often look deceptively simple in hindsight, which makes them easy to under-appreciate."
Me: *still can't fathom how anyone could ever figure out something so clever and elegant*
This is how I feel after finishing any of his videos. They are truly magical
My thoughts exactly, just standing in awe. So many brilliant people...
1:07 blew my mind
My mind was absolutely blown when it was shown how turning the results from the parity checks into binary-booleans gave you the exact location of the error and it just clicked for me why you placed the redundancy bits at powers of two! Dear god I love this channel and please please please don't stop producing content.
honestly. the guys and gals who worked in comuting and hardware at the start of the field are absolute geniuses. I am always left speechless when learning about the tricks they used, the methods they developed, the brilliance of it all
We have some smart tech people now too, but the people who started the field from nothing will always be amazing to me
@@mohammedsamir5142 If you think Hamming Codes are beautiful, wait till you learn about biological evolution.
I know! I audibly yelled "Of course!" when he pointed that out. I can't believe I didn't see it sooner.
he just started off with a banger. I was just mind blown at the start...
I find the vertical columns split to horizontal rows quite interesting. I mean binary numbers is really one dimensional. Watching the first video I thought that this grid layout actually provides additional benefits. But now I realize that the systematic lexicographic placement of one dimensional addresses in a two dimensional grid results into higher digits in the one dimensional address space mapping to rows in the 2 dimensional address space. And since bits are modular (i.e. circular/wave-like in a way), it seems much more obvious to me, why a simple fourier transform on pictures might result in interesting insights.
So my mind was blown at the same time about a different topic.
When you learn about this kind of clever things, it's genuinely impressive how often it ends up having been invented at Bell Labs ...
Bell Labs deserves a documentary series of its own. How it was funded, what they let their people do. So, so much of what we all depend on had foundations laid down there.
Its not that incredible when you think about it. Most of these fundamentals were designed in the early era of computers when there simply weren't that many players involved -- a couple of major companies like Bell and IBM and a handful of the most technical universities like MIT and that was about it. If you wanted to work on an actual computer, you had to be at one of those places -- the devices simply didn't exist elsewhere.
Its kind of like being surprised that advances in rocket tech have mostly come out of Space-X, Blue Origin and Virgin Galactic in the past 5 years or so. Even NASA isn't really working on rocket tech these days (they seem to focus more on satellites now and farm the lift out to private industry.) Maybe 50 years from now rocketing will be so cheap and commonplace that there are hundreds or thousands of competing companies employing smart people, but right now there's only a fairly small group of employers so its not too unusual for most work in the field to come from people working for one of those employers.
@@altrag This does make a lot of sense!
@@thealienrobotanthropologist NASA was chartered under the 1958 Space Act to develop space technology and transfer it to US industry. That Act forbids NASA to compete with private companies. NASA's serious engineering focuses on making the impossible, possible. Do it first, document the lessons, and teach industry. Then get out of the business and engineer something harder.
Sadly the organization's funding is a shadow ( about 10%) of its former level.
That's the response to your comment, by an old friend and co-worker still working at JPL.
@@TinkerAssist_ Not really the point. The point is simply that there are few places doing the research, so research related to the subject necessarily comes from those places.
Whether that research is "fundamental" or "leveraging a convergence of technologies" is kind of beside the point.
I really love what you said at the end. Too often we learn the end results from textbooks without any indication of how insanely clever their discoverers were. This channel is great at telling the story of that discovery process for us.
This is something I've always tried to describe to teachers and people designing curriculum (most of my family is involved in education, so this isn't super weird): I used to phrase it like "we need to teach math, but like the *history* of math." I probably should have found a better way to describe it lol. But it was the same as this point you're talking about.
@@delphicdescant When tutoring students in the STEM field at my college, I always re-derive it for the students. Often times the students don't entirely understand the significance of a derivation or the professor doesn't have the time to explain it to the students (class pacing is brutal). Sometimes all a student needs is a different perspective than the one they're given.
The video actually does NOT tell the story of that discovery process. (It's a very long story!) That's the point he was trying to make at the end of the video, that we under appreciate the amount of effort put into the process because we only see the result, i.e. what is explained in these two videos.
@@delphicdescant I think sciences like chemistry and physics should be the same way. It makes it much more interesting to hear the story of how things developed the way they did, what problems the minds of the time were facing and how they solved them, especially when you get to late 19th and early 20th century. (@mike) 3b1b might not have told the full story, but he at least set up the problem at hand with the punch cards, and showed the book where you can read all about it.
This is so true, Grant is truly a god-tier STEM communicator
I'm studying Geology. I have NOTHING to do with this sort of things but I'm still here for those beautiful videos and ideas/ concepts :)
Divided by Different streams, united by Curiosity.
The true essence of Science , :)
does 1 + 1 = 0 surprised to you?
I am very very ignorant in geology but I'm pretty sure data processing plays a huge part in this field. Like idk when reading height data from satellites or measuring seismic activity :)
Geology is good, but be careful of the political brainwashing and follow the money. Stick with the good science and when new information comes, be ready to change your indoctrinated beliefs in geology. this is a youtube guy who is brilliant at predicting earthquakes with science. /user/dutchsinse
Luck favours the prepared mind.
"It can be done in python in 1 line of code"
import HammingCode
i get it i get it!
by the way, a huge shovel of schite to those who count "lines of code per hour"
Two lines
import HammingCode
HammingCode.findError(bits)
@@ultimatedude5686 If you use a semicolon, you can do it in one line.
David L. Q. So everything can be considered as "one line of code"
David L. Q. Isn’t that kind of cheating though?
I kid you not. I'm sitting at the airport, I pull out my phone. I think, "It'd be awesome if there were a new 3B1B video"
So yeah, you're the best
have an "errorless" journey ;P
It's pretty unlikely that exact situation would happen to you or anyone specifically, but given how often he uploads and how many people are excited for the uploads and say "It'd be awesome if", it's pretty likely to happen to someone eventually. I bet there's a 3B1B video on that idea lol
@@PianoMastR64 Lol way to math away the excitement 😆
@@PianoMastR64 I guess it's not surprising that someone wins the lottery every now and then, but it's pretty exciting if it happens to you lol
I was bored sitting in hospital bed after playing tons of Earthbound and Final Fantasy , I pulled out the phone and watched Computerphile, Numberphile and 3B1B videos. Don't regret it at all, time well spent
3B1B in a nutshell: Takes "Impossible" topic, blindfolds you for a second, removes the blindfolds, shows beauty.
Btw I reeeeeally love your work.
Oh, _hey there!_
I agree, this is wonderful.
The interesting thing about the error correcting idea is that it was used as a card trick people may have seen before (I know I saw it when young). Each card has a list of numbers written on them, and another person is asked to pick a number between 1-60 and pick out each card with that number printed on it. The cards each were a binary class as shown in this video, so all you had to do to guess their number was sum the top left number on each card.
I did this as a Maths teacher a few years ago to teach binary arithmetic to kids :)
@jalel @3blue1brown thanks to your comment i grabbed a pack of cards and realized one trick i remembered from childhood functioned was exactly this. i knew this algorithm when i was like 9 or 10 or 11? but i did never connect math with it. this makes it even more beautiful- and to shows me complex stuff can be thought and learned way earlier. you two together invoked beautiful childhoodmemories, thank you guys =)
Yeah I had that when I was younger, and I thought it was so amazing that I saved it from the magic set it came with. I found them again a few weeks ago and figured out the trick, and I gotta say figuring out the solution to something I know baffled young me was a really nice experience.
Any video on this card trick 👀 asking to increase my repertoire of party tricks...
@@jaishkhan7442 you'll have to print out certain cards. First one for example will have 1,3,5,...,59 (only odd numbers). Second will have 2,3,6,7,... (2 or 3 mod 4). And so on. Your last card will be 32, 33, ...
I think that the best part about your videos is that you won't understand something completely unless you pause and work on it yourself. I've seen comments asking you to slow down but I think your pace is perfect for telling me that something is going beyond my head. Then, when I pause and figure it out myself, I'm never going to forget it. Keep up the great content :D
Exactly!
Grant is amazing. So often watching his videos, he explains something and my mind goes "yeah but what about if this strange edge case thing happens??", then every time, grant addresses that exact edge case thing precisely. In short, he leaves no stone unturned, that is, unless the stone is redundant, and doesn't need turning. Super satisfying.
I love to see how clever people can be. Just imagine you standing in front of such a problem and trying to find such an elegant solution!
This reminds me of the following riddle:
The King of a small country invites 1000 senators to his annual party. As a tradition, each senator brings the King a bottle of wine. Soon after, the Queen discovers that one of the senators is trying to assassinate the King by giving him a bottle of poisoned wine. Unfortunately, they do not know which senator, nor which bottle of wine is poisoned, and the poison is completely indiscernible. However, the King has 10 prisoners he plans to execute. He decides to use them as taste testers to determine which bottle of wine contains the poison. The poison when taken has no effect on the prisoner until exactly 24 hours later when the infected prisoner suddenly dies. The King needs to determine which bottle of wine is poisoned by tomorrow so that the festivities can continue as planned. Hence he only has time for one round of testing. How can the King administer the wine to the prisoners to ensure that 24 hours from now he is guaranteed to have found the poisoned wine bottle?
Exactly!
I remember this riddle from my childhood -
and during the video it immediately sprang to mind.
It's kind of shocking to realize that an important concept as this, only discovered in the 50' -
can still be compacted into a riddle for school children.
I'd never heard this riddle! There's my solution below for those who don't want to get spoiled.
It turns out that 999 in binary has 10 digits: 1111100111
So the king just has to label the bottles in binary, from 0000000000 to 1111100111.
Then he gives the first prisoner a glass filled from all the bottles starting with a 1, the second prisoner all the bottles which second digit is a 1, etc. until the 10th prisoner who's given all the odd labelled bottles.
24 hours later, the king writes 1 if the first prisoner died, or 0 if he's alive. To the right of that digit, he writes 1 if the second prisoner died, and 0 if he's alive, and so on to the tenth prisoner.
At the end of this process, the king has written the label of the bottle containing the poison.
@@Ricocossa1 Don't you actually have to take out a bottle, and have that one be the poison if no prisoner dies?
@@maxsnts Well, how do you know which bottle to take out? You can only have them drink once.
Edit: I see what you mean. The bottle you take out is actually the one labelled 0000000000. That one will be in none of the prisoners' glasses.
Incidentally you could also have them drink that bottle. The trick works with up to 1024 bottles. If you have just one more, you'll need 11 prisoners.
I was reminded of a whole family of puzzles involving, say, 100 coins, one of which is counterfeit and weighs less than the rest, and all you have is a balance scale. The most efficient way of weighing them is with a clever grouping which is effectively the same thing as your puzzle's solution
This feels almost too elegant. I mean that I would never expect it to work out this nicely so I would not even put my effort into it and I would never discover all these last tricks.
Seeing a brilliant mind at work (like Hamming in this case) is astonishingly beautiful
The feeling when some problem that you thought was terribly complex, simplifies down to something so concise, is pretty special. It's almost like you've discovered something fundamental about the universe, the first explorer gazing at a new continent. I'm no Hamming, but I've had a few moments like that writing code, where some long block reduces down to a simple formula and you're just like, "aw yeah" hehe
It’s elegant, but very pedestrian. The single bit flip assumption is rather weak. There are much stronger codes in terms of error correction and detection capacities. They involve harder math as well.
Hamming codes were good for the time and a nice intro to coding theory.
Can we dig into Reed-Solomon error correction next? (Multiple-bit and burst error correction used for CD’s, DVD’s, QR codes, RAID-6, etc.)
Yes Plesse 😁
Its to complicated dude
Or maybe cyclic redundancy checks (CRCs).
Ikr wf
And NASA space probes, don't forget those!
I just paused this video at 1:07 because I got literal goosebumps when you said they spell the location. This video is incredible!
I swear the explanations that you make are impossibly elegant, just like some of the things you explain. kinda crazy as I consider myself to be a very slow person and I can absolutely understand the flow of your videos w/o having to rewind. the videos always seem to have immensely powerful lessons as well, where we not only learn about a fun fact but also how it was thought of, how amazing it was, and a separate takeaway other than the thing we're learning. honestly amazing, it's so appreciated, and I absolutely love this channel for it.
Man. When I watch other educational content creators, I usually set the playback speed to 2x. Just because I either don't want to waste time with their overexplaining or the content is so boring but I have to somehow go through it for the lack of other material. This channel has done such an unbelievable job in avoidng both!!! The content and the explaining method are so engaging but without going into too much / too little details that I see myself watching the same video many times on 1x speed.
Thank you for being so amazing. You're literally everything I aspire to be.♥♥♥
Woah realized 'the why' of the relation between the binary bisection and the fact that it actually spells out the position of the cell in binary just before you explained it, that has never happened to me before in one of these videos.
*dopamine boost intensifies*
addiction to math complete.
it's a great feeling.
My "naive" implementation started from the top to keep all possible error locations within a solid interval:
"Error is somewhere between 0 (included) and 16 (excluded). Now is the error in the 2nd half? If not, the new endpoint becomes (0+16)/2 = 8. If it is, the new starting point becomes 8. Then, in which quarter of the array (i.e. which half of the interval) is the error? Halve the interval again, etc. until you have an endpoint that's 1 more than the starting point, and the error is pinned down. But the solution in the video is even more elegant.
For hardware, one could run the data through a circuit where you have 4 XOR gates, and you'd use the index of the bit to turn the gates on/off, so that each gate XORs only half the data. In software, one would XOR the indices of all bits which are 1. Essentially, that's two ways to XOR, by column in hardware and by row in software.
this channel makes so many complicated or high-level topics easily accessible for no cost; you've helped me really *understand* topics that daunted me just reading the video titles. you're fighting the good fight of information accessibility!
Although I studied electrical engineering with focus on communications and most of this is really familiar, it's still fascinating to see it explained and visualized so beautifully. I wish this channel already existed during my studies, that would have made thing so much easier.
In the early 1970's, Hamming spent a year at U C Irvine, working on the second edition of his book. He also taught a class. I'm one of the survivors of that year-long experience. I remember Hamming talking about being forced to invent error correcting codes so he could do (reliable) computation on unreliable hardware. He was brilliant, and a curmudgeon who did not suffer fools well -- I also remember his rant one morning in class when he discovered that some of us had not had a class in complex variable... And then proceeded to give us poor folks an amazingly lucid explanation (that astounded those in the class that had completed complex variable). Hamming's year-long class was one of the highlights of my time at UCI.
reduce() will raise an exception if the list of values to reduce is empty (i.e. all bits were 0 in the Hamming-encoded message). So technically, you should pass 0 (the identity for XOR) as an additional argument:
reduce(ops.xor, (i for i, bit in enumerate(bits) if bit), 0)
That's what I was thinking too.
This is the perfect example of a perfectly right, but definitely unnecessary comment
@@hidroman1993 how ist it unnecessary? It points out a bug in the code and povides a bugfix. The video didn't state the precondition of the message not being all 0
Wow thank you code nazi, maybe the purpose of the video is other than showing a screen full of code
@@hidroman1993 I don't understand why you're upset. Even if the point of a video is to communicate the concept and to induce curiosity.
The comment wasn't rude or condescending, it just presented the facts.
Even if the simplified version is in the video on purpose there's nothing useless about posting the fully correct version.
Hey Grant! Absolutely love your channel, though I'm an electronics and communication engineering grad and now work in consulting, your videos have reignited my love for advanced math and coding. Please never stop making these amazing videos and do upload more topics as your method of explaining such advanced topics is so amazing that even a 6year old can understand them pretty well. LOADS OF Love and Respect for you!
The Haskell programmer in me loved the "one line" reduction (though wanted to write it pointfree), but the C++ programmer in me hated it and wanted to write the 32-bit version as a fixed series of operations in the most efficient manner possible.
Blubwrun
You can rewrite the program in Haskell as a hylomorphism. Making use of the Recursion Schemes library, we can write it as the following;
hammingAlgebra :: ListF Int Int -> Int
hammingAlgebra Nil = 0
hammingAlgebra (Cons i1 i2) = xor i1 i2
hammingCoalgebra :: (Int, [Bool]) -> ListF Int (Int, [Bool])
hammingCoalgebra (_, []) = Nil
hammingCoalgebra (i, (b : r)) = Cons (if b then i else 0) (i + 1, r)
hamming :: [Bool] -> Int
hamming = hylo hammingAlgebra hammingCoalgebra . (0,)
This rendition is also, in some ways, more efficient than the one given in the video, as it avoids using the linear space required to store the enumeration list, only using constant space instead. We can turn this into a point-free implementation, but it won't look too good as the position (i) needs to be copied for both keeping track of position and being fed into xor.
I personally hate list comprehension syntax as it obscures the algebraic structure of what's going on behind seemingly clear but in-fact obscuring syntax sugar.
I have been raised on C-similar languages since 5th grade so anything that isn't completely efficient ticks me off
@@shershahdrimighdelih I've been using Scratch for a few years, and yes, *everything* must be as efficient as possible. Because else it just won't work or will be too slow or non-scalable...:)
xor is a single clock cycle operation, I'm not sure how something like this could possibly be written inefficiently with something that compiles natively. unless you'd do memory allocations in a loop while checksumming something large
Learning about Hamming Codes was such a cool moment in my computer science education along with learning about compression and learning about encryption.
They were so intuitive when someone shows you but mindblowing when you think about it.
I used to play a game called Mastermind where I had to guess the location and colours of 4 pegs using a series of guesses. My method for winning looks a lot like using parity bits.
Ah I remember this game. I think the game is winnable in at most 4 moves
I only know that game because of a minecraft youtuber known as Ethoslab XD
@@shantanunene4389 Depends on the version. I had a version with 8 colors and 5 spaces; I don't know what the number of moves is for that version, but I doubt it's 4
@@Hi_Brien He is a master
Thankyou
Wow. Oh my goodness. I don't know if I have ever been as blown away by the simplicity and elegance of an explanation of any topic on TH-cam. Thank you so much for this video! I understand Hamming codes, and error detection and correction as a whole, far better than I ever have before. I will definitely be "liking and subscribing"!
you have 3.14 million subscribers as of right now, that is milestone goals...
I watched this around when it first came out and I didn't get a thing out of it
about a year later, having been knees deep in trying to make a simple image rendering system using ASCII characters, and I came upon this video again. And it really hits me way harder than it did before, both because I have more coding experience and because that experience told me to truly follow along with the video and play the guessing game as I watched along.
Thank you 3B1B, it truly is elegant.
"Number of bits required is the log base 2 of the bit size." Claude Shannon entered the chat 😂
I've done grad study work on quantum error correcting codes and the concept of code switching between two qubit codes with "gauge qubits" to achieve a fault tolerant gate set. This pair of videos is really well put together, and I selfishly wish you could take your expertise in presenting these elegant ideas, and go much much deeper for the sake of people like me. But alas, you do the best work for reaching a wide audience. For the deep dives at the same level of quality, I guess I have to be the change I wish to see in this world.
Oh good lord. I remember learning this in the 90s. Looking forward to the Reed-Solomon encoding, I don't think we ever covered that.
This style of thinking is beautiful, Hamming you absolute genius.
A big thank you to 3 blue 1 brown for the simplicity of the explanation, you make difficult subjects understandable for people like me.
Great video! The clear and eloquent way you explain it is admirable! The very process of learning give an incredible sense of pleasure, giving another different perspective of the way of thinking and to see the result! Bravo!
Man, this is art. Literally got goosebumps wondering what hamming would have felt when it all came together and made sense. Ignoring the fact that >2errors is not possible but that the redundancy decreases with scale is quite a rewarding feeling to think about.
I've always love Grant's math and style in teaching math (everyone needs more animated Pi's in their life!) but I also appreciate the occasional dips into philosophy and having creative/intuitive/inquisitive worldview, like he did at the end of this pair of videos.
We learned this in class the last year with the more matematical approach and without any sort of explanation of what the calculation we were doing mean.
With 40minutes of vidéo you have explained it much more clearly than 25 hours of course.
So thank you !
I think I dropped a tear when I saw the blue line crossing the whole maze of paths at the end, as I only got where you were going with that animation when you actually finished stating your last message... That's very true to me, and the way you so simply represented it is so simple yet beautiful ; with all those little pi-searchers going into wrong/forgotten directions, and this only pi-stein which is remembered as the big hero of a simplified story.
I like how all of this spawned because of a hardware error nobody wanted to fix.
Side note. This video series was outstanding, and to somebody has has a moderate familiarity with computers a lot of it clicked with
very deliberate and careful guiadances.
Thank you
TH-cam-recommended had me watch part 2 first
maybe because youtube algorithm prefers more recent video
Maybe TH-cam algorithm did not correct its code ;)
@@rohitsrao or maybe its complete GARBAGE
@@j.hawkins8779 yea probably
@@Sohlstyce no, DEFINITELY
Your videos keep impressing me. After spending 18 years in school, and quite a few working in software, I have never seen anyone explain technical stuff as well as you. It's amazing...
Im a mathematician and I'm high. This is pure gold.
Y e s
"a mathematician and high" ... There is a lot of redundancy there ;)
Same
@@travcollier i wish there were more were black, women and lgbt in mathematics
@@hugodaniel8975 Used to be a lot of women in high-level maths. Never been a lack of talent there. Sexism is stupid :(
On race, Europeans never had a monopoly, but there's a very strong cultural component (which is why Inida and Persia were way more advanced on maths than Europe for most of history.) Most of the great work comes from ideas someone has when they are pretty young, so it really helps to grow up around maths. It isn't common anywhere, but in some places there are sort of math-is-cool subcultures. Black nerds sort of 'coming out' these days is promising on that front, but it is a generation timescale thing.
LGBT... Yeah, no reason not. Actually, thinking about it, LGBT might already be fairly or even over-represented. It's more of a case of them always being there, just not being obvious. The norms have shifted really quickly, and the majority of folks in the maths and sciences react to LGBTQ with a sort of shrug... So Jim became Joan, ok, they are still an expert on using differential equations to model ecosystem dynamics (that's a real example BTW).
My mind got blown when you explained how taking the xor of all the 1 bits, using the parity bits to even out to 0000, will give you the position of the error. Beautiful
Thanks for posting this after I graduate (lying down and crying) !!
Hey Grant. Its teachers day in India. You are the best teacher I ever had. Happy teachers day.
Happy teachers day Grant
Beautiful.
However, I'm still waiting for part 3 of "probability of probabilities"
Yeaaah me too...
@@gaeb-hd4lf i wish there were black, lgbt and women programning
Hugo Daniel javascript isn’t racist
No programming language should be racist
@@masonhunter2748 I’m sure we can all agree that if any programming language was racist, it would probably be javascript
I usually don't subscribe to channels, but for you I made an exception. I am a teacher and cannot think of a better way to explain all materials you discuss in your videos :) So I decided to give your videos to my students and I build my lessons on top of your materials. Thank you for your videos and keep up with the good work!
FEEL FREE TO MESSAGE ONE OF MY MOST TRUSTED TRADER DAVID NATHAN TO MAKE GREAT PROFITS IN CRYPTO
+..1...2...0...1.....4.. .1...6....3.....5....7....0...
His strategies are top notch 100% risk free.
The money quote of the video: "Ironically the ideas that most profoundly shape the ways that a future generation thinks will end up looking, to that future generation, simpler than they really are."
I was inspired during a liners algebra class to write all binary logic functions as a composition of just xor and and.
I am so glad you referenced Ben Eater. Also a very good source. You fellows are among the very many brilliant stars in the night sky. Generally a gift to humanity. Thank you for being there for us, and yourselves of course. There should be an encyclopedia of humanities brilliant sources. Again thanks.
Actually these days there are so many showing up, they begin to be hard to keep track of!
Hey. I tried to visualize a (7, 4) bit problem as a 2x2x2 cube, then expandable to higher dimensions, and not a 2x4 rectangle. Instead of the band patterns I get cool half cube divisions in each dimension. It is basically the same, but it is a cool visualization. In case I wasn't clear I can try explaining it better :)
3b1b did mention that idea in the Chessboard video as "a really satisfying way of coloring a hypercube", which is analogous to the (15, 11) Hamming block.
Yep, and visualising a (255,247) Hamming Block is as simple as visualising halves of an 8-dimensional hypercube. It's simple, I really don't get what all the fuss is about.
We do that in school.
I mean, university of Informatics.
i see you watched the computerphile video too
Amazing! I love how you built it up in two videos, one the long, but intuitive way, and then the other one just breaking it down into literally two operations.
“These days many of us are so immersed in thinking about bits and information，but it's easy to overlook how distinct this way of thinking was”～
In the small place where I lived, I believe I was the only kid to study binary over more than 500. But I can't be sure... I was not telling anyone... Considering those children unlikely to do anything beyond class
I was greatly surprised about his relationship with Shannon. I always thought of Shannon as a forgotten genius who published all his results in a 3 page paper and wasn't heard from again. In stark contrast to modern scientists that publish endless pages and articles to boost those citation counts imposed by bureaucrats.
Hey Grant, I just wanted to thank you for framing your videos from the point of view of the discoverer. I hope to one day invent crazy new ideas and your videos strengthen the mental muscles required for such leaps of logic and discovery. I also love that you mentioned the struggle and redundancy of all the things he tried before arriving to this.
I used to work at Pixar (which I remember you visiting) in which I took a machine learning class from Tony Derose in which I asked "what does it feel like to invent math" (In relationship to polygon subdivision), and it warmed my heart how the often somewhat stoic Tony beamed with energy like a 10 year old saying 'It was the greatest feeling in my life'
XOR is an "addition mod 2"
whaaaat, and only know, after 2 years of eletronics AND half of the course of Computer Scientist i know that ??????
I figured it out and I haven't gone to college yet...... It's more important we figured it out. Most people never will.
That's a very elegant way to say it
Yep! If you've studied digital logic circuits at all, here are two more ways to think about it:
1. XOR is the output of a half adder.
2. Hamming codes work on the same principle as using Karnaugh maps to create boolean algebra expressions from bit tables.
Exceedingly cool to see these connecting points between things I think!
also, AND is multiplication. 1*1=1, 1*0=0, 0*1=0, 0*0=0
Easier to consider it a toggle by mask.
I haven't thought of Hamming codes since college (1980s). This is a wonderful description and reminds me how much I love XOR.
7:43 This also beautifully explains why this method can't find an error in position 0: XORing 0000 doesn't change the result, and with the 'correct' result being 0000 from the start, there's just no way to detect a flip there.
I'm a CS grad student, and I find your work nothing short of amazing; really, your videos make my days better, even if I already know the topics at hand. And your linear algebra series *saved* me.
Thank you so much, and keep it up! 🙏
I always get a feeling of satisfaction when I come across an algorithm that gets more efficient as the data grows
"The ideas that most profoundly shape how a future generation thinks will look simple to that generation" That's an awesome idea and I can only wonder how future generations will think about tech like quantum computers and generic engineering, complicated subjects today, but possibly beautifully understood tomorrow.
This is barely related, but the thought of how simple something seems once you’ve seen the final solution, made me think of lightning bolts. In slow motion you can see that lightning doesn’t start out as the perfect, single line bolt (albeit pretty squiggly) we usually imagine, but has thousands of tiny “feeler” bolts before it meets the ground. The final thing we think of is just whichever bolt found the ground first, which is cool to me how that’s like how the correct solution is just the one attempt of thousands that succeeded. The animation at 15:10 is what really brought it home for me :)
5:45 the yellow boxes aren't aligned. I cried when I saw this
That's because of the difference in the number of zeros and ones before those boxes!
TIHI
i was initially very unhappy with standupmaths explanation of the chessboard puzzle solution, but i spent about 2 hours working through the problem and figured it out. best decision ever, it made this and the previous two videos extremely digestible :)
3:50 Ah, that's the bit I found missing in part 1. The fact that the four parity locations are the ones which are only in one group wasn't immediately obvious, at least not to me.
"that's the bit" i thought about a tricky 0 or 1, not about a piece of knowledge lol
As someone who's familiar with binary codes and such, placing things at powers of 2 did seem to make intuitive sense to me, but I didn't realize that each parity bit was _only_ in its group until I started working through the 256-bit version myself.
Hey 3b1b, I just wanted to say thank you for these videos. I was suggesting your work and as I explained why it worked for me, being a visual learner, the more I realized it is because of people like you, who give visual form to the data, that I have had any improvement. Thank you so much!
I'd abolutely take a good visual explanation for reed solomon from you, just the fact that you showed a polynomial and you called it an interpolation have sparked me again with some ideas and interest to go check it out again even if theCD specs and wikipedia make it sounds like black magic.
I loved the lesson, but the way he concludes his videos are so amazing.
"Ironically, the ideas that most profoundly shape the way future generations think, will end up looking, to that future generations, simpler than they really are."
I'm a simple man, whenever I see "Lambda" or "reduce" I click.
> using fold in Python
Guido van Rossum is gonna hunt 3b1b down lol
Lol tru
I dunno I have PTSD from some of the "clever" reduce one-liners I've seen in production code...
This man has a such a great talent on making this mathematical animations.
I hope that, in a near by future they put this software more accessible to other users and professors that would be a revolution in mathematical education.
Congratulations, at this moment you have pi millions of subscribers!
The full video is a hidden gem. One of the best explained yt videos I have ever watched.
So u have completed 2 parts on how to correct errors... Good job
There's a mistake in one of them but you have enough information to see where it was (/s)
6:20 I realized why in a few seconds and then saw the elegance of it all. That's amazing!!
15:09 that's a teaser for path finding algorithms? or maybe random walks
Or a new T-shirt ?
If you want to explore about it, it's called DFS algorithm, pretty simple
I think random walk is the cover of the book! 14:02
shout out to my boy A*
This is very interesting. I can't say that it feels obvious to me.
I'm amazed that somebody came up with something so efficient and elegant.
without the first video i would not have understood any of this at all, so I'm glad you made a version of this explanation that is understandable to somebody with no coding experience.
"All good ideas are obvious in hindsight" - someone but no idea who.
Whoever said that didn't realize how good of an idea that saying is.
@@vigilantcosmicpenguin8721 LOL, but it is obvious in hindsight.
$Kumacoin project is set on a mission to help one MILLION children and beyond through their transaction fee and NFT marketplace built for charity.
It's always easy when you know the answer
Amazing content. I absolutely love the music in the background too! Can't wait for more!
same!
I really hope you do a video on Reed Solomon code, I have been curious about how it works but it always confused me
I remember Grant said this in one of the videos--maybe he didn't say it first, but I first heard it from him...
It is paraphrased like this, "a lot of the times genius ideas and impressive discoveries to problems don't come out of nowhere(it does, when you are just naturally gifted), but comes from continuously seeing similar patterns and problems and having that laying somewhere in your subconsciousness. "
So practice is the way to go...meaningful and intentional practice.
The final takeaway message is so important and highly relevant to the current zeitgeist, as it doesn't only apply to scientific thinking but also moral thinking. What we know now makes it really easy to assume people in the past were stupid, racist, etc, but it couldn't be further from the truth.
"The ideas that most profoundly shape the ways a future generation thinks, will end up looking to that future generation simpler than they really are"
No, people were racist and less intelligent in the past, those facts have been researched thoroughly. It's the entire reason why you can't compare an IQ score from say 1950 to one from 2010 without knowing how µ and σ have shifted.
What Grant is saying is: "Hindsight is 20/20"
@@Ruhrpottpatriot What you are talking about with IQ is called the Flynn Effect and it is highly disputed. What I'm saying is that people in the past used the best tools they had available and built the foundation for the tools and ideas we use today. You're basically saying a caveman is stupid to use a rock to crack open a nut when he should just go to walmart and buy a nutcracker.
People in the past weren't stupid, why would they be? People in the past WERE racist, but I don't think it has to do with the fact they were figuring out the ins and outs of morality. After all, people opposed slavery for example even then. I think it relates more to the status quo and how hard it is to go against the grain. Since people in power benefited from the status quo, they worked to maintain it, and didn't really think of the moral implications or just tried to justify them.
I assure you that even then, if people were made to take a hard look at their stance, and to critically examine it, they would've arrived at the same conclusion as we do now.
You see it at present time too. Veganism is obviously the way to go if we want to protect our planet's resources, even more so if you want to reduce the aggregate suffering in this world because pumping chicken full until their legs break is evidently not moral. However, people are willing tto gloss over that, not think it through because they enjoy meat.
@@HeythemMD Only that Veganism is _actually_ harmful to the human body as you're missing key ingredients, e.g. Vitamin B12 which is *only* found in animal products.
Nobody of sane mind disagrees with people needing to eat _less_ meat (although the type of meat has vast implications for climate, e.g. pork is way better than beef), but no animal products is just as stupid as one steak every day.
@@Ruhrpottpatriot People are not more intelligent, we can't evolve so fast that the brains of our species are more capable after only half a century. IQ tests are far from perfect, and you can score higher on them with study, not to mention they are known to have had cultural biases. The *knowledge* that we have in the modern day is greater because of information passed down to us, but our raw mental ability has not changed.
You cannot claim that you are smarter than newton because you learned the results of his life's work while you were in highschool. You would in no way be able to discover those things on your own were you to live in his time with the resources available to him. It is only easy to understand now because of efficient education techniques used to pass the information on to you.
I’ve been pausing this video to work things out and rewinding to make sure I really understand what I’m hearing. It’s been really elucidating - thanks!!
I remember when I first learned about Gray code and how surprised I was by how recently (relatively) it was invented, It just looks so obvious.
This is amazing. It really blown my mind how smart all these people are..thanks for telling this story !! Please bring more like this, appreciated so much !
"Id like to think of xor as addition mod 2"
Holy moose, that just made something click for me.
At the college no one believed I was able to do the hamming correction by plain sight, and I told them it was like a sudoku. I figured out it was all about regions intersections and xor's and it just clicked for me. That's one of the reasons I love information theory.
Nice video! What about Vectra Coin algorithm review?
There's a professor in my university that can always make students feel how clever an invention is and how one could work towards it without going out of topic (which is very useful, not just for understanding, but also for solving exercises). That's just a part of his ability to make any mathematical topic interesting and only one of the reasons most students in my university like his courses so much.
2 vids so fast? Damn. Must be my bday
This, again, illustrates an idea that has developed in my head over the past several years. It takes a genius to create something new: a new model of physics, a new "math" (such as calculus), a new artistic style, etc. However, it doesn't take a genius to be able to understand and/or USE that new thing.
Amazing!
Thank you so much for the intuitive way of thinking as well as an overview of how it came into being. I must say I have learned in this 16 min more than a 90 min lecture. If only there were more inspiring teachers like you!
The video notification brought happiness to my heart ❤
Same
Thank you! I am literally crying thinking of the utter crapfest that was "taught" in my digital communications class for this amazing idea
I think I’ve said “oh, that’s so smart” like 10 times to myself in this video
It never ceases to amaze me to how powerful the XOR truly is; it's such a simple operation, by virtue of being its own inverse, and not causing under- or overflow, it is so powerful.
pls make video on "" mathematics used in fluid dynamics """
Thanks a lot for this videos.
I am teaching discrete math at Moscow State University. Even though it's not the hardest topic I'm grateful for having a new way to intriduce my students to Hammg codes
Wow I watched the first part before the second part was uploaded!
Yep same 😂
The best illustration on the internet, I appreciate your efforts very much!
fantastic PLEASE do one on the Leech lattice, they're deeply related
I am by no means a math/coding person, and this (along with the first part) was the first thing about coding I’ve actually been able to follow, thanks for going through each and every step!