What is Hackers' Pub?

Hackers' Pub is a place for software engineers to share their knowledge and experience with each other. It's also an ActivityPub-enabled social network, so you can follow your favorite hackers in the fediverse and get their latest posts in your feed.

0
0
0
cancel @cancel@merveilles.town
Public

Please stop making software that writes unnecessarily to disk. I'm especially angry at web browsers. I don't want the web browsers to be writing 1~3mbps to disk the entire time they're open and visiting sites. SSDs have become unaffordable, and they have limited write lifetime. Please stop making software that does this. Thanks.

0
0
0
jacobian @jacob@social.jacobian.org
Public

@Jamessocoljames @b0rkJulia Evans We put a huge emphasis on docs from day 1. Our policy has always been that new code can’t be merged unless it includes docs — we’ve held up major features because the docs weren’t done/good. That’s a virtuous cycle: good docs attract contributors who value good docs. So yeah it’s super intentional, and always nice to hear from someone that it seems to be working :)

Russell Keith-Magee @freakboy3742@cloudisland.nz
Public
Shared by Carlton Gibson

@jacobjacobian @Jamessocoljames @b0rkJulia Evans I can, without reservation, say that the reason I started using Django 20 years ago, eventually joined the core team, and everything that flows from that, is significantly due to the fact that Django’s documentation, even in the 0.91 days, was *excellent*.

I have a PhD in CS - so I theoretically knew stuff, but couldn’t actually do things like “build a web site”. I bounced off PHP because the docs at the time were incoherent. I bounced off Rails and CherryPy because while the tutorial got a TODO app going, the next steps were unclear.

I don’t think you can understate the influence you and @adrianAdrian Holovaty’s focus on good docs in Django had on the Python ecosystem.

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
1
0
0
北市真 @KitaitiMakoto@bookwor.ms
Public

「検索してもノイズにまみれていい結果に出会うの苦労しそうだからまずはAIに聞くか……」
ってなることあって、こうやってAIの優位性を体験していくのかなあ、なんて思ってたけど、
いやいや、それ、検索エンジンがクソってだけだからな、騙されるところだった。

0
0
0
1
0
0
0
0
0
1
0
0
드라코 @draco@pointless.chat
Public

애플이 사랑하는 버그들 | GeekNews

news.hada.io/topic?id=26079

잡스가 부팅시간 몇초 단축시키면 X사용자수해서 몇명의 인생을 구하는거라고 했었는데
그 정신이 사라진 애플이네.

애플이 사랑하는 버그들 | GeekNews

Apple 제품 전반의 장기적인 버그로 인해 전 세계 사용자가 막대한 시간을 낭비하고 있음Mail 검색 실패, 자동 수정 루프, AirDrop 탐색 문제, iCloud 사진 업로드 지연 등 다양한 기능에서 반복적 오류 발생각 사례마다 일일 수백만~수억 시간의 생산성 손실이 발생하고 있지만, 이들은 “몇 백 시간의 엔지니어링 노력으로 해결 가능”함이 사이트는

news.hada.io · GeekNews

0
0
0
1
0
0
José A. Alonso @Jose_A_Alonso@mathstodon.xyz
Public

Elementary proofs of ring commutativity theorems. ~ Michael Kinyon, Desmond MacHale. arxiv.org/abs/2601.12599v1

arXiv logo

Elementary proofs of ring commutativity theorems

Jacobson's commutativity theorem says that a ring is commutative if, for each $x$, $x^n = x$ for some $n > 1$. Herstein's generalization says that the condition can be weakened to $x^n-x$ being central. In both theorems, $n$ may depend on $x$. In this paper, in certain cases where $n$ is a fixed constant, we find equational proofs of each theorem. For the odd exponent cases $n = 2k+1$ of Jacobson's theorem, our main tool is a lemma stating that for each $x$, $x^k$ is central. For Herstein's theorem, we consider the cases $n=4$ and $n=8$, obtaining proofs with the assistance of the automated theorem prover Prover9.

arxiv.org · arXiv.org

0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
Horologram @horologram.bsky.social@bsky.brid.gy
Public

근데 많은 경우 정부가 이런 생산과 분배 문제를 적극적으로 해결해야하는데 오히려 반대로 악용하고 사람들 사이를 더 구조적으로 벌어지게 만드 상당히 괘씸한듯 특히 미국 정부가 요새 그러는데 음... 이쯤되면 정부는 왜 있나 싶은 생각도 자주 들고...

0
0
0
MissConstrue @MissConstrue@mefi.social
Public
Shared by earthling

An absolutely brilliant long form article by Richard David Hames. It’s so, so good.

Some curated quotes:

