Computer Enthusiast • Founder of NXU 💻 @alwaysramcharan♥️ @jharrisjayaraj🤍

Hyderabad, India
No one became poor by giving rich 🫶🏻♥️
Next year, I will give one of my SpaceX shares to every kid in America. This will be the first of many.
27
The Alexander retweeted
Dr. B. R. Ambedkar Ji said: “In a society where Buddhism does not exist, I do not consider it a society at all. Promote this Dhamma as much as possible. If this Dhamma were to disappear from society, the entire human civilization would be in danger.” ☸️🪷
1
30
124
1,554
😂
🤣🤣🤣🤣🤣
40
The Alexander retweeted
A small but important milestone for NXU. We’ve published our ARM64 kernel foundation on main. 🚀 NXU is being built from scratch, one step at a time. There’s still a lot to figure out, and that’s exactly why I want more developers to take a look. I’ve opened a few issues in the repo around areas that need closer review. If you work on kernels, ARM64, memory management, or low-level systems, I’d really appreciate it if you could go through the code and share your thoughts. Point out what’s wrong, what I might have missed, or what could be done better. Honest criticism is welcome — I’d rather catch mistakes early than build on top of them. Repo: github.com/AlexanderRamancha… NXU is just getting started. Let’s build it right. 🛠️ #nxu #kernel
2
4
646
Delight to watch apple animations ✨
This video by Apple has aged like wine in today’s superintelligence era.  2013
27
The Alexander retweeted
Dhirubhai Ambani is an Indian and founder of the Reliance group; he later passed it to his sons, who are Indians too. Mukesh Ambani will pass his businesses to his children. Mukesh Ambani’s children are American citizens, and their children too. @elonmusk was born in South Africa, moved to Canada, launched PayPal, moved to the US, and built SpaceX, Neuralink, Starlink, xAI, Tesla, and other companies. When Elon started these in the US as a Canadian, Ford didn’t call him anti-America, American media didn’t call it a national security issue, and NASA didn’t feel insecure. They welcomed the research and enjoyed the fruits of his innovation. This is how working societies behave: they look at the larger picture and build their nation for the public on the basis that the sky is the limit. In India, billionaires flaunt their religious beliefs to gain support, use media and movies to their advantage, label people, fund parties to buy the people’s resources, and scam money from our products without contributing to research and development. Elon is an innovator; Ambani and Adani are pure Dalals. I believe India is not dumb enough to miss the basic logic.
133
453
2,326
156,682
I believe a network isn’t just about speed. It’s about connectivity. What’s the point of having the fastest internet if billions of people still can’t access it?That’s why Starlink matters. 🌍🛰️The real revolution isn’t making the internet faster for the connected — it’s connecting those who are still disconnected. Speed is a metric. Connectivity is the mission. #starlink #elonmusk @elonmusk
23
It’s that simple 😉
Those abusing Elon Musk over his tweet are free to delete X from their phones. Use it again when India builds its own X. Until then, stop lecturing the owner of the platform while happily using it every day with Deshbhakti.
19
The Alexander retweeted
Orange >>>>>>>>>>>>
2
103
766
14,678
The Alexander retweeted
🔥🔥
40
74
429
5,499
NXU — Not eXactly Unix FROM MACHINE TO COMPUTATION CHAPTER 01: THE MACHINE THAT ARRIVED IN A DREAM At 2:17 a.m., Jenny fell asleep with a question that refused to leave him alone. How was a computer created? Not how to use one. Not how to write software for one. How did humanity take lifeless matter—metal, electricity, silicon—and make it follow instructions, manipulate information, and perform calculations? Outside, rain tapped against the windows. The room was dark. Jenny closed his eyes. And the machine appeared. It stood in the darkness like something impossible: a silent object capable of calculations, memory, and decisions. No keyboard. No screen. No visible human controlling it. Then the machine began to disappear. Its silicon dissolved into metal. Its circuits became gears. Its screen vanished into paper covered with mathematical tables. A name emerged from the darkness. CHARLES BABBAGE — MATHEMATICIAN AND MECHANICAL COMPUTING PIONEER. London, 1820s. Errors in mathematical tables were a serious practical problem. Astronomers, navigators, and engineers depended on calculations that human beings had laboriously prepared. A single mistake could travel through a table and become someone else’s mistake. Babbage imagined a different future. What if a machine could calculate those tables mechanically, reducing the dependence on error-prone manual work? His Difference Engine was designed to calculate values using the method of finite differences. Work on a portion of the machine demonstrated that the idea was mechanically real—but the full project was never completed as originally intended. Then came the more astonishing leap. In 1837, Babbage described the Analytical Engine: a general-purpose mechanical computing design with a store for numbers, a mill for operations, and a mechanism for controlling the sequence of calculations. It was not merely a better calculator. It pointed toward a machine whose operations could be directed by instructions. But the Analytical Engine was never completed in Babbage’s lifetime. The dream had revealed its first twist: an idea can be technically meaningful long before engineering, manufacturing, money, and practical construction catch up with it. Then another name appeared. ADA LOVELACE — MATHEMATICIAN AND WRITER ON THE ANALYTICAL ENGINE. In 1843, Lovelace published extensive notes on the Engine, including a procedure for calculating Bernoulli numbers. Her work explored something more profound than arithmetic: a machine could manipulate symbols according to rules, provided those symbols and operations could be represented in a form the machine could process. The machine did not need to understand the meaning of a number. It needed a mechanism that could operate on its representation. Jenny watched the gears turn in his dream. A machine had been imagined. A method of directing its operations had been explored. But the machine still depended on an unanswered question. How could a physical mechanism represent a decision? How could matter be arranged so that one condition produced one result, and another condition produced a different result? The gears stopped. A book opened in the darkness. Its author had never built a computer. He had done something stranger. He had tried to express the laws of reasoning in mathematics. Next: Chapter 02 — When Logic Met Electricity. #NXU #computer #software
1
116
NXU — FROM MACHINE TO COMPUTATION CHAPTER 02: WHEN LOGIC MET ELECTRICITY In Jenny’s dream, the gears of Babbage’s machine began turning backwards. Metal became symbols. Symbols became equations. The equations filled a blackboard in a room that belonged to another century. At the centre stood a name. GEORGE BOOLE — MATHEMATICIAN. In 1847, and more extensively in 1854, Boole developed an algebraic approach to logic. He showed how logical relationships could be represented and manipulated through mathematical rules. He was not building a digital computer. He was creating a way to reason symbolically about logic. At the time, the connection between this mathematics and future electronic machines was not yet the familiar one it would become. Then history made an extraordinary connection. The year was 1937. At MIT, CLAUDE SHANNON — MATHEMATICIAN AND ELECTRICAL ENGINEER — completed a master’s thesis connecting Boolean algebra with electrical switching circuits. An electrical relay could occupy distinct physical states: its contacts could be open or closed. By arranging relays into circuits, engineers could make electrical behaviour implement logical operations. AND. OR. NOT. The symbols on Boole’s blackboard could now help engineers reason about physical arrangements of switches. Shannon’s thesis, published in 1938, showed how Boolean algebra could be used to analyse and simplify relay and switching circuits. Consider what had happened. Boole had developed mathematics for logical relationships. Shannon recognised how that mathematics could describe the behaviour of electrical switching circuits. The connection did not make a relay intelligent. It made its behaviour designable, predictable, and composable according to logical rules. A circuit could combine conditions. Circuits could be combined into larger circuits. Those arrangements could implement arithmetic and other operations. The computer was no longer only a mechanical dream. But there was a catch. A circuit designed to perform one fixed sequence of operations would not automatically become a different machine when a new problem arrived. The physical arrangement still mattered. How could a machine become flexible? How could the same hardware perform different calculations without engineers rebuilding its logic for every new task? Jenny watched a wall of relays click in the darkness. Thousands of tiny physical decisions, each following the behaviour permitted by its electrical arrangement. And suddenly, the problem became clear. The challenge was no longer simply to build a machine that could calculate. It was to separate the machinery that performed operations from the instructions that selected those operations. That separation would change everything. Yet another discovery was waiting in the shadows: even a machine that could follow instructions would need a way to preserve information between operations. Without memory, every result would vanish into the past. With memory, a machine could retain data—and instructions. But memory would create a new danger. If a machine could change what it remembered, what would prevent it from changing the wrong thing? Jenny’s dream grew darker. The next machine would not merely calculate. It would execute instructions—and sometimes, those instructions would be wrong. Next: Chapter 03 — The Machine That Needed Boundaries. #NXU #Computer #software
1
43
Chapter 3 -— The Machine That Needed Boundaries In 1936, Alan Turing, a British mathematician, asked a question that would change how we understand computation: What does it actually mean for a problem to be computable? His answer was not a physical machine, but a mathematical model of one: a machine that follows simple rules, reads symbols, changes them, and moves through a sequence of steps. The surprising discovery was that even a system built from simple operations has fundamental limits. Some problems cannot be solved by any algorithm of the kind he described. But another question remained. What happens when computation moves from mathematics into a real machine—with physical memory, multiple processors, interruptions, and programs that must not interfere with one another? By the mid-twentieth century, stored-program computers were emerging. The 1945 First Draft of a Report on the EDVAC, associated with John von Neumann, helped describe an influential architecture in which instructions and data could reside in memory. Many researchers contributed to the ideas and machines that made this possible. As computers grew more capable, engineers needed ways to organise execution. Concepts such as processes, threads, and schedulers emerged to solve practical problems: managing independent work, sharing processors, and controlling when computation runs. These concepts are not laws of nature. They are human-designed abstractions built on real hardware mechanisms. That distinction matters. An abstraction may be useful, even essential, for a particular design. But its name alone guarantees nothing. We must ask what mechanism implements it, what properties that mechanism enforces, and what happens when something goes wrong. Years later, Jenny began asking a related question while building NXU. What if we started not with the familiar vocabulary of operating systems, but with the machine itself? A processor has architectural state. Memory has physical boundaries. Translation hardware enforces access permissions. Exceptions redirect execution. Timers measure time. Interrupt controllers deliver events. These are mechanisms we can investigate and test. NXU’s experiment is to discover how much useful computation and isolation can be built from such facts—and which higher-level abstractions are genuinely necessary. Its terms—Room, Wall, Edge, Fabric, and Pulse—must face exactly the same scrutiny. New names are not new science. Each concept must correspond to a mechanism, provide a measurable guarantee, and survive adversarial testing. The current NXU prototype is only an early experiment, not a completed operating system or a proven replacement for existing designs. And that is where the real mystery begins. If the machine provides mechanisms, and humans invent abstractions to organise them, how do we distinguish what computation truly requires from what generations of engineers simply became accustomed to building? That question began NXU. #NXU #computer #software
18
NXU — FROM MACHINE TO COMPUTATION CHAPTER 02: WHEN LOGIC MET ELECTRICITY In Jenny’s dream, the gears of Babbage’s machine began turning backwards. Metal became symbols. Symbols became equations. The equations filled a blackboard in a room that belonged to another century. At the centre stood a name. GEORGE BOOLE — MATHEMATICIAN. In 1847, and more extensively in 1854, Boole developed an algebraic approach to logic. He showed how logical relationships could be represented and manipulated through mathematical rules. He was not building a digital computer. He was creating a way to reason symbolically about logic. At the time, the connection between this mathematics and future electronic machines was not yet the familiar one it would become. Then history made an extraordinary connection. The year was 1937. At MIT, CLAUDE SHANNON — MATHEMATICIAN AND ELECTRICAL ENGINEER — completed a master’s thesis connecting Boolean algebra with electrical switching circuits. An electrical relay could occupy distinct physical states: its contacts could be open or closed. By arranging relays into circuits, engineers could make electrical behaviour implement logical operations. AND. OR. NOT. The symbols on Boole’s blackboard could now help engineers reason about physical arrangements of switches. Shannon’s thesis, published in 1938, showed how Boolean algebra could be used to analyse and simplify relay and switching circuits. Consider what had happened. Boole had developed mathematics for logical relationships. Shannon recognised how that mathematics could describe the behaviour of electrical switching circuits. The connection did not make a relay intelligent. It made its behaviour designable, predictable, and composable according to logical rules. A circuit could combine conditions. Circuits could be combined into larger circuits. Those arrangements could implement arithmetic and other operations. The computer was no longer only a mechanical dream. But there was a catch. A circuit designed to perform one fixed sequence of operations would not automatically become a different machine when a new problem arrived. The physical arrangement still mattered. How could a machine become flexible? How could the same hardware perform different calculations without engineers rebuilding its logic for every new task? Jenny watched a wall of relays click in the darkness. Thousands of tiny physical decisions, each following the behaviour permitted by its electrical arrangement. And suddenly, the problem became clear. The challenge was no longer simply to build a machine that could calculate. It was to separate the machinery that performed operations from the instructions that selected those operations. That separation would change everything. Yet another discovery was waiting in the shadows: even a machine that could follow instructions would need a way to preserve information between operations. Without memory, every result would vanish into the past. With memory, a machine could retain data—and instructions. But memory would create a new danger. If a machine could change what it remembered, what would prevent it from changing the wrong thing? Jenny’s dream grew darker. The next machine would not merely calculate. It would execute instructions—and sometimes, those instructions would be wrong. Next: Chapter 03 — The Machine That Needed Boundaries. #NXU #electricity #silicon
1
37
Chapter 1 — The Machine That Needed Boundaries In 1936, Alan Turing, a British mathematician, asked a question that would change how we understand computation: What does it actually mean for a problem to be computable? His answer was not a physical machine, but a mathematical model of one: a machine that follows simple rules, reads symbols, changes them, and moves through a sequence of steps. The surprising discovery was that even a system built from simple operations has fundamental limits. Some problems cannot be solved by any algorithm of the kind he described. But another question remained. What happens when computation moves from mathematics into a real machine—with physical memory, multiple processors, interruptions, and programs that must not interfere with one another? By the mid-twentieth century, stored-program computers were emerging. The 1945 First Draft of a Report on the EDVAC, associated with John von Neumann, helped describe an influential architecture in which instructions and data could reside in memory. Many researchers contributed to the ideas and machines that made this possible. As computers grew more capable, engineers needed ways to organise execution. Concepts such as processes, threads, and schedulers emerged to solve practical problems: managing independent work, sharing processors, and controlling when computation runs. These concepts are not laws of nature. They are human-designed abstractions built on real hardware mechanisms. That distinction matters. An abstraction may be useful, even essential, for a particular design. But its name alone guarantees nothing. We must ask what mechanism implements it, what properties that mechanism enforces, and what happens when something goes wrong. Years later, Jenny began asking a related question while building NXU. What if we started not with the familiar vocabulary of operating systems, but with the machine itself? A processor has architectural state. Memory has physical boundaries. Translation hardware enforces access permissions. Exceptions redirect execution. Timers measure time. Interrupt controllers deliver events. These are mechanisms we can investigate and test. NXU’s experiment is to discover how much useful computation and isolation can be built from such facts—and which higher-level abstractions are genuinely necessary. Its terms—Room, Wall, Edge, Fabric, and Pulse—must face exactly the same scrutiny. New names are not new science. Each concept must correspond to a mechanism, provide a measurable guarantee, and survive adversarial testing. The current NXU prototype is only an early experiment, not a completed operating system or a proven replacement for existing designs. And that is where the real mystery begins. If the machine provides mechanisms, and humans invent abstractions to organise them, how do we distinguish what computation truly requires from what generations of engineers simply became accustomed to building? That question began NXU. #NXU #software #osdev
17
The Alexander retweeted
जय भीम 💙🔥🔥✊
78
373
2,658
30,470
What if we’re starting OS design one abstraction too high? Instead of assuming processes, threads and schedulers, start from what the hardware actually gives us — execution state, memory, events and time. Can useful computation emerge from that without recreating the same abstractions? That’s what I’m exploring with NXU. #NXU #lowlevel #Kernel
Made with AI
2
59
The Alexander retweeted
India is a Corrupt Country
260
1,660
6,449
269,565
Probably the best feeling ever for programmers 😂💻
That feeling 😭🥀
1
99