Blockchain Networks

Chapter 11
Blockchain Network Analytics and Monitoring

Diploma in Blockchain
Blockchain Networks   •   Diploma

Blockchain Network Analytics and Monitoring

Introduction

A blockchain network is not adequately understood by examining individual transactions alone. Its operational condition emerges from the interaction of blocks, validators, nodes, mempool activity, fees, peer connections, smart contracts, and users. Network analytics converts these observations into evidence that can support technical operations, governance, security investigation, capacity planning, and business decisions.

Blockchain monitoring has two related purposes. Observability asks what is happening inside or around a network: whether blocks are being produced, whether nodes are synchronized, and whether transactions are being confirmed. Analytics asks what those observations mean: whether congestion is temporary or structural, whether validator participation is becoming concentrated, or whether a sudden contract interaction is abnormal.

This chapter presents a practical framework for using block explorers, dashboards, logs, and on-chain metrics to assess network activity, decentralization, validator behaviour, congestion, anomalies, and operational health. Examples refer to general blockchain concepts because individual networks differ in terminology, consensus design, data availability, and APIs.

Learning Objectives

By the end of this chapter, a learner should be able to:

  1. Explain the roles and limitations of block explorers, dashboards, node logs, indexers, and raw RPC interfaces.
  2. Select suitable on-chain metrics for activity, performance, decentralization, validator behaviour, congestion, and reliability.
  3. Calculate and interpret transaction throughput, confirmation delay, validator concentration, uptime, and related measures.
  4. Distinguish normal variation from operational incidents and suspicious anomalies.
  5. Design a basic monitoring workflow with alerts, baselines, escalation procedures, and evidence preservation.
  6. Evaluate privacy, governance, data-quality, and regulatory issues in blockchain analytics.

1. The Evidence Architecture of Blockchain Monitoring

A monitoring system should be understood as a chain of evidence rather than a single dashboard. Each layer answers different questions.

Evidence layerTypical sourceMain questionsCommon limitation
Public chain dataBlocks, transactions, receipts, eventsWhat was recorded? What state changed?Historical data may be incomplete or reinterpreted after reorganisations
Node telemetryRPC endpoints, metrics endpoints, logsIs a node synchronized and healthy?Requires access and correct configuration
Network telemetryPeer data, propagation measurementsAre messages reaching peers effectively?Often unavailable or inconsistent across clients
Indexing layerSearch indexes, data warehouses, subgraphsHow can large datasets be queried?Indexing errors and lag can distort conclusions
Operational systemsAlerts, incident records, deployment logsWhat changed and when?Context may be missing or manually entered

A block explorer provides a user-oriented view of blocks, transactions, addresses, token transfers, contracts, and sometimes validator information. It is useful for rapid inspection and communicating evidence to non-specialists. However, an explorer is not necessarily authoritative for real-time operations. It may cache data, omit failed or internal events, use proprietary labels, or lag behind the node.

A dashboard combines metrics into panels and time series. Dashboards support trend analysis and situational awareness, but a visually attractive panel can hide poor sampling, inconsistent denominators, or missing data. A professional analyst should always identify the metric definition, collection interval, time zone, source, and freshness.

Node logs record events such as peer changes, block import, consensus messages, database errors, execution failures, and warnings. Logs provide causal clues but are difficult to aggregate. A log line is not automatically evidence of a fault: a peer disconnect may be routine, whereas repeated disconnections accompanied by synchronization lag are more significant.

RPC and metrics interfaces provide programmatic access to blocks, transactions, receipts, state queries, peer counts, and client telemetry. They are suitable for repeatable analysis. Access control is essential because unrestricted administrative RPC methods can expose or alter sensitive node functions.

An effective monitoring architecture normally includes:

  1. Collection: obtain chain data, node metrics, logs, and infrastructure measurements.
  2. Normalization: standardize timestamps, identifiers, units, chain names, and event definitions.
  3. Storage: retain raw evidence and processed aggregates separately.
  4. Analysis: calculate metrics, compare with baselines, and correlate signals.
  5. Alerting: define thresholds and anomaly rules.
  6. Response: investigate, communicate, remediate, and document.

2. Core Metrics for Network Activity

2.1 Blocks and transactions

Block height or slot number indicates chain progress, but it does not alone prove healthy operation. A chain may advance while transaction inclusion is delayed or some validators are unavailable. Useful activity measures include blocks per unit time, transactions per unit time, active addresses, contract calls, transfer volume, and failed transaction rates.

