Built with WordPress and KaTeX, hosted on Fastly behind Cloudflare. Domain registered in 2023.
binius.xyz is built with WordPress, hosted on Fastly behind Cloudflare. It measures traffic with Cloudflare Web Analytics and Google Analytics.
| Technology | Version | First seen |
|---|---|---|
| CMS & Site Builders1 | ||
| – | 16 Nov 2026 | |
| WordPress Plugins1 | ||
| – | 16 Nov 2026 | |
| JavaScript Frameworks & Libraries3 | ||
| – | 16 Nov 2026 | |
| Frontend Build Tools & CSS4 | ||
| – | 16 Nov 2026 | |
| Web Servers, Languages & Backend Frameworks1 | ||
| – | 16 Nov 2026 | |
| CDN & Hosting4 | ||
| – | 16 Nov 2026 | |
| Analytics & Tag Management3 | ||
| – | 16 Nov 2026 | |
| Fonts & Icon Fonts1 | ||
| – | 16 Nov 2026 | |
Registration from the registry's RDAP record, the certificate the site serves, and its rank in public traffic lists.
The crew hasn’t read this site’s colors yet. We read a palette when we capture a site’s screenshot, busiest sites first. Meanwhile, browse palettes from other sites.
What the homepage's first heading and body text render in, read from the browser's computed styles, and where the font files come from.
Counted from every stack change we've recorded: of the sites we watched running one of this site's tools, how many went on to add another. A pattern across sites, not a forecast for this one.
magnolia.ns.cloudflare.compaul.ns.cloudflare.comUser-agent: * Allow: / Sitemap: https://www.binius.xyz/sitemap.xml
# binius.xyz - [Basics](/basics.md): Welcome to Binius! - [Concepts](/basics/concepts.md): Overview of the core concepts of verifiable computing - [Binius64 vs. Binius V0](/basics/binius64-vs-v0.md) - [Binius64 Roadmap](/basics/roadmap.md): What features and apps we plan to build - [Binius V0](/basics/binius-v0.md) - [Background](/basics/binius-v0/background.md): Review of previous arithmetization techniques - [Towers of Binary Fields](/basics/binius-v0/towers.md): A crash course on our basic datatypes - [Data Types](/basics/binius-v0/types.md): The fundamental objects in our arithmetization scheme - [Multi-Multiset Matching](/basics/binius-v0/m3.md): A new arithmetization paradigm, based on the balancing of channels - [A Toy Example](/basics/binius-v0/m3/example.md): Illustrating how M3 lets us solve problems - [Definition of M3](/basics/binius-v0/m3/definition.md): Including tables, constraints, flushing rules and channels - [Proving Collatz Orbits](/basics/binius-v0/m3/collatz.md): Another example from elementary number theory - [Lasso Lookup](/basics/binius-v0/m3/lasso.md): Lookups within the M3 formalism - [Further Resources](/basics/resources.md): From blog posts and talks to community resources - [Blog Posts](/basics/resources/posts.md): Irreducible blog posts written throughout Binius's development - [Talks and Lectures](/basics/resources/talks.md): Informal and academic video lectures on Binius - [External Resources](/basics/resources/external.md): Content on Binius written by community members - [Building](/building.md): Everything you need to know to build end-to-end ZK applications with Binius64 - [Demo Circuits](/building/demo-circuits.md): Ready-to-run example circuits for profiling and experimentation - [End-to-End Example](/building/example.md): The full lifecycle of a SHA-256 commitment proof - [Writing a Circuit](/building/example/circuit.md): Starting a fresh project and writing our first circuit - [Proving and Verifying](/building/example/proofs.md): Generating and verifying zero-knowledge proofs about our circuit - [Runnable Project](/building/example/runnable.md): A full, runnable Rust project that generates and verifies proofs - [Circuits](/building/circuits.md) - [Introduction](/building/circuits/introduction.md): Key concepts to know, before you start building - [Gadgets](/building/circuits/gadgets.md) - [Wires](/building/circuits/wires.md) - [Control Flow](/building/circuits/control-flow.md) - [Circuit Composition](/building/circuits/composition.md) - [Performance](/building/circuits/performance.md) - [Tutorials](/building/tutorials.md): Runnable examples in our repository - [Blueprint](/blueprint.md): Cryptographic details about our backend - [Overview](/blueprint/overview.md): High-level summary of Binius64 - [Math Background](/blueprint/math.md): A sketch of the objects we use - [Binary Fields](/blueprint/math/fields.md): Basics on the fields we use - [Multilinear Polynomials](/blueprint/math/multilinears.md): The existence and uniqueness of multilinear extensions - [The Sumcheck](/blueprint/math/sumcheck.md): A review of an essential protocol - [Oblong-Multilinearization](/blueprint/math/oblong.md): Low-degree polynomials on rectangular domains - [Constraint Systems](/blueprint/constraints.md): How we represent computations - [Introduction](/blueprint/constraints/introduction.md): Think R1CS, but with bitwise shifts - [Shifted Value Indices](/blueprint/constraints/indices.md): Specifying shifted components of the witness - [Constraint Arrays](/blueprint/constraints/arrays.md): A convenient formalism - [AND Constraints](/blueprint/constraints/ands.md): Bitwise-AND relations on shifted value indices - [MUL Constraints](/blueprint/constraints/muls.md): Enforcing unsigned-integer-multiplication relations - [The Backend](/blueprint/backend.md): The full explanation of our cryptography - [The Shift Indicators](/blueprint/backend/shifts.md): Algebraically representing arithmetic offsets - [Shifted Witness Polynomials](/blueprint/backend/shifts/polynomials.md): Expressing bitshifting algebraically - [Logical Shifts](/blueprint/backend/shifts/logical.md): Efficiently arithmetizing rightshifts - [Arithmetic Shifts](/blueprint/backend/shifts/arithmetic.md): Handling the high sign bits - [The AND Reduction](/blueprint/backend/ands.md): Evaluating bitwise ANDs of 64-bit words - [The Rijndael Field](/blueprint/backend/ands/rijndael.md): Mathematical groundwork for our small-field zerocheck - [The Univariate Skip](/blueprint/backend/ands/univariate.md): Integrating the univariate skip with deterministic challenges - [The Rijndael Zerocheck](/blueprint/backend/ands/implementation.md): Our efficient prover implementation of our univariate skip variant - [The MUL Reduction](/blueprint/backend/muls.md): Using GKR to handle unsigned integer multiplication - [Multiplying in the Exponent](/blueprint/backend/muls/multiplying.md): From repeated exponentiation to multiplication - [Exponentiating Multilinears](/blueprint/backend/muls/exponentiating.md): Using GKR to multiply "twisted" multilinears - [Combined Protocol](/blueprint/backend/muls/combined.md): Our full protocol for MUL constraints - [The Shift Reduction](/blueprint/backend/reduction.md): The technical core of Binius64 - [Mathematizing Constraint Arrays](/blueprint/backend/reduction/mathematizing.md): Connecting oblong-multilinearized constraint arrays to the witness - [The Sumchecks](/blueprint/backend/reduction/sumchecks.md): The two phases of the shift reduction - [Prover Implementation](/blueprint/backend/reduction/implementation.md): Implementing the shift reduction in a sparsity-aware way - [Public Input Check](/blueprint/backend/public.md): Validating the prover's data's public part - [Polynomial Commitment](/blueprint/commitment.md): Explanation of our multilinear polynomial commitment scheme - [Benchmarks](/benchmarks.md): How Binius measures up in key real-world tasks - [AWS Benchmarks Guide](/benchmarks/aws_guide.md): How to reproduce Binius64 benchmark results in AWS - [Binius](/index.md): Binary Proofs, Blazing Fast - [Media Kit](/media-kit.md): Binius brand assets and media resources
| – |
| 16 Nov 2026 |
| – | 16 Nov 2026 |
| – |
| 16 Nov 2026 |
| – | 16 Nov 2026 |
| – | 16 Nov 2026 |
| – |
| 16 Nov 2026 |
| – | 16 Nov 2026 |
| – | 16 Nov 2026 |
| – |
| 16 Nov 2026 |
| – | 16 Nov 2026 |