Donald Trump is not an interruption of the American story; he is one of its clearest chapters. He condenses habits that long predate him—mythmaking, extraction, spectacle, racial hierarchy, masculine anxiety—into a single, gaudy figure. To look at him carefully is to see the civilisation that made him.

The United States was founded on a dazzling contradiction: “all men are created equal,” written by men who owned other humans. Its history since has been a choreography of grand ideals and systematic betrayal. One response to this tension has been hypocrisy—keeping the language of virtue while quietly doing the opposite. Another response, Trump’s response, is to drop the mask.

richarddavidhames.substack.com

The Mirror Cracks

Donald Trump and the American Psyche

richarddavidhames.substack.com

0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
hukl @hukl@chaos.social
Public

It's surprising in a positive way that the cheap little kit antennas of the RTL-SDR allow me to receive some ADS-B data from within my apartment with no clear view to the sky or horizon in any direction :)

Also receiving temperature and humidity sensor data from cars and weather stations is crazy. No need for your own weather station :D

I definitely feel the appeal of this particular nerd rabbit hole. Caught myself reading about DIY antenna builds already :D

0
0
0
0
0
0
0
0
0
José A. Alonso @Jose_A_Alonso@mathstodon.xyz
Public

AI for mathematics: Progress, challenges, and prospects. ~ Haocheng Ju, Bin Dong. arxiv.org/abs/2601.13209v2

arXiv logo

AI for Mathematics: Progress, Challenges, and Prospects

AI for Mathematics (AI4Math) has emerged as a distinct field that leverages machine learning to navigate mathematical landscapes historically intractable for early symbolic systems. While mid-20th-century symbolic approaches successfully automated formal logic, they faced severe scalability limitations due to the combinatorial explosion of the search space. The recent integration of data-driven approaches has revitalized this pursuit. In this review, we provide a systematic overview of AI4Math, highlighting its primary focus on developing AI models to support mathematical research. Crucially, we emphasize that this is not merely the application of AI to mathematical activities; it also encompasses the development of stronger AI systems where the rigorous nature of mathematics serves as a premier testbed for advancing general reasoning capabilities. We categorize existing research into two complementary directions: problem-specific modeling, involving the design of specialized architectures for distinct mathematical tasks, and general-purpose modeling, focusing on foundation models capable of broader reasoning, retrieval, and exploratory workflows. We conclude by discussing key challenges and prospects, advocating for AI systems that go beyond facilitating formal correctness to enabling the discovery of meaningful results and unified theories, recognizing that the true value of a proof lies in the insights and tools it offers to the broader mathematical landscape.

arxiv.org · arXiv.org

0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
モリーオ @ozoramore@social.t2arc.net
Public
Shared by 北市真

今日の名言をWWWに配信するためのプロトコルがあるのよね
https://www.mimoex.net/260111-aikatsu-qotd-rfc865/

TCP/UDP 17番ポートでアイカツ格言を配信する 〜RFC 865 QOTD を真面目に実装してみた〜 | mimoexのブログ

Quote of the Day（RFC 865）という古典的プロトコルを、アイカツ格言で実装してみた記録。受信データ無視・512文字制限という潔さが逆に楽しい。

www.mimoex.net

0
0
0
José A. Alonso @Jose_A_Alonso@mathstodon.xyz
Public

Blurred drinker paradoxes and blurred choice axioms: Constructive reverse mathematics of the downward Löwenheim-Skolem theorem. ~ Dominik Kirst, Haoyi Zeng. arxiv.org/abs/2601.12592v1

arXiv logo

Blurred Drinker Paradoxes and Blurred Choice Axioms: Constructive Reverse Mathematics of the Downward Löwenheim-Skolem Theorem

In the setting of constructive reverse mathematics, we analyse the downward Löwenheim-Skolem (DLS) theorem of first-order logic, stating that every infinite model has a countable elementary submodel. Refining the well-known equivalence of the DLS theorem to the axiom of dependent choice (DC) over classical base theories, our constructive approach allows for several finer logical decompositions: Just assuming countable choice (CC), the DLS theorem is equivalent to the conjunction of DC with a newly identified fragment of the excluded middle (LEM) that we call the blurred drinker paradox (BDP). Further without CC, the DLS theorem is equivalent to the conjunction of BDP with similarly blurred weakenings of DC and CC. Independently of their connection with the DLS theorem, we also study BDP and the blurred choice axioms on their own, for instance by showing that BDP is LEM without a contribution of Markov's principle and that blurred DC is DC without a contribution of CC. The paper is hyperlinked with an accompanying Coq development.

arxiv.org · arXiv.org

0
0
0
1
0
0
1
0
0