The simplest throughput estimate is:

TPS = N / ∆t

where N is the number of transactions observed and ∆t is the measurement interval in seconds. The result is transactions per second. The calculation assumes that the observation window is clearly defined and that transactions are counted consistently. A short interval may be highly volatile; longer windows provide a more stable average.

For example, if 18,000 transactions are included during a 15-minute interval, then:

∆t = 15 × 60 = 900 seconds

TPS = 18,000 ÷ 900 = 20 transactions per second.

This is an average inclusion rate, not necessarily the maximum processing capacity. It also does not indicate whether transactions were simple transfers or computationally intensive contract calls.

A network may report multiple transaction concepts:

  • Submitted transactions: received by a node or gateway.
  • Mempool transactions: waiting for inclusion.
  • Included transactions: recorded in a block.
  • Successful transactions: executed without a protocol-level failure.
  • Finalized transactions: protected by the network’s finality mechanism.

These categories must not be silently mixed. For example, submitted TPS can exceed included TPS during congestion, while successful TPS can be lower than included TPS when execution failures are common.

2.2 Confirmation and finality

Confirmation delay measures the time between submission and a defined inclusion or finality event. The definition should specify whether the clock starts at gateway receipt, node acceptance, or first observation in the mempool.

For transaction i, confirmation delay may be represented as:

Di = ti(final) − ti(submit)

where Di is the delay for transaction i, and the two times use the same clock standard and time zone. The mean delay is:

D̄ = (1/n) ∑ᵢ₌₁ⁿ Di

The mean can be distorted by a small number of very slow transactions. Therefore, operational dashboards should normally show median and percentile values, such as the 95th percentile, in addition to the mean. A percentile is meaningful only when the sample definition and time window are known.

Inclusion is not always equivalent to finality. Some consensus systems provide probabilistic confidence, while others provide protocol-defined finality after a vote, checkpoint, or certificate. Monitoring should expose both where relevant.

2.3 Fees and resource use

Fees are often an indirect congestion signal. A rising fee market may indicate demand exceeding available block space, but it can also reflect a temporary application campaign, a fee-market change, or a wallet configuration error.

Where a transaction uses computational resources, an effective fee rate can be expressed as:

Fee rate = transaction fee ÷ resource units consumed

The resource unit may be gas, weight, compute units, bytes, or another protocol-specific measure. Units must be reported explicitly. Comparing fee rates across different networks without normalizing resource definitions and currencies is misleading.

Other useful metrics include block fullness, gas used relative to the block limit, calldata or data-availability consumption, and the proportion of transactions rejected or replaced before inclusion.

3. Decentralization and Validator Analytics

Decentralization is multidimensional. Counting validator identities is insufficient because voting power, stake ownership, infrastructure providers, geography, client software, and governance influence may be concentrated even when the nominal validator count is high.

3.1 Validator participation

Depending on the consensus model, analysts may monitor:

  • active validator or sequencer count;
  • voting power online and offline;
  • missed proposals or attestations;
  • participation in consensus rounds;
  • slashing or penalty events;
  • client and version distribution;
  • stake delegation and operator relationships;
  • geographic and hosting-provider distribution.

A basic participation rate is:

Participation rate = observed voting power ÷ eligible voting power × 100%

The numerator and denominator must refer to the same epoch, round, or measurement period. A validator count should not be substituted for voting power unless all validators have equal weight.

3.2 Concentration metrics

If entities hold shares s₁, s₂, …, sₙ of total voting power, where each share is expressed as a proportion and the shares sum to 1, the Herfindahl–Hirschman Index is:

HHI = ∑ᵢ₌₁ⁿ sᵢ²

The index approaches 1 when one entity controls nearly all voting power and becomes smaller as power is distributed among many entities. It is sensitive to the definition of an entity. Treating several operators controlled by one organisation as independent can understate concentration.

The Nakamoto coefficient is the smallest number of entities whose combined share exceeds a specified threshold. If a threshold of one-third is used for a safety-related question, sort entities from largest to smallest and add their shares until the cumulative total exceeds one-third. The resulting count is the coefficient for that threshold. The threshold must be stated because different consensus assumptions use different safety or liveness boundaries.

These measures are indicators, not complete proofs of decentralization. They may omit informal coordination, common cloud providers, shared software, delegated stake, or legal control.

