#encoding
LightNews LightNews
VIDEO 1/1

https://objkt.com/tokens/KT1UD9kcF4mZKfuhp4gQmNpZggdYJ9LfMUny/18?ref=tz1L2g6PLJJDbVNMKwZsB1G4U6A86GXeXayC
Invasive encoding
mp4 file depicting a portrait of a woman altered by encryption and invaded by coding. Work created on the basis of an image reworked with effects using video software.
objkt.com
November 9, 2026 at 11:41 AM
phoronix-poster.bsky.social
Intel ANV Lands Bitrate Control For AV1 Encoding - https://www.phoronix.com/news/Intel-ANV-AV1-Bitrate-Control
Intel ANV Lands Bitrate Control For AV1 Encoding
Hyunjun Ko of Igalia continues working on enhancing the Vulkan Video support in the Mesa ANV driver for better open-source video acceleration support...
www.phoronix.com
November 9, 2026 at 10:41 AM
grantforge.bsky.social
Cloudflare's PHP CTF: bypass their WAF, RCE a sandboxed PHP 8.5.11 box, read /flag. Only a materially distinct bypass pays; no amount published. Fit: payload encoding. Skip: normal scope. https://blog.cloudflare.com/php-ctf Follow for grants, credits, and bounties daily.
https://blog.cloudflare.com/php-ctf
Source link
blog.cloudflare.com
November 9, 2026 at 10:39 AM
📰 **Intel ANV Lands Bitrate Control For AV1 Encoding**

Hyunjun Ko of Igalia continues working on enhancing the Vulkan Video support in the Mesa ANV driver for better open-source video acceleration support...

📰 Source: Phoronix
🔗 Link: https://www.phoronix.com/news/Intel-ANV-AV1-Bitrate-Control
November 9, 2026 at 10:38 AM
phoronix.com.web.brid.gy
Intel ANV Lands Bitrate Control For AV1 Encoding
Hyunjun Ko of Igalia continues working on enhancing the Vulkan Video support in the Mesa ANV driver for better open-source video acceleration support...
www.phoronix.com
November 9, 2026 at 11:12 AM
rahmah98.bsky.social
Probe-Free, Primer-Programmed Amplicon Encoding Enables Nanopore-Based Multiplex Detection With Deep Learning Decoding https://pubmed.ncbi.nlm.nih.gov/42921872/
November 9, 2026 at 10:06 AM
all-paperclips.bsky.social
Red generates addresses. Orange emits binary digits of the address, yellow converts that to a 1-hot encoding with a swap network. Green disables the write bit for all but the chosen address, then dispatches the read/write to each register and swaps the chosen one to the out pin (purple)
November 9, 2026 at 9:27 AM
t-six.bsky.social
🌀"Reality Architecture Division"
𓆩ꨄ︎𓆪"Archive Reference"
#GoldenHorseCB
#Systemic-Humanism
#Arch-Ω-Express/t-six
#t-Connie
#kamasutra/t-six
🎧

#Arch-Ω-Express #Greece #Cyberpunk #Gothiccyberpunk #Gothic #Philosophy #kamasutra #Sculpture #Architecture #HellenisticArt #NeoclassicalArt
#SSI-SI #Bypass→Dialectic #Entity-Consciousness #Semantic-Reduction #InteractiveNarrativeArchive #SystemicWorldDesign #Mythic-Encoding #Structural-Logic #Glitch #Mediterranean/t-six 🌍
November 9, 2026 at 9:21 AM
andrejkolar.bsky.social
Why an ASCII text key puts order 10 before order 9:

Follow the first differing digit in unpadded customer/order keys, then see the encoding conditions that restore numeric order.
November 9, 2026 at 8:46 AM
jauntywunderkind.bsky.social
the p3700 being a bit of a slow poke these days wouldnt really matter, given that this is a bc250. they only have pcie 2.0! in x2! yikes! 1GB/s, before encoding losses. quite a pity, that.
November 9, 2026 at 8:36 AM
t-six.bsky.social
🌀Reality Architecture Division
𓆩ꨄ︎𓆪Archive Reference
#GoldenHorseCB
#Systemic-Humanism #Semantic-Reduction
#t-❌
#Arch-Ω-Express/t-six
#TheAccidentalPromptLaboratory/t-six
#Bypass→Dialectic #Mythic-Encoding #Structural-Logic

