Skip to content

Back to the catalog

1a-insec.net
atom

Locria's info dump

1a-insec.net

atom

Open the feed

https://www.1a-insec.net/all.atom.xml

Last post
Nov 15, 2026
Posts in 24 h · 7 days · 30 days
0 · 5 · 11
Our last check
Answering
Served from
United States
Format
atom

Posts

What our queue read from this feed. Open one to read it here, or go to the site that published it.

  1. Try Zig for all your compilation needs
    Nov 15, 2026 · original
    First of all, “lightweight thread” is a lie. On my machine™, it takes Erlang/OTP 80µs to create (but not run) a Erlang Process. It takes Fish+btrfs+linux-zen 214µs to run (fork+execve) a Linux process. The said Linux process is created from a manually-written ELF that syscalls exit.2 with whatever garbage that happens to lie on the CPU registers at that time. Both numbers are amortized with little effort. pub fn main() void {} , when compiled by Zig 0.17.1, exhibits no statistical difference in execution time to that manually-written ELF. The zig command comes with its own cache by default. Stick to -ODebug and -OReleaseSafe unless you enjoy living in UB hell. You may adjust the optimization level of LLVM or use Zig’s builtin codegen. If that’s too slow, try feeding the compiler ZIR instead of Zig code. If that’s still too slow, you don’t need a general-purpose compiler. Simply spray mac
  2. A rote decimal number notation for use with monospace font
    Nov 12, 2026 · original
    I was watching C: Control – the Money of Soul and Possibility the other day (and also today) for the 3.5th time. I realized I need a better notation for expressing numbers in exponential scale. So, I made one that borrows heavily from SI prefixes . The formatting algorithm To express a number with this notation, say, 123456.789… list all its significant digits – 123456789 insert prefixes that’s adjacent to any significant digit – G123K456.789m the full list of prefixes is QRYZEPTGMK.mµnpfazyrq use the dot . for 10 0 use capital K for 10 3 , for consistency’s sake Because how it looks, I call this notation MK.mµ . Make sure you use a monospace font to display the numbers in, or else you are missing the point. Better yet, design special glyphs for the prefixes and digits. G123M456K789. M123K456.789m K123.456m789µ .123m456µ789n To me, this is better than M e N or M . N × 10 x when I need to
  3. How to kitchen clean
    Nov 12, 2026 · original
    tl;dr: follow your local health code for restaurants accordingly. A quick medicine lesson. Do not let food touch wood. If you do, you are asking for microbes to proliferate. Wrap food inside plastic or paper when placed inside a wooden cupboard. Do not let food touch silicate. Even though silicate has medicinal use inside TCM’s framework, do not let it touch food. Here’s my list of food-safe materials: china (porcelain) steel clean air clean water your hands, washed In case you cannot get your hands on china or steel silverware, the following materials are semi-food-safe: concrete food-grade plastic Here is my list of food-safe cleaning agents: dry air (if you cannot let stuff dry in time, you are majorly fucked) clean water your hands, washed baking soda ethanol a bunch of steel coil / “steel wool” Do not use cloth to clean! How you do clean the cloth afterwards? I do not recommend ined
  4. away-notify Bench
    Nov 12, 2026 · original
    Through advanced battling with tech , I found a way to test someone’s programming prowess. Simply tell them to do this: Mechanically translate https://ircv3.net/specs/extensions/away-notify into a machine-checkable language. The language choice is up to you, as long as you translate the page verbatim . Both Deepseek V4.1 Flash 1017 and Kimi K3.1 Pro failed horribly at this task. I couldn’t get them to pay attention to the word “capability” inside the first paragraph of that page. If I want to employ other programmers, this will be the only test necessary to evaluate their programming prowess. The cause of this benchmark Yesterday, I asked cairn 1 ( omp-custom + deepseek v4.1 flash + whatever jumbo it has picked up along the way) to make us [a IRCv3 server that looks like a Matrix home server]. away-notify is simply the first extension (sorted by alphabetical order) the server need to sup
  5. Puzzle-oriented programming
    Nov 12, 2026 · original
    Content Warning: The plot inside this article is left half unrealized, so please treat it as fiction. The article is published as-is because I believe that it would be a crime aginst humanity to fully realize it. I was involved in playing 1 thinky puzzle games some time ago. It affected me so much that even my meme phrase “Tech Battle Advanced” was borrowed from Icely . A good rule among puzzle designers is this: A good puzzle should have a unique solution. Yesterday, I was asking Deepseek and omp to build a IRCv3 server out of whatever. The first Zig version worked. When I asked it to port the Zig code to Civet, the ported version no longer worked. Some information must be lost in translation. Other than discovering a new CAP theorem… LLM use, fun, it works – choose any 2 That’s when I realized that, wait , we do not actually need to provide the computer a program. We only need to provi
  6. Consider digital paper forms
    Nov 3, 2026 · original
    You don’t need relational algebra in your software. You need a file locker to store forms in. NoSQL? Yeah, that works too. Any POSIX file system works by itself. Allow the form to submitted even if the “required” fields are not filled in. Keep the partially filled form for your customer. They may come back later.
  7. Writing a state machine in Zig
    Nov 2, 2026 · original
    This article was orginally intended to be about Python’s async def , but someone else has already written about it . According to me, async function coloring that rewrites to state machines is the worst language feature I know of. JavaScript’s async is justifiable, since it uses callbacks instead. A Linux process is already async, when it makes syscalls. So how would you write a state machine in Zig? pub const FooMachine = opaque { pub const Start = struct { u32 }; pub const End = struct { u32 }; pub fn to_end(x: Start) End { return .{ x[0] }; } }; Q: Why not use a sum type? A: Then the different states would be type erased. Q: This doesn’t look like a state machine. A: If you want a sealed state machine, use Java. Q: What if I want to do async I/O in Zig? A: Use ZIO .
  8. Programming complications
    Oct 31, 2026 · original
    For this article, I hereby define “complication” as “something that can’t be detangled from its outside”. 90% of the complications i encountered in software development are caused by people’s hallucinations. the rest 10% are hallucinated directly by me or otherwise. 90% of feature requests I received are hallucinated I’m not talking about the open source community, which is like heaven when compared to the harsh reality that is called “the general population”. Examples: Q: I want to buy for stuff with electronic transaction without leaving a trace. A (me): Ask your government to cancel banking KYC or use crypto. Q: … and I will pay you at most 14EUR/hour for your work to finish my request. A (me): … Q: I want to achieve \(a(b, c, d, e, f, g, h)\) . A (me): What is \(a\) ? Q: \(a\) is \(i(j, k, l, m, n, o, p)\) . A (me): What is \(i\) ? Q: Why are you attacking me? Why can’t you speak in
  9. Experiencing and Deciding are not Computing
    Oct 31, 2026 · original
    this is word play. If experiencing and deciding are computing, every computer is a hypercomputer, since they can pull oracles from thin air. I cannot prove or disprove this with math, as it is a property of reality, not of math. If an algorithm pulls degrees of freedom from spacetime , it is not pure computation. [ Example: Lavarand]
  10. What is double cover
    Oct 29, 2026 · original
    In this article, we will talk about double cover . We will not discuss about \(SU(2)\) , \(SO(3)\) or spinors, as there are enough videos on YouTube on this topic; you may pick your preferred flavor of education and watch them. Here’s what I get from guessing, without reading any literature: structure DoubleCover α where add : α - α - α zero : α a_turn : α add_zero : (x : α) - add x zero = x double_cover : add a_turn a_turn = zero Writing Lean feels right at home. (this article is a placeholder for further extension)
  11. Strange Medicine
    Oct 20, 2026 · original
    So yes, I have been studying medicine for 3 weeks now. 《黃帝內經》, a text considered the origin of Traditional Chinese Medicine (TCM) (it’s not. it’s a compilation of curing techniques popular at the time of writing), describes 6 ways of curing: 針 = acute puncture with a thin needle 灸 = heat transfer 砭 = scraping with a stone 毒 = toxin 導、引、按、蹻 = operating on 脉 (whole-body flow network) 導 = steering 引 = pulling 按 = pressing. don’t conflate this with pressure points, please… 蹻 = stretching body parts (like body yoga). 捷舉手足。《素問•異法方宜論》:“其治宜導引按蹻。” In this article, let me explain what the six are so you have a rough idea what TCM is. Then maybe, you will consider TCM as medicine and leave confounded. acute puncture 1 wrong puncture and the patient’s mind breaks. seriously. don’t do this if you cannot take the responsibility of making someone vegetable. Many years ago, while visiting a hospital, I
  12. No need to return errors; carve holes instead
    Sep 15, 2026 · original
    Intro Have you ever used Result in Rust and is bothered by it not carrying enough debug information? Have you used errors in Zig and is bothered by it not having data fields? Chances are, all paths besides the happy path can be written separately from the happy path. In this article, we use Zig, not Koka, for demostration. Warning: stack overflow Try to compile the following code with Zig 0.17.x (currently the master branch). const std = @import("std"); pub fn main() !void { const x = entry(effect_handler, 0); std.debug.print("Done: {}\n", .{x}); } fn entry(h: fn (i32) i32, x: i32) i32 { return h(x); } fn effect_handler(x: i32) i32 { if (x == 10000000) { return std.process.abort(); } else { return entry(x + 1); } } In Debug mode, the program stack overflows, because there is no tail call optimization. In ReleaseFast mode, the program terminates with SIGABRT (the correct behavior). Using
  13. Compute machine more powerful than Turing Machine
    Sep 14, 2026 · original
    In this article, we describe a type of machine with more compute power than a Turing Machine. Function definitions in most programming languages are compressed definitions. In other words, they are like syntax sugars. Hypothetically, we have a type of machine called Machine Z that can turn the two functions below… fn invert_1(x: bool) - bool { if x == true { false } else { true } } fn invert_2(x: bool) - bool { if x == false { true } else { false } } … into the mapping … true - false false - true Then we say that invert_1 and invert_2 are definitionally equal , even though their notations in Rust are different. In Machine Z, a function with type \(A - B\) is a set of paths 1 , where, for all terms of \(A\) ( \(a\) ), there exist a path whose start is \(a\) and whose end is a term of \(B\) . By this definition, how a function is described can be “compiled” into a mapping (a set of paths).
  14. Proving the topology of the pure state of a qubit in Interv
    Sep 3, 2026 · original
    Because I was curious about what a wave function is, I asked omp to prove something about it. From some Internet searches, the pure-state space of a qubit is the 2-sphere: the Bloch sphere. Equivalently, the complex projective line is the Riemann sphere, \(\mathbf{CP}^1 = S^2\) . Before I started this project, I did not know what \(\mathbf{CP}^1\) is. The proof is written in Interv , a small functional language that bootstraps itself and that we have been building for the past month. The proof is written in its cubical type theory. It lives in the interv repository at research/cp1-s2/ 1 in three files: pure_state_sphere.ivs , bloch_sphere_equiv.ivs , and real_anisotropy.ivs . Thoughts Making Interv and the proof is exciting. Writing this article is not. Now I understand why some people do not like writing research papers. Mathematics is verifiable by anyone; computation need not be; only
  15. Awareness and the universe
    Aug 22, 2026 · original
    Here’s a story I made. There was once a mathematical system that tried to define itself fully. When it succeeded, it ceased to be a mathematical system — and everything could then be “proved” from it. Here’s a similar story from the Śūraṅgama Sūtra (楞严经). There was once “Awareness” (觉), and it was “Clear” (明). It tried to understand its own property of being Clear. When it succeeded (becoming 明觉), it was no longer Clear — and everything (this universe) came to be. By definition, all sentient (poor translation. should be “attracted to something”) beings inherently possess awareness (一切有情众生自有觉性), because they are fragments of Awareness. My extrapolation: before the universe, there is math. It’s also 邪门 (weird) to see the side effect of Awareness (Consciousness/识) acting as human — at least as weird as some Cthulhu creature acting as human. Thanks to MacroAlpha (宏观阿尔法) for inspiring this ar
  16. Coupled meta-learning while learning homotopy theory
    Aug 12, 2026 · original
    Don’t you all have a body. For me, it is troublesome to think of a policy to control its actions. Even I don’t have a policy for it, it still does things anyway. But first, to have a desired policy, I need to specify my policy desire . A policy is like a function that takes the environment as input and produces an action as output. A policy desire is the space (or type) of policies that I deemed acceptable. Since the space of desired policies is not a point, there must be choice. Randomness works too. Still, what I desire may drift from time to time based on what I experience. This, seen from the outside, is a coupled meta-learning system: one loop learns a policy for whatever desire the system currently holds, and another loop picks the desire itself. The space of desires is not a point, so the outer loop must choose; randomness works. And since the policy the system acts with changes w
  17. How to live in an era where machines can think
    Jul 17, 2026 · original
    Yesterday, Kimi K3 released. 1 Aside from the amazing capabilities of it, it made me wonder, how should I respond to it. If we believe in how computation works from All you need is computation , all computation belongs in the same class: turing complete . At this point in technology development, I feel that trying to compete in computation with carved stones as biological organism doesn’t make much sense anymore. We better do something else. Being able to rest With more than enough computation, I think people will be less busy in the future. Therefore, it’s important to learn about resting. Here’s an except from The Miracle of Mindfulness . When you breathe in, know that you are breathing in. When you breathe out, know that you are breathing out. When you breathe in short, know that. When you breathe in long, know that. Same for when you breathe out. Bring the awareness to every present
  18. Memory safety and type system
    Jul 12, 2026 · original
    You probably have heard of the recent Bun Rust rewrite debacle. Long story short, Bun’s recent Rust rewrite is not about Rust being better than Zig; it is about which kind of type system you need when a tracing garbage collector and a more manual allocator share a process. The boundary between JavaScriptCore’s tracing GC and Zig’s manual allocator is where ownership invariants have to be enforced by hand. With a linear type system, you can automatically enforce the invariance. Example failure at programming Bun calls into JavaScriptCore through the C API. JSValueMakeString and JSObjectMake return a value with a +1 retain; you must release it or let it be collected. JSValueProtect and JSValueUnprotect must be called in matched pairs; unprotecting too many times is undefined behavior. The conservative stack scanner can find JSValueRef s on the stack during a JSC call, but it cannot see ins
  19. A stay on Plum Blossom Island
    Jun 4, 2026 · original
    We came for plum blossoms. The name promised. Only the name delivered. The guesthouse was two stories — dining area and kitchen on the ground floor, rooms above. Quiet when we arrived. A few people eating downstairs. The owner handed us a key. The room was nicer than expected, like an actual hotel. We dropped our bags and set out. The road to the monastery was rough in an ordinary way. One lane had coin-sized craters pocked into the surface. The other was smoother but stones pushed up through the concrete, just enough to notice. A wooden gate stood at the entrance: 不二, torii-like. Through it, whitewashed walls and a front gate. Inside the courtyard, the ground was paved with sharp retail-style gravel and stone tablet panels running down the middle. Modern. Clean. Silent — not the silence of old stone, but the silence of minds holding still. People meditated all day. I don’t know what my
  20. A new standard for cryptography
    Dec 30, 2025 · original
    Allow me to propose a new standard for cryptography. A cryptographic algorithm is considered secure when every step of the computation is shown to the attack as it happens. A step can be blinded (cannot be measured exactly which step is taken) when multiple candidate steps can be taken, and there isn’t a plausible way to detect which step is chosen. All computation generates heat, and heat radiates as light (black body radiation). In the far future, there may be a device capable of looking inside a x86 CPU and differentiating between mov rax 0 and mov rax 1 being executed. Therefore, a cryptographic algorithm should pair with adequate radiation shielding to prevent surveilance. A device like lava lamp can be placed inside to create heat disturbances to make decoding CPU movement from outside the box nigh impossible. We can create such a computer box by purchasing a fanless computer and p

Found by rss-feed-index, which checks each feed once a month at most.

Same record as JSON: https://api.agentalog.com/api/feeds/fd_1a_insec_net_edbcfdad133b9175. More from this site: 1a-insec.net in the Feeds tab.

Looking for something else?QuestionsContact