Tootfinder

The US supreme court on Thursday ruled
in favor of the Trump administration’s bid to strip temporary protected status (TPS) from hundreds of thousands of Haitians and Syrians,
who were legally in the US and protected from deportation.
People with TPS are given the permission to live and work in the US because the Department of Homeland Security (DHS) deemed their home countries to be unsafe due to war, political instability or natural disasters.
In the past year, Tru…

US supreme court allows Trump administration to strip Haitians and Syrians of protected status
Decision effects hundreds of thousands of people who have permission to live and work in the US because their home countries are unsafe

It is not clear how quickly Haitians and Syrians will become vulnerable to removal from the United States,
but the ruling from the Supreme Court on Thursday makes them deportable.
Their work permits will expire, and they will lose their jobs and driver’s licenses.
The long-awaited ruling landed like a bomb on the Haitian community in South Florida,
the largest in the country.
It quickly reverberated through Massachusetts; New York; Springfield, Ohio; and other…

‘Nowhere to Go’: T.P.S. Ruling Plunges Many Migrants Into Limbo
The decision renders 1.3 million people from more than a dozen countries, many who have lived in the United States for decades, vulnerable to deportation.

Kraken Technology, which designs and builds autonomous maritime platforms, such as uncrewed subsurface vessels, raised a $175M Series B at a $1B valuation (John Reynolds/Tech.eu)
https://tech.eu/2026/07/09/maritime-defence-startup-kraken-technology-…

Maritime defence startup Kraken Technology hits unicorn status
British-founded maritime defence startup Kraken Technology today said it had achieved unicorn status. The startup, founded in 2020 by former speedboat racer Mal Crease, said it had raised $175m in a Series B funding round at a $1bn valuation, according to a press release. The funding round was led by Digital Transformation Capital Partners (DTCP), with support from the British Business Bank, NATO Innovation Fund (NIF), Rheinmetall, Inocea group as well as VC firms Hico Ventures, Thesiger Capita…

from my link log —
The design principles of the Elixir type system.
https://arxiv.org/abs/2306.06391
saved 2026-06-04 https://dotat.at/:/D3ZFY.html

The Design Principles of the Elixir Type System
Elixir is a dynamically-typed functional language running on the Erlang Virtual Machine, designed for building scalable and maintainable applications. Its characteristics have earned it a surging adoption by hundreds of industrial actors and tens of thousands of developers. Static typing seems nowadays to be the most important request coming from the Elixir community. We present a gradual type system we plan to include in the Elixir compiler, outline its characteristics and design principles, a…

European Parliament triggers procedure to ban Alternative for Germany’s (AfD) EU party
https://www.euronews.com/my-europe/2026/07/07/european-parliament-triggers-procedure-to-ban-alternative-for-germanys-eu-party…

EU Parliament triggers procedure to ban AfD's EU Party
Europe of Sovereign Nations will now face a process that could see it stripped of its status as a European political party, losing funding in the process. Far-right MEPs from other groups opposed the decision. #EuropeNews

Build-Authorized Evidence for Opaque Calls: A Fail-Closed Rewrite-Authority Boundary
Zhonghua Yi (Toka Language Research Group)
https://arxiv.org/abs/2607.18949 https://arxiv.org/pdf/2607.18949 https://arxiv.org/html/2607.18949
arXiv:2607.18949v1 Announce Type: new
Abstract: Detached semantic facts about opaque native providers do not by themselves justify compiler rewrites: rewrite authority must be confined to the accepted fact, selected provider and build, caller, callback environment, observation, and runtime target. We present a build-authorized path-effect interface that enforces this boundary through fail-closed authorization and link receipts. The design separates receipt closure, callback-environment closure, and projection identity, and passes accepted facts to LLVM through a narrow internal API. We use one-hop topology-load reuse as a minimal observable witness of authority, not as the optimization target.
A conservative LLVM consumer reuses a pointer observation only from a noalias root or one constant nonzero projection. Rocq models prove conditional refinement and authority non-amplification under explicit effect, alias, compiler/ABI, and target-resolution premises. We instantiate checked production with Toka: a source-summary gate emits exact LLVM IR, a separate IR checker accepts only a bounded topology-preserving subset, and only accepted IR is compiled into the receipt-bound provider object. A bounded static Darwin/arm64 profile also checks the final direct branch target.
Across issuer-declared readv, recvmsg, and Cairo boundaries, authorized IR retains each opaque call, reduces the relevant loads from two to one, and preserves observed results; mismatched providers, builds, callbacks, projections, and unsupported IR remain neutral. A libjpeg case is rejected because its callback environment is open, while a bound callback singleton demonstrates the supported closure rule. The contribution is a checked deployment-compiler boundary with an explicit trust and applicability frontier, not a uniquely expressive effect encoding or a new load-elimination algorithm.
toXiv_bot_toot

