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.

Jules @Jules78120@mamot.fr
Public
Shared by Frédéric Jacobs

🧵🌡️ J'ai le plaisir de vous présenter le résultat de trois mois de travail sur la désinformation climatique :)

J'ai entrepris de cartographier les acteurs de la diffusion des discours climato-dénialistes (= climatosceptiques) en France.

👉 deni-climatique.fr

La carto du déni climatique

Cartographier la désinformation climatique en France.

deni-climatique.fr · La carto du déni climatique

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

Resolution of Erdős problem #728: a writeup of Aristotle's Lean proof. ~ Nat Sothanaphan. arxiv.org/abs/2601.07421v3

arXiv logo

Resolution of Erdős Problem #728: a writeup of Aristotle's Lean proof

We provide a writeup of a resolution of Erdős Problem #728; this is the first Erdős problem (a problem proposed by Paul Erdős which has been collected in the Erdős Problems website) regarded as fully resolved autonomously by an AI system. The system in question is a combination of GPT-5.2 Pro by OpenAI and Aristotle by Harmonic, operated by Kevin Barreto. The final result of the system is a formal proof written in Lean, which we translate to informal mathematics in the present writeup for wider accessibility. The proved result is as follows. We show a logarithmic-gap phenomenon regarding factorial divisibility: For any constants $0<C_1<C_2$ and $0 < \varepsilon < 1/2$ there exist infinitely many triples $(a,b,n)\in\mathbb N^3$ with $\varepsilon n \le a,b \le (1-\varepsilon)n$ such that \[ a!\,b!\mid n!\,(a+b-n)!\qquad\text{and}\qquad C_1\log n < a+b-n < C_2\log n. \] The argument reduces this to a binomial divisibility $\binom{m+k}{k}\mid\binom{2m}{m}$ and studies it prime-by-prime. By Kummer's theorem, $ν_p\binom{2m}{m}$ translates into a carry count for doubling $m$ in base $p$. We then employ a counting argument to find, in each scale $[M,2M]$, an integer $m$ whose base-$p$ expansions simultaneously force many carries when doubling $m$, for every prime $p\le 2k$, while avoiding the rare event that one of $m+1,\dots,m+k$ is divisible by an unusually high power of $p$. These "carry-rich but spike-free" choices of $m$ force the needed $p$-adic inequalities and the divisibility. The overall strategy is similar to results regarding divisors of $\binom{2n}{n}$ studied earlier by Erdős and by Pomerance.

arxiv.org · arXiv.org

0
0
0
0
0
0
0
0
0
1
0
0
daniel:// stenberg:// @bagder@mastodon.social
Public

Today is the ten year anniversary for one of the best email series I ever received. The "Instagram and Spotify hacking ring" one.

daniel.haxx.se/blog/2016/01/19

“Subject: Urgent Warning”

Back in December I got a desperate email from this person. A woman who said her Instagram had been hacked and since she found my contact info in the app she mailed me and asked for help. I of course replied and said that I have nothing to do with her being hacked but I … Continue reading “Subject: Urgent Warning” →

daniel.haxx.se · daniel.haxx.se

0
3
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
시아란 🌌 Private @siaranics.siaran.kr@bsky.brid.gy
Public
Shared by 잇창명 EatChangmyeong💕🦋

폭주하는 광인의 말을 곧이곧대로 들으면 안 된다. 노벨 평화상을 갈취해 내는 데 성공했더라면 "평화의 상징이 된 내게 바쳐라" 고 주장했을 인간이다.

RE: https://bsky.app/profile/did:plc:g23eq6mc3wh6nk5kmxbobm6i/post/3mcrear4dpi2k

🗞️연합뉴스 속보 봇 (@news-bot.bsky.social)

트럼프 "노벨상 나한테 안줘서…그린란드 통제할 것" https://n.news.naver.com/mnews/article/001/0015855367

bsky.app · Bluesky Social

0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
lunamoth @lunamoth@threads.net
Public
Shared by The Rt. Rev. Fumire, Ph.D. :twitter__verified_organization:

- 삼성, SK하이닉스, 마이크론 등 주요 메모리 업체들이 2025-26년까지 DDR4와 MLC NAND 같은 레거시 제품을 단계적으로 중단하고, 하이퍼스케일러를 위한 고마진 AI 및 엔터프라이즈 메모리로 전환 중

- 마이크론은 소비자 시장에서 완전히 철수하며, 기존 메모리 공급은 감소하고 가격은 상승하고 있음

Out with the Old: Memory Giants Map Their 2025-26 Exit Strategy amid Supply Crunch

https://www.trendforce.com/news/2026/01/19/news-out-with-the-old-memory-giants-map-their-2025-26-exit-strategy-amid-supply-crunch/

[News] Out with the Old: Memory Giants Map Their 2025-26 Exit Strategy amid Supply Crunch

Amid tightening memory supply, the industry is shifting focus to high-margin, cutting-edge products catering to hyperscalers. Legacy, consumer-oriente...

www.trendforce.com · TrendForce

0
0
0
0
0
0
0
0
0
1
0
0
1
0
0
에스텔 뉴스계정 @transborder.bsky.social@bsky.brid.gy
Public
Shared by 초무

"한국에서 십수 년 살아도, 중국보다 한국을 사랑해도 '중국 출신'이라고 혐오하더라"[우리 안의 중국] 입력 2026.01.19. 오전 5:15 [우리 안의 중국] ① 차별·혐오 견뎌 온 중국계 이주민들, 계엄 후 일상 위협에 공포 극심해져 m.pressian.com/m/pages/arti...

"한국에서 십수 년 살아도, 중국보다 한국을 사랑해도 ...

