Show threadSolarbird Jan 16

@gavi you asked for it

https://www.youtube.com/watch?v=aC0N9CcMdfw

tho' honestly

playing the entire album in order is the real formula you need

#music #p9 #4lung

P9 vs. 4lung - T​+​PAZOLITE IS A FUCKING [REDACTED]

YouTube
Dimly Lit CornersJun 22, 2025

#Goals2025

Moving away from the constant upgrade cycle & moving closer to the ideals of #PermaComputing #MalleableSoftware

Design and setup a redundant system of old/used, cheap, low-power devices running ia: #Guix, #Linux, #FreeBSD, #macOS, #HaikuOS, #Plan9Front, #X11, #P9, #NFS, all working together

Become an expert on #MicroControllers #ESP32 #STM32 #RP2040 #MIPS #RiscV

DIY sensors which sing like birds to communicate their status

DIY robots "drones"

Move as much as possible of my computing needs to the #Terminal, #Emacs, #Rio #CLI #TUI #P9

Get an #3DPrinter and learn to use it

Design and build my own portable 8dot #braille terminal & try out if 3x3 or 3x4 dots is also workable.

Design and build my own low-power computers, their OS, and tools

Writing more of my own tools #DIY

#SmallTalk #ObjectPascal #Prolog #Scheme #Racket #CommonLisp #Haskell #Rust #Go #ObjectiveC #Swift

Deploy #LoRa #ReticullumNetwork #RNodes #MeshCore #Meshtastic

Start an #InternetResiliencyClub

Add #Tor, #I2P support by #WebProxy

#SolarPowered #SelfHost over #I2P, #OnionService #Blog #Wiki #Repositories #GopherHole #Darcs #Mercurial

#SelfHost my own #EmailServer, which will only accept email from #KnownServers #CommunityEmail #MutualEmailAcceptance

Share files via #BitTorrent over #I2P

DIY #HomeAutomation
DIY #GardeningAutomation
DIY #GreenHouse

Get a house cat, train the cat, use voice and gestures

Start asking money for advice & technology support

Build/program my own opportunistic and strange cryptocurrency miners #BTC, #XMR, #ZEC, etc #Art

#MakeMoreArt #LearnToDraw #Learn3DModeling #LearnGenerativeArt #LearnToComposeAmbientMusic

#ReCreateJottit #ReCreateInstikiWiki

#WriteMore #PublishMore #Letters, #Essays, #Missives, #Reports, #Treatise

…

#Incomplete #Ongoing #NotFinal

Dimly Lit CornersMay 27, 2025

#HomeLab

Local Services:
- SysLog
- Sleep Proxy
- #PiHole
- File server (NFS, SMB, AFP)
- TFTP (netboot)
- #PostgreSQL
- WebProxy (SOCKS)
- #Tor + Onion services
- #I2P + Invisible services
- #Reticulum gateway + #LXMF + ...
- Home automation: Matter, thread, …
- #P9

Onion services:
- Archiver
- Wikis, Blogs
- Gopher
- Luanti

Invisible Services
- Alternative path to Onion services
- Full node: BTC, XMR, ZEC
- BitTorrent & tracker

VPS:
- email server

Suggestions are welcome :D

MacMay 7, 2025

#Sonnensystem: Vielversprechender Kandidat für Planet Neun entdeckt

https://www.golem.de/news/sonnensystem-vielversprechender-kandidat-fuer-planet-neun-entdeckt-2505-195913.html

#Astronomie #P9

Sonnensystem: Vielversprechender Kandidat für Planet Neun entdeckt - Golem.de

Die genaue Bahn konnte zwar bisher nicht berechnet werden, dennoch vermutet ein Forschungsteam, dass es sich bei dem Himmelskörper um Planet Neun handeln könnte.

Golem.de
Julien DeswaefMar 12, 2025
#Barcelona #PobleNou #P9
रञ्जित (Ranjit Mathew)Mar 2, 2025

