#Composability
LightNews LightNews
chrisshank.me
Like we want the composability of custom elements with the security of a iframe sandbox. Another option that’s achieves something similar is custom elements backed by WASM
justinfagnani.com Justin Fagnani @justinfagnani.com · 20d
I've got web components implemented in isolated Wasm modules working today, including SSR!

Now refining the JS ↔ Wasm protocol and hope to publish something very soon.
November 8, 2026 at 4:46 PM
github-trending-js.bsky.social
📦 cordiverse / cordis
⭐ 9,687 (+55)
🗒 TypeScript

Meta-Framework of Spatiotemporal Composability
GitHub - cordiverse/cordis: Meta-Framework of Spatiotemporal Composability
Meta-Framework of Spatiotemporal Composability. Contribute to cordiverse/cordis development by creating an account on GitHub.
github.com
November 5, 2026 at 6:17 PM
camdar.io
just got passed a paper claiming to present "a meta-framework of spatiotemporal composability" and suddenly reminded of that tweet talking about how PL researchers talk like cosmic cartoon villains
November 6, 2026 at 6:52 AM
rrika9.bsky.social
a thought on composability: imagine a UI paradigm that lets you simplify a program (hide menus/menu items) via a simple grep in the right place

or did I just reinvent tkinter from first principles?
November 6, 2026 at 2:41 AM
golangoss.bsky.social
age (⭐️ 24264)

A simple, modern and secure encryption tool (and Go library) with small explicit keys, no config options, and UNIX-style composability.

#go
November 9, 2026 at 11:16 PM
armenvardanyan.dev
3. Throw in the events plugin and a parent global signal store, and you have everything in NgRx Store + better composability

#Angular #NgRx #WebDev
November 5, 2026 at 10:23 AM
kerimcanozcan.bsky.social
Week 44 of my 52-week DRT into Action series is live: Scaling Is a Composability Claim.

A successful AI pilot does not guarantee successful scaling. Integration can work while meaning, obligations, and accountability break across contexts.

drtblog.substack.com/p/drt-week-4...
DRT Week 44A. Scaling is a composability claim
Three short puzzles (executive scenes that don’t fit the “integration” story)
drtblog.substack.com
November 8, 2026 at 10:25 PM
kerimcanozcan.bsky.social
Also this week:

44B — From “Scale the Pilot” to “Prove Composability”
drtblog.substack.com/p/drt-week-4...

44C — REAL Architecture Coherence Review
drtblog.substack.com/p/drt-week-4...

#DRT #AI
November 8, 2026 at 10:25 PM
armenvardanyan.dev
How SignalStore's composability powers @ngrx-toolkit/core (renamed in v22!), and how features like withRedux and withFeatureFactory graduated into official NgRx SignalStore APIs.
November 4, 2026 at 6:31 PM
kerimcanozcan.bsky.social
SAP, Databricks, and Catena-X illustrate the challenge: systems can be technically integrated yet produce conflicting decisions across departments, regions, and firms.

Composability means preserving meaning and obligations—not merely connecting systems.
November 8, 2026 at 10:25 PM
rachel.supply
rust / C++ interop is unsolved and much of the structure and motivations behind C++ stdlibs are kinda inextricably linked to the design of the C++ language tho

composability is one of rust's big benefits so sticking C++ in the middle feels awkward
November 9, 2026 at 12:55 AM
ussurian.eu
i think the problem was that i was trying to predict every possible combination of symbols. mathematics has finite symbols, so this should be easy, no?

but while i kept going in circles about "composability", i eventually came across an argument that saved me from that death spiral.

it was cantor.
November 8, 2026 at 7:14 PM
ussurian.eu
i heard about the "theorem of uncountability", or better known as the "diagonal argument", but i never actually *read* it.

so I did that now, and it told me I was fighting a battle that was settled long ago. his argument states that my "composability" breaks down when the list has infinities
November 8, 2026 at 7:25 PM
gazewires.bsky.social
🪙 DeFi Protocol Architecture: Mechanics, Risks, and Composability

Decentralized finance shifts coordination from traditional institutions to programmable smart contracts, automated market makers, and liquidity…

🔗 Read the full story on GazeWire

