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
0
0
1
0

PIOのオペコード眺めてたけどNOPでタイミング調整とかしていて、恐らく最初のACKはすぐ返しちゃいけない?みたいなHWバグに起因する処理があるっぽいんだけどだいぶ微妙な感じがしていて、世の中のPS互換コントローラはよくやってるなと思うなどしている

1
0

Programmers! Did you know you can fairly choose a random item from a list in a single pass, without knowing the total number of items in advance, and in constant, minimal space? This delightful method has lived rent-free in my head since I learned it from the Perl gods in the 90s: csg.sph.umich.edu/chen/Perl/co

0
0
0
1
1
0

youtu.be/N9qtcSOYi1w?... 특별한 장비가 없어도 개인이 고화질 줌 동영상을 찍을수 있으니 별의별것이 다 올라옴;; 댓글 보면 30배 정도만 확대가능일것이라고 하긴하던데 그래도 대단해보임; 첫번째 부분은 원 촬영자가 40분 동안 최대한 안움직이고 손으로 들고 찍은 모양인데... 비닐봉지나 드론 풍선도 아니고 모양이 아주 기괴하긴하네 허허

4K 울트라 100배 줌으로 당긴 한국 최고 선명 UF...

0
1
0
0
0
0
0
1
0
0
0
0
0
0
0

Cybersecurity also isn’t ready for the conversation about how we as an entire industry trick young men into perceiving red team as a way to be legally allowed to be a high tech, vigilante thief and then hire them for crap salaries to write repetitive and futile vulnerability assessment reports.

0
0
0
0
0
0
2
1
0
0

🍢来年4月から自転車の規制が厳しくなり場合によって罰金を取られるとか。 

今まで私用ではヘルメットを被っていなかったが購入した。

でも何だかなあ〜 :blobcatglare:

私は駅まで自転車で行き、駐輪場に停めて電車に乗って通勤する。

なのでヘルメットを持って電車に乗らないといけない。

邪魔だ。

今駅の駐輪場に停めて電車に乗る人でヘルメットを使用している人も、持って電車に乗る人も見た事がない。

これから増えるのか?

駐輪場は屋根がないからヘルメットを自転車に鍵をつけて置いていくと、急な雨が降ったら濡れてしまう。

ただでさえカゴの中に飲みかけの缶ジュースやゴミを入れられる治安の悪さなのに、何されるかわかったもんじゃない。

買い物に自転車でよく行くが、ヘルメットしていくと手が塞がって買い物も不自由になる。

不愉快だ。

そんなにヘルメットって大事なの?
長距離乗車ならともかく、近所に買い物に行くには邪魔なんだけど。

この決まりって本当に意味があるの?

0
1
0
0

福知渓谷
まさかの桜が咲いていて紅葉と桜の競演が見れました
:blob_dancefloor:
砥峰高原~福知渓谷の移動中もとても景色が良かったらしいのでおすすめです
20251120

2
0
1
0
0
0
1
0
0
0
0
0
0

Over at the Erdos problem website, AI assistance is now becoming routine. Here is what happened recently regarding Erdos problem #367 erdosproblems.com/367 :

1. On Nov 20, Wouter van Doorn produced a (human-generated) disproof of the second part of this problem, contingent on a congruence identity that he thought was true, and was "sure someoneone here is able to verify... does indeed hold".

2. A few hours later, I posed this problem to Gemini Deepthink, which (after about ten minutes) produced a complete proof of the identity (and confirmed the entire argument): gemini.google.com/share/81a65a . The argument used some p-adic algebraic number theory which was overkill for this problem. I then spent about half an hour converting the proof by hand into a more elementary proof, which I presented on the site. I then remarked that the resulting proof should be within range of "vibe formalizing" in Lean.

3. Two days later, Boris Alexeev used the Aristotle tool from Harmonic to complete the Lean formalization, making sure to formalize the final statement by hand to guard against AI exploits. This process took two to three hours, and the output can be found at borisalexeev.com/t/Erdos367.le

EDIT: after making this post, I decided to round things out by making AI literature searches on this problem, which (after about fifteen minutes) turned up some related literature on consecutive powerful numbers, but nothing directly relating to #367. chatgpt.com/share/6921427d-9dc gemini.google.com/share/0d2964

0
0
0