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

How do you think Santa is handling cyberthreats? With Dangerzone of course! (Yeah, it took some training.) If you feel like testing his security team, you should know it has a challenge for you: Craft Santa a letter that can bypass Dangerzone's defenses and earn a bounty! 💰🎅 dangerzone.rocks/news/2025-12-

0
1
0
1

언어모델 기반 에이전트 (혹은 AI봇)이 툴 호출을 잘하면 좋은데 현재로선 안타깝게 잘 안됩니다 ㅎㅎㅎ 실수를 많이 하는데 그래서 유저나 전문가가 많이 신경을 써줘야하고요 봇이 사용자 의도는 파악해도 파라메터 채우거나 올바른 순서대로 알아서 파악해서 함수 호출하는것이 잘안되더라고요 최신모델도 그렇고...

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

If we use Skyrim as an example, there are plenty of spaces to cross. Mountains, roads, beaches, forests.

Those are often littered with tiny points of interest. A cave, a shrine, a hunter. These exist to insure our journey is not simply "hold W for ten minutes" and almost never have any deeper value or chain to other objectives. They are points to define the space.

But then we have major POI: the cities. These draw us from vast distances.

We also have mission POI, to create more paths.

So I was thinking: if we're generating maps, wouldn't it make the most sense to start by generating the points of interest, then generate the space that separates them according to the experience you want the player to have between two given points?

Like, if two points should be unrelated, you put a big fuckin' mountain inbetween them. If two points seem like a natural fit, there's a road between them.

You can start with the bigg'uns, then recurse down to smaller sizes...

This seems like fun!

0
0
1

The funny thing is i mostly implemented the decode for fun and as a cool demo, not having any serious intent of doing anything with PCIe at the time since I'm mostly an Ethernet guy.

Now look where I ended up. (I did find and fix a few bugs in the decode once I started using it heavily, but that's to be expected)

0
0
0
0
0
0
2
0
0
2

イラスト担当しております『蜘蛛ですが、なにか?』原作10周年記念オンラインくじが開催されております。全部描きました!(原作で使用されたイラストです。一部、本くじ用に加筆した絵もあります)
よろしくお願いいたします…!
https://kujibikido.com/lp/kumo/

1
0
0
1

RE: fedi.lynnesbian.space/@lynnesb

holy shit.

so for YEARS i've thought that google maps just spoke in a really stilted voice for everyone.

turns out it was just because both my and pet's midrange phones were too slow. for basic speech synthesis.

i got a new high end phone today and it just speaks fluently. instead of "in two hundred metres. at the roundabout. take the... first... exit." it's just "in two hundred metres, at the roundabout, take the first exit."

gooooOOOOGGLLLLLEEEE!!!

0
0

You may have heard of eUSB, the low-voltage cousin to the venerable USB 2.0 from 25 years ago. It's used on SoCs made on small process nodes that can't support standard USB 2.0 voltage levels.

Turns out, it recently got an upgrade called eUSB2V2 (yes, really). It supports asymmetric operation (which is a first for USB) at up to 4.8Gbit/s and is aimed at connecting high-resolution webcams in laptops.

0
1
1
0
0

Who do you like for domain name registration that supports giving multiple accounts admin access for the same domain?

I usually use Hover, but I think (?) they’re strictly one domain name = one admin account. And we can just share a password securely between admins, but…I always like to reduce that bus factor when I can!

0
0
1
0
0
0
0
0
0

AI 버블론과 관련해서...

최근 OpenAI가 최근 부진한 성적과 비정상적인 행동을 보여주면서 위험해 보이는 상황입니다. 또한 OpenAI가 생각보다 미운짓 많이 했다는 것을 감안하면 업보 청산 이라는 이벤트가 발생할 가능성도 없지 않습니다.
반대로 구글이 AI 부분에서 많이 올라오면서 현 추세가 지속된다면 구글이 AI 레이스의 최종 승리자가 될 가능성이 높습니다. 하지만 구글은 TPU라고 해서 독자 개발한 프로세서를 사용하기에 AI 관련 투자자 입장에서는 좀 다른 모습을 보일겁니다.

0

Polls are rendering!

screenshot of the latest emoji poll rendered on the ktistec server

I'm working to get all of the little visual elements available across the Fediverse to render in a usable way on Ktistec. When released, users will also be able to vote on polls.

0
0
1
1