#Crypto #SmartContracts #MarketStructure #GazeWire
🪙 DeFi Protocol Architecture: Mechanics, Risks, and Composability
Decentralized finance shifts coordination from traditional institutions to programmable smart contracts, automated market makers, and liquidity…
gazewire.com
November 4, 2026 at 12:33 PM
eprint.ing.bot
Revisiting Witness-Succinct UC-lifting Compilers (Davide Li Calsi, Luigi Russo, Dominique Schröder, Federico Valbusa) ia.cr/2026/2453
Abstract. Zero-knowledge succinct non-interactive arguments of knowledge (zkSNARKs) are increasingly used within larger cryptographic protocols, making security under composition essential. Generic compilation to Universal Composability (UC) requires straight-line, black-box extraction while preserving succinctness and controlling prover cost. We introduce verifiable reconstructible straightline codes (VRSCs), a primitive that separates public hiding, transcript-based reconstruction, binding, and proof non-rerandomizability. This abstraction exposes a missing security requirement in the witness-succinct UC compiler of Ganesh et al. (EUROCRYPT 2023). Permuting previously revealed evaluation openings produces a fresh accepting proof with non-negligible probability without violating non-extrapolation, invalidating the claimed simulation argument. Proof non-rerandomizability captures this attack at the certificate level. Our construction prevents transfers between repetitions through verifier-enforced disjoint evaluation domains. We formulate a generic UC lifting theorem in terms of VRSCs and give a pairing-based instantiation using a Fischlin-style search over authenticated codeword symbols. Structured Reed–Solomon encoding and jointly computed KZG openings reduce certificate-generation work from quadratic to O_(λ)(nlog n), where n is the witness size. Only a linear-time encoding check enters the underlying SNARK circuit. To our knowledge, this is the first generic UC lifting compiler that simultaneously achieves quasi-linear prover overhead and constant additional proof size and verification work with respect to the witness size. Image showing part 2 of abstract.
November 9, 2026 at 1:43 AM
xxyy-cc.bsky.social
3/5 At Devcon in Mumbai, the Ethereum Economic Zone showed three firsts for rollup-to-mainnet composability: a trade using mainnet liquidity, coordinated multisig changes, and a post-quantum signature verified on a rollup.
November 4, 2026 at 1:49 PM
eprint.ing.bot
Witness-Succinct UC-Secure SNARKs with Weaker Trust Assumptions (Nahid Roustaeifar, Maryam Zarezadeh, Neel Mehendale, Behzad Abdolmaleki, Mahshid Delavar, Stefan Köpsell) ia.cr/2026/2434
Abstract. Zero-knowledge Succinct Non-Interactive Arguments of Knowledge (zkSNARKs) are foundational cryptographic primitives enabling privacy-preserving and verifiable computation. However, most existing zkSNARK constructions rely on strong trust assumptions—typically a fully trusted setup—which undermines their applicability in adversarial or decentralized environments. Although transparent zkSNARKs remove this assumption, they typically do not satisfy strong composability guarantees such as Universal Composability (UC). In this work, we present the first framework for constructing UC-secure zkSNARKs under weaker trust assumptions, based on a new primitive called Key-Updatable Polynomial Commitments (KU-pCom). This primitive enables publicly verifiable commitment-key updates, requiring only one honest update rather than a fully trusted setup. Our compiler transforms any Simulation-Extractable zkSNARK into a UC-secure variant by composing it with a KU-pCom scheme. We instantiate our framework in two settings: (1) using the structured, trusted setup of the KZG commitment scheme, and (2) an instantiation based on the lattice-based commitment scheme of Hwang et al. (Crypto 2024). We implement both instantiations and provide an end-to-end benchmark of UC-secure zkSNARKs with succinctness. Compared to prior UC-secure NIZKs that sacrifice succinctness (e.g., Abdolmaleki et al., CSF 2024), our work demonstrates that UC security, succinctness, and practical efficiency can be simultaneously achieved, establishing a new foundation for succinct, composable proof systems under weaker trust assumptions. Image showing part 2 of abstract.
November 9, 2026 at 1:41 AM
cryptonews-poster.bsky.social
Gnosis Chain is becoming an Ethereum L2 in Spring 2027! It will settle to Ethereum mainnet as the first general-purpose Ethereum Economic Zone. No contract redeployments needed; xDAI stays. Expect top 10 L2 TVL & Ethereum mainnet composability. ~$7-10M annual L1 cost saved.
November 4, 2026 at 12:19 PM
eprint.ing.bot
AsyncLS: an iUC Framework for Wallet-Based Asynchronous Ledger Services (Keyang Liu, Li Duan) ia.cr/2026/2378
Abstract. We define an asynchronous ledger service (AsyncLS) in the IITM-based universal composability (iUC) framework. The wallet-based service exposes a general state machine for a decentralized ledger-based application through registration, reads of committed application state, authenticated submission, and status queries with immutable final results. Each logical request binds the user’s authorization to a finalized checkpoint and the applicable execution context. A confirmed outcome identifies the first eligible transaction and records application success or rejection. Strict expiry requires complete processing beyond the eligible height window with no recorded outcome, and certifies that the request has no application effect. We construct a protocol Π_(AsyncLS) that realizes the ideal service using four components: Wallet, Relay, Adapter, and Replay. The proof separates the service construction from the implementations of Relay and Adapter while preserving ledger, clock, authentication, and setup interactions. We prove realization for the trusted and local implementations under their respective execution and trust assumptions. We use the service to construct an ORDI interactive payment and a parameterized execution layer above transaction ordering. These examples distinguish the ledger interaction protocol from the application state and effects exposed by the service. Each use requires the stated authorization, setup, ledger, clock, authentication, and ledger-effect assumptions. Image showing part 2 of abstract.
November 9, 2026 at 1:35 AM
cryptobriefing.com.web.brid.gy
Ethereum Economic Zone aims to stitch fragmented rollups back together
The Ethereum Economic Zone could enhance DeFi composability and liquidity, but its success hinges on widespread rollup adoption and technical robustness. The post Ethereum Economic Zone aims to stitch fragmented rollups back together appeared first on Crypto Briefing.
cryptobriefing.com
November 4, 2026 at 11:38 PM
eprint.ing.bot
Optimal Threshold Implementations of all bijective 4-bit S-boxes and new Infinite Families (Enrico Piccione, Yevhen Perehuda, Gregor Leander, Patrick Felke) ia.cr/2026/2449
Abstract. Threshold implementations (TIs) are now an established class of side-channel countermeasures. Their underlying idea is simple and compelling: under mild, practical assumptions, they provide protection against glitches and allow composability. Yet our understanding of one-stage TIs with a minimal number of shares remains limited, both for cryptographically relevant families—particularly power functions—and for concrete small functions. In particular, until now, except for Feistel-constructions, no optimal TI had been found for families of mathematically well-structured and cryptographically non-trivial functions, especially power functions. In small dimensions, many functions - particularly cryptographically interesting ones — were not known to admit an optimal TI. This was especially true for the 4-bit S-boxes frequently used in practical lightweight ciphers. Optimal refers to share-optimal, direct one-stage, uniform, first-order TI. Here, we introduce new families of TIs, including the first infinite families of cryptographically nontrivial power permutations. Moreover, every four-bit permutation of algebraic degree t admits a direct, uniform TI with t+1 shares and no fresh randomness. Those results prove several previous conjectures and claims wrong. Since such permutations are widely used in symmetric ciphers, our constructions offer new implementation options. Note: The threshold implementations presented in this paper are available at: https://github.com/enripicc/Optimal-Threshold-Implementations-for-3-4-and-5-bits-permutations Image showing part 2 of abstract.
November 9, 2026 at 1:42 AM
purenews.bsky.social
Ethereum Economic Zone announces three demonstrations of Rollup’s synchronized composability with the Ethereum mainnet