“What I Saw At The Evolution Of Plan 9” [PDF], Geoff Collyer (https://adi.onl/oral.pdf).

Via HN: https://news.ycombinator.com/item?id=43108977

#Plan9 #OS #Unix #ComputerHistory #BellLabs #OperatingSystems #P9

DaLetraJun 28, 2024
Letra da música “Love You In Those Jeans” de P9
#P9 #LoveYouInThoseJeans
https://daletra.com.br/p9/letra/love-you-in-those-jeans.html
Love You In Those Jeans - P9

Uh, wee. You're lookin' so mean. Why you wanna go and do that in those jeans? Why you wanna do like that in those jeans? I saw you out again.

DaLetra
DaLetraMay 28, 2024
Veja a letra da música “Love You In Those Jeans” de P9
#P9 #LoveYouInThoseJeans
https://daletra.com.br/p9/letra/love-you-in-those-jeans.html
Love You In Those Jeans - P9

Uh, wee. You're lookin' so mean. Why you wanna go and do that in those jeans? Why you wanna do like that in those jeans? I saw you out again.

DaLetra
Show threadarXiv math.CO botSep 19, 2023
The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set. In the present paper we provide a $5$-dimensional counterexample to the well-known statement that it is not ever possible for a knight to visit once every vertex of $C(3,k):=\{\underbrace{\{0,1,2\} \times \{0,1,2\}\times \cdots \times \{0,1,2\}}_\textrm{k-times}\}$ by performing a sequence of $3^k-1$ jumps of standard length, since the most accurate answer to the original question actually depends on which mathematical assumptions we are making at the beginning of the game, when we decide to extend a planar chess piece to the third dimension and above. Our counterintuitive outcome follows from the observation that we can alternatively define a $2$D knight as a piece that moves from one square to another on the chessboard by covering a fixed Euclidean distance of $\sqrt{5}$ so that also the statement of Theorem 3 in [Erde, J., Gol\'enia, B., & Gol\'enia, S. (2012), The closed knight tour problem in higher dimensions, The Electronic Journal of Combinatorics, 19(4), \#P9] does not hold anymore for such a Euclidean knight, as long as a $2 \times 2 \times \cdots \times 2$ chessboard with at least $2^7$ cells is given. Moreover, we construct a classical closed knight's tour on $C(3,4)-\{(1,1,1,1)\}$ whose arrival is at a distance of $2$ from $(1,1,1,1)$, and then we show a closed Euclidean knight's tour on $\{\{0,1\}\times\{0,1\}\times\{0,1\}\times\{0,1\}\times\{0,1\}\times\{0,1\}\times\{0,1\}\}\subseteq \mathbb{Z}^7$.
[https://arxiv.org/abs/2309.09639v1]
Proving the existence of Euclidean knight's tours on $n \times n \times \cdots \times n$ chessboards for $n < 4$

The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set. In the present paper, we provide a $5$-dimensional alternative to the well-known statement that it is not ever possible for a knight to visit once every vertex of $C(3,k) := \{0,1,2\}^k$ by performing a sequence of $3^k-1$ jumps of standard length, since the most accurate answer to the original question actually depends on which mathematical assumptions we are making at the beginning of the game, when we decide to extend a planar chess piece to the third dimension and above. Our counterintuitive outcome follows from the observation that we can alternatively define a $2$D knight as a piece that moves from one square to another on the chessboard by covering a fixed Euclidean distance of $\sqrt{5}$ so that also the statement of Theorem~3 in [Erde, J., Gol{é}nia, B., \& Gol{é}nia, S. (2012), The closed knight tour problem in higher dimensions, The Electronic Journal of Combinatorics, 19(4), \#P9] does not hold anymore for such a Euclidean knight, as long as a $2 \times 2 \times \cdots \times 2$ chessboard with at least $2^6$ cells is given. Moreover, we show a classical closed knight's tour on $C(3,4)-\{(1,1,1,1)\}$ whose arrival is at a distance of $2$ from $(1,1,1,1)$, and we finally construct closed Euclidean knight's tours on $\{0,1\}^k$ for each integer $k \geq 6$.

arXiv.org
SoulBlack 🌊 There But For TheApr 24, 2023

在无人关注的游戏论坛世界最近有两件小事。

1、「游戏时光VGtime」编辑部被资方全盘替换，昨日发布了告别公告，今早就被资方一级小号删除，并重发简陋、触众怒的公告称离职员工用官方账号发布的是虚假内容。然后所谓的官方账号后来已注销。

2、由于偷盘哥事件，#P9 某位阴阳哥被现任站长永封（当然有历史清算和民怨激愤之嫌），然后阴阳哥利用另一位大佬的账号发帖说，由于账号被封，以后有奖杯标题翻译和版本标注需求的用户请找新站长维护，让大家多多支持和理解新站长的工作。上午的借号发帖被删，晚上永封的影响开始逐渐显现。一大堆游戏名称没了中文标题，被打回原形。还有一堆不明事情严重的群众不断叫好。如果觉得英文标题顺眼，那你们为什么不去用功能更好的#PSNP ？

关于VGtime一事，我再次感慨，中文网络想要做一个纯粹的数据库+社区是多么理想化与不靠谱。
最后我还是推荐 backloggd。