Kava (KAVA) sustainability report

Kava is present on the following networks: Binance Smart Chain, Osmosis.

BNB Smart Chain, the programmable chain of BNB Chain and formerly styled Binance Smart Chain, reaches agreement through Proof of Staked Authority, a design that borrows stake-weighted election from delegated proof of stake and rotating, permissioned block production from proof of authority. Bonded stake decides who may produce blocks rather than who wins any individual slot. The network keeps an active set of forty-five operators, ranked by the amount of the native asset bonded to them through self-delegation and through delegation from holders. The twenty-one highest-ranked form the cabinet tier and the next twenty-four are candidates, with everyone below inactive and producing nothing. Rankings are recomputed once a day, so membership of the set turns over on a daily cycle rather than per block.

Within each epoch a consensus group of twenty-one is drawn from the active set, weighted heavily toward the cabinet tier, and those operators take turns proposing in a fixed rotation. Turn length and epoch length are protocol parameters that have been retuned repeatedly as block intervals shortened: successive upgrades cut the interval from three seconds to 1.5, then to 0.75 in mid-2025, and to 0.45 seconds in January 2026. A separate voting layer sits above the rotation, in which validators sign attestations on recent blocks; once enough signatures accumulate a block is treated as final, giving deterministic finality in roughly a second. Should that voting layer stall, the chain falls back to confirmation by accumulated depth, which takes minutes rather than seconds.

Security rests on an honest supermajority of a deliberately small elected set, backed by on-chain penalty logic. A slashing contract watches for double signing, for contradictory attestations in the fast-finality vote, and for repeated failure to produce during an assigned turn. Consequences range from temporary jailing and lost rewards through to removal from the set and forfeiture of part of a validator's own bonded stake. The trade-off is deliberate: a compact, frequently re-elected validator set buys very short block intervals and cheap execution, at the cost of the broader operator base that larger validator sets provide.

Osmosis is a sovereign chain built with the Cosmos SDK, reaching agreement through CometBFT, the Byzantine fault tolerant engine that carried the name Tendermint Core until its rename in 2023. Blocks are committed in rounds: a validator from the active set proposes, the set votes in a prevote stage and then a precommit stage, and the block is finalized the moment precommits representing more than two thirds of bonded voting power are collected. Nothing is probabilistic about this, so a committed block cannot be reorganized away and no confirmation depth needs to be observed. The guarantee the engine provides is that honest validators never commit conflicting blocks while fewer than one third of bonded voting power misbehaves; past that point the chain halts instead of forking.

Validators are ranked by the stake bonded to them, self-bonded and delegated counted together, and the highest ranked fill a fixed number of active slots, which on this network is seventy, a deliberately tighter set than several of the chains it interoperates with. Delegation lets holders of the native asset assign their weight to an operator and share in that operator's rewards, and it carries the same downside the operator carries. Bonded stake takes a fortnight to unwind, roughly half the period used elsewhere in the ecosystem.

What sets this network apart from a general-purpose Cosmos chain is that its exchange lives inside the state machine rather than in contracts deployed on top of one. Pool creation, routing a swap across several pools, concentrated liquidity positions, and the accounting of trading fees are all protocol modules that validators execute as part of processing a block, so a trade is a consensus-level state transition carrying exactly the same finality as a transfer. The protocol also runs an arbitrage module of its own, which inspects a proposed block for price discrepancies its pools have opened and captures the correction for the protocol rather than leaving it to outside searchers. A number of recurring operations, issuance and reward distribution among them, are processed once per daily epoch instead of every block.

Kava is present on the following networks: Binance Smart Chain, Osmosis.

BNB Smart Chain pays for its own security out of transaction fees rather than out of new issuance. The native asset carries no protocol-level block subsidy, so every reward reaching a validator or a delegator originates in gas paid by users. When a block is finalized the proposer's collected fees are routed into system contracts and split three ways. A governed fraction is sent to an unspendable address and permanently removed from supply, a slice accumulates in a reward vault used for network-wide purposes such as paying for fast-finality attestations, and the balance sits in the validator-set contract until it is distributed, on a daily cycle, to active validators and the holders who delegated to them.