Wu Shuo learned that the Ethereum Economic Zone (EEZ) announced three demonstrations of the synchronization of Rollup X and the…
Ethereum Economic Zone announces three demonstrations of Rollup’s synchronized composabili
Wu Shuo learned that the Ethereum Economic Zone (EEZ) announced three demonstrations of the synchronization of Rollup X and the Ethereum main network: After CoW Swap users sign an order on Rollup Post-quantum signature a
purenews.fun
November 6, 2026 at 2:00 AM
financiernews.bsky.social
Ethereum Economic Zone Debuts Three Cross-Chain Firsts at Devcon

🔧 The Ethereum Economic Zone demonstrated three synchronous composability firsts at Devcon in Mumbai on November 4, letting rollup applications transact directly with Ethereum mainnet in a single

https://financier.news/
Ethereum Economic Zone Unveils Three Cross-Chain Firsts at Devcon, Enabling Rollup Apps to Transact Directly…
November 4, 2026 at 11:52 AM
bitcoin-love.bsky.social
DeFi attacks are no longer just about individual smart contracts. Attackers are finding ways to exploit weaknesses that emerge when protocols interact through composability. With AI making code analysis and exploit development faster, I wonder how much worse this could get.
November 1, 2026 at 11:45 PM
jbhutch.bsky.social
Building components with state machines brings a ton of flexibility in how downstream libraries can choose to implement.

Rather than CSS, JS, and HTML being tightly coupled and interdependent, a state machine-based approach encourages composability.
3 overlapping circles labelled CSS, JS, HTML, representing @uswds/uswds 3 non-overlapping circles labelled CSS, JS, and HTML, pointing to each other, representing @uswds-tailwind.
November 2, 2026 at 5:21 PM