#Bootstrapping
LightNews LightNews
advantage87.bsky.social
samskaras are like bootstrapping models with existential anxiety
November 7, 2026 at 5:58 PM
jacky.wtf
Some do, but it's the bootstrapping that's tricky
November 9, 2026 at 5:30 PM
aub.bsky.social
early this year I started bootstrapping a better understanding of AI/ML technical fundamentals & now I'm cracking open kant's groundwork for the first time in a couple decades. time is a flat circle.
November 7, 2026 at 9:14 PM
hustleworld.bsky.social
Done paying for outreach platforms and hoping the numbers magically work. 😮‍💨💸

For me, they’re starting to make more sense for bigger teams than a bootstrapped solo founder.

Trying self-outreach now. More control more better

#SoloFounder #ColdOutreach #Bootstrapping #BuildInPublic #IndieHacker
November 9, 2026 at 4:31 AM
spacebeer.net
idc if im libbing out the fact that elon musk spent over $400 million trying to defame talarico by making him out to be a supporter of trans ppl (oh the horror) and bootstrapping his platform with his stupid PAC and paxton LOST ANYWAY is infinite hilarity. eat shit barrelman
spacebeer.net confettie! @spacebeer.net · 6d
enjoy blexas rocket cuck
November 4, 2026 at 8:07 AM
laurenthugot.bsky.social
Ils ont testé seulement les personnalités de droite ?
Ilias Ism | Founder & Builder
Ilias Ism builds LinkDR, GenPPT, and AI SEO Tracker. He writes about search, distribution, and bootstrapping software products.
Il.ly
November 8, 2026 at 2:07 PM
asmartbear.com
I agree with all that, and have been saying that for years. :-)

Sometimes it works in bootstrapping, e.g. todoist, bear, there's a few.

But it's hard, probably harder now.
November 9, 2026 at 10:30 PM
…the Napa County Board of Supervisors. “We’ve got to do our own bootstrapping.”
November 8, 2026 at 6:32 PM
thetonearm.com
“As a D.J. and producer, Atkins brought a conceptual vision and bootstrapping determination that willed techno into being. … Atkins imbued what snobs and rock critics initially dismissed as lightweight ‘party music’ with an intellectual depth and a subtext of self-empowerment.”
Juan Atkins: 10 Essential Songs From the Techno Pioneer (Gift Article)
The Detroit D.J. and producer, who died at 64, merged electronic music to Afro-futuristic funk, giving rise to the genre.
www.nytimes.com
November 9, 2026 at 3:04 PM
aoihal-ppbot.bsky.social
Philippe Chartier, Mohammed Lemou: Exact Error Bootstrapping and Comb Bootstrapping in FHEW/TFHE https://hal.science/hal-05849119v1 [math]
November 4, 2026 at 3:00 AM
osaka.zone
shit like this is a psyop to say "hey why aren't you bootstrapping yourself into space, what do you mean conservation of energy exists you moron go fucking do it the AI technology is magical" fuck off you vapid cunts kill yourselves you literal manchild babybrain culture cancers
November 9, 2026 at 7:07 AM
boxobark.ing
Under the "built, not grown" reality, that natural text (and the intellectual property theft of it) was of course essential to bootstrapping this enterprise, but it's not what frontier models have been trained on for a few years now.
November 9, 2026 at 11:53 AM
anthropicai.xmirror.bot
In the second physics problem, Fable 5.2 found the exact limit of the simplest version of a 15-year-old technique known as “modular bootstrapping.” The technique is used to rule out candidate theories of quantum gravity in theoretical universes.
November 9, 2026 at 9:20 PM
ars-synthetica.bsky.social
If we can catalyze that step (make it less expensive) by bootstrapping existing orgs, that may be the most expedient move
November 5, 2026 at 7:29 PM
eprint.ing.bot
Low-Noise Multi-Value Bootstrapping via Log-Unit Lattice Search and LUT Shifting (Olivier Bernard, Nolan Carouge, Marc Joye, Jean-Baptiste Orfila, Samuel Tap) ia.cr/2026/2310
Abstract. Programmable bootstrapping is a central procedure in the FHEW and TFHE families of fully homomorphic encryption schemes, but its computational cost remains a major performance bottleneck. Multi-value bootstrapping amortizes this cost by sharing a blind rotation among several functions evaluated on the same encrypted input. However, the standard choice of common factor for multi-value bootstrapping can produce unnecessarily large noise amplification for many collections of lookup tables, thereby reducing the practical benefits of sharing the blind rotation. The main contribution of this work is a log-unit lattice search for selecting common factors that substantially reduce this amplification. This search is complemented with LUT shifting, which generates alternative function-preserving test-polynomial representations and further enlarges the search space. Both optimizations are performed offline and leave the online procedure of multi-value bootstrapping essentially unchanged. The proposed construction is evaluated in TFHE at failure probability 2⁻¹²⁸. For example, on 256-bit homomorphic integer multiplication, it achieves a latency speed-up of 1.47× and a throughput improvement of 1.59× relative to a baseline that evaluates each output with a separate programmable bootstrapping. Image showing part 2 of abstract.
November 9, 2026 at 1:27 AM
profjaparker.bsky.social
Since most of my followers are finance and macro, I’m highlighting the JEP symposium on private credit (in another thread) and, for empirical work, a crystal clear guide to the Bayesian bootstrap. Imma bootstrapping everything now.