Worked Example: Voting-Power Concentration

Assume five identifiable operators have voting-power shares of 0.30, 0.25, 0.20, 0.15, and 0.10. Their HHI is:

HHI = 0.30² + 0.25² + 0.20² + 0.15² + 0.10²

HHI = 0.09 + 0.0625 + 0.04 + 0.0225 + 0.01 = 0.225

For a one-third threshold, the largest operator alone has 0.30, while the largest two have 0.55. Thus, the Nakamoto coefficient at this threshold is 2 under the stated entity assumptions. The result does not mean that two operators can necessarily halt or rewrite the chain; the actual consequence depends on the consensus protocol and its safety and liveness rules.

4. Validator Behaviour and Operational Health

Validator monitoring connects protocol outcomes with infrastructure causes. A validator may miss duties because of process failure, network isolation, clock error, insufficient hardware, overloaded storage, client bugs, or deliberate withdrawal.

Important signals include:

  • missed block proposals;
  • missed votes, attestations, or signatures;
  • increasing propagation delay;
  • peer count falling below an operational baseline;
  • local chain height lagging behind the network;
  • repeated database or execution errors;
  • disk capacity and input/output latency;
  • CPU, memory, and network saturation;
  • clock offset;
  • client version and configuration changes.

A simple uptime measure is:

Availability = (scheduled time − unavailability time) ÷ scheduled time × 100%

If a node is unavailable for 18 minutes during a 24-hour period, scheduled time is 1,440 minutes and availability is:

(1,440 − 18) ÷ 1,440 × 100% = 98.75%

This measure assumes that unavailability has been accurately detected and that planned maintenance is either included or excluded consistently. A node can be reachable but operationally unhealthy, so availability should be paired with synchronization and duty-performance metrics.

A service-level indicator is the measured condition, such as finalized-block delay. A service-level objective is the target, such as 99.9% of finalized blocks observed within a defined interval. An alert should refer to an SLI and a time window, not merely to a vague statement that the network is “slow.”

5. Congestion Analysis

Congestion occurs when demand for scarce network resources approaches or exceeds available capacity. It can be observed through a combination of:

  • growth in pending transactions;
  • increased fee bids or priority fees;
  • longer inclusion and finality delays;
  • fuller blocks or exhausted execution limits;
  • rising replacement and cancellation activity;
  • increased gateway rejection rates;
  • application-specific failures caused by stale assumptions.

A single metric may be ambiguous. For example, a full block with low pending volume may indicate stable high demand and adequate pricing, whereas a rapidly growing mempool combined with increasing delays indicates pressure exceeding effective capacity.

Analysts should distinguish capacity from utilisation. If a network processes 20 TPS while its tested sustainable capacity is 100 TPS, utilisation is approximately 20%, but the capacity estimate depends on transaction type, hardware, state size, and consensus conditions. A theoretical block limit is not automatically a safe production capacity.

A useful investigation compares demand and supply over the same interval:

  1. Measure transaction arrival or submission rate.
  2. Measure inclusion rate.
  3. Measure pending volume and age.
  4. Examine resource use per transaction.
  5. Compare fee changes and application composition.
  6. Check whether validators or nodes are experiencing resource saturation.

6. Logs, Dashboards, and Data Quality

Monitoring data has failure modes. Common problems include clock skew, duplicate events, missing blocks, indexer lag, chain reorganisations, address-label errors, bot-generated activity, and inconsistent treatment of failed transactions.

A reliable workflow preserves:

  • the original event or log;
  • collection timestamp;
  • block height and hash where applicable;
  • transaction hash and receipt status;
  • source endpoint and software version;
  • transformation logic;
  • analyst or automated decision that used the data.

When a reorganisation occurs, data associated with an abandoned branch must be marked rather than silently deleted. For financial, compliance, or incident purposes, analysts should record the finality state at the time of the conclusion.

Dashboards should display freshness and data-source status. A blank panel can mean zero activity, a collection failure, or an indexing delay; these possibilities must be visually distinguished. Alert rules should include a “data unavailable” condition so that a silent monitoring failure is not mistaken for a healthy network.

7. Anomaly Detection and Investigation

An anomaly is an observation that differs materially from an established baseline. It is not automatically malicious. Baselines can be based on historical values, comparable time periods, protocol epochs, application-specific cycles, or peer groups.

A simple standardised score is:

