Hacker News

Article URL: https://www.aikido.dev/blog/keyv-and-friends-compromised-in-npm-supply-chain-attack

Comments URL: https://news.ycombinator.com/item?id=49166874

Points: 1

# Comments: 0

Article URL: https://www.cnbc.com/2026/08/04/us-has-used-virtually-all-of-its-long-range-precision-missiles-report.html

Comments URL: https://news.ycombinator.com/item?id=49166860

Points: 1

# Comments: 0

When I worked with 3 or 4 Claude Code sessions in parallel terminals on my laptop, sometimes ordered in little windows, sometimes full screen, it did not feel optimal. Often a session stopped and waited for a permission prompt, especially when in full screen to follow the process in more detail. When I talked to other devs I got the feedback, that a little status indicator would be nice.

cctap puts in every terminal a one line statusline. It looks the same over the different terminals and every session gets a number and a name. When one session waits on you it turns red. I also added the option to add a system key to jump instantly in the session which needs attention.

cctap can be installed with 2 lines, one for the visual status, one for the key setup.

npx @chipmates/cctap install-hooks npx @chipmates/cctap keys setup cctap registers hooks that report to a small local daemon via unix socket.

The code is published under MIT, zero dependencies, no network calls.

The statusline, animated: https://github.com/chipmates/cctap/raw/main/docs/demo.gif

Hope you like it.

Comments URL: https://news.ycombinator.com/item?id=49166844

Points: 1

# Comments: 0

Article URL: https://arxiv.org/abs/2607.27191

Comments URL: https://news.ycombinator.com/item?id=49166838

Points: 2

# Comments: 0

Article URL: https://researchmaster.ai/en

Comments URL: https://news.ycombinator.com/item?id=49166825

Points: 1

# Comments: 0

Article URL: https://hacdias.com/2026/07/28/filebrowser/

Comments URL: https://news.ycombinator.com/item?id=49166788

Points: 1

# Comments: 0

Article URL: https://ladybird.org/newsletter/2026-07-31/

Comments URL: https://news.ycombinator.com/item?id=49166783

Points: 2

# Comments: 0

Article URL: https://cetele.online/

Comments URL: https://news.ycombinator.com/item?id=49166779

Points: 1

# Comments: 0

Article URL: https://granat.blog/posts/2026-07-24-react-arven/

Comments URL: https://news.ycombinator.com/item?id=49166767

Points: 1

# Comments: 0

Article URL: https://velumprivacy.com/blog/pii-benchmark-reversed-changing-dataset

Comments URL: https://news.ycombinator.com/item?id=49166762

Points: 1

# Comments: 0

Article URL: https://github.com/rokib16x/listnr

Comments URL: https://news.ycombinator.com/item?id=49166758

Points: 4

# Comments: 0

Article URL: https://www.ssp.sh/brain/mini-retirements/

Comments URL: https://news.ycombinator.com/item?id=49166749

Points: 1

# Comments: 0

Article URL: https://phys.org/news/2026-08-quantum-encryption-method-ciphertext-cloned.html

Comments URL: https://news.ycombinator.com/item?id=49166730

Points: 1

# Comments: 0

Article URL: https://wild.space/fable

Comments URL: https://news.ycombinator.com/item?id=49166718

Points: 2

# Comments: 0

Article URL: https://agenmatic.ai/

Comments URL: https://news.ycombinator.com/item?id=49166707

Points: 2

# Comments: 0

Article URL: https://viki.wiki/assets/waffle/wafflemaker-slop2.html

Comments URL: https://news.ycombinator.com/item?id=49166697

Points: 1

# Comments: 1

Article URL: https://arstechnica.com/space/2026/08/lego-deploys-hubble-space-telescope-as-detailed-desktop-model/

Comments URL: https://news.ycombinator.com/item?id=49166692

Points: 1

# Comments: 0

Article URL: https://ekxide.io/blog/byte-wise-atomic-wrapper-to-prevent-ub/

Comments URL: https://news.ycombinator.com/item?id=49166672

Points: 1

# Comments: 1

Article URL: https://scholarlyfutures.substack.com/p/frontier-models-transparency-and

Comments URL: https://news.ycombinator.com/item?id=49166662

Points: 1

# Comments: 0

The two of us (PhD in Physics and Mathematics and Philosophical Anthropology) have spent many years working on a mathematically protected secret voting system suitable for making socially significant decisions. During the design process, we realized that such a system must be a peer-to-peer network satisfying six absolute requirements. We have not been able to find a single existing protocol or academic paper that simultaneously satisfies more than two of them: First: anonymous user authentication that guarantees the uniqueness of the user's representation in the network (preventing one person from creating multiple accounts) without storing their personal data and without using any external resources, such as certificate authorities or a trusted third party. Second: a network providing such anonymous authentication must be capable of covering all inhabitants of the Earth. Currently that is just over 8 billion people, but this number grows by more than 100 million every year. Moreover, the deceased must not be excluded from the system, which means monotonic growth is endless. Third: a network that guarantees anonymity must not have any distinguished nodes—that is, it must be strictly peer-to-peer, consisting of nodes formed by users' devices. However, each user may have not one but several devices, and devices can fail, get lost, become obsolete, or even simply go out of fashion. This immediately changes the scale of the network—it must handle hundreds of billions of nodes. Fourth: it is necessary to provide each user with access to their account from any device without using passwords, tokens, seed phrases, or anything similar. Fifth: the key requirement becomes performing a search that enables user recognition in less than 1 second (so that it is imperceptible to the user). That is, any device must locate any other device or data in less than 1 second, while the amount of routing information stored by a single device must be negligibly small, preferably under 100 KB. Sixth: to guarantee data preservation on unreliable user devices, first, the replication factor must be ~100 or even ~1000x, and second, there must be verification and recovery of routing and data based on consensus without a central arbiter or trusted nodes. At the same time, background synchronization traffic must remain below a few hundred bytes/sec per device to avoid overwhelming mobile data plans. Our question to HN: Is the community aware of any existing P2P protocol, DHT, or academic proposal that even attempts to simultaneously satisfy these constraints? We have studied Kademlia, Chord, BATMAN, GNUnet, I2P, etc., and all of them seem to fail at scalability or traffic efficiency. Are we missing something fundamental, or is this truly a blind spot? (This question is motivated by the fact that we have developed a candidate architecture that, in our opinion, solves all six problems. A brief description can be found on our GitHub [https://github.com/ikhrabry-spec/A-P2P-Network-Architecture-for-100B-Nodes]. Patent applications have been filed, and one patent has been granted. However, we doubt the novelty of our solutions and the absence of analogues—please point us to anything we may have missed.)

Comments URL: https://news.ycombinator.com/item?id=49166652

Points: 2

# Comments: 0