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.

1
0

New research reveals hidden weaknesses in WhatsApp’s multi-device group messaging! 🔐 While encryption is strong, lack of cryptographic group membership authentication could let attackers silently join groups. Users must stay vigilant: manage linked devices & verify contacts regularly! 📱🔍

Read more: cyberinsider.com/weaknesses-di

🤫 Psst there is also Signal 😉 👍

support.signal.org/hc/en-us/ar

0
0
0

以前、韓国映画「国際市場で逢いましょう」がインドでサルマン・カーン主演「BHARAT」としてリメイクされたのだけど、この映画、ちょいちょいウヨってる感じが気になってたんだよね。タイトルがBHARATだし

内容は基本的に国際市場〜をなぞってたし面白かったけど、生き別れのきっかけが、印パ戦争でパキスタンに攻め込まれたことが原因になってたし、インド向けに変更されたところ微妙だったんだよね

BHARAT | Official Trailer | Salman Khan | Katrina Kaif | Movie Releasing On 5 June 2019 - YouTube: youtube.com/watch?v=Ea_GKoe81GY

0
0
0
0
0

예전부터 생각하던 건데, git reset --hard를 인자 없이 쓰면 git stash로 동작하거나, 아니면 적어도 인자 없이 썼을 때 오류가 나게끔 설정할 수 있었으면 좋겠다. 별 생각 없이 날려도 괜찮겠지 싶어서 git reset --hard 쳤다가 몇 분 뒤에 후회하는 경우가 종종 있다.

2

As we approach the release of Bonfire 1.0, this isn’t your typical launch announcement. Instead, it’s a moment to reflect on how we’ve built Bonfire, a roadmap of values, methods, and intentions – and an invitation to define what comes next.

In a world of “move fast and break things,” we’ve chosen a different tempo — one rooted in care, deep listening, and collective stewardship...

📣 Read our latest blog post: bonfirenetworks.org/posts/slow

0
0
0

【5/11 文学フリマ東京40 出店!】ブース: O-13

『「キリ看」で学ぶ聖書の世界 Ver.2』
田舎で見かける謎の看板に書かれた、聖書のメッセージを真面目に解説。キリスト教に馴染みがなくても大丈夫です。弊サークルのベストセラー!

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

Wait, so this is how it works in Bluesky OAuth?… If e.g. Skythread, Skeets, Flashes, Skylight uses OAuth, either the user gets logged out every few days or it all needs to go through a backend, do I understand that right?… If so, this is kinda useless, no? 😐 #atdev

RE: https://bsky.app/profile/did:plc:ia76kvnndjutgedggx2ibrem/post/3lope23jcicbu

0
0
0

any TU Berlin students here? there's a brand new Open Source Hardware seminar this semester (MNT will also make an appearance if it happens) and so far only 3 students registered! they need at least 5 to make it work, so if you're interested or know potential candidates at TU, spread the word: tu.berlin/qw/studium-lehre/leh

0
0
0
0

As we approach the release of Bonfire 1.0, this isn’t your typical launch announcement. Instead, it’s a moment to reflect on how we’ve built Bonfire, a roadmap of values, methods, and intentions – and an invitation to define what comes next.

In a world of “move fast and break things,” we’ve chosen a different tempo — one rooted in care, deep listening, and collective stewardship...

📣 Read our latest blog post: bonfirenetworks.org/posts/slow

0
0
0

비퀴어 청년 남성분들 제일 신기한점 억울한 건 되게 많은데 그럼 님을 글케 힘들게 하는 이 사회의 문제점을 진지하게 말해 보라고 하면 갑자기 억울징징은 어디가고 기득권 팬보이 모드가 돼서 AI 쓰는 게 기업 입장에선 좋긴 하다 한국 남자면 군대 가는 게 당연한 거다 복지한다고 무조건 좋은 게 아니다 이럼 하지만 넌 기업가도 아니고 장교도 아니고 나랏님도 아니잖아...

0

We're excited to announce that we've implemented RFC 9421 (HTTP Message Signatures) in , complete with our double-knocking mechanism to maintain backward compatibility with the draft cavage version.

This implementation includes both signature generation and verification, meaning is used when both sending and receiving activities. While we haven't merged the RFC 9421 implementation branch yet, we're currently conducting interoperability tests with development versions of Mastodon and other implementations. Once these tests confirm compatibility, we'll proceed with the merge.

As noted in the attached docs, although RFC 9421 is the final and official standard for HTTP Signatures, the draft cavage version remains widely used across the . Our double-knocking mechanism ensures maximum compatibility by trying the RFC 9421 version first, then falling back to draft cavage if needed.

Currently, we support RSA-PKCS-v1.5 key pairs for generating HTTP Message Signatures, with plans to expand to other signature types in future releases.

We look forward to contributing to a more standardized and secure fediverse!

HTTP Message Signatures

This API is available since Fedify 1.6.0.

RFC 9421, also known as HTTP Message Signatures, is the final revision of the HTTP Signatures specification. Although it is the official standard, it is not widely used in the fediverse yet. As of May 2025, major ActivityPub implementations, such as Mastodon, et al., still rely on the draft cavage version of HTTP Signatures for signing portable activities.

Fedify automatically signs activities with the sender's private key if the actor keys dispatcher is set and the actor has any RSA-PKCS#1-v1.5 key pair. If there are multiple key pairs, Fedify selects the first RSA-PKCS#1-v1.5 key pair among them.

NOTE

Although HTTP Message Signatures support other than RSA-PKCS#1-v1.5, Fedify currently supports only RSA-PKCS#1-v1.5 key pairs for generating HTTP Message Signatures. This limitation will be lifted in the future releases.Double-knocking HTTP Signatures

This API is available since Fedify 1.6.0.

As you read above, there are two revisions of HTTP Signatures: the draft cavage version and the RFC 9421 version. The draft cavage version is declared as obsolete, but it is still widely used in the fediverse, and many ActivityPub implementations still rely on it. On the other hand, the RFC 9421 version is the official standard, but it is not widely used yet.

To support both versions of HTTP Signatures, Fedify uses the double-knocking mechanism: trying one version, then falling back to another if rejected. If it's the first encounter with the recipient server, Fedify tries the RFC 9421 version first, and if it fails, it falls back to the draft cavage version. If the recipient server accepts the RFC 9421 version, Fedify remembers it and uses the RFC 9421 version for the next time. If the recipient server rejects the RFC 9421 version, Fedify falls back to the draft cavage version and remembers it for the next time.
1
0
1
1
0
1
0
0
0
1
0
0
0
1
0
0
0
0
1
0
0
0