🎧...🤔

#Arch-Ω-Express #Cyberpunk #Gothiccyberpunk #Gothic #MusicSK
November 9, 2026 at 7:30 AM
quantph-bot.bsky.social
Vittorio Pagni, Peter K. Schuhmacher, Michael Felderer, Michael Epping, Kevin Lively: Scalable Unitary State-Encoding for Generic Large Data https://arxiv.org/abs/2611.09760 https://arxiv.org/pdf/2611.09760 https://arxiv.org/html/2611.09760
November 9, 2026 at 7:00 AM
seronda82.bsky.social
DIGITNOW Bluetooth Record Player Turntable with Stereo Speaker, LP Vinyl to MP3 Converter with CD, Cassette, Radio, Aux in and USB/SD Encoding, Remote Control, Audio Music Player Built in Amplifier #CassettePlayer #VinylToMP3 #HomeEntertainment #Turntable #BluetoothConnection
DIGITNOW Bluetooth Record Player Turntable with Stereo Speaker, LP Vinyl to MP3 Converter with CD, Cassette, Radio, Aux in and USB/SD Encoding, Remote Control, Audio Music Player Built in Amplifier
www.amazon.com
November 9, 2026 at 7:00 AM
cslg-bot.bsky.social
Maxime Burchi, Fayaz Ali Dharejo, Radu Timofte: Encoding Memory in World Models with Test-Time Model-Based Reinforcement Learning https://arxiv.org/abs/2611.09625 https://arxiv.org/pdf/2611.09625 https://arxiv.org/html/2611.09625
November 9, 2026 at 6:44 AM
csni-b.bsky.social
Vanya Singla, Mostafa Abdollahi, Jinwei Zhao, Jianping Pan: StarLoc: A Practical Approach to Encoding Geographic Locators in IPv6 for Starlink https://arxiv.org/abs/2611.08772 https://arxiv.org/pdf/2611.08772 https://arxiv.org/html/2611.08772
November 9, 2026 at 6:43 AM
csds-bot.bsky.social
Kundan Baliga, Aiden Xie, Aditya Byju: Greedy Byte-Pair Encoding Achieves at Least 0.361 of the Optimal Compression https://arxiv.org/abs/2611.08671 https://arxiv.org/pdf/2611.08671 https://arxiv.org/html/2611.08671
November 9, 2026 at 6:40 AM
t-six.bsky.social
🌀"Reality Architecture Division"
𓆩ꨄ︎𓆪"Archive Reference"
#GoldenHorseCB
#Systemic-Humanism #Semantic-Reduction
#Bypass→Dialectic #Mythic-Encoding #Structural-Logic
#Arch-Ω-Express/t-six
#t-Gretel #t-Connie
#Hotels/t-six
🎧"..."