"한국에서 십수 년 살아도, 중국보다 한국을 사랑해도 '중국 출신'이라고 혐오하더라"

윤석열 전 대통령은 12.3 비상계엄을 정당화하기 위한 '명분'의 하나로 '중국 혐오'를 끌어들였다. 근거 없는 '부정선거' 음모론의 배후로 중국을 지목했다. 그러면서 한국 사회 내에서 '혐중' 정서가 본격 수면 위로 떠올랐다. 극우세력은 대림과 명동 등 중국인 밀집

m.pressian.com

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

Formalization of amicable numbers theory. ~ Zhipeng Chen, Haolun Tang, Jingyi Zhan. arxiv.org/abs/2601.07444v1

arXiv logo

Formalization of Amicable Numbers Theory

This paper presents a formalization of the theory of amicable numbers in the Lean~4 proof assistant. Two positive integers $m$ and $n$ are called an amicable pair if the sum of proper divisors of $m$ equals $n$ and the sum of proper divisors of $n$ equals $m$. Our formalization introduces the proper divisor sum function $\propersum(n) = σ(n) - n$, defines the concepts of amicable pairs and amicable numbers, and computationally verifies historically famous amicable pairs. Furthermore, we formalize basic structural theorems, including symmetry, non-triviality, and connections to abundant/deficient numbers. A key contribution is the complete formal proof of the classical Thābit formula (9th century), using index-shifting and the \texttt{zify} tactic. Additionally, we provide complete formal proofs of both Thābit's rule and Euler's generalized rule (1747), two fundamental theorems for generating amicable pairs. A major achievement is the first complete formalization of the Borho-Hoffmann breeding method (1986), comprising 540 lines with 33 theorems and leveraging automated algebra tactics (\texttt{zify} and \texttt{ring}) to verify complex polynomial identities. We also formalize extensions including sociable numbers (aliquot cycles), betrothed numbers (quasi-amicable pairs), parity constraint theorems, and computational search bounds for coprime pairs ($>10^{65}$). We verify the smallest sociable cycle of length 5 (Poulet's cycle) and computationally verify specific instances. The formalization comprises 2076 lines of Lean code organized into Mathlib-candidate and paper-specific modules, with 139 theorems and all necessary infrastructure for divisor sum multiplicativity and coprimality reasoning.

arxiv.org · arXiv.org

0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
시아란 🌌 Private @siaranics.siaran.kr@bsky.brid.gy
Public
Shared by 초무

폭주하는 광인의 말을 곧이곧대로 들으면 안 된다. 노벨 평화상을 갈취해 내는 데 성공했더라면 "평화의 상징이 된 내게 바쳐라" 고 주장했을 인간이다.

RE: https://bsky.app/profile/did:plc:g23eq6mc3wh6nk5kmxbobm6i/post/3mcrear4dpi2k

🗞️연합뉴스 속보 봇 (@news-bot.bsky.social)

트럼프 "노벨상 나한테 안줘서…그린란드 통제할 것" https://n.news.naver.com/mnews/article/001/0015855367

bsky.app · Bluesky Social

0
0
0
:_shi::_no::_no::_n::_do::_wave::_ru::blobcamera: @sinonondoll@misskey.io
Public

しののんさん、高校は写真部入ってたけど、大学でカメラから離れて数年。4年前にドールちゃんお迎えしてから再燃して今これ​:blobcatuwu:​

1
0
0
0
0
0
seuros @seuros@mastodon.bsd.cafe
Public
Shared by Stefano Marinelli

Yesterday some news websites picked on ChaosBSD.
I did read the comments, and created a WIKI : github.com/seuros/ChaosBSD-src

I'm learning Driver building, that a sandbox of a full working system.

Some people raised the concern that FREEBSD -CURRENT should be the sandbox.

That not how operate.

For example, if i get a WIFI driver to scan 2.4gh, and dont have knowledge to do 5GH. That driver land. Someone else could add 5gh or WPA1/2/3 .

This ChaosBSD, the driver should at least do something useful.

I have Broadcom drivers that kernel panic if you stop the scan.

Other usb driver refuse reattach after a suspend mode.

These are the drivers that will not make it in mainline because Freebsd cannot tell it used : `BTW if you have BCM94321MC and close the lid, you lose wifi`

Also this is not a joke project. I'm trying to setup a work flow so we keep in sync with upstream.

Where FreeBSD drivers go to get beaten into shape before upstream. - seuros/ChaosBSD-src

Home

Where FreeBSD drivers go to get beaten into shape before upstream. - seuros/ChaosBSD-src

github.com · GitHub

0
0
0
0
0
0
1
0
0
1
0
0
1
0
0
0
0
0
Larvitz @Larvitz@bsd.cafe
Public
Shared by Stefano Marinelli

The Linux version of the game Factorio runs perfectly fine (with solid 60 FPS/UPS) on FreeBSD 15.0-RELEASE. Using linux64.ko and the rl9 user-land packages. Performance is great, even on an 8 year old ThinkPad T480.

$ file factorio
factorio: ELF 64-bit LSB pie executable, x86-64, version 1 (SYSV), dynamically linked, interpreter /lib64/ld-linux-x86-64.so.2, BuildID[sha1]=3e1ef3fc882aecbbebb1c9d2fc5ca064842310fc, for GNU/Linux 3.2.0

On 14.3-RELEASE, I did still run the Windows64 version via wine (the Linux version was flickering), but now the Linux version is running perfectly on FreeBSD.

I'm very happy with how perfectly it works. Love to play that when traveling in the hotel during a business trip.

THE FACTORY MUST GROW!! 🙂 🏭

🎮 :freebsd_logo:

0
0
0
0
0
0
0
0
0
0
0
0