Participation is staking-based. An operator must self-delegate a substantial amount of the native asset before it can be considered for the active set, and holders may bond additional stake to any validator to lift its ranking. Delegators receive their proportional share of whatever the validator earns, after the commission that validator sets for itself, and only the forty-five ranked operators earn at all: stake bonded to an inactive validator yields nothing. Unbonding is subject to a waiting period, so stake cannot be pulled out the instant misbehavior comes to light.

Penalties are graduated. Missing assigned turns or going offline for a sustained stretch triggers jailing, during which the validator produces nothing and earns nothing. Double signing and contradictory attestations in the finality vote are treated far more severely and can cost the validator a portion of its own bonded stake alongside ejection from the set.

Users face a conventional gas-metered fee model inherited from the Ethereum virtual machine. Each operation carries a gas cost, the sender chooses a gas price, and the total is charged in the native asset. There is no separate storage rent, so the cost of persisting state is bundled into execution gas, and deploying or calling a contract is priced purely by the computation and storage it consumes. The minimum acceptable gas price is a coordinated parameter that operators and infrastructure providers have revised downward several times, keeping ordinary transfers and contract calls inexpensive in absolute terms.

Three groups are paid on this network, and the balance between them has shifted markedly. New units of the native asset are minted on a daily cadence along a schedule that steps down by a third every seven hundred and thirty days, and governance decides how each day's issuance is split. Liquidity provision was once the largest claim on that issuance; it has since been removed from the split entirely, on the argument that trading revenue rather than subsidy now sustains the pools. The staking share has been cut back as well, with most of each day's issuance now directed into the community fund alongside a fixed development allocation. Bonded stake is increasingly compensated from revenue instead: transaction fees collected in the native asset accrue to stakers, and fees paid in other accepted denominations are converted first.

That revenue comes from trading. Every swap pays a spread factor to the providers of liquidity in each pool it touches, and separately a taker fee to the protocol, set by default at a tenth of a percent and overridden route by route by a delegated fee committee that prices heavily traded pairs down and thin ones up. Taker fees collected in the native asset are split so that the larger part is destroyed and the remainder is paid to stakers. Taker fees collected in other assets are divided between the community fund and a buyback that acquires the native asset before splitting it the same way, which ties the rate of destruction directly to trading volume. Liquidity providers may bond their positions for additional incentives, and a superfluid arrangement lets the portion of a bonded position represented by the native asset be delegated to a validator at the same time, so one unit of capital both secures consensus and backs a pool.

Ordinary transactions pay gas at a base price that climbs when blocks fill and falls back when they empty, resting on a governance-set minimum, a mechanism intended to price out spam rather than to raise revenue; fees may be paid in a whitelisted set of denominations, not only the native one. Validators must charge at least five percent commission. Signing two conflicting blocks costs a validator and its delegators a share of bonded stake and permanent exclusion from the set, while missing too many blocks results in jailing rather than confiscation.

Kava is present on the following networks: Binance Smart Chain, Osmosis.

The energy figure for BNB Smart Chain is built upward from the node population rather than downward from operator revenue, which is the appropriate treatment for a staked network where block production is not a computational race. Nothing about the fee model or the value of the native asset determines how much hardware is deployed: the size of the validator set is fixed by protocol, and the wider population of non-validating nodes is driven by demand for chain access.

The estimate has three inputs. The first is the number of machines. The elected validator set is known from the chain itself, while the surrounding population of full and archive nodes is approximated from peer-discovery crawls, public node listings and network scans, all of which observe only nodes willing to accept inbound connections and therefore tend toward undercounting. The second input is a representative hardware profile per node, inferred from the client software's published requirements, which on this chain are demanding relative to slower networks of the same family, since sub-second block intervals and rapid state growth push operators toward high core counts, large memory and fast solid-state storage. The third is the electrical draw of such a machine, taken from measurement of comparable configurations on the bench, both under sustained load and at idle, because a validator idles between its assigned turns and that baseline draw is a real part of the total. Aggregating the per-machine figure across the estimated population, with an allowance for the overhead of the facilities housing it, gives the network total.

