Made in Forli, Italy

Built by one engineer.
Measured, not marketed.

Pedulli is the work of Francesco Pedulli - an independent, EU-sovereign, GDPR-by-design project. The promise is simple: every public number is a measured result, the engine internals stay closed, and we make no absolute-security claims.

Pedulli ships two products: the T15 Orchestrator (lossless compression) and the Pedulli SRD Engine (a witness-gated exact verifier plus measured closure gain). Engine internals stay sealed.

Francesco Pedulli

Founder & engineer - Forli, Italy

Download CV (PDF) GitHub - InfiniMatrix LinkedIn

About the founder

Francesco Pedulli is an independent software engineer based in Forli, Italy. Pedulli is a solo-built engineering project focused on a single discipline: lossless data compression you can verify byte-for-byte, with an exact verifier layer on top.

The project is deliberately self-sealed. The runtime is protected and the engine internals remain closed, but every claim on this site is backed by something you can check: a byte-exact roundtrip, a SHA-256 hash, a reproducible benchmark, or an exact equivalence test. Where the engine wins, we show it. Where established codecs win, we say so.

For the full background - education, work history and project timeline - see the CV.

Read the full CV ->

Measured results - the only claims we make

What is actually substantiated

Three results, each independently checkable - every public number here is a measured result.

01 / COMPRESSION

Byte-exact lossless, +1 byte floor

A byte-exact roundtrip (SHA-256 verified) with a +1 byte never-worse floor on Pedulli's own output. It uses Pedulli's SRD-derived compression logic together with standard codecs and keeps the smallest verified output -> never larger than the best standard codec (worst case +1 byte). Wins outright on structured data; ties the best codec on already-optimal/random data. Not "superior to all", not "past the Shannon bound".

02 / MDP EQUIVALENCE

Exact value/policy preservation

MDP and game decisions: exact value and policy equivalence under a stated symmetry - a correctness check, not a speedup claim.

03 / EXACT VERIFIER

Witness-gated checks

A witness-gated exact verifier: real AES-GCM re-encryption check, a p*q == N bigint check, a SHA-256 roundtrip, and supplied-clause SAT. It verifies supplied witnesses; cryptographic and security domains are verifier-gated and authorized-scope only.

Public boundary: protected runtime + exact verifier + measured closure gain + diagnostic if not closed. Self-sealed - proof without disclosure, engine internals remain closed, no absolute-security claims. Vertical ratios mentioned elsewhere on the web are projections/targets, not delivered customer results.

See our research tracks (under verification) -> See competition results & our proof-gated policy ->

Built by one engineer.Measured, not marketed.