Or, you know, we could stop growing almonds in the desert www.c-win.org/cwin-water-b...
Hélianthe
@helianthe.net
516 followers 919 following 1.1K posts
the moon is my flagship and her ripple fire she ranges from the sun optimae machinae fulgore solis cybernétrice ∵ she/her/they 🏳️⚧️🏳️🌈
![The Drake equation is:[1]
N = R ∗ ⋅ f p ⋅ n e ⋅ f l ⋅ f i ⋅ f c ⋅ L {\displaystyle N=R_{*}\cdot f_{\mathrm {p} }\cdot n_{\mathrm {e} }\cdot f_{\mathrm {l} }\cdot f_{\mathrm {i} }\cdot f_{\mathrm {c} }\cdot L}
where
N = the number of civilizations in the Milky Way galaxy with which communication might be possible (i.e. which are on the current past light cone);
and
R∗ = the average rate of star formation in our galaxy.
fp = the fraction of those stars that have planets.
ne = the average number of planets that can potentially support life per star that has planets.
fl = the fraction of planets that could support life that actually develop life at some point.
fi = the fraction of planets with life that go on to develop intelligent life (civilizations).
fc = the fraction of civilizations that develop a technology that releases detectable signs of their existence into space.
L = the length of time for which such civilizations release detectable signals into space.[6][7]
This form of the equation first appeared in Drake's 1965 paper.
https://en.wikipedia.org/wiki/Drake_equation](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:njrbgwxgxk6om43tshrjjpjn/bafkreibypyn4cxabj4oaspwhc6nggn6rm56ucxbolylmizxwna636wpsse)
![Keywords
Smart Glasses, Ray-Ban Meta [highlighted], Digitial Harassment, Pick Up Artistry (PUA), Content Moderation](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:njrbgwxgxk6om43tshrjjpjn/bafkreid74xjiy36e7ruoixlznjf334tunv2f7qodrwy6puk3jahkhutx5y)
![/-- On the other hand, no lossless bit-string codec can make *every* nonempty
input strictly shorter. The two one-bit inputs would both have to map to
the sole zero-bit string, contradicting the round trip. -/
theorem no_lossless_bit_codec_shrinks_every_input
(encode decode : List Bool → List Bool)
(roundtrip : ∀ input, decode (encode input) = input) :
¬ ∀ input, input ≠ [] → (encode input).length < input.length := by
intro every_input_shrinks
have false_short := every_input_shrinks [false] (by simp)
have true_short := every_input_shrinks [true] (by simp)
have false_empty : encode [false] = [] := by
apply List.eq_nil_of_length_eq_zero
apply Nat.lt_one_iff.mp
simpa using false_short
have true_empty : encode [true] = [] := by
apply List.eq_nil_of_length_eq_zero
apply Nat.lt_one_iff.mp
simpa using true_short
have impossible : [false] = [true] := by
calc
[false] = decode (encode [false]) := (roundtrip [false]).symm
_ = decode (encode [true]) := by rw [false_empty, true_empty]
_ = [true] := roundtrip [true]
simp at impossible](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:njrbgwxgxk6om43tshrjjpjn/bafkreidm6ucsfywiaklgcv6d2tskgz6q5r3ts4llqb76rfdzuojmfhnd6a)
![https://leanprover-community.github.io/mathlib4_docs/Init/Control/Lawful/Basic.html#LawfulFunctor
class LawfulFunctor (f : Type u → Type v) [Functor f] :
Prop
A functor satisfies the functor laws.
The Functor class contains the operations of a functor, but does not require that instances prove they satisfy the laws of a functor. A LawfulFunctor instance includes proofs that the laws are satisfied. Because Functor instances may provide optimized implementations of mapConst, LawfulFunctor instances must also prove that the optimized implementation is equivalent to the standard implementation.
map_const {α β : Type u} : Functor.mapConst = Functor.map ∘ Function.const β
The mapConst implementation is equivalent to the default implementation.
id_map {α : Type u} (x : f α) : id <$> x = x
The map implementation preserves identity.
comp_map {α β γ : Type u} (g : α → β) (h : β → γ) (x : f α) : (h ∘ g) <$> x = h <$> g <$> x
The map implementation preserves function composition.](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:njrbgwxgxk6om43tshrjjpjn/bafkreid2fower5owhu66e2qmfyee3dqnemusdqmxeazjcqiz2mrolqctei)
![https://en.wikipedia.org/wiki/Republican_Party_(United_States)#State_capitalism
```quote
## State capitalism
Historically, Republicans advocated for free markets and individual achievement as the primary factors behind economic prosperity.[279] Reduction in income taxes for those with higher incomes[280][281] is a core component of Republicans' fiscal agenda.[282]
The relationship between income and voting broke down in the 2010s. Instead, age and education became the best predictors of voting behavior.[283] Writing for Time magazine in 2024, Jeffrey Sonnenfeld described Trump's moves against capitalism as sharing "more in common with far-left progressive positions than with traditional GOP views, and are often far more progressive than the Biden Administration" and wrote that he expected such attacks to continue into his second term.[284]
By 2025, Trump and the Republican Party largely abandoned traditional Republican orthodoxy about protecting and promoting the free market,[285] instead favoring state capitalism by taking direct government equity stakes in major US corporations, an approach that has been characterized by critics in favor of free market economics as socialist.[286] The Trump administration has also deviated from the GOP's conventional free market approach by ordering Nvidia and AMD to pay the federal government a portion of chip sales to China.[287]
In February 2026, the New York Times contrasted Trump's economic policies with those of Mitt Romney, the previous Republican presidential nominee before Trump. It described Trump's economic ideology as similar to dirigisme, used in some countries such as France.[288]
```](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:njrbgwxgxk6om43tshrjjpjn/bafkreicke4dgjrvbnh3jnifpqqhrwg4dhbmftvybwowfleycn6bfxzn25a)