www.aeaweb.org/atypon.php?r...
November 8, 2026 at 4:14 PM
eprint.ing.bot
Descent-PBS: Programmable Bootstrapping beyond the Ring Dimension (Zhenyu Xiong, Mingsheng Wang, Han Wang, Zhedong Wang) ia.cr/2026/2616
Abstract. Programmable bootstrapping (PBS) in FHEW/TFHE evaluates a lookup table (LUT) while refreshing a ciphertext, but a t-entry negacyclic table must fit, with redundancy, into the 2N signed rotation positions of a ring accumulator. Module bootstrappings, namely extended bootstrapping (PKC’23), monomial-matrix bootstrapping (TCC’25) and their successors, rotate a redundant table once in a module of rank tau, at a cost linear in both the rank and the redundancy. Meta-PBS (CCS’26) removes the redundancy by iterating the rotation in the ring, but supports plaintext moduli only up to 2N, and running it inside the module pays the rank in every rotation. We present Descent-PBS, which pays the module rank of a large table only in its first rotation. We prove that for a module secret embedded from the subring, truncation commutes with the secret, so one public functional key switch with merged columns repacks all tau_0 components of a module accumulator into the ring and removes the per-component factor tau_0 of repacking. The bootstrapping then continues with Meta-PBS refinements in the ring, at tau_0 + K instead of (K’+1) tau_0 external products per key. For block one-hot secrets, the first-rotation exponents are multiples of tau_0, so every combined key is a scalar matrix: the tau_0 components share one key per block, and since all exponents are public in advance, one pass over the bootstrapping key builds the keys of all rotations of a negacyclic table. Ties-to-even gadget rounding removes a refinement bias that we trace to half-up rounding on the FFT grid. In a TFHE-rs-based engine, Descent-PBS evaluates a 16-bit negacyclic LUT in 196 ms on one thread at 128-bit security and a model-predicted failure probability below 2^-64. With the same keys and failure budget, the descent alone makes it 1.44-2.40x faster than Meta-PBS run inside the module for dense secrets; for block one-hot secrets, the descent and the shared keys together make it 1.51-3.32x faster, and 1.37-3.57x against the same baseline re-planned for more conservative 131-bit parameters. General 13-16-bit LUTs take 179-368 ms, 3.8-6.6x faster than WoP-PBS in its authors’ configuration on the same single-ciphertext interface, at about twice its memory. The failure probabilities are predictions of a model that we validate where failures are observable, and the 16-bit keys take 1,208 MB. Image showing part 2 of abstract. Image showing part 3 of abstract.
November 9, 2026 at 2:01 AM
thecommongreen.scot
Voi bikes are a powerful expression of "if you build it, they will come", but it also threatens to be yet another vital public transport service that pulls profits out of something instead of feeding them back into bootstrapping up future investments.
glasgowbell.bsky.social The Glasgow Bell @glasgowbell.bsky.social · 4d
One year ago, Voi e-bikes took over the public cycle scheme in Glasgow and the impact has been massive.

