HNHacker News
TopNewBestAskShowJobs

manchoz

595 karma · joined January 16, 2009

Co-Founder and CEO of Trampoline, I'm working hard to bring digital marketing to its next life through Wi-Fi networks.

Mobile Marketing is the magic spell, here.

In past years I've been involved in software development for self-configuring wireless mesh networks at Wi-Next. Previously I hacked LSCube, an open source multimedia streaming platform project at Turin Polytechnic University.

I'm a long-time advocate for Free Software and Open Knowledge movements.

[ my public key: https://keybase.io/manchoz; my proof: https://keybase.io/manchoz/sigs/JsCRfkYeUsxkGEgNVKT8G_o-2MiLkm4zNQjk9P5wEnE ]

submissionscomments
manchoz··on Ask HN: Cool hardware blogs and new company's in the the hardware space
Blogs

* https://www.cnx-software.com * https://hackaday.com * https://interrupt.memfault.com/blog/

manchoz··on The Death of Arduino?
Arduino official response - https://blog.arduino.cc/2025/11/21/the-arduino-terms-of-serv...
manchoz··on Arduino published updated terms and conditions: no longer an open commons
Arduino official response - https://blog.arduino.cc/2025/11/21/the-arduino-terms-of-serv...
manchoz··on Ask HN: Who is hiring? (March 2024)
Arduino | FAE for European Market | Full-time | Hybrid (Italy) | Turin, Italy | https://arduino.cc

Hey, we are looking for a Field Application Engineer to support our customers and system integrators on Arduino Pro products (HW/SW/Cloud) in the European market.

You can apply here: https://www.linkedin.com/jobs/view/3853489189

manchoz··on CapibaraZero: A cheap alternative to FlipperZero based on ESP32-S3
Very very nice idea!
manchoz··on On a Proof of Inequality of P vs NP based on Boolean gates
The analysis discussed in this study and its previous version is based on a well-known NP-complete problem which is called the "satisfiability problem" or "SAT". From SAT a new NP-complete problem, called "core function", derives; this problem is described by a Boolean function of the number of the clauses of SAT. In this study, a new proof is presented according to which the number of gates of the minimal implementation of core function increases with n exponentially. Since the synthesis of the core function is an NP-complete problem, this result can be considered as the proof of the theorem which states that the class P of all the decision problems which can be solved in polynomial time does not coincide with the class NP of the problems for which an answer can be verified in polynomial time.
manchoz··on Learn Effective C++ for Embedded Code
MbedOS (https://github.com/ARMmbed/mbed-os), the RTOS from ARM, has a very large C++ API (leveraging C/C++ SDKs from hardware vendors).
manchoz··on DreamWorks Animation to release MoonRay as open source
The name actually reminds me of the awesome RenderMan-compliant BMRT https://en.wikipedia.org/wiki/Blue_Moon_Rendering_Tools
manchoz··on Using an Arduino MK1310 with the Helium Network (plus cryptochip usage)
The author shows how to connect a cheap Arduino MK1310 to The Helium Network. The post also shows how to sign and cipher messages using the integrated ATECC508A cryptochip.
manchoz··on The Engineer’s Guide to Matter
There is a lot of marketing-level information about Matter (formerly CHIP), but very few technical breakdowns, so the authors wrote one.
manchoz··on Why AWS loves Rust, and how we’d like to help
Because AWS doesn't have his own fancy language.
manchoz··on Raspberry Pi 4 Review
Wayback Machine: https://web.archive.org/web/20190716140109/https://www.elect...
manchoz··on Poll: HN readers, where's your residence?
Turin, Italy
manchoz··on Poll: Where are you from?
Torino, Italy