HN user

ashish01

638 karma
Posts42
Comments84
View on HN
arxiv.org 1d ago

Kimi Linear: An Expressive, Efficient Attention Architecture

ashish01
3pts0
pocketwise.app 6mo ago

Show HN: Pocketwise – a privacy-first, double-entry finance tracker

ashish01
3pts0
meal-tracker.fly.dev 7mo ago

Show HN: Meal Tracker – Weekend hack using LLM to get food macros from photos

ashish01
1pts0
pocketwise.app 8mo ago

Show HN: PocketWise – a simple, natural-language double-entry finance tracker

ashish01
2pts2
github.com 11mo ago

Cleora: A Simple, Strong and Scalable Graph Embedding Scheme

ashish01
1pts0
hn-reader.pages.dev 1y ago

Show HN: HN Reader – Alternate Reader for Hacker New

ashish01
2pts1
zed.dev 1y ago

DeepSeek-R1 for Coding in Zed

ashish01
31pts8
staff.um.edu.mt 2y ago

Little Languages (1986) [pdf]

ashish01
175pts29
news.ycombinator.com 3y ago

Tell HN: YouTube red is increasing subscription price by 53%

ashish01
5pts6
github.com 4y ago

Lark Python parsing toolkit 1.0 release

ashish01
4pts0
github.com 5y ago

Daily Hacker News data dump

ashish01
9pts3
youtu.be 5y ago

Crust of Rust: Lifetime Annotations

ashish01
1pts0
structuredchaos.me 6y ago

Show HN: Simple ways to split bills with friends

ashish01
2pts0
infoscience.epfl.ch 7y ago

Lightweight Modular Staging: Runtime Code Generation and Compiled DSLs [pdf]

ashish01
3pts0
cafbit.com 8y ago

Tokio internals: Understanding Rust's asynchronous I/O framework, bottom up

ashish01
4pts0
github.com 8y ago

MARISA: Matching Algorithm with Recursively Implemented StorAge

ashish01
4pts0
fasttext.cc 8y ago

FastText: Library for efficient text classification and representation learning

ashish01
6pts0
www.paulgraham.com 8y ago

What You Can't Say (2004)

ashish01
143pts68
www.sqlite.org 9y ago

SQLITE: JSON1 Extension

ashish01
311pts70
intorust.com 9y ago

Screencasts and tutorials to help you learn Rust

ashish01
6pts0
medium.com 9y ago

Towards a Unified Theory of Operational Transformation and CRDT

ashish01
7pts0
paulgraham.com 10y ago

Do things that don't scale

ashish01
1pts0
github.com 10y ago

Micro C library for handling HTTP requests on low resource systems

ashish01
1pts0
www.youtube.com 11y ago

MarI/O: machine learning Super Mario

ashish01
2pts0
thedailywtf.com 11y ago

The Upgrade

ashish01
1pts0
rhiever.github.io 11y ago

The optimal road trip across the U.S. according to machine learning

ashish01
30pts30
databricks.gitbooks.io 11y ago

Databricks Spark Reference Applications

ashish01
2pts0
www.cs.unm.edu 11y ago

Data Structures for Text Sequences (1998) [pdf]

ashish01
36pts3
www.businessinsider.com 11y ago

Science Says Lasting Relationships Come Down to 2 Basic Traits

ashish01
2pts0
www.infoq.com 11y ago

Simple Made Easy (By Rich Hickey)

ashish01
3pts1

I have an old Lenovo IdeaPad with fairly modest hardware, and I have both Fedora and Windows installed. About 90% of the time I use Fedora, and it works fine overall. The only thing that bothers me is that Firefox on Fedora feels noticeably more sluggish compared to Edge or Firefox on Windows. Maybe it’s just a perception issue, but I’d love to know what others are using as their web browser on Linux.

Litestream VFS 7 months ago

I use Litestream for near real-time backups. Does not change how SQLite is used on the server, just a replacement for .backup

RustPython 2 years ago

I tried jit as well but looks like recursive functions cannot be jitted yet :(

RustPython 2 years ago

I was curious about how slow (or fast) it is compared to cpython. On fibonacci.py rustpython about 11x slower than cpython.

    def fib(n):
        if n == 0 or n == 1:
            return 1
        return fib(n-1) + fib(n-2)

    print(fib(35))

    time python3 ~/code/fibs.py
    14930352

    ________________________________________________________
    Executed in    1.18 secs    fish           external
       usr time    1.14 secs  180.00 micros    1.14 secs
       sys time    0.01 secs  616.00 micros    0.01 secs

    time ./target/release/rustpython ~/code/fibs.py
    14930352

    ________________________________________________________
    Executed in   13.44 secs    fish           external
       usr time   13.32 secs  175.00 micros   13.32 secs
       sys time    0.02 secs  776.00 micros    0.02 secs

One of the core problems in semantic search is doing efficient approximate nearest neighbor search. In this post the author uses KD trees. There are other alternatives for efficient ANN like scann from Google and faiss from Facebook.

Any books / papers you would recommend to cover basics of search engine implementation? Practicalities like elias fano encoding and WAND searching.

This brings back so many memories. I was in a same situation (reading a book) and needed on digital offline dictionary. I couldn't find anything for my phone back then. It was a Sony Ericson phone with 64MB memory and J2ME as development environment.

So I wrote a offline dictionary with a friend of mine based on wordnet and J2ME polish. It was my first real world project - http://cornucopia.sourceforge.net/

I tried a few QnA style queries and most (all?) of them got their answers from Wolfram Alpha.

why is sky blue

Top result: https://www.wolframalpha.com/input/?i=why%20is%20sky%20blue

what is the capital of punjab

Top result: https://www.wolframalpha.com/input/?i=what%20is%20the%20capi...

what is the population of seattla (with typo)

Top result: https://www.wolframalpha.com/input/?i=what%20is%20the%20popu...

For one keyword query I tried "rust lang" the results felt very repetitive.

Just wondering if its a layer on top of Wolfram Alpha or is it doing QnA inference on its own.