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

[단독] 인권위, 내란 청산 ‘헌법존중TF’ 구성 않기로 의결했다 www.hani.co.kr/arti/society... "이들 중 안창호 위원장과 김용원·한석훈·이한별·강정혜 위원은 지난 2월10일 ‘내란 옹호’ 비판이 제기된 ‘윤석열 방어권 안건’에 찬성해 내란 특검에 내란 선동·선전 혐의 등으로 고발된 바 있다. 이들은 “헌법 존중 티에프가 공무원의 인권을 침해한다”고 주장했다고 한다. 이날 김용원 위원은 “헌법존중 티에프를 시행하는 정부를 직권조사해야 한다”고 발언한 것으로 전해졌다."

[단독] 인권위, 내란 청산 ‘헌법존중TF’ 구성 않기...

0
0

ちょっと気になったので以前オモチャンで話題になってた「速い水」こと尚仁沢の天然水を買ってみて飲んだんですけど、たしかに速いかも 口当たりが柔らかくて雑味がまったくないので、めちゃくちゃ研がれた刀で切られたことに気づかないみたいな(?)

1
1
0

My wife and I were having a row. I drove past her on my way home while she was walking the dog. The dog shit and she didn't pick it up. I made an anonymous post on our local Facebook community forum calling her out. She saw it and has been sulking about it for weeks. Petty win.

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

We (Microslug), together with our intimate circle of 940 critically important partners (because who doesn’t need nearly a thousand companies involved in their email?) proudly process your data so we can: stash information on your device, “enhance” products in ways you’ll never notice, tailor ads with unsettling accuracy, measure how many ads you didn’t click, extract audience insights worthy of a surveillance thesis, pinpoint your exact geolocation down to the square inch, and identify you via device scanning (don’t worry, that’s just modern life).

Some third parties may process your data based on their “legitimate interest,” a magical phrase that apparently grants unlimited powers if you squint hard enough. You may, hypothetically, exercise your right to consent or object whenever your courage permits by selecting Manage preferences or spelunking through Outlook settings (bring snacks).

By clicking Accept all, you enthusiastically agree to all of this the tracking, the profiling, the location grabbing, the “anonymized-but-not-really” data sharing, the endless cross-device fingerprinting digitally signing your digital soul over to 940 strangers.

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

New post from me over on the @spritelyThe Spritely Institute blog: Composing capability security and conflict-free replicated data types

Local-first apps often use CRDTs, but I'm not really aware of any that fully embrace capability security. This post is an attempt to show how the two can be composed using a simple group chat application as a case study.

spritely.institute/news/compos

A diagram of a local-first chat room shared between Alice, Bob, and Carol.
0
0
0

Slicing Is All You Need: Towards a Universal One-Sided Distributed MatMul

Link: arxiv.org/abs/2510.08874
Discussion: news.ycombinator.com/item?id=4

arXiv logo

Slicing Is All You Need: Towards A Universal One-Sided Algorithm for Distributed Matrix Multiplication

Many important applications across science, data analytics, and AI workloads depend on distributed matrix multiplication. Prior work has developed a large array of algorithms suitable for different problem sizes and partitionings including 1D, 2D, 1.5D, and 2.5D algorithms. A limitation of current work is that existing algorithms are limited to a subset of partitionings. Multiple algorithm implementations are required to support the full space of possible partitionings. If no algorithm implementation is available for a particular set of partitionings, one or more operands must be redistributed, increasing communication costs. This paper presents a universal one-sided algorithm for distributed matrix multiplication that supports all combinations of partitionings and replication factors. Our algorithm uses slicing (index arithmetic) to compute the sets of overlapping tiles that must be multiplied together. This list of local matrix multiplies can then either be executed directly, or reordered and lowered to an optimized IR to maximize overlap. We implement our algorithm using a high-level C++-based PGAS programming framework that performs direct GPU-to-GPU communication using intra-node interconnects. We evaluate performance for a wide variety of partitionings and replication factors, finding that our work is competitive with PyTorch DTensor, a highly optimized distributed tensor library targeting AI models.

arxiv.org · arXiv.org

0
0
0
1
0
1
1
0
1
0

タイムスケジュールとコアタイムについて

みすけっとですがいよいよ今週土日の開催となりました。よろしくお願いいたします。

イベント開催期間中は自由に入場ができますが、交流のためにコアタイムの設定を行いました。
サークル参加者の滞在は必須ではありませんが目安としてご利用ください。よろしくお願いいたします。

・11/29(土) 1日目 開場 00:00
・11/29(土) 1日目 コアタイム(昼の部) 14:00 ~ 16:00
・11/29(土) 1日目 コアタイム(夜の部) 20:00 ~ 22:00
・11/30(日) 2日目 コアタイム(昼の部) 14:00 ~ 16:00
・11/30(日) 2日目 コアタイム(夜の部) 20:00 ~ 22:00
・11/30(日) 2日目 閉場 24:00

※ピクリエにアクセスが集中すると一時的に入場ができなくなるなどの可能性も想定されます。その場合は時間をずらしてご入場ください。よろしくお願いいたします。


みすけっとのイベントページはこちら↓
https://picrea.jp/event/c630fa554a3327d2a262e8705178781847b4d64a421fb94362214e718c4fb578

0
0
1