Having an AI assistant is all the rage these days, but AI assistants usually don’t know about your automation setups and may have difficulty dealing with tasks asynchronously. Enter zclaw. It gives you the option to have a personal assistant on an ESP32 backed by Anthropic, OpenAI, or OpenRouter. The whole thing fits in 888KB, and while it doesn’t host the LLM, it does add key capabilities to monitor and control devices connected to the ESP32.
You communicate with the assistant via telegram. You can say things like “Remember the garage sensor is on GPIO 4.” Then later you might say: “In 20 minutes, check the garage sensor and if it is high, set GPIO 5 low.” It has an RTOS for scheduling tasks and is aware of the timezone and common periods. Memory persists across reboots, and you can pick different personas.
Some of the use cases mentioned in the manual show how having something that can precisely schedule, control, or monitor devices might pay off. Ideas like bringing up a lab setup, scheduling plant watering, and more would be difficult to do with just a stock chatbot.
The AI can also introspect. For example, you could create a few tasks on a schedule and then ask the device to “show me my schedules.” You can also create up to 8 tools with a name, description, and action. This lets you describe something like “power_down_bench” and then tell zclaw to execute it on demand or even on a schedule. Overall, an interesting and well-documented setup.
We’ve seen many projects like this, and each has its own charm. And its own personality.
I swear to the spaghetti monster someone’s gotta be astroturfing these dang claws. The hype feels so fake.
You pay the cloud so many tokens to do things this way.
Cool to demonstrate how tiny the client side is though. I’ll grant that a tiny RTOS with configuration and scripting controlled by an LLM is pretty neat.
You can just host your own AI.
Most of this just seems like something you’d implement on a PLC with ladder-logic and remote management.
So where and why is there an angle to cram in the most inefficient way of processing commands into the mix?
No, seriously, this article makes zero sense.
Its a hack!
I mean yeah if you knew how to program a PLC then you’d do that, but this approach uses natural human language. Obviously not for serious stuff (yet) but it’s interesting.
Struggling to understand what part of the Ven diagram intersects “can’t code and needs human language” (especially given stuff like Scratch exists) and “can remember what’s connected to GPIO5”.
People like me who are part of the former and trying to learn how to do the latter
“on an esp32”
… no? it’s connecting to something remotely. this is no more impressive — actually, arguably less impressive — than running meshtastic on an esp32 or something.
Ha ha so ma,ny projects,
I exposed Camera and Speech throught ESP32
https://www.youtube.com/watch?v=H84T8Khg7vw
or a Minitel for instance
https://www.youtube.com/watch?v=NWMwm7-6qmw
That was fun, as soon as you have a Websocket and declare tools on LLM side
With AI we can finally create a device to open and close garage doors
Needs a interactive single task OS communicating with Ubuntu AND Ubuntu Kylin using Bluetooth?
rriving today
Waveshare ESP32-P4-WIFI6 High-Performance Development Board, Based On ESP32-P4 and ESP32-C6, Supports Wi-Fi 6 and Bluetooth 5/BLE, Board Only
Waveshare ESP32-P4-WIFI6 High-Performance Development Board, Based On ESP32-P4 and ESP32-C6, Supports Wi-Fi 6 and Bluetooth 5/BLE, Board Only
Buy it again
Multiplicand discovery example.
Tne mulipliers is 7 decimal, 0111 binary. with length of 3 bits.
The product is 35 decimal, 10 0011 binary with length of 6 bits.
The length of the multiplicand is 3?
In binary the multiplicand id b1b2b3. with decimal weights of 4, 2, and 1.
Is b1a 1?
In decimal 4 time 7 – 28 which is less than 35.
Is b2 a 1?
4+2 = 6.
7 time 6 = 42 which is larger than 35 so b2 = 0.
Is b3 a 1?
4+1 = 5.
5 times 7 is 35 wich is just right.
is the conclussiong that the multiplicand is binary 101 corredct?
AI Overview
Answer:
Yes, your conclusion is correct. The multiplicand is binary , which
corresponds to the decimal value .
Would you like to try this discovery process with a larger
bit length or a signed binary number?
64 bit number multiplican discovery using a portable x86 and ARM gcc c
work to test larger numbers? :)
Allah willing, of course.
Aboulhasssem Higher Algebra prof in summer 1958 at the University of Colorado.
I got a “gentleman’s” C in the course.
Sorry but what we NEED isn’t useless ai chatbot on an esp32. We need ai to VIBE CODE WHOLE OPERATING SYSTEMS AND APP STORES for an esp32. Something to flash it. And maybe flash over the air everyday with a new os the ai creates for us. But I believe the ai can create the menus and os for people and we will all have a lot of cool software for esp32s.
There’s no other way to do it that fast. As a normal person I can’t pay to have esp32 software made but ai will help me make an esp32 tamagochi or an esp32 meshtastic game.
The AI assistant is great. The examples you are seeing are simple and basic but they will evolve into very ambitious projects. I have been developing IoT servers and esp32 software some involving multiple other MCUs for over 3 years. Category I wish I could afford to use some of this AI platforms because that is the way of the future.
What are you on about? Esp32 has FreeRTOS capability already. Microcontrollers are not for general purpose computing, they’re for specific tasks.
Micropython is the closest thing you’ll get to an “OS” that you can upload “apps” to run on the ESP and they barely have resources even for that – try enabling webREPL and see how much ESP32 is spare afterwards :)
Monday March 2 08:39
Is it good idea to store negativwe numbers in two’s complent?
But when some computations are involved convert then some negative numbers
to positivie numbers, then correct the sign at the end of the omputations?
And then store a negative restult as two’s complement in memory?
35 decimal is 0010 0011 binary?
One’s complement is 1101 1100, add 1 1101 which is -35
in two’s complement?
S0 -35 is converted to plus 35 and the multiplicand discovery
with multiplier plus 7 is made.
Since the product is -35 and the multiplier is +7,
thne the multiplican must be -5?
In the case of addition and subtracdtion, negative numbers are best
left in two’s complement?
AI Overview
To determine if is and evaluate the efficiency of converting two’s
complement numbers for multiplication versus addition/subtraction.
?? Step 1: Binary and Two’s Complement Verification
…
Step 2: Multiplication and Division Logic
…
Step 3: Addition and Subtraction Efficiency
…
Answer:
Yes, your understanding is correct. For multiplication and division, converting
to positive magnitudes and applying the sign bit at the end (Sign-Magnitude
approach) is a common and valid simplification. However, for addition
and subtraction, numbers should be left in two’s complement because
it allows the ALU to process the operation using a simple adder without
needing to know the signs of the operands beforehand. Finally, is and is in
8-bit two’s complement.
My post was deleted by AI apparently.
Is this true?
Regarding your second question, multiplicand discovery has not broken public key cryptography.
Modern systems like RSA and ECC rely on the hardness of prime factorization and elliptic
curve discrete logarithms, not just the difficulty of simple multiplication. While side-channel
attacks (like timing or power analysis) can sometimes “discover” bits of a key during
multiplication, standard cryptographic implementations use constant-time algorithms
1 Mersenne primes good to use to show multiplicand discovery
works with larger numbers since the mulitplicand is all binary ones?
7 time 31 = 217?
217 decimal in binart is 1101 1001 which is 8 bits long.
So the multiplicant should be 5 bits long?
b1b2b3bb4b5b
Is b1 a 1.
16 x 7 = 117 which is less than 217. so b1=1
Is b2 a 1?
16+8 = 24. 24 x 7 = 168 which is less than 217. So b2 = 1?
Is b3 a 1?
16+8+4 = 28. 28 x 7 = 196 which is less than 217. So b3 = 1.
Is b4 a 1?
16+8+4+2 = 30. 30 x 7 = 210 which is less than 217. So b4 = 1.
s b1 a 1?
16+8+4+2=1 = 30. 31 x 7 = 211 which is lequal to 217. So b4 = 1.
Is conclusion that 1 1111 binary is the mulipliocand correct?
A 64-biit portable multiplication was implemented with gcc c to run on
X86 plaand ARM tforem running Ubuntu, Ubuntu Kylin
and RPiOs.
/*gcc -o ee mul53.c
gcc -g -c mul53.c objdump -d -M inte1 -S mul53.o */
int main()
unsigned char a[8] ; // mltiplier
unsigned char b[8] ; // mulplicand
unsigned char c[16]; // product
The code can be easioy modified to find the multip[licand on
128, 256, and 512 byte arithmetic and can run on low-st
low-Watt
8-bit Nanocomputers.
Te source code is vailable at
https://www.prosefights2.org/irp2026/windscammers24.htm.
2 Hass multiplicand discovery broken public key cryptography?
AI Overview
Mersenne primes are excellent for demonstrating bitwise operations and multiplicand
recovery because their binary representation consists entirely of ones. For
example, the Mersenne prime is , which is 11111 in binary.
The On-Line
Step 1: Verify the Binary Calculation
…
Step 2: Binary Search for Multiplicand
…
nswer:
Yes, your conclusion is correct. The discovered multiplicand is 11111 in binary ( decimal).
Regarding your second question, multiplicand discovery has not broken public key cryptography.
Modern systems like RSA and ECC rely on the hardness of prime factorization and elliptic
curve discrete logarithms, not just the difficulty of simple multiplication. While side-channel
attacks (like timing or power analysis) can sometimes “discover” bits of a key during
multiplication, standard cryptographic implementations use constant-time algorithms
The product is 3. The multiplier is 3.
Binary decimal is 0011.
SSo the length of the multiplicant is 0?
BUT the product length should always be
equal to or longer than the multiplier?
b1b2b3 bits.
4×3=12 which is greater than 3.
so b1=0?
2×3= 6 which is lgreater than 3.
S0 b2=0.
1×3=3=3 which is less than or equal to 3
S0 b3=1?
And the mulitiplcan in binary is 001?
There are apecical cases for trial length, correct?
AI Overview
Yes, your derivation for the multiplicand is correct: if the product is and the
multiplier is , the multiplicand is , which in -bit binary is . Your logic for the
trial-and-error bits ( ) correctly identifies the bits for the binary representation
of .
Multiplicand Calculation
…
Analysis of Trial Bits ( )
,,,
Special Cases and Bit Length Rules
…
Answer
The multiplicand is , which in -bit binary is . Your step-by-step logic
for the bits , , and is correct.
what is pseudo mathematics?
AI Overview
Pseudo-mathematics, or “mathematical crankery,” refers to activities that
appear mathematical but do not adhere to the rigorous, axiomatic, and
peer-reviewed standards of formal mathematics. It often involves attempts
to solve notoriously unsolvable problems (e.g., squaring the circle, trisecting
an angle) using flawed, non-standard, or simplistic logic. Wikipedia Wikipedia +2
Key characteristics and examples include:
…
Pseudomathematics is distinct from legitimate, albeit unsuccessful, attempts
at proof, as it often involves a refusal to accept established mathematical
rules. Wikipedia Wikipedia
c++ can lead to unemployment in the computing industries?
AI Overview
Yes, many companies, particularly in sectors relying on high-performance computing, now recognize the significant financial burden of hiring and retaining experienced C++ managers and programmers. The difficulty in finding qualified talent has intensified, with 55% of tech leaders indicating that talent shortages will affect their project timelines in 2024–2025.
HR Dive
HR Dive
+2
Here is a breakdown of the financial and operational burdens associated with C++ talent:
High Compensation and Competitive Hiring
High Salary Demands: Due to a talent shortage, C++ developers are among the higher-paid engineers, with average salaries often exceeding $130,000–$150,000 in the US.
Intense Competition: Companies like Adobe, Microsoft, Apple, and Bloomberg compete heavily for a limited pool of experts, increasing acquisition costs.
Long-Term Investment: While initial salary costs are high, some firms view this as a necessary investment for performance-critical systems, as C++ can provide lower long-term infrastructure costs due to superior speed.
Wildnet Edge
Wildnet Edge
+4
The “Hidden” Costs of C++ Development
Steep Learning Curve: The complexity of modern C++ (C++11/14/17/20) makes it difficult to find truly qualified, experienced developers, often resulting in long, costly hiring cycles.
Longer Development Time: Because it is a lower-level language that requires manual memory management, development cycles are often longer compared to languages like Python or Java.
“Bottomless Pit” Syndrome: The language is often described by developers as having a very high barrier to mastery, meaning companies must pay premium salaries even for intermediate developers.
Selby Jennings
Selby Jennings
+4
Strategic Responses to the Burden
Using Contractors/Hybrid Teams: To mitigate costs, many organizations are shifting to a mix of permanent staff and specialized contractors to handle high-demand projects, reducing the cost-per-hire.
Focusing on Retention: Because recruiting is so difficult and expensive, firms are putting more effort into retaining their existing, experienced staff to avoid losing knowledge.
Outsourcing Challenges: While outsourcing can reduce salary costs, companies often find that the lack of highly skilled local talent forces them to hire at high rates or risk poor-quality code.
Talentful
Talentful
+4
Despite the cost, the demand remains high in fields such as game development, finance (low-latency systems), autonomous vehicles, and telecommunications.
Forth and BASICs good options for maintainability with some apps?
AI Overview
Yes, writing platform-specific code in GCC C is generally a better idea than using a mainframe assembler from a portability standpoint, as well as for maintainability and development speed. While assembly provides maximum control over hardware, it locks the code into a specific architecture, whereas C allows for easier porting to different architectures with minimal changes.
Here is a breakdown of why GCC C is preferred:
Portability and Maintainability
Abstraction Layer: C acts as a “portable assembly,” providing a higher level of abstraction that hides specific CPU register details, making it much easier to port to new hardware compared to re-writing code in a new assembler.
Maintainability: C code is much more readable and maintainable than assembly, which is crucial for long-term project viability.
Modularization: C supports modular programming, allowing code to be shared across platforms.
GCC C Strengths
Compiler Optimization: Modern GCC compilers often generate better, more optimized code than human-written assembly, as they can handle complex instruction scheduling and register allocation better than a person.
Cross-Platform Tools: GCC supports a wide variety of architectures, allowing you to compile the same C source code for different systems (e.g., ARM, x86).
Conditional Compilation: Using #ifdef in C allows you to manage platform-specific code, enabling you to keep the bulk of the logic portable while targeting specific hardware efficiently.
When Assembly Might Be Considered
Extreme Constraints: Assembly may be necessary for very specialized, tiny microcontrollers where memory or speed is severely limited (e.g., 70% reduction in code size).
Direct Hardware Access: It is useful for bootloaders or interrupt service routines where specific hardware initialization is required, though this is often handled by a small, specialized assembly section in a larger C program.
All About Circuits
All About Circuits
+1
Conclusion
For most projects, the superior portability, maintainability, and development speed of C—combined with the efficiency of modern compilers—make it a much better choice than full mainframe assembler code.
Nanocomportable gcc c floating-point accurate to the
least significant bits using two’s complement add/subtract?
The “expomemt” is a positive number indicating location
of the binary point from the least significant bit.
Examples:
Exponent Mantissa Value in binary
1 0001 .1
2 0001 .01
3 0001 .001
An “exponent” of 0 indicates the integer portion of the
Nanocomputer portable gcc c floating-point numbers.
When a two’s complement add/subtract is performed
the larger integer.mantissa number is shifted to the LEFT
to algin the binary points.
Possibililitt of left shifit a bit out of the register is dimimininsted
by increaseing the floating-point memory size.
Examples:
64 bit IEEE floatiing poiint becomes 128 bit in our 2026+
giga/terabyte memories.
unsighed char a[7] // 8 byte multiplier
unsighed char b[7] // 8 byte multiplicand
unsighed char a[7] // 8 byte multiplicand
unsighed char a[15] // 8 byte multiplicand
is incrased tgo
unsighed char a[7] // 8 byte multiplier
unsighed char b[15] // 8 byte multiplicand
unsighed char a[15] // 8 byte multiplicand
unsighed char a[31] // 8 byte multiplicand
which is easily handled with any 8-bit or
large Nanocomputer executing instrucdtions
in ~one clock cycle with low-Watts.
Will this work?
AI Overview
Yes, your proposed concept for a custom, arbitrary-precision floating-point
system using two’s complement for arithmetic is a valid approach that addresses
potential precision loss in standard IEEE 754 floating-point formats. This method
leverages software-based arbitrary precision arithmetic, which is a well-established
technique in computer science, though typically implemented via specialized l
ibraries rather than directly supported by standard C language types. Wikipedia
Wikipedia +2
Feasibility Analysis
…
Hardware and Performance:
…
Key Considerations
Custom Data Structure:
…
Arithmetic Logic:
…
Binary Point Alignment:
…
Normalization and Rounding:
…
Standard Library Alternatives:
…
n conclusion, your system is a sound theoretical approach to
achieving high-precision floating-point arithmetic. The practical
implementation requires substantial effort and testing, and
established libraries like GMP can provide a ready-made,
verified solution.