frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Show HN: Runtime Fence – Kill switch for AI agents

https://github.com/RunTimeAdmin/ai-agent-killswitch
1•ccie14019•2m ago•1 comments

Researchers surprised by the brain benefits of cannabis usage in adults over 40

https://nypost.com/2026/02/07/health/cannabis-may-benefit-aging-brains-study-finds/
1•SirLJ•4m ago•0 comments

Peter Thiel warns the Antichrist, apocalypse linked to the 'end of modernity'

https://fortune.com/2026/02/04/peter-thiel-antichrist-greta-thunberg-end-of-modernity-billionaires/
1•randycupertino•4m ago•1 comments

USS Preble Used Helios Laser to Zap Four Drones in Expanding Testing

https://www.twz.com/sea/uss-preble-used-helios-laser-to-zap-four-drones-in-expanding-testing
2•breve•10m ago•0 comments

Show HN: Animated beach scene, made with CSS

https://ahmed-machine.github.io/beach-scene/
1•ahmedoo•11m ago•0 comments

An update on unredacting select Epstein files – DBC12.pdf liberated

https://neosmart.net/blog/efta00400459-has-been-cracked-dbc12-pdf-liberated/
1•ks2048•11m ago•0 comments

Was going to share my work

1•hiddenarchitect•14m ago•0 comments

Pitchfork: A devilishly good process manager for developers

https://pitchfork.jdx.dev/
1•ahamez•14m ago•0 comments

You Are Here

https://brooker.co.za/blog/2026/02/07/you-are-here.html
3•mltvc•18m ago•0 comments

Why social apps need to become proactive, not reactive

https://www.heyflare.app/blog/from-reactive-to-proactive-how-ai-agents-will-reshape-social-apps
1•JoanMDuarte•19m ago•1 comments

How patient are AI scrapers, anyway? – Random Thoughts

https://lars.ingebrigtsen.no/2026/02/07/how-patient-are-ai-scrapers-anyway/
1•samtrack2019•20m ago•0 comments

Vouch: A contributor trust management system

https://github.com/mitchellh/vouch
2•SchwKatze•20m ago•0 comments

I built a terminal monitoring app and custom firmware for a clock with Claude

https://duggan.ie/posts/i-built-a-terminal-monitoring-app-and-custom-firmware-for-a-desktop-clock...
1•duggan•21m ago•0 comments

Tiny C Compiler

https://bellard.org/tcc/
1•guerrilla•22m ago•0 comments

Y Combinator Founder Organizes 'March for Billionaires'

https://mlq.ai/news/ai-startup-founder-organizes-march-for-billionaires-protest-against-californi...
1•hidden80•22m ago•2 comments

Ask HN: Need feedback on the idea I'm working on

1•Yogender78•23m ago•0 comments

OpenClaw Addresses Security Risks

https://thebiggish.com/news/openclaw-s-security-flaws-expose-enterprise-risk-22-of-deployments-un...
2•vedantnair•23m ago•0 comments

Apple finalizes Gemini / Siri deal

https://www.engadget.com/ai/apple-reportedly-plans-to-reveal-its-gemini-powered-siri-in-february-...
1•vedantnair•24m ago•0 comments

Italy Railways Sabotaged

https://www.bbc.co.uk/news/articles/czr4rx04xjpo
4•vedantnair•24m ago•0 comments

Emacs-tramp-RPC: high-performance TRAMP back end using MsgPack-RPC

https://github.com/ArthurHeymans/emacs-tramp-rpc
1•fanf2•26m ago•0 comments

Nintendo Wii Themed Portfolio

https://akiraux.vercel.app/
2•s4074433•30m ago•2 comments

"There must be something like the opposite of suicide "

https://post.substack.com/p/there-must-be-something-like-the
1•rbanffy•32m ago•0 comments

Ask HN: Why doesn't Netflix add a “Theater Mode” that recreates the worst parts?

2•amichail•33m ago•0 comments

Show HN: Engineering Perception with Combinatorial Memetics

1•alan_sass•39m ago•2 comments

Show HN: Steam Daily – A Wordle-like daily puzzle game for Steam fans

https://steamdaily.xyz
1•itshellboy•41m ago•0 comments

The Anthropic Hive Mind

https://steve-yegge.medium.com/the-anthropic-hive-mind-d01f768f3d7b
1•spenvo•41m ago•0 comments

Just Started Using AmpCode

https://intelligenttools.co/blog/ampcode-multi-agent-production
1•BojanTomic•43m ago•0 comments

LLM as an Engineer vs. a Founder?

1•dm03514•43m ago•0 comments

Crosstalk inside cells helps pathogens evade drugs, study finds

https://phys.org/news/2026-01-crosstalk-cells-pathogens-evade-drugs.html
2•PaulHoule•44m ago•0 comments

Show HN: Design system generator (mood to CSS in <1 second)

https://huesly.app
1•egeuysall•44m ago•1 comments
Open in hackernews

zearch: regular expression searching on grammar-compressed text

https://pevalme.github.io/zearch/graphs/index.html
4•1vuio0pswjnm7•3mo ago

Comments

