Hacker Newsnew | past | comments | ask | show | jobs | submit | namibj's commentslogin

Solar is REALLY CHEAP. And provided you keep existing central European gas heating infrastructure around for a while, you can basically just wait out the really good energy storage by using existing caverns you pre-fill with methane to keep your people from freezing. If you're not curtailing a substantial fraction of PV yield (yearly) in central Europe that's a sign there way not enough capacity yet.

Built facades and roofs out of glass-glass PV laminate. We have the technology from glass roofs/facades; you just add glass-catching-mesh/insulation below because you can't use the insulated multi-pane window glass construction with safety lamination and solar cells all three together.


Says electrically 3x2.

Right, but I don’t think a x2 slot exists so hence being physically a x4 card. If you had an open ended x1 slot you might be able to run as PCIe v4 x1.

What they mean is that the cost per bit both capex and opex/power is worse for 10G than 25G for a while now as long as you talk about new hardware.

We're at the point where 25GBaud PAM4 is being replaced by 50GBaud PAM4. That's 50 to 100 Gbit/s.

But iirc the use of PAM4 for the faster ones than "only" 25Gbit/s lanes is a hindrance to managing bottom-barrel price-per-bit. PCIe 3 was 8, PCIe4 was 16, and PCIe 5 is 32 GBaud with a line code basically like the 10+ Gbit/s Ethernet links (well, it's 66b/64b for Eth and 130b/128b for PCIe).


10m is extended reach copper, you can do about triple the range of 100m with approximately the same transceiver analog prowess.

Modern cable trenching at least if you're not hitting rocks is to take a wet vac and a pressure washer and just cut a slit, make sure you got ergonomics sorted and a place to dump the sludge for drying (c.f. kiddie pool, or one of those pools that rely on the top inflated ring to keep the otherwise loose bag of water from spilling...except made from geotextile or something rock/dirt friendly that'll filter the sediment letting the water seep past) before you backfill.

Use simple roof geometry. Use frameless panels in rails/frames made for keeping the building dry under exposed glass roof. Put regular insulation underneath, don't just expose it.

Profit.

Just hard to get the stuff it seems, mostly because the market has a fetish for early-gen retrofit/independent solar panels, as far as mounting goes.


Look at where the Barmen gas power plant is in Wuppertal, Germany to see....

They are like bulbs on an old-school Christmas tree light string, all in series with just one insulated conductor between.


B(+)Trees do actually admit a fast intersection (they offer a way more powerful projected-to-shared-keyspace mutual index join, technically it's even able to do antijoin but that'll actually modify iteration more than a very genericalized inner join; basically whenever you look at a key in any one of the involved indices you project it to a shared keyspace before doing the comparison-based-search things):

You get cache locality from the upper layers, and for navigation basically `let mut head = keyspace.min(); 'outer: while(!cursors[0].finished()){ for(&mut cursor in cursors.iter_mut()) { let new_head = cursor.seek_to_target_or_next_after_if_none_match(head); if (head != new_head) {continue 'outer; }} /* passed all without seeking past target on any one */ output_fun(head, cursors.iter().map(|x| x.val())); }`. If you want you can do the inner loop's seeks concurrently, which helps if those are IO latency bound and you can afford to waste absolute IOPS on eagerly doing that. You'll want to locally compute the max() of those returned and assign that to `head`. Imagine the cursors are lambda-parametrized to feel like they operate on the projected shared keyspace.

If the keys are a bitstring prefix suited to a binary prefix trie you can actually intersect that way, it's beyond worst case optimal when multiple key columns are involved. Sadly any simple implementation strategies of those algorithms have prohibitive external-memory-machine coefficients for their nominally poly-logarithmic IOPS, due to involvement of combinatorial explosion / curse of dimensionality in search tree/trie structures. They do work though. C.f. "Tetris-LoadBalanced"/"Tetris-Reordered".

The latter even tames one index containing "all" even numbers and the other "all" odd numbers, well, matters more if you involve 3+ columns :D


Speculative decoding is already gambling.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: