1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
//! Chunk storage operations.
//!
//! Chunks are immutable, content-addressed data blocks where the address
//! is the BLAKE3 hash of the content.
use crate::data::client::batch::{finalize_batch_payment, PreparedChunk};
use crate::data::client::peer_cache::record_peer_outcome;
use crate::data::client::Client;
use crate::data::error::{Error, Result};
use ant_protocol::evm::{QuoteHash, TxHash};
use ant_protocol::transport::{MultiAddr, PeerId};
use ant_protocol::{
compute_address, detect_proof_type, send_and_await_chunk_response, ChunkGetRequest,
ChunkGetResponse, ChunkMessage, ChunkMessageBody, ChunkPutRequest, ChunkPutResponse, DataChunk,
ProofType, XorName, CLOSE_GROUP_MAJORITY,
};
use bytes::Bytes;
use futures::stream::{FuturesUnordered, StreamExt};
use std::collections::HashMap;
use std::future::Future;
use std::time::{Duration, Instant};
use tracing::{debug, info, warn};
/// Data type identifier for chunks (used in quote requests).
const CHUNK_DATA_TYPE: u32 = 0;
/// Store-response timeout for non-merkle chunk PUTs.
const STORE_RESPONSE_TIMEOUT: Duration = Duration::from_secs(10);
fn store_response_timeout_for_proof(proof: &[u8], merkle_timeout_secs: u64) -> Duration {
match detect_proof_type(proof) {
Some(ProofType::Merkle) => Duration::from_secs(merkle_timeout_secs),
_ => STORE_RESPONSE_TIMEOUT,
}
}
impl Client {
/// Store a chunk on the Autonomi network with payment.
///
/// Checks if the chunk already exists before paying. If it does,
/// returns the address immediately without incurring on-chain costs.
/// Otherwise collects quotes, pays on-chain, then stores with proof
/// to `CLOSE_GROUP_MAJORITY` peers.
///
/// # Errors
///
/// Returns an error if payment or the network operation fails.
pub async fn chunk_put(&self, content: Bytes) -> Result<XorName> {
let address = compute_address(&content);
let data_size = u64::try_from(content.len())
.map_err(|e| Error::InvalidData(format!("content size too large: {e}")))?;
match self
.pay_for_storage(&address, data_size, CHUNK_DATA_TYPE)
.await
{
Ok((proof, peers)) => self.chunk_put_to_close_group(content, proof, &peers).await,
Err(Error::AlreadyStored) => {
debug!(
"Chunk {} already stored on network, skipping payment",
hex::encode(address)
);
Ok(address)
}
Err(e) => Err(e),
}
}
/// Store a chunk to `CLOSE_GROUP_MAJORITY` peers from the quoted set.
///
/// Initially sends the PUT concurrently to the first
/// `CLOSE_GROUP_MAJORITY` peers. If any fail, falls back to the
/// remaining peers in the quoted set until majority is reached or
/// all peers are exhausted.
///
/// # Errors
///
/// Returns an error if fewer than `CLOSE_GROUP_MAJORITY` peers accept
/// the chunk.
pub(crate) async fn chunk_put_to_close_group(
&self,
content: Bytes,
proof: Vec<u8>,
peers: &[(PeerId, Vec<MultiAddr>)],
) -> Result<XorName> {
let address = compute_address(&content);
let initial_count = peers.len().min(CLOSE_GROUP_MAJORITY);
let (initial_peers, fallback_peers) = peers.split_at(initial_count);
let mut put_futures = FuturesUnordered::new();
for (peer_id, addrs) in initial_peers {
put_futures.push(self.spawn_chunk_put(content.clone(), proof.clone(), peer_id, addrs));
}
let mut success_count = 0usize;
let mut failures: Vec<String> = Vec::new();
let mut fallback_iter = fallback_peers.iter();
while let Some((peer_id, result)) = put_futures.next().await {
match result {
Ok(_) => {
success_count += 1;
if success_count >= CLOSE_GROUP_MAJORITY {
debug!(
"Chunk {} stored on {success_count} peers (majority reached)",
hex::encode(address)
);
return Ok(address);
}
}
Err(e) => {
warn!("Failed to store chunk on {peer_id}: {e}");
failures.push(format!("{peer_id}: {e}"));
if let Some((fb_peer, fb_addrs)) = fallback_iter.next() {
debug!(
"Falling back to peer {fb_peer} for chunk {}",
hex::encode(address)
);
put_futures.push(self.spawn_chunk_put(
content.clone(),
proof.clone(),
fb_peer,
fb_addrs,
));
}
}
}
}
Err(Error::InsufficientPeers(format!(
"Stored on {success_count} peers, need {CLOSE_GROUP_MAJORITY}. Failures: [{}]",
failures.join("; ")
)))
}
/// Spawn a chunk PUT future for a single peer.
fn spawn_chunk_put<'a>(
&'a self,
content: Bytes,
proof: Vec<u8>,
peer_id: &'a PeerId,
addrs: &'a [MultiAddr],
) -> impl Future<Output = (PeerId, Result<XorName>)> + 'a {
let peer_id_owned = *peer_id;
async move {
let result = self
.chunk_put_with_proof(content, proof, &peer_id_owned, addrs)
.await;
(peer_id_owned, result)
}
}
/// Store a chunk on the Autonomi network with a pre-built payment proof.
///
/// Sends to a single peer. Callers that need replication across the
/// close group should use `chunk_put_to_close_group` instead.
///
/// # Errors
///
/// Returns an error if the network operation fails.
pub async fn chunk_put_with_proof(
&self,
content: Bytes,
proof: Vec<u8>,
target_peer: &PeerId,
peer_addrs: &[MultiAddr],
) -> Result<XorName> {
let address = compute_address(&content);
let node = self.network().node();
let timeout =
store_response_timeout_for_proof(&proof, self.config().merkle_store_timeout_secs);
let timeout_secs = timeout.as_secs();
let request_id = self.next_request_id();
// `content` is a refcounted `Bytes` shared with the sibling
// close-group sends; pass it through directly so each peer shares
// the same backing buffer instead of deep-copying the 4 MB payload.
let request = ChunkPutRequest::with_payment(address, content, proof);
let message = ChunkMessage {
request_id,
body: ChunkMessageBody::PutRequest(request),
};
let message_bytes = message
.encode()
.map_err(|e| Error::Protocol(format!("Failed to encode PUT request: {e}")))?;
let addr_hex = hex::encode(address);
let result = send_and_await_chunk_response(
node,
target_peer,
message_bytes,
request_id,
timeout,
peer_addrs,
|body| match body {
ChunkMessageBody::PutResponse(ChunkPutResponse::Success { address: addr }) => {
debug!("Chunk stored at {}", hex::encode(addr));
Some(Ok(addr))
}
ChunkMessageBody::PutResponse(ChunkPutResponse::AlreadyExists {
address: addr,
}) => {
debug!("Chunk already exists at {}", hex::encode(addr));
Some(Ok(addr))
}
ChunkMessageBody::PutResponse(ChunkPutResponse::PaymentRequired { message }) => {
Some(Err(Error::Payment(format!("Payment required: {message}"))))
}
ChunkMessageBody::PutResponse(ChunkPutResponse::Error(e)) => Some(Err(
Error::Protocol(format!("Remote PUT error for {addr_hex}: {e}")),
)),
_ => None,
},
|e| Error::Network(format!("Failed to send PUT to peer: {e}")),
|| {
Error::Timeout(format!(
"Timeout waiting for store response after {timeout_secs}s"
))
},
)
.await;
// No RTT recorded on the PUT path: the wall-clock is dominated by
// the ~4 MB payload upload, which reflects the uploader's uplink
// rather than the peer's responsiveness. Quote-path and GET-path
// RTTs still feed quality scoring.
record_peer_outcome(node, *target_peer, peer_addrs, result.is_ok(), None).await;
result
}
/// Retrieve a chunk from the Autonomi network.
///
/// Queries all peers in the close group for the chunk address,
/// returning the first successful response. This handles the case
/// where the storing peer differs from the first peer returned by
/// DHT routing.
///
/// # Errors
///
/// Returns an error if the network operation fails.
pub async fn chunk_get(&self, address: &XorName) -> Result<Option<DataChunk>> {
// Check cache first, with integrity verification.
if let Some(cached) = self.chunk_cache().get(address) {
let computed = compute_address(&cached);
if computed == *address {
debug!("Cache hit for chunk {}", hex::encode(address));
return Ok(Some(DataChunk::new(*address, cached)));
}
// Cache entry corrupted — evict and fall through to network fetch.
debug!(
"Cache corruption detected for {}: evicting",
hex::encode(address)
);
self.chunk_cache().remove(address);
}
let peers = self.close_group_peers(address).await?;
let addr_hex = hex::encode(address);
let queried = peers.len();
let mut not_found = 0usize;
let mut timeout = 0usize;
let mut network_err = 0usize;
for (peer, addrs) in &peers {
match self.chunk_get_from_peer(address, peer, addrs).await {
Ok(Some(chunk)) => {
self.chunk_cache().put(chunk.address, chunk.content.clone());
return Ok(Some(chunk));
}
Ok(None) => {
not_found += 1;
debug!("Chunk {addr_hex} not found on peer {peer}, trying next");
}
Err(Error::Timeout(_)) => {
timeout += 1;
debug!("Peer {peer} timed out for chunk {addr_hex}, trying next");
}
Err(Error::Network(_)) => {
network_err += 1;
debug!("Peer {peer} unreachable for chunk {addr_hex}, trying next");
}
Err(e) => return Err(e),
}
}
// None of the close group peers had the chunk. Emit a single summary
// so operators can distinguish data loss (all peers responded NotFound)
// from a reachability problem (most peers timed out / errored).
info!(
"chunk_get exhausted close group for {addr_hex}: \
queried={queried} not_found={not_found} timeout={timeout} network_err={network_err}"
);
Ok(None)
}
/// Fetch a chunk from a specific peer.
async fn chunk_get_from_peer(
&self,
address: &XorName,
peer: &PeerId,
peer_addrs: &[MultiAddr],
) -> Result<Option<DataChunk>> {
let node = self.network().node();
let request_id = self.next_request_id();
let request = ChunkGetRequest::new(*address);
let message = ChunkMessage {
request_id,
body: ChunkMessageBody::GetRequest(request),
};
let message_bytes = message
.encode()
.map_err(|e| Error::Protocol(format!("Failed to encode GET request: {e}")))?;
let timeout = Duration::from_secs(self.config().chunk_get_timeout_secs);
let addr_hex = hex::encode(address);
let timeout_secs = self.config().chunk_get_timeout_secs;
let start = Instant::now();
let result = send_and_await_chunk_response(
node,
peer,
message_bytes,
request_id,
timeout,
peer_addrs,
|body| match body {
ChunkMessageBody::GetResponse(ChunkGetResponse::Success {
address: addr,
content,
}) => {
if addr != *address {
return Some(Err(Error::InvalidData(format!(
"Mismatched chunk address: expected {addr_hex}, got {}",
hex::encode(addr)
))));
}
let computed = compute_address(&content);
if computed != addr {
return Some(Err(Error::InvalidData(format!(
"Invalid chunk content: expected hash {addr_hex}, got {}",
hex::encode(computed)
))));
}
debug!(
"Retrieved chunk {} ({} bytes) from peer {peer}",
hex::encode(addr),
content.len()
);
Some(Ok(Some(DataChunk::new(addr, Bytes::from(content)))))
}
ChunkMessageBody::GetResponse(ChunkGetResponse::NotFound { .. }) => Some(Ok(None)),
ChunkMessageBody::GetResponse(ChunkGetResponse::Error(e)) => Some(Err(
Error::Protocol(format!("Remote GET error for {addr_hex}: {e}")),
)),
_ => None,
},
|e| Error::Network(format!("Failed to send GET to peer {peer}: {e}")),
|| {
Error::Timeout(format!(
"Timeout waiting for chunk {addr_hex} from {peer} after {timeout_secs}s"
))
},
)
.await;
let success = result.is_ok();
let rtt_ms = success.then(|| start.elapsed().as_millis() as u64);
record_peer_outcome(node, *peer, peer_addrs, success, rtt_ms).await;
result
}
/// Check if a chunk exists on the network.
///
/// # Errors
///
/// Returns an error if the network operation fails.
pub async fn chunk_exists(&self, address: &XorName) -> Result<bool> {
self.chunk_get(address).await.map(|opt| opt.is_some())
}
/// Finalize a single-chunk publish after an external signer has paid.
///
/// Single-chunk analogue of [`Client::finalize_upload`]. Takes a
/// [`PreparedChunk`] (from [`Client::prepare_chunk_payment`]) and a
/// `quote_hash -> tx_hash` map containing receipts for every non-zero
/// quote in the chunk's payment. Builds the `PaymentProof` and stores
/// the chunk on `CLOSE_GROUP_MAJORITY` peers, returning its address.
///
/// Wave-batch payment shape only. Single-chunk publishes don't need
/// Merkle batching: one chunk's worth of quotes is well below the
/// wave-batch threshold.
///
/// # Errors
///
/// Returns an error if the proof construction fails (e.g. missing
/// `tx_hash` for a non-zero quote) or if fewer than
/// `CLOSE_GROUP_MAJORITY` peers accept the chunk.
pub async fn finalize_chunk(
&self,
prepared: PreparedChunk,
tx_hash_map: &HashMap<QuoteHash, TxHash>,
) -> Result<XorName> {
let mut paid = finalize_batch_payment(vec![prepared], tx_hash_map)?;
// finalize_batch_payment returns one PaidChunk per PreparedChunk
// input; we passed exactly one. If that invariant is ever violated
// it's an upstream bug — fail loudly rather than silently address-0.
let chunk = paid.pop().ok_or_else(|| {
Error::Payment(
"finalize_batch_payment returned no paid chunks for a single \
prepared chunk — internal invariant violated"
.into(),
)
})?;
self.chunk_put_to_close_group(chunk.content, chunk.proof_bytes, &chunk.quoted_peers)
.await
}
}
#[cfg(test)]
mod tests {
use super::*;
use ant_protocol::{PROOF_TAG_MERKLE, PROOF_TAG_SINGLE_NODE};
/// Arbitrary configured Merkle store timeout used by the timeout-selection tests.
const TEST_MERKLE_TIMEOUT_SECS: u64 = 60;
/// Sentinel byte used to represent an unknown/unrecognized proof tag.
const UNKNOWN_PROOF_TAG: u8 = 0xff;
#[test]
fn single_node_proof_uses_store_response_timeout() {
let timeout =
store_response_timeout_for_proof(&[PROOF_TAG_SINGLE_NODE], TEST_MERKLE_TIMEOUT_SECS);
assert_eq!(timeout, STORE_RESPONSE_TIMEOUT);
}
#[test]
fn unknown_proof_uses_store_response_timeout() {
let timeout =
store_response_timeout_for_proof(&[UNKNOWN_PROOF_TAG], TEST_MERKLE_TIMEOUT_SECS);
assert_eq!(timeout, STORE_RESPONSE_TIMEOUT);
}
#[test]
fn merkle_proof_uses_configured_store_timeout() {
let timeout =
store_response_timeout_for_proof(&[PROOF_TAG_MERKLE], TEST_MERKLE_TIMEOUT_SECS);
assert_eq!(timeout, Duration::from_secs(TEST_MERKLE_TIMEOUT_SECS));
}
/// Regression: the default `merkle_store_timeout_secs` must be at
/// least the storer-side `CLOSENESS_LOOKUP_TIMEOUT` (240 s) plus
/// padding. If either side moves and this invariant breaks, the
/// client will give up on chunks the storer is still verifying.
/// See `DEFAULT_MERKLE_STORE_TIMEOUT_SECS` doc comment for the
/// derivation.
#[test]
fn default_merkle_store_timeout_satisfies_storer_invariant() {
use crate::data::client::ClientConfig;
const STORER_CLOSENESS_LOOKUP_TIMEOUT_SECS: u64 = 240;
const MIN_PADDING_SECS: u64 = 30;
let config = ClientConfig::default();
assert!(
config.merkle_store_timeout_secs
>= STORER_CLOSENESS_LOOKUP_TIMEOUT_SECS + MIN_PADDING_SECS,
"merkle_store_timeout_secs ({}) must be >= storer CLOSENESS_LOOKUP_TIMEOUT ({}) + padding ({})",
config.merkle_store_timeout_secs,
STORER_CLOSENESS_LOOKUP_TIMEOUT_SECS,
MIN_PADDING_SECS,
);
}
/// Regression: the non-merkle PUT path uses the hardcoded
/// `STORE_RESPONSE_TIMEOUT` constant, not the per-config
/// `merkle_store_timeout_secs`. If a future refactor accidentally
/// routes non-merkle PUTs through the merkle field they'd inherit
/// the 270 s value and silently regress non-merkle latency.
/// `store_response_timeout_for_proof` with a non-merkle proof tag
/// must return the const regardless of what merkle timeout is
/// passed.
#[test]
fn non_merkle_put_ignores_merkle_timeout_value() {
let absurd_merkle_timeout = 9_999;
for tag in [PROOF_TAG_SINGLE_NODE, UNKNOWN_PROOF_TAG] {
let timeout = store_response_timeout_for_proof(&[tag], absurd_merkle_timeout);
assert_eq!(
timeout, STORE_RESPONSE_TIMEOUT,
"non-merkle proof tag {tag:#x} should ignore merkle timeout {absurd_merkle_timeout}",
);
}
}
}