Whole-known-network
<p><span class="h-card" translate="no"><a href="https://infosec.exchange/@david_chisnall" class="u-url mention">@<span>david_chisnall</span></a></span> <span class="h-card" translate="no"><a href="https://discuss.systems/@steve" class="u-url mention">@<span>steve</span></a></span> <span class="h-card" translate="no"><a href="https://mastodon.social/@wingo" class="u-url mention">@<span>wingo</span></a></span> (each individual pass will perform every possible rewrite after only iterating through the netlist once; it's only the case where there are very incremental simplifications achieved by 2 or 3 passes running in a chain which result in this inefficiency)</p>
<p><span class="h-card" translate="no"><a href="https://infosec.exchange/@david_chisnall" class="u-url mention">@<span>david_chisnall</span></a></span> <span class="h-card" translate="no"><a href="https://discuss.systems/@steve" class="u-url mention">@<span>steve</span></a></span> <span class="h-card" translate="no"><a href="https://mastodon.social/@wingo" class="u-url mention">@<span>wingo</span></a></span> the main downside is that the current implementation will do 2 passes rewriting 99% of the netlist and then 15 passes rewriting the same one cell using all three passes over and over until it converges. I think this should be fixable with a system that tracks a lower bound on the cells to be revisited, running partial passes followed by one full pass once partial ones find nothing to mop up anything it missed</p>
<p><span class="h-card" translate="no"><a href="https://infosec.exchange/@david_chisnall" class="u-url mention">@<span>david_chisnall</span></a></span> <span class="h-card" translate="no"><a href="https://discuss.systems/@steve" class="u-url mention">@<span>steve</span></a></span> <span class="h-card" translate="no"><a href="https://mastodon.social/@wingo" class="u-url mention">@<span>wingo</span></a></span> FPGA synthesis, actually</p><p>most of it is this straightforward term rewriting system; it runs on graphs rather than trees but otherwise the idea is the same</p><p><a href="https://github.com/prjunnamed/prjunnamed/blob/main/generic/src/simplify.rs" target="_blank" rel="nofollow noopener" translate="no"><span class="invisible">https://</span><span class="ellipsis">github.com/prjunnamed/prjunnam</span><span class="invisible">ed/blob/main/generic/src/simplify.rs</span></a></p><p>the fixpoint loop is here, it also runs the merge and split passes. these are not inherently required for the domain, but we use word-wide (multibit) terms in the netlist, so you end up missing simplifications if you never split off unused bits of the result, etc</p><p><a href="https://github.com/prjunnamed/prjunnamed/blob/main/generic/src/lib.rs" target="_blank" rel="nofollow noopener" translate="no"><span class="invisible">https://</span><span class="ellipsis">github.com/prjunnamed/prjunnam</span><span class="invisible">ed/blob/main/generic/src/lib.rs</span></a></p>
<p>Sadly the RoadCraft demo is currently broken on Steam Deck / Linux <a href="https://www.gamingonlinux.com/2025/02/sadly-the-roadcraft-demo-is-currently-broken-on-steam-deck-linux/" target="_blank" rel="nofollow noopener" translate="no"><span class="invisible">https://www.</span><span class="ellipsis">gamingonlinux.com/2025/02/sadl</span><span class="invisible">y-the-roadcraft-demo-is-currently-broken-on-steam-deck-linux/</span></a></p><p><a href="https://mastodon.social/tags/RoadCraft" class="mention hashtag" rel="tag">#<span>RoadCraft</span></a> <a href="https://mastodon.social/tags/Gaming" class="mention hashtag" rel="tag">#<span>Gaming</span></a> <a href="https://mastodon.social/tags/Linux" class="mention hashtag" rel="tag">#<span>Linux</span></a> <a href="https://mastodon.social/tags/SteamDeck" class="mention hashtag" rel="tag">#<span>SteamDeck</span></a> <a href="https://mastodon.social/tags/AMD" class="mention hashtag" rel="tag">#<span>AMD</span></a></p>
<p><span class="h-card" translate="no"><a href="https://mastodon.social/@whitequark" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>whitequark</span></a></span> <span class="h-card" translate="no"><a href="https://discuss.systems/@steve" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>steve</span></a></span> <span class="h-card" translate="no"><a href="https://mastodon.social/@wingo" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>wingo</span></a></span> Oh, FOGA place and route? I guess that’s a more constrained search space, so I’d imagine a better theoretical best case, but it’s such a huge search space I’m surprised it makes a difference in practice. If you have a write up somewhere of how you achieve the fixed point, I’d love to read it. Especially if there are features of FPGAs that make it easier.</p>
<p><span class="h-card" translate="no"><a href="https://mastodon.social/@gamingonlinux" class="u-url mention">@<span>gamingonlinux</span></a></span> ai dis, ai dat, ayy i ain't gettin' any younger</p>
<p>Steam Deck SteamOS 3.6.22 brings a fix for pre-compiled shader downloads <a href="https://www.gamingonlinux.com/2025/02/steam-deck-steamos-3-6-22-brings-a-fix-for-pre-compiled-shader-downloads/" target="_blank" rel="nofollow noopener" translate="no"><span class="invisible">https://www.</span><span class="ellipsis">gamingonlinux.com/2025/02/stea</span><span class="invisible">m-deck-steamos-3-6-22-brings-a-fix-for-pre-compiled-shader-downloads/</span></a></p><p><a href="https://mastodon.social/tags/SteamOS" class="mention hashtag" rel="tag">#<span>SteamOS</span></a> <a href="https://mastodon.social/tags/SteamDeck" class="mention hashtag" rel="tag">#<span>SteamDeck</span></a> <a href="https://mastodon.social/tags/Linux" class="mention hashtag" rel="tag">#<span>Linux</span></a> <a href="https://mastodon.social/tags/Steam" class="mention hashtag" rel="tag">#<span>Steam</span></a> <a href="https://mastodon.social/tags/Valve" class="mention hashtag" rel="tag">#<span>Valve</span></a></p>
<p>finite state machine of the reproductive behavior of the binturong (1981)</p>
<p><span class="h-card" translate="no"><a href="https://mastodon.social/@gamingonlinux" class="u-url mention">@<span>gamingonlinux</span></a></span> I don't understand the reasons behind this. What cheats work on Linux desktop but not on Steam Deck</p>
