Bun

Show HN: How well do you use Claude Code?

A bunch of companies that I spoke to had their own claude & codex OTel dashboards that showed spend + seats per month. However, none of the dashboards actually analyzed how the engineers worked with the tools and if...

hackernews · 원본 ID 49042653

Show HN: Jixp, a Lisp DSL for describing Jax neural nets

This is a side project I've been working on while learning Jax. I noticed that a bunch of the neural net math looked like it would work well in a lisp syntax because most of the data flows through layers in a &quot...

hackernews · 원본 ID 49037725

Show HN: Audio Player with "Binaural Beats" tuned to the same key as your music

Hi HN, Gabriel here. This is a standalone binaural beat generator, combined with a two-deck local audio player built with the Web Audio API. It includes ten harmonic carrier pairs, seven brainwave-state presets, per-har...

hackernews · 원본 ID 49033302

Buz – A fork of Bun using modern Zig, with sub-1s incremental builds

hackernews · 원본 ID 49033099

Cruller: Bun's Zig Runtime, Continued on Zig 0.16

hackernews · 원본 ID 49017344

Testing Distributions Against Bounded Distinguishers

Motivated by the challenge of testing distributions over high-dimensional or continuous domains, we study distribution testing with respect to bounded classes of distinguishers. A representative task is to use samples from an unknown distribution $P$ over a very large domain to decide between two cases: $P = P_{\mathsf{ref}}$ for a fixed reference distribution $P_{\mathsf{ref}}$, or there exists a distinguisher $f$ in a bounded class $\mathcal{F}$ which witnesses the separation $|\mathbf{E}_P[f] - \mathbf{E}_{P_{\...

arxiv · 원본 ID http://arxiv.org/abs/2607.15645v1

QMA Lower Bounds for Batch Verification via Approximate Degree

We study batch verification in QMA query and communication complexity, where the goal is to understand how the resources needed to verify $m$ copies of a Boolean function $f$ depend on $m$. We give a general technique for proving lower bounds on the witness-query tradeoff needed to batch verify a function $f$ in terms of its approximate degree. Applying this technique to an explicit family of DNF formulas $f$, we show that attempting to save even a constant factor on the witness length of the baseline approach to...

arxiv · 원본 ID http://arxiv.org/abs/2607.08888v1

The Prepare and Broadcast Scenario

We introduce the dimension-restricted prepare and broadcast (PAB) scenario, which generalizes standard prepare-and-measure frameworks. Here, the system prepared by a sender undergoes a broadcasting transformation before being locally measured by multiple receivers. We develop a hierarchy of classical, quantum, and nonsignalling models describing this scenario, characterize their corresponding correlation sets, and derive new families of Bell-like inequalities together with linear and semidefinite programming metho...

arxiv · 원본 ID http://arxiv.org/abs/2606.28632v1

On Braverman-Kazhdan's asymptotic Hecke algebra for inner forms of $\mathrm{GL}_n$

We study Braverman-Kazhdan's asymptotic Hecke algebra $\mathcal{J}(G)$ for inner forms $G$ of $p$-adic $\mathrm{GL}_n$. We show that $\mathcal{J}(G)$ and the property for a $G$-representation to extend to a $\mathcal{J}(G)$-module are defined over $\overline{\mathbb{Q}_\ell}$, and hence make sense in the context of the categorical local Langlands correspondence. We show a rudimentary form of compatibility with Hecke operators, allowing us discuss stalks of sheaves on $\mathrm{Bun}_n$ corresponding to the trivial v...

arxiv · 원본 ID http://arxiv.org/abs/2606.21313v1

Graphs of Hecke operators in mixed ramification

We study Hecke operators on moduli spaces of ramified $G$-bundles using the combinatorial language of Hecke graphs. We introduce a general notion of $\mathcal H$-ramification in the spirit of parahoric ramification, which depends on a choice of a divisor and subgroups of $G$ at every point of the divisor. Building on our previous work, we prove that, under mild regularity conditions, the action of a Hecke operator in the deep cusp of $\mathrm{Bun}_G$ in a highly complex ramification mimics an action in a much simp...

arxiv · 원본 ID http://arxiv.org/abs/2605.13824v1

Dialysis Risk Prediction and Treatment Effect Estimation for AKI patients using Longitudinal Electronic Health Records

Progression to dialysis or end-stage renal disease is a rare but clinically important outcome. Clinicians need evidence on how medication exposures influence downstream risk. We constructed a fixed-window EHR cohort (90-day observation, 730-day prediction; N=81401; dialysis/ESRD prevalence: 1.1%) and modeled sequences of diagnoses, procedures, and medications with kidney laboratory trends (creatinine, BUN, eGFR). A transformer-based causal multi-head model was trained to estimate drug- and ingredient-level average...

arxiv · 원본 ID http://arxiv.org/abs/2604.24547v1

Replicable Composition

Replicability requires that algorithmic conclusions remain consistent when rerun on independently drawn data. A central structural question is composition: given $k$ problems each admitting a $ρ$-replicable algorithm with sample complexity $n$, how many samples are needed to solve all jointly while preserving replicability? The naive analysis yields $\widetilde{O}(nk^2)$ samples, and Bun et al. (STOC'23) observed that reductions through differential privacy give an alternative $\widetilde{O}(n^2k)$ bound, leaving...

arxiv · 원본 ID http://arxiv.org/abs/2604.10423v1