z = (x − μ) ÷ σ

where x is the observation, μ is the baseline mean, and σ is the baseline standard deviation. This interpretation is most appropriate when the baseline is reasonably stable and not dominated by extreme outliers. A high absolute score signals unusualness, not cause. Blockchain activity is often seasonal and heavy-tailed, so robust measures such as median and median absolute deviation may be preferable.

A practical anomaly investigation follows these steps:

  1. Validate the signal. Confirm the source, time range, chain, units, and indexing status.
  2. Establish scope. Determine whether the change affects one address, one application, one validator, a region, or the whole network.
  3. Correlate signals. Compare transaction volume, fees, block fullness, peer health, logs, deployments, and external events.
  4. Classify the event. Possible classes include routine demand, software release, infrastructure fault, economic attack, exploit, governance event, or data error.
  5. Preserve evidence. Save hashes, blocks, logs, screenshots or exports, queries, and timestamps.
  6. Escalate proportionately. Avoid irreversible action based on a single unverified indicator.

For example, a sudden increase in token transfers may result from an exchange migration, a bridge rebalancing, an airdrop, wash activity, or theft. Address labels and transfer counts alone cannot establish intent.

8. A Monitoring Framework for Professional Practice

A diploma-level monitoring programme can be organised around five dimensions.

DimensionExample indicatorsOperational question
ActivityTPS, active addresses, contract callsIs demand changing?
Performanceinclusion delay, finality delay, block fullnessAre users receiving timely service?
Decentralizationvoting-power shares, client diversity, operator concentrationAre control and failure risks distributed?
Reliabilitypeer count, sync lag, missed duties, disk and memoryCan infrastructure perform its role?
Security and anomaliesunusual flows, failed calls, privilege events, reorgsIs activity outside the expected pattern?

For each indicator, define an owner, source, collection interval, baseline, threshold, escalation path, and retention period. Thresholds should be tested against historical data. A static threshold may generate excessive false alarms when network activity changes over time.

A basic alert design uses three levels:

  • Informational: notable change requiring observation.
  • Warning: condition that may affect service if sustained.
  • Critical: confirmed or highly probable loss of safety, liveness, integrity, or availability.

Runbooks should state what an operator checks first, which evidence is safe to collect, who can approve configuration changes, and when validators should be removed from service. Monitoring must not create new risks by exposing private keys, administrative endpoints, or sensitive customer data.

9. Illustrative Case: Congestion and Validator Degradation

Background

A fictional proof-of-stake payment network normally processes approximately 12 transactions per second. Its operations team observes a sudden increase in customer complaints about delayed payments.

Problem

Over 30 minutes, the pending transaction count grows from 2,000 to 18,000. The 95th-percentile inclusion delay increases from 40 seconds to 9 minutes. Average block fullness rises from 62% to 99%. At the same time, three validators begin missing votes.

Analysis

The team first verifies that the explorer and internal indexer agree on block heights and timestamps. It then compares submission rate with inclusion rate and finds that a newly launched application is responsible for most additional transactions. Fee bids have risen, indicating competition for block space.

Node telemetry shows that the three affected validators have high disk-write latency and are several blocks behind. Their peer counts are lower than normal, but other validators remain synchronized. The evidence suggests two related effects: application-driven congestion and infrastructure degradation at a subset of validators.

The team does not conclude that the application is malicious merely because it generates high volume. It examines contract failures, deployment history, address clusters, and whether activity is authorised. It also checks whether the network is approaching a protocol safety or liveness threshold.

Approach and solution

Operations temporarily increases node storage performance, removes unhealthy validators from service according to the approved procedure, and routes traffic to healthy infrastructure. The application team communicates expected confirmation delays and reviews its transaction batching and fee strategy. Monitoring is changed to alert on the combination of block fullness above 95%, rapidly increasing pending age, and validator lag rather than on any one metric.

Outcome

After infrastructure remediation, validator participation returns to normal. Congestion declines when application demand falls and users adjust fees. The post-incident review identifies missing alerts for pending-transaction age and insufficient visibility into disk latency.

Learning points

  1. Congestion and validator failure can occur simultaneously and amplify one another.
  2. A dashboard must correlate demand, capacity, finality, and infrastructure health.
  3. Public transaction volume does not by itself establish malicious intent.
  4. Alerts should combine indicators and include data-quality checks.
  5. Incident evidence should support both technical remediation and later governance review.