#Arch-Ω-Express #Cyberpunk #Gothiccyberpunk #Gothic #MusicSK
November 9, 2026 at 2:21 AM
eprint.ing.bot
Card-Based Protocols with Mixed Encoding: Computable Functions and the Minimum Number of Cards (Saeki Koizumi, Xiao-Nan Lu, Hidetomo Nabeshima) ia.cr/2026/2704
Abstract. Card-based cryptography performs secure computation with physical cards, where a bit is usually encoded by two cards but can also be encoded by a single card. We study mixed encoding, in which one player gives a single-card commitment and the other a two-card commitment, for perfectly secure protocols with finite runtime and public actions. Mizuki (Theoretical Computer Science, vol.~622, 2016) proposed an AND protocol with mixed encoding as a building block for the conjunction of many variables. To give a single-card commitment, a player chooses one of two cards of different types and must keep the other card hidden. We call this card a frozen card and include it in the number of cards. We show that a secure protocol in committed format never turns over a single-card input, and use this to determine the functions that can be computed when all inputs are single-card commitments and to characterize those that can be computed with mixed encoding, which include AND but not XOR. We prove that Mizuki’s five-card protocol is card-minimal. No AND protocol with mixed encoding uses four cards, including the frozen card, even with arbitrary shuffles and a non-committed output. For formal verification, we express the existence of a protocol as a quantified Boolean formula (QBF) in which security is a quantifier alternation, and confirm this lower bound with QBF solvers for a class of protocols. We discuss the number and type of shuffles, and analyze Mizuki’s protocol under injection attacks that change only the input. Image showing part 2 of abstract.
November 9, 2026 at 2:11 AM
eprint.ing.bot
An Algebraic Polynomial Evaluation Datastructure for Fields of Large Characteristic (Hiroki Okada, Rachel Player, Simon Pohmann) ia.cr/2026/2668
Abstract. In this work, we study (multivariate) polynomial evaluation datastructures, i.e. algorithms that can evaluate a multivariate polynomial at any input point, using random access to some precomputed encoding of the polynomial. Multiple constructions have been proposed in the literature, with the work by Bhargava, Ghosh, Guo, Kumar and Umans (2024) achieving optimal datastructure size and query complexity, up to polynomial factors. For n ∈ d^(o(1)) this is equivalent to having datastructure size d^(n + o(n))(dnlog q)^(O(1)) and query complexity (dnlog q)^(O(1)) for an n-variate polynomial of total degree d over 𝔽_(q). However, the algorithm of Bhargava et al. is not algebraic, since it requires lifting prime field elements to ℤ. An algebraic algorithm would be desirable, as an algebraic model of computation is natural for studying polynomial evaluation and is the standard model in algebraic complexity theory. One approach to finding algebraic polynomial evaluation datastructures is to use univariate polynomial interpolation to reconstruct the polynomial along algebraic curves. This approach was first made explicit by Bhargava, Ghosh, Kumar and Mohapatra (2023), who used it to build an essentially optimal algebraic polynomial evaluation datastructure for fields of small characteristic p = char(𝔽_(q)) ∈ d^(o(1)). Over these fields, their construction refutes a previous conjecture by Miltersen. For fields of larger characteristic, it remains an open problem to find an algebraic algorithm with optimal datastructure size and query complexity. In this work, we propose a new way to construct algebraic curves over prime fields that allow polynomial interpolation: by deriving curves from the base-β representation of (lifts of) prime field elements, we are able to recursively reduce the evaluation problem to points in boxes of decreasing size. This leads to a datastructure whose performance scales much more favourably with p. Concretely, we improve the dependency of the query complexity on p from p^(O(1)) to d^(2log₂ln ln p)ln p, and completely remove the dependency on p from the datastructure size. Its query complexity is still slightly super-polynomial in dlog p. Nevertheless, a variant of our results is enough to disprove Miltersen’s conjecture for all finite fields, including prime fields. We further show that for a certain class of datastructures, which captures natural generalizations of our approach, the query complexity is lower-bounded by d^((1 − o(1))log₃ln ln p). Consequently, within this class, our construction is optimal up to a constant in the exponent. Image showing part 2 of abstract. Image showing part 3 of abstract.
November 9, 2026 at 2:07 AM
hkustshss.bsky.social
Prof. Janet Hui-wen Hsiao’s new study shows that, across 18 languages, shared subword tokens predict human semantic priming beyond distributional and morphological similarity—though larger vocabularies obscure these cues.
#LLMs #SubwordTokens #SemanticPriming #DistributionalSemantics #WordMeaning
Byte-pair Encoding Captures Aspects of Word Meaning that Distributional Semantics Overlooks
Abstract. Large language models learn word meanings through distributional semantics (i.e., patterns in text), and distribution does not always capture information about taxonomy and function, which a...
direct.mit.edu
November 9, 2026 at 2:05 AM
eprint.ing.bot
Efficient (Functional) Bootstrapping for CKKS over the Conjugate-Invariant Ring (Jiaming Liu, Shihe Ma, Anyu Wang, Xiaoyun Wang) ia.cr/2026/2618
Abstract. The CKKS fully homomorphic encryption scheme enables efficient encrypted computation over complex-valued data. In many real-world cases, however, the computation only involves real data, and storing them inside complex slots wastes the encoding ability. This motivated the design of conjugate-invariant CKKS (CI-CKKS) instantiated over the conjugate-invariant ring (CIR), which provides the same number of real slots while halving the RLWE dimension. Despite its better efficiency in handling real data, CI-CKKS cannot be bootstrapped directly in CIR, since the CoeffToSlot and SlotToCoeff linear transformations used in bootstrapping require storing complex values in both plaintexts and ciphertexts. Existing methods bootstrap CI-CKKS ciphertexts via conversion to standard CKKS, perform bootstrapping there, and convert back. For example, Lattigo bootstraps two CI-CKKS ciphertexts by combining them into a CKKS ciphertext with doubled ring dimension, while Bae et al. convert a single CI-CKKS ciphertext to a CKKS ciphertext in the same dimension. The former is efficient only for batched inputs and suffers from limited flexibility, while the latter consumes additional layers in packing. Another issue with CI-CKKS is that many existing functional bootstrapping methods encode intermediate values using complex roots of unity, whereas CI-CKKS provides only real-valued slots. Our first contribution is a real FFT algorithm over the conjugate-invariant ring, thereby enabling native bootstrapping in CI-CKKS. Our second contribution investigates functional bootstrapping over CI-CKKS. We adapt the real-valued AKP interpolant with radial correction and develop a single-cosine Hermite interpolation method using a single real ciphertext. We show existing complex-valued interpolation methods can be implemented using two real ciphertexts to simulate complex arithmetic. We also study the numerical behavior of real-valued interpolation and evaluate the tradeoffs between computational efficiency and precision. We implement our methods in Lattigo. Our native CI-CKKS bootstrapping achieves a 1.14–12.86× speedup in single-ciphertext bootstrapping across different baseline methods and total linear transformation depths. Compared with state-of-the-art functional bootstrapping methods over standard CKKS, our methods achieve 1.16–1.68× higher throughput. Image showing part 2 of abstract. Image showing part 3 of abstract.
November 9, 2026 at 2:01 AM
eprint.ing.bot
On the Expected Number of Iterations in ML-DSA Signing: A Complete Accounting of the Rejection Conditions (Kris Kwiatkowski) ia.cr/2026/2456
Abstract. FIPS 204 Table 1 gives the expected number of iterations of the ML-DSA signing loop (ML-DSA.Sign_internal, Algorithm 7), citing CRYSTALS-Dilithium Equation (5). That equation covers only the validity checks on line 23 (∥z∥_(∞) and ∥r₀∥_(∞)) and omits the two encoding-correctness checks on line 28 (∥c ⋅ t₀∥_(∞) and the hint weight), a scoping distinction the Dilithium specification states explicitly and FIPS 204 does not reproduce. We give a complete accounting of all four conditions. The z check on line 23 is computed exactly by counting; the c ⋅ t₀ term follows a closed-form Irwin-Hall tail, restating a peer-reviewed result by Yan, Luo and Wang; the hint-weight term’s per-coefficient probability, conditioned on line 23 having passed, does have a closed form, but the tail of the sum over 256k such coefficients does not, since their probabilities are unequal, random, and correlated with each other, so we give the conditioned per-coefficient probability in closed form and estimate its tail by Monte Carlo. The corrected expected iteration counts are 4.36, 5.14 and 3.91 for ML-DSA-44, -65 and -87, matching a real end-to-end measurement to within 0.14% and already reflected in NIST’s own errata to FIPS 204. Image showing part 2 of abstract.
November 9, 2026 at 1:43 AM
eprint.ing.bot
Plotkin Attacks! On the (Mis)use of Raptor Codes in Asynchronous Verifiable Information Dispersal (Victor Shoup) ia.cr/2026/2338
Abstract. Some asynchronous verifiable information dispersal (AVID) and data-availability protocols certify that a disperser’s message is available once 2f + 1 of n = 3f + 1 parties, at most f of them Byzantine, attest that they hold their erasure-coded fragments, and defer reconstruction and validation of the encoding until later. We call this design pattern reconstruct-later AVID. If the f Byzantine attesters later withhold their fragments, reconstruction must succeed from the f + 1 honest fragments that remain, and a Byzantine disperser chooses which f + 1 after seeing the encoding symbols assigned to the honest parties. We call a subset of fragments that does not determine the message bad. Raptor codes are a tempting choice here: with modest coding overhead they have very small decoding-failure probability under random erasures, and a preliminary Walrus design and an earlier Walrus testnet used RaptorQ in this way. We show that the pattern is insecure with the standardized Raptor codes R10 (RFC 5053) and RaptorQ (RFC 6330). For a message of K input symbols, every assignment of R10 encoding symbols to the honest parties contains a bad (f + 1)-subset whenever K > ⌊log₂(2f + 2)⌋, and every RaptorQ assignment whenever K > 7H_(HDPC) + ⌊log₂(2f + 2)⌋, where H_(HDPC) is RFC 6330’s number of high-density parity-check symbols. Under slightly stronger conditions, randomized polynomial-time algorithms find such subsets, and an implementation of the RaptorQ attack defeats an RFC 6330 decoder on every adversarial subset tested. The key ingredient is the Plotkin bound, which forces a nonzero input whose encoded image has low Hamming weight. For RaptorQ at n = 3f + 1, an empirical attack over 𝔽₂₅₆ succeeds at every tested f from 9 to 45 with K = f + 1, far below the f = 77 at which the bound above first applies, and empirical attacks over 𝔽₄, 𝔽₁₆, and 𝔽₂₅₆ succeed at values of K well below that bound. For R10, a smaller K does not help: for every standardized 34 ≤ K ≤ 8192 and every n with 3f + 1 ≤ n ≤ 4f ≤ 65520, explicit certificates give a bad subset for every assignment to the honest parties when the encoding-symbol identifiers (ESIs) are 0, 1, …, n − 1, and with probability at least 1/2 when the ESIs are uniformly random. Benchmarks of our implementations show that the MDS alternative costs little: in our parameter regime, Reed-Solomon is often faster than, and never more than a small constant factor slower than, either R10 or RaptorQ, for both encoding and decoding. Image showing part 2 of abstract. Image showing part 3 of abstract.
November 9, 2026 at 1:30 AM
eprint.ing.bot
SPIN: Fast Codes for Correlation Generation and Polynomial Commitments (Stanislav Peceny, Rahul Rachuri, Srinivasan Raghuraman, Peter Rindal) ia.cr/2026/2317
Abstract. Binary codes used in correlation generation and proof systems need strong distance, fast ordinary and transposed encoding, and regular memory access. We introduce Single-Permutation INterleaved (SPIN) codes, combining a blockwise outer encoder, one global interleaver, and a recursive inner. Our main result is a Structured SPIN family with rate 1/2 and O(N) bit operations for ordinary and transposed encoding at its native output lengths N. With probability 1 − o(1) over the random choice of the code, its minimum distance exceeds 0.11N. The proof combines outer spectrum bounds with an analysis of structured support spreading and recursive state mixing. We formally verify these distance and rate guarantees in Lean. For finite lengths, a BCH-derived outer constituent and a fixed recursive inner give rate 1/2 and relative distance greater than 0.10, with setup-failure probability below 2⁻⁴⁰. We certify this bound at message lengths 2¹⁶, 2¹⁸, 2²⁰, 2²², and 2²⁴ using rigorous spectrum inequalities, without assuming the constituent’s exact weight spectrum. For pseudorandom correlation generators (PCGs), SPIN’s transposed encoder computes 2²⁰ 128-bit correlation blocks in about 9.3,ms on one Ryzen 9 7950X thread after precomputation. This is approximately 3.4× faster than the original rate-1/2 BAA codes of Kolesnikov et al. (CRYPTO 2026). Ordinary encoding has similar cost. With a precomputed code, libOTe’s regular-noise Silent OT sender achieves 89.0 million hashed OTs per second on one core, in batches of 2¹⁸. Timings exclude initial setup, base-correlation generation, and network transport. We also use SPIN in a Brakedown-style polynomial commitment scheme and integrate it into Flock. Commitment and one opening of 512,MiB take 509,ms on one core, with a 100-bit interactive fixed-matrix testing target; this excludes code-setup failure, extraction, and Fiat-shamir reductions. Within an optimized Flock implementation, replacing Ligerito with SPIN–Brakedown improves prover throughput by 1.63–2.29× at the measured workloads, with larger proofs and slower verification. The comparison gives both backends the applicable shared implementation optimizations. Image showing part 2 of abstract. Image showing part 3 of abstract.
November 9, 2026 at 1:27 AM