Several qualifications belong with the result. It is a modeled estimate resting on observed node counts and stated software requirements, not metered consumption at the socket. Where evidence is thin, the assumptions chosen lean toward overstating rather than understating consumption. Figures are revised as crawler coverage and hardware information improve. Finally, apportioning a share of the network total to any single asset issued on the chain is done from observed on-chain transfer volumes, which measures how heavily an asset is used rather than the energy it uniquely causes.

The reported consumption for this network is a modeled estimate rather than a measurement taken from a meter, and it is built from the machines that keep the chain running. The first task is to size that machine population. It comprises the seventy validators in the active set, the bonded candidates waiting outside it, and the full, archive, and indexing nodes that serve the trading interfaces, routing services, and relayers connecting this chain to its neighbors. The count is approximated from peer discovery on the public network, from what operators publish about their own deployments, and from the chain's own on-chain register of who is bonded.

Each machine is then represented by a hardware profile. The client software publishes the processor, memory, disk, and bandwidth a node needs to stay in sync, and a machine meeting those requirements stands in for the node. This chain sits at the demanding end of the range for its family, because validators execute swap routing, concentrated liquidity accounting, and the protocol's own arbitrage checks inside block processing rather than delegating them to a contract layer, and because several recurring tasks are batched into a daily epoch that produces a pronounced load spike. Electrical draw for the representative machine comes from controlled measurement of comparable equipment across its load range, idle draw included, since nodes are powered continuously. Draw multiplied by population over the reporting period gives the network total, from which a per-asset share is apportioned using observed on-chain activity.

Two caveats matter. The population and the hardware mix are inferred from public observation and stated software requirements, not from operator disclosure, and where evidence is missing the assumption chosen raises rather than lowers the estimate, so the figure is likelier to overstate than understate. Second, a correction: earlier assessments attributed to this network a share of another chain's consumption on the grounds that the other chain contributed to its security. That is not how this network is secured. It has its own validator set, its own bonded stake, and its own penalties, and the estimate here covers only the machines that run it. Figures are restated as observation improves.

Kava is present on the following networks: Binance Smart Chain, Osmosis.

The renewable share reported for BNB Smart Chain follows from where its machines physically run, so the method begins with locating them. Node addresses visible through peer discovery and public network observation are resolved to hosting providers, autonomous systems and countries, producing an approximate geographic distribution of the validator and full-node population. Where that observation is too sparse to stand on its own, the distribution of a network with a comparable staking design and operator economics is substituted, on the reasoning that similar incentives attract similar operators into similar hosting markets.

That distribution is then matched against national electricity statistics. Each country's share of generation coming from renewable sources is taken from Share of electricity generated by renewables, compiled and processed by Our World in Data from Ember's yearly electricity datasets and the Energy Institute's Statistical Review of World Energy. Weighting those country-level shares by the portion of estimated node capacity sitting in each gives a single renewable percentage for the network.

Energy intensity is a separate quantity and is defined marginally: the additional electricity associated with one further transaction being processed, rather than the annual total divided by the transaction count. On a chain that produces blocks on a fixed schedule whether or not they are full, the marginal figure is far smaller than a simple average would suggest, and the two should not be used interchangeably.

Three limits are worth stating plainly. An observed hosting location identifies a grid but not a procurement arrangement, so an operator buying renewable power on a carbon-heavy grid is indistinguishable from one that is not. Cloud and proxy infrastructure can place a node's apparent location away from the hardware actually running it. And national annual averages smooth over the hourly and seasonal variation in generation mix that a continuously running machine actually draws from.

Because electricity is generated differently from one grid to the next, the renewable share reported for this network depends on establishing where its machines are. Locations are inferred from publicly observable network data: the addresses validators and other nodes advertise to their peers, the hosting ranges into which those addresses fall, and whatever operators choose to publish about their own infrastructure. The output is a distribution of the node population over countries and regions, never a precise site for a given machine. Where the distribution cannot be established with confidence, the observed distribution of a network with a comparable consensus design and comparable rewards is substituted, on the assumption that similar economics lead operators to similar places.