1vuio0pswjnm7•3mo ago
.

   cd zearch-master/
   ed Makefile <<__GGG__
   11c
   CC = gcc
   .
   4,6c
   CFLAGS = -static -s -I/usr/include -fcommon -O3 -march=native -flto -mtune=native
   # CFLAGS = -fcommon -flto -DNDEBUG -ggdb -fno-inline-functions
   LFLAGS = -L/usr/local/lib/ /usr/lib/libfa.a
   .
   w
   q
   __GGG__


   ed main.c <<__HHH__
   750,751c
   if(mode=='q'){ret=run_boolean_zearch(minimize,argv[argc-1],argv[argc-2]);exit(ret);}else run_zearch(minimize,argv[argc-1],argv[argc-2]);
   .
   730,733c
   if(argc==4)if(argv[1][0]=='-')mode=argv[1][1];else mode='l';
   .
   707,728c
   if(argc!=3&&argc!=4)help();
   .
   703c
   int help(){
   fputs("Usage: zearch [OPTION] PATTERN RE-PAIR FILE\n",stderr);
   fputs("  -c: prints only a count of selected lines in RE-PAIR FILE\n",stderr);
   fputs("  -q: suppress all normal output\n",stderr);
   exit(0);
   }
   .
   525a
   int help();
   if(slp==NULL)help();
   .
   501c
   ret=1;
   .
   491c
   ret=0;
   .
   482c
   ret=0;
   .
   430a
   int help();
   if(slp==NULL)help();
   .
   419c
   if(mode=='c')printf("%d\n",ret+counting_overflows*COUNTER_TOP);
   .
   350c
   if(mode!='c'&&mode!='q'){
   .
   238,253d
   w
   q
   __HHH__

   ed nfa.c <<__III__
   103,104c
   extern unsigned int num_e_l;
   extern unsigned int num_e_r;
   .
   diff -re zearch-master/src/stack.c zearch-master.new/src/stack.c
   56c
   s->data = (unsigned int*)realloc(s->data, sizeof(unsigned int) * s->size);
   .
   53c
   __attribute__((always_inline)) inline void stack_push(STACK *s, unsigned int n){
   .
   42,43c
   __attribute__((always_inline)) inline unsigned int stack_pop(STACK *s){
   unsigned int ret;
   .
   37c
   posix_memalign((void **)&s->data, 64, STACK_SIZE * sizeof(unsigned int));
   .
   w
   q
   __III__

   ed stack.h <<__JJJ__
   65c
   void stack_push(STACK *s, unsigned int n);
   .
   55c
   unsigned int stack_pop(STACK *s);
   .
   36c
   unsigned int *data;
   .
   5c
   * Each element is a unsigned int.
   .
   w
   q
   __JJJ__
1vuio0pswjnm7•3mo ago
Corrected

More code for experimentation: https://github.com/s-maruyama/exrepair

    cd zearch-master
    ed Makefile <<__GGG__
    11c
    CC = gcc
    .
    4,6c
    CFLAGS = -static -s -I/usr/include -fcommon -O3 -march=native -flto -mtune=native
    # CFLAGS = -fcommon -flto -DNDEBUG -ggdb -fno-inline-functions
    LFLAGS = -L/usr/local/lib/ /usr/lib/libfa.a
    .
    w
    q
    __GGG__

    cd src
    ed main.c <<__HHH__
    750,751c
    if(mode=='q'){ret=run_boolean_zearch(minimize,argv[argc-1],argv[argc-2]);exit(ret);}else run_zearch(minimize,argv[argc-1],argv[argc-2]);
    .
    730,733c
    if(argc==4)if(argv[1][0]=='-')mode=argv[1][1];else mode='l';
    .
    707,728c
    if(argc!=3&&argc!=4)help();
    .
    703c
    int help(){
    fputs("Usage: zearch [OPTION] PATTERN RE-PAIR FILE\n",stderr);
    fputs("  -c: prints only a count of selected lines in RE-PAIR FILE\n",stderr);
    fputs("  -q: suppress all normal output\n",stderr);
    exit(0);
    }
    .
    525a
    int help();
    if(slp==NULL)help();
    .
    501c
    ret=1;
    .
    491c
    ret=0;
    .
    482c
    ret=0;
    .
    430a
    int help();
    if(slp==NULL)help();
    .
    419c
    if(mode=='c')printf("%d\n",ret+counting_overflows*COUNTER_TOP);
    .
    350c
    if(mode!='c'&&mode!='q'){
    .
    238,253d
    w
    q
    __HHH__

    ed nfa.c <<__III__
    103,104c
    extern unsigned int num_e_l;
    extern unsigned int num_e_r;
    .
    w
    q
    __III__

    ed stack.c <<__JJJ__
    56c
    s->data = (unsigned int*)realloc(s->data, sizeof(unsigned int) * s->size);
    .
    53c
    __attribute__((always_inline)) inline void stack_push(STACK *s, unsigned int n){
    .
    42,43c
    __attribute__((always_inline)) inline unsigned int stack_pop(STACK *s){
    unsigned int ret;
    .
    37c
    posix_memalign((void **)&s->data, 64, STACK_SIZE * sizeof(unsigned int));
    .
    w
    q
    __JJJ__

    ed stack.h <<__KKK__
    65c
    void stack_push(STACK *s, unsigned int n);
    .
    55c
    unsigned int stack_pop(STACK *s);
    .
    36c
    unsigned int *data;
    .
    5c
    * Each element is a unsigned int.
    .
    w
    q
    __KKK__