10. Ethical, Governance, and Regulatory Considerations

Blockchain data is often public, but public availability does not eliminate ethical duties. Address histories may reveal financial relationships, employment patterns, political donations, or personal behaviour when combined with external data. Analysts should apply data minimisation, access controls, retention limits, and purpose limitation.

Address clustering is probabilistic. It may produce false associations and unfairly label individuals or organisations. Risk scores should therefore be treated as investigative leads, not final judgments. High-impact actions such as account restriction or reporting should involve human review, documented evidence, and applicable legal processes.

Organisations must also distinguish operational monitoring from surveillance. Where analytics is used for compliance, relevant jurisdictional requirements may include anti-money-laundering obligations, privacy law, data protection rules, records retention, and cross-border transfer restrictions. Legal advice is required for specific implementations.

Governance questions include who defines decentralization metrics, who can change alert thresholds, how incidents are disclosed, and whether validator performance data affects delegation or rewards. Transparent definitions reduce disputes and prevent metrics from being selected merely to support a preferred narrative.

11. Contemporary Developments and Best Practices

Modern blockchain analytics increasingly combines on-chain data with off-chain telemetry, distributed tracing, data warehouses, and machine-learning-assisted investigation. AI can help classify logs, detect unusual combinations of signals, summarise incidents, and prioritise investigations. It should not be treated as an authoritative source of facts. Models can inherit biased labels, miss new attack patterns, or generate convincing but unsupported explanations. Human validation, reproducible queries, and evidence links remain essential.

Best practices include:

  • define every metric and denominator;
  • use multiple independent data sources for critical conclusions;
  • monitor both the network and the monitoring system;
  • retain raw data and version analytical transformations;
  • separate inclusion, success, and finality measurements;
  • report percentiles and distributions, not only averages;
  • account for reorganisations and indexing lag;
  • aggregate validator identity carefully to reveal control relationships;
  • protect credentials and administrative RPC methods;
  • test alerts through controlled exercises;
  • document assumptions, limitations, and uncertainty;
  • review thresholds after protocol upgrades and major application changes.

Chapter Summary

Blockchain network analytics turns blocks, transactions, validator records, logs, and infrastructure telemetry into operational evidence. Block explorers are useful for accessible inspection, while dashboards, RPC interfaces, indexers, and logs support systematic monitoring and investigation. Reliable analysis begins by defining the observation window, data source, units, and finality state.

Core measures include throughput, confirmation and finality delay, resource utilisation, fee rates, participation, availability, concentration, and anomaly scores. Metrics must be interpreted together: rising fees, full blocks, pending age, and delayed inclusion provide stronger evidence of congestion than any single measure. Validator analysis should consider voting power, missed duties, client diversity, operator concentration, and infrastructure health. HHI and Nakamoto-style measures are useful indicators but depend on how entities and thresholds are defined.

Professional monitoring requires baselines, alert levels, runbooks, evidence preservation, and safeguards against data-quality failures. Anomalies require validation and correlation before they are classified as attacks or misconduct. Finally, blockchain analytics must respect privacy, proportionality, legal obligations, and the uncertainty of address attribution. A mature monitoring programme is therefore both a technical system and a governance practice.

Key Terms

Block explorer: A service that presents searchable blockchain data such as blocks, transactions, addresses, and contracts.

Blockchain finality: The point or level of confidence at which a recorded transaction is considered irreversible under a protocol’s rules.

Block fullness: The proportion of available block resources used by included transactions.

Confirmation delay: Time between transaction submission and a defined inclusion or finality event.

Congestion: A condition in which demand for scarce blockchain resources approaches or exceeds effective capacity.

Dashboard: A visual interface displaying current and historical operational metrics.

Data freshness: How recently a monitoring system received or processed source data.

Herfindahl–Hirschman Index: A concentration measure calculated as the sum of squared entity shares.

Indexer: Software that transforms blockchain data into searchable or analytically convenient structures.

Inclusion: Recording a transaction in a block or equivalent ledger structure.

Mempool: A node’s pool of transactions received but not yet included in a block.

Nakamoto coefficient: The smallest number of entities whose combined share exceeds a specified control threshold.

Node telemetry: Measurements describing node operation, such as peers, synchronization, resource use, and errors.

On-chain metric: A measurement calculated from data recorded on or directly derived from a blockchain.