Every region in that distribution is then paired with published statistics on the composition of its electricity generation, and the network's estimated consumption is weighted across the regions to yield the proportion met from renewable sources. The generation statistics are taken from Share of electricity generated by renewables, compiled by Our World in Data with major processing from Ember's yearly electricity data and the Energy Institute's Statistical Review of World Energy.

Energy intensity is reported as a marginal quantity and should not be read as consumption divided by transaction count. It answers a narrower question: how much additional energy the network draws when one further transaction is included in a block. That distinction is particularly sharp here. Validators run continuously and commit blocks on a fixed cadence whether or not there is trading to process, so nearly all of the draw is a standing cost, and the incremental cost of one more swap, which is executed by the same validator process as any other message, is very small by comparison.

The method's weakest link is geolocation. An address identifies a hosting provider rather than a customer, machines behind large commercial cloud regions are assigned to the advertised region rather than to a physical building, and the grid statistics are averages over a country or region that ignore any supply arrangement an individual facility has made. Where a stand-in distribution has been used, its representativeness remains an assumption.

Kava is present on the following networks: Binance Smart Chain, Osmosis.

Emissions for BNB Smart Chain are derived from the same geographic picture used for the energy mix, then converted using regional carbon factors. Node locations are approximated from peer-discovery data, public network observation and hosting attribution, and where coverage is insufficient the distribution of a structurally similar staked network stands in. Each location carries the carbon intensity of its national grid, drawn from Carbon intensity of electricity generation, processed by Our World in Data from Ember's yearly electricity data and the Energy Institute's Statistical Review of World Energy and published under a CC BY 4.0 license. Multiplying the electricity attributed to each region by that region's grams of carbon dioxide equivalent per kilowatt-hour, and summing across regions, gives the annual emissions figure.

The split between scopes matters for interpretation. Scope 1 covers emissions from sources the network's operators control directly, such as on-site fuel combustion, which for a population of general-purpose servers in rented facility space is generally negligible and is reported as such. Scope 2 covers the indirect emissions embodied in the electricity those machines purchase from the grid, and that is where effectively the whole footprint sits. Emissions upstream of operation, in the manufacture and eventual disposal of the hardware, fall outside this accounting boundary.

Greenhouse-gas intensity mirrors the energy definition: the incremental emissions associated with one additional transaction, not the annual total divided by throughput.

Uncertainty in the emissions figure compounds the uncertainty in the two inputs behind it. Any error in the estimated electricity total propagates directly into the result, and the geographic attribution adds error of its own, since grid carbon intensity varies by more than an order of magnitude between countries and a misplaced share of node capacity moves the answer substantially. Annual national averages also mask the hourly variation in grid intensity to which a machine running around the clock is fully exposed.

Emissions figures are constructed from the energy estimate and the geographic estimate together. The distribution of nodes across regions is inferred from publicly observable network data, with the distribution of a structurally comparable network standing in where direct observation is insufficient. Each region's share of estimated consumption is then multiplied by the emissions released per unit of electricity generated on that region's grid, and the results are summed to give the network total.

Carbon intensity values are taken from Carbon intensity of electricity generation, compiled by Our World in Data with major processing from Ember's yearly electricity data and the Energy Institute's Statistical Review of World Energy, and published under the Creative Commons CC BY 4.0 license.

The distinction between the two reported scopes is worth spelling out. Scope 1 captures emissions from sources the infrastructure's operators control directly, essentially combustion happening on their own premises. Validators and supporting nodes for this network are conventional servers housed in data centers and supplied from public grids, so there is ordinarily nothing of that kind to record and the scope 1 figure is reported at or close to zero rather than omitted. Scope 2 captures the emissions embodied in the purchased electricity that those machines consume, and in practice the entire footprint falls under it. Greenhouse gas intensity mirrors energy intensity in construction: it expresses the emissions attributable to one additional transaction at the margin, not an average obtained by dividing a total by a count.

Every uncertainty already present in the consumption and location estimates propagates into these figures, and the intensity data introduces another. Published grid intensities are annual averages across a region; they cannot reflect the hours at which a node's consumption actually falls, nor any generation a particular operator has contracted for directly. Where the evidence is thin, the conservative assumption is preferred, meaning the reported emissions are more likely to sit above the true value than below it, and every figure is revised as the underlying observation improves.