<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
    <title>lossless</title>
    <link rel="self" type="application/atom+xml" href="https://links.biapy.com/guest/tags/198/feed"/>
    <updated>2026-04-19T08:35:23+00:00</updated>
    <id>https://links.biapy.com/guest/tags/198/feed</id>
            <entry>
            <id>https://links.biapy.com/links/73</id>
            <title type="text"><![CDATA[Spotizerr]]></title>
            <link rel="alternate" href="https://lavaforge.org/spotizerr/spotizerr" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/73"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Spotify music downloader with a lossless twist, based on the deezspot library.

A self-hosted music download manager with a lossless twist. Download everything from Spotify, and if it happens to also be on Deezer, download from there so you get those tasty FLACs.]]>
            </summary>
            <updated>2025-09-04T07:29:15+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/1099</id>
            <title type="text"><![CDATA[Blosc]]></title>
            <link rel="alternate" href="https://www.blosc.org/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/1099"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[As data volumes continue to grow in fields like machine learning and scientific computing, optimizing fundamental operations like matrix multiplication becomes increasingly critical. Blosc2&amp;#039;s chunk-based approach offers a new path to efficiency in these scenarios.

Blosc is a high performance compressor optimized for binary data (i.e. floating point numbers, integers and booleans, although it can handle string data too). It has been designed to transmit data to the processor cache faster than the traditional, non-compressed, direct memory fetch approach via a memcpy() OS call. Blosc main goal is not just to reduce the size of large datasets on-disk or in-memory, but also to accelerate memory-bound computations.

- [C-Blosc2 @ GitHub](https://github.com/Blosc/c-blosc2).

Related contents:

- [Compress Better, Compute Bigger @ ironArray](https://ironarray.io/blog/compute-bigger).]]>
            </summary>
            <updated>2025-08-28T18:59:47+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/5806</id>
            <title type="text"><![CDATA[Zstandard (zstd)]]></title>
            <link rel="alternate" href="https://github.com/facebook/zstd" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/5806"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Fast real-time compression algorithm.

Zstandard, or zstd as short version, is a fast lossless compression algorithm, targeting real-time compression scenarios at zlib-level and better compression ratios. It&amp;#039;s backed by a very fast entropy stage, provided by Huff0 and FSE library.]]>
            </summary>
            <updated>2025-08-29T08:04:34+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/7694</id>
            <title type="text"><![CDATA[FLIF - Free Lossless Image Format]]></title>
            <link rel="alternate" href="http://flif.info/index.html" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/7694"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[FLIF is a novel lossless image format which outperforms PNG, lossless WebP, lossless BPG, lossless JPEG2000, and lossless JPEG XR in terms of compression ratio.]]>
            </summary>
            <updated>2025-08-29T13:19:34+00:00</updated>
        </entry>
    </feed>