Uniform-Loss Automated Market Making for Prediction Markets
Ciamac C. Moallemi, Dan Robinson, Brian Zhu
https://arxiv.org/abs/2607.17428 https://arxiv.org/pdf/2607.17428 https://arxiv.org/html/2607.17428
arXiv:2607.17428v1 Announce Type: new
Abstract: Automated market makers (AMMs) for prediction markets descend from market scoring rules, where a mechanism operator subsidizes a market to aggregate beliefs about uncertain events. The existing literature has focused on bounding the total worst-case loss to the subsidizer, but has not addressed how that loss is distributed across price states or over time. We use the framework of loss-versus-rebalancing (LVR) to study this distribution and introduce \textit{uniform AMMs}, defined by the property that instantaneous LVR is proportional to pool value and independent of the current token price. In a static setting, we show that for a broad class of \textit{win-martingales} -- processes that converge to 0 or 1 at a fixed resolution time -- there exists a pricing function that achieves uniform LVR under that process, and conversely, that any sufficiently regular pricing function induces a win-martingale under which it is uniform. We then extend the framework to dynamic liquidity management, showing that liquidity levels can be adjusted over time to implement a prescribed target expected cumulative loss schedule. This theory is illustrated with canonical examples of win-martingales and pricing functions. Our results can inform AMM designers and liquidity providers on how the inevitable cost of subsidizing price discovery can be shaped and controlled across both price and time.
toXiv_bot_toot

On Thursday June 25, 2026,
the Supreme Court, in a 6-3 decision,
granted Trump the power to terminate the Temporary Protective Status (TPS)
of hundreds of thousands of Haitians and Syrians living in America.
The ruling clears the path for Trump to extend his mass-kidnappings and deportations to over 350,000 people from Haiti.
Trump and his admin’s focus specifically on Haitian migrants isn't by chance.
What brought them into his focus was one of the …

Following the Trail: From Blood Tribe to the Supreme Court
How a neo-nazi campaign targeting Haitians in Ohio led all the way to the Supreme Court.

ETAS: An Effect-Typed Language for Agent Systems
Huiri Tan, Yikun Wang, Puyang Zhang, Shangyu Li, Jiasi Shen
https://arxiv.org/abs/2607.17780 https://arxiv.org/pdf/2607.17780 https://arxiv.org/html/2607.17780
arXiv:2607.17780v1 Announce Type: new
Abstract: ETAS is a programming language for agent systems that treats model-backed agents, tool calls, prompts, typed memory, human approvals, policies, and execution traces as semantic program elements rather than library conventions. It separates deterministic computation from agentic nondeterminism and externally visible actions while preserving a direct programming style.
We present the core design of ETAS. Its static semantics assigns ordinary types through spec conformance and tracks each computation with two behavioral indices: an escaping effect row and a persistent abstraction of the typed action trace it may request. Specs form a terminating compile-time constraint calculus: type specs provide evidence for polymorphism and resource facts, callable specs constrain function and stage shapes, and trace specs express allow, deny, and temporal constraints. Typing checks requested traces against compiled monitors and emits residual obligations when dynamic resources preclude a complete static proof. The dynamic semantics distinguish requested, handled, denied, and committed events; handlers interpret typed actions without making their requests invisible to authorization or audit.
We formalize a core calculus and state preservation, progress, type/effect soundness, handler trace-transparency, and policy safety. We also implement ETAS in Rust with a command-line interface, typed HIR checks, effect and policy diagnostics, handler checks, and trace-aware execution hooks. ETAS provides a programming-language foundation for reasoning about authorization, nondeterminism, recovery, and audit evidence before and during agent execution.
toXiv_bot_toot