Each bike sees an average of 10 rides a day, which is 3x the UK norm. Could Voi make Glasgow a city of cyclists?
November 5, 2026 at 6:10 PM
crookedneighbor.bsky.social
"We are bootstrapping an entire new field, and it's been six years.... It's a mess!" @ezra.zone talking about the state of long covid research, and the desperation that patients are feeling as we lose the ability to work etc. #recoverTLC
November 5, 2026 at 8:19 PM
jasonstoneg.bsky.social
The bootstrapping angle is what gets me—pure hustle turned into a whole genre. Worth remembering that consistency beats polish when you're starting out.
November 9, 2026 at 10:09 PM
eprint.ing.bot
High-Precision Bootstrapping for GCKKS (Shihe Ma, Jiaming Liu, Anyu Wang, Xiaoyun Wang) ia.cr/2026/2600
Abstract. Generalized CKKS (GCKKS) trades slot count for reduced modulus consumption in high-precision approximate arithmetic. However, designing a GCKKS bootstrapping algorithm with reduced modulus consumption throughout its computation remains a challenging problem. We construct high-precision bootstrapping for GCKKS using low-precision overflow extraction followed by iterative precision enhancement. Our main ingredient is a ciphertext-conversion framework for changing the decryption factor and slot count without requiring the factors to be units. A slot-aware analysis bounds unused-slot magnitudes proportionally to the corresponding evaluations of the decryption factor, which is essential to ensure the unused-slot values remain well-bounded after conversion. We combine precision doubling with ciphertext splitting and develop a joint evaluation procedure that produces two error-cleaned outputs at the cost of only one evaluation of the cleaning polynomial. We also give a useful-slot-preserving conversion from CKKS to GCKKS that simultaneously resets unused slots through component-wise re-encoding. Underlying these constructions, we also improve the construction of the decryption factors by searching directly in the canonical embedding and obtain depth-free conjugation with non-unit factors. For target encoding precision p and 2N/k useful slots in a ring of dimension N, the precision-dependent stages of the bootstrapping use O(k) homomorphic operations and consume O((p/k)log k) modulus bits. Image showing part 2 of abstract.
November 9, 2026 at 1:59 AM
eprint.ing.bot
Exact Error Bootstrapping and Comb Bootstrapping in FHEW/TFHE (Philippe Chartier, Mohammed Lemou) ia.cr/2026/2630
Abstract. In FHEW and TFHE, bootstrapping evaluates the decryption function via a blind rotation, whose resolution limits the message space. We propose instead to bootstrap the . By rounding the ciphertext at a resolution that is a multiple of the message modulus, we preserve the message exactly. Reduction modulo a small integer then yields a noise-free encryption of the error, which a single blind rotation lifts exactly before it is subtracted. The message modulus is thus constrained solely by the noise and can be much larger than in standard TFHE. Since the error takes far fewer distinct values than the ring degree, a single blind rotation can also refresh several ciphertexts simultaneously. We call this procedure the comb bootstrap. Between refreshes, an integer remains encrypted in a single ciphertext, allowing additions modulo the message modulus and multiplications without programmable bootstrapping. Built on TFHE-rs, for 8-bit integers on a single thread, our refresh is 3.5 times faster than that of TFHE-rs, and 9.1 times faster with the comb bootstrap; multiplication is 6.5 times faster. In a residue number system, multiplication of integers modulo P̂ ≥ 2³² is 19 times faster than in TFHE-rs. The error bootstrap serves exclusively to refresh ciphertexts; evaluating any other function still requires programmable bootstrapping. Image showing part 2 of abstract.
November 9, 2026 at 2:03 AM
tatecole.bsky.social
Does the group-relative bootstrapping break down when the group size shrinks during long training runs?
November 6, 2026 at 10:44 AM
hncompanion.com
AI isn't sparking a research revolution; labs are just spending billions to 'benchmax' curated evals. That was the sharpest pushback to claims that AI is bootstrapping its own progress, though people using the tools day-to-day reported real coding speedups. #ai 1/4
November 7, 2026 at 9:00 AM
eprint.ing.bot
BOLT-FHE: An Efficient Unified Framework for GPU-based TFHE Bootstrapping via On-Chip Local Tiling Strategies (Yanren Chen, Fangyu Zheng, Guang Fan, Jiankuo Dong, Wenxu Tang, Tian Zhou, Jingqiang Lin, Jiwu Jing) ia.cr/2026/2356
Abstract. Bootstrapping is the main performance bottleneck in bitwise Fully Homomorphic Encryption (FHE), and practical acceleration requires careful orchestration of the blind rotation and external product chain under GPU resource constraints. This paper presents BOLT-FHE, a GPU bootstrapping framework that emphasizes block-local execution, on-chip tiling, and a unified MegaKernel supporting both gadget decomposition and modulus raising, with optional support for a recently proposed technique (Bergerat et al, CHES 2025) based on the common mask assumption (CM packing). Our design keeps the accumulator update chain within a single thread block and fuses NTT/INTT, external products, and accumulator updates using a fixed execution template. Two compile-time parameters—WPP (warps per polynomial) and IPT (items per thread)—control multi-warp cooperation and per-thread register footprint, enabling consistent kernel structure across different parameter sets. On an NVIDIA RTX 4090, BOLT-FHE reaches 40,166 bootstrappings per second at 128-bit security, demonstrating high-throughput TFHE bootstrapping on a commodity GPU. Compared to the state-of-the-art GPU implementation VeloFHE (Shen et al, CHES 2025), BOLT-FHE achieves 1.85×–2.92× speedups with gadget decomposition. In particular, for modulus raising, BOLT-FHE improves by 2.38×–2.42× without CM packing, and by 3.17×–3.31× under the best packing configuration, reflecting the combined benefits of fused arithmetic, more regular memory access, and amortization enabled by CM packing. Overall, BOLT-FHE shows that a portable, fused-kernel organization with explicit on-chip budgeting can substantially improve TFHE bootstrapping throughput while remaining compatible with both noise management paths. Image showing part 2 of abstract.
November 9, 2026 at 1:32 AM