Participation rate: Voting power observed performing an eligible consensus duty divided by eligible voting power.

Percentile: A value below which a specified percentage of observations falls.

Reorganisation: A change in the preferred chain history that may replace previously observed blocks.

Service-level indicator: A measured value describing service performance or reliability.

Throughput: The rate at which transactions or other protocol objects are processed or included.

Validator: A participant responsible for proposing, voting on, attesting to, or otherwise helping secure blocks under a consensus protocol.

Review Questions

Short Answer Questions

  1. What is the difference between a block explorer and a node metrics interface?
  2. Why should inclusion delay and finality delay be measured separately?
  3. Define voting-power participation rate.
  4. What does a rising pending-transaction age usually indicate?
  5. Why can a public blockchain dataset still create privacy risks?

Long Answer Questions

  1. Explain how an organisation could design a monitoring architecture using explorers, RPC data, logs, indexers, and dashboards.
  2. Discuss why validator count alone is an inadequate measure of decentralization.
  3. Explain the causes and indicators of blockchain congestion.
  4. Describe a complete workflow for investigating an on-chain anomaly.
  5. Evaluate the benefits and limitations of using AI in blockchain monitoring.

Analytical / Application Questions

  1. A network includes 36,000 transactions in 20 minutes. Calculate its average TPS and state what additional information is needed before judging whether the network is congested.
  2. Four operators have voting-power shares of 0.40, 0.30, 0.20, and 0.10. Calculate the HHI and the Nakamoto coefficient for a threshold greater than one-third. Interpret the result cautiously.
  3. A dashboard shows full blocks, rising fees, normal validator participation, and a rapidly growing mempool. Determine the most likely operational condition, identify two additional metrics to inspect, and propose an appropriate alert response.

Multiple Choice Questions with Answers

Question 1

Which metric measures the average number of transactions included per second during a defined interval?

A. TPS

B. HHI

C. Availability

D. Nakamoto coefficient

Correct Answer: A. TPS

Question 2

Why should finality delay be distinguished from inclusion delay?

A. Finality always occurs before submission

B. Inclusion does not necessarily mean the transaction is irreversibly protected

C. Finality measures only transaction fees

D. Inclusion applies only to failed transactions

Correct Answer: B. Inclusion does not necessarily mean the transaction is irreversibly protected

Question 3

If 12,000 transactions are included in 600 seconds, what is the average throughput?

A. 2 TPS

B. 12 TPS

C. 20 TPS

D. 72 TPS

Correct Answer: C. 20 TPS

Question 4

What does the HHI primarily measure in validator analytics?

A. Transaction latency

B. Resource consumption

C. Voting-power concentration

D. Block propagation speed

Correct Answer: C. Voting-power concentration

Question 5

Which combination provides the strongest evidence of congestion?

A. Low fees, empty blocks, and falling pending age

B. Full blocks, rising fees, increasing pending age, and delayed inclusion

C. Stable validator participation and low transaction volume

D. A single disconnected peer

Correct Answer: B. Full blocks, rising fees, increasing pending age, and delayed inclusion

Question 6

What is the first appropriate step when an anomaly alert is generated?

A. Assume malicious activity

B. Delete the abnormal data point

C. Validate the source, time range, units, and indexing status

D. Immediately rewrite the chain

Correct Answer: C. Validate the source, time range, units, and indexing status

Question 7

A node is unavailable for 18 minutes during a 1,440-minute day. What is its availability?

A. 96.25%

B. 97.50%

C. 98.75%

D. 99.90%

Correct Answer: C. 98.75%

Question 8

Which statement about validator count is most accurate?

A. It completely measures decentralization

B. It is irrelevant to decentralization

C. It must be considered alongside voting power and control relationships

D. It measures only transaction fees

Correct Answer: C. It must be considered alongside voting power and control relationships

Question 9

What should a monitoring system do when an indexer stops receiving data?

A. Treat the absence of data as zero activity

B. Generate a data-availability or freshness alert

C. Increase the HHI automatically

D. Mark every transaction as finalized

Correct Answer: B. Generate a data-availability or freshness alert

Question 10

Why is address clustering described as probabilistic?

A. Addresses cannot appear on a blockchain

B. Clustering infers relationships and can produce false associations

C. All addresses are controlled by validators

D. Clustering measures block size exactly

Correct Answer: B. Clustering infers relationships and can produce false associations

Blockchain Networks
Chapter 11 of 14