rostra-client-db 0.1.2

Embedded database and projections for a Rostra client
Documentation
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
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
use std::borrow::Cow;
use std::collections::{HashMap, HashSet};

use ids::{IdsFollowersRecord, IdsUnfollowedRecord};
use itertools::Itertools as _;
use rand::{Rng as _, RngCore as _};
use redb::StorageError;
use redb_bincode::{ReadableTable, Table};
use rostra_core::event::{
    EventContentRaw, EventExt as _, VerifiedEvent, VerifiedEventContent, content_kind,
};
use rostra_core::id::{RostraId, ToShort as _};
use rostra_core::{ContentHash, ExternalEventId, ShortEventId, Timestamp};
use tables::EventRecord;
use tables::event::{
    ContentStoreRecord, EventContentResult, EventContentState, EventsMissingRecord,
};
use tables::ids::IdsFolloweesRecord;
use tracing::{debug, error};

use super::event_order::EventOrder;
use super::id_self::IdSelfAccountRecord;
use super::{
    Database, DbError, DbResult, EventsHeadsTableRecord, InsertEventOutcome, content_rc,
    content_store, events, events_by_time, events_content_state, events_heads, events_missing,
    events_self, get_first_in_range, get_last_in_range, ids, ids_follow_events, ids_followees,
    ids_followers, ids_self, tables,
};
use crate::{
    IdSocialProfileRecord, IdsDataUsageRecord, LOG_TARGET, Latest, LatestEventValue,
    SocialPostRecord, WotData, events_content_missing, ids_data_usage, ids_full, social_posts,
    social_profiles,
};

pub(crate) trait RandomTableKey: Copy + Ord {
    fn min_key() -> Self;
    fn random_key() -> Self;
    fn max_key() -> Self;
}

impl RandomTableKey for ShortEventId {
    fn min_key() -> Self {
        Self::ZERO
    }

    fn random_key() -> Self {
        Self::random()
    }

    fn max_key() -> Self {
        Self::MAX
    }
}

impl RandomTableKey for ExternalEventId {
    fn min_key() -> Self {
        Self::new(RostraId::ZERO, ShortEventId::ZERO)
    }

    fn random_key() -> Self {
        let mut rng = rand::rng();
        let mut rostra_id = [0u8; 32];
        let mut event_id = [0u8; 16];
        rng.fill_bytes(&mut rostra_id);
        rng.fill_bytes(&mut event_id);
        Self::new(
            RostraId::from_bytes(rostra_id),
            ShortEventId::from_bytes(event_id),
        )
    }

    fn max_key() -> Self {
        Self::new(RostraId::MAX, ShortEventId::MAX)
    }
}

impl Database {
    /// Merge a direct content-deletion candidate into stored attribution.
    ///
    /// Deletion presence is monotone. Multiple direct deleters select the
    /// greatest `(event.timestamp, ShortEventId)` so delivery order cannot
    /// affect attribution.
    fn merge_deleted_by_tx(
        current: Option<ShortEventId>,
        candidate: Option<EventOrder>,
        events_table: &impl events::ReadableTable,
    ) -> DbResult<Option<ShortEventId>> {
        let Some(candidate) = candidate else {
            return Ok(current);
        };
        let Some(current_id) = current else {
            return Ok(Some(candidate.event_id()));
        };

        let current_timestamp = events_table
            .get(&current_id)?
            .map(|event| event.value().timestamp())
            .ok_or(DbError::MissingDeletionAttribution {
                event_id: current_id,
                location: snafu::Location::new(file!(), line!(), column!()),
            })?;

        Ok(Some(
            EventOrder::new(current_timestamp, current_id)
                .max(candidate)
                .event_id(),
        ))
    }

    pub(crate) fn read_followees_tx(
        id: RostraId,
        ids_followees_table: &impl ids_followees::ReadableTable,
    ) -> DbResult<HashMap<RostraId, IdsFolloweesRecord>> {
        Ok(ids_followees_table
            .range((id, RostraId::ZERO)..=(id, RostraId::MAX))?
            .map(|res| res.map(|(k, v)| (k.value().1, v.value())))
            .collect::<Result<HashMap<_, _>, _>>()?)
    }
    pub(crate) fn read_followees_tx_iter(
        id: RostraId,
        ids_followees_table: &impl ids_followees::ReadableTable,
    ) -> DbResult<impl Iterator<Item = Result<(RostraId, IdsFolloweesRecord), StorageError>>> {
        Ok(ids_followees_table
            .range((id, RostraId::ZERO)..=(id, RostraId::MAX))?
            .map_ok(|(k, v)| (k.value().1, v.value())))
    }

    pub(crate) fn read_followers_tx(
        id: RostraId,
        ids_followers_table: &impl ids_followers::ReadableTable,
    ) -> DbResult<HashMap<RostraId, IdsFollowersRecord>> {
        Ok(ids_followers_table
            .range((id, RostraId::ZERO)..=(id, RostraId::MAX))?
            .map(|res| res.map(|(k, v)| (k.value().1, v.value())))
            .collect::<Result<HashMap<_, _>, _>>()?)
    }

    /// Compute the web of trust data from the given direct followees.
    ///
    /// The WoT includes:
    /// - Direct followees (passed in)
    /// - Extended followees: followees of direct followees, excluding those
    ///   already in direct followees
    pub(crate) fn compute_wot_tx(
        self_id: RostraId,
        direct_followees: &HashMap<RostraId, IdsFolloweesRecord>,
        ids_followees_table: &impl ids_followees::ReadableTable,
    ) -> DbResult<WotData> {
        let mut extended = HashSet::new();

        for followee_id in direct_followees.keys() {
            // Get the followees of this followee
            for result in Self::read_followees_tx_iter(*followee_id, ids_followees_table)? {
                let (ext_id, _record) = result?;
                // Don't include self or direct followees in extended
                if ext_id != self_id && !direct_followees.contains_key(&ext_id) {
                    extended.insert(ext_id);
                }
            }
        }

        Ok(WotData {
            followees: direct_followees.clone(),
            extended,
        })
    }

    pub(crate) fn insert_self_event_id_tx(
        event_id: impl Into<rostra_core::ShortEventId>,
        events_self_table: &mut events_self::Table,
    ) -> DbResult<()> {
        events_self_table.insert(&event_id.into(), &())?;
        Ok(())
    }

    /// Insert an event and perform all DAG accounting.
    ///
    /// This function handles event insertion and related bookkeeping:
    ///
    /// 1. **Identity tracking**: Records the author's full RostraId
    /// 2. **DAG structure**: Resolves author-scoped parents, updates heads, and
    ///    handles missing parent references
    /// 3. **Content tracking**:
    ///    - Non-deleted content increments RC in `content_rc`
    ///    - Nonempty content is marked `Missing` in `events_content_state`
    ///    - If missing content is not in `content_store`, adds it to
    ///      `events_content_missing`
    ///    - Content that starts Deleted skips RC and Missing and is accounted
    ///      directly as total and deleted usage
    /// 4. **Deletion handling**: If event is a delete, marks its target Deleted
    ///
    /// **Important**: This function does NOT process content side effects (like
    /// incrementing reply counts). That happens in `process_event_content_tx`.
    /// The `Missing` marker ensures content processing is idempotent - it
    /// can be called multiple times for the same event without duplicate
    /// effects.
    ///
    /// Returns [`InsertEventOutcome`] indicating if the event was newly
    /// inserted or already present, along with metadata about the
    /// insertion.
    #[allow(clippy::too_many_arguments)]
    pub(crate) fn insert_event_tx(
        event: VerifiedEvent,
        ids_full_t: &mut ids_full::Table,
        events_table: &mut events::Table,
        events_missing_table: &mut events_missing::Table,
        events_heads_table: &mut events_heads::Table,
        events_by_time_table: &mut events_by_time::Table,
        events_content_state_table: &mut events_content_state::Table,
        content_store_table: &mut content_store::Table,
        content_rc_table: &mut content_rc::Table,
        events_content_missing_table: &mut events_content_missing::Table,
        mut ids_data_usage_table: Option<&mut ids_data_usage::Table>,
    ) -> DbResult<InsertEventOutcome> {
        let author = event.author();
        let event_id = event.event_id.to_short();

        ids_full_t.register(author)?;

        if events_table.get(&event_id)?.is_some() {
            return Ok(InsertEventOutcome::AlreadyPresent);
        }

        let (was_missing, is_deleted) = match events_missing_table
            .remove(&(author, event_id))?
            .map(|g| g.value())
        {
            Some(prev_missing) => {
                // If the missing was marked as deleted, we'll record it.
                (
                    true,
                    if let Some(deleted_by) = prev_missing.deleted_by {
                        events_content_state_table
                            .insert(&event_id, &EventContentState::Deleted { deleted_by })?;
                        true
                    } else {
                        false
                    },
                )
            }
            _ => {
                // Since nothing was expecting this event yet, it must be a "head".
                events_heads_table.insert(&(author, event_id), &EventsHeadsTableRecord)?;
                (false, false)
            }
        };

        // When both parents point at same thing, process only one: one that can
        // be responsible for deletion.
        let parent_ids = if event.parent_aux() == event.parent_prev() {
            vec![(event.parent_aux(), true)]
        } else {
            vec![(event.parent_aux(), true), (event.parent_prev(), false)]
        };

        let mut deleted_parent = None;

        let mut reverted_parent_content: Option<EventContentRaw> = None;
        let mut missing_parents = vec![];

        for (parent_id, parent_is_aux) in parent_ids {
            let Some(parent_id) = parent_id else {
                continue;
            };

            let parent_event = events_table
                .get(&parent_id)?
                .map(|r| r.value())
                .filter(|parent| parent.author() == author);
            if let Some(parent_event_record) = parent_event {
                if event.is_delete_parent_aux_content_set() && parent_is_aux {
                    deleted_parent = Some(parent_id);

                    let parent_content_hash = parent_event_record.content_hash();
                    let old_state = events_content_state_table
                        .get(&parent_id)?
                        .map(|state| state.value());
                    let deleted_by = Self::merge_deleted_by_tx(
                        match old_state {
                            Some(EventContentState::Deleted { deleted_by }) => Some(deleted_by),
                            _ => None,
                        },
                        Some(EventOrder::new(event.timestamp(), event_id)),
                        events_table,
                    )?
                    .expect("a direct deletion candidate always produces attribution");
                    events_content_state_table
                        .insert(&parent_id, &EventContentState::Deleted { deleted_by })?;

                    if let Some(EventContentState::Missing {
                        next_fetch_attempt, ..
                    }) = old_state
                    {
                        events_content_missing_table.remove(&(next_fetch_attempt, parent_id))?;
                    }

                    // Decrement RC unless already decremented
                    // (Deleted/Pruned/Invalid all decrement RC on transition).
                    let rc_already_decremented = matches!(
                        old_state,
                        Some(
                            EventContentState::Deleted { .. }
                                | EventContentState::Pruned
                                | EventContentState::Invalid
                        )
                    );

                    if old_state.is_none() {
                        // Only processed content applied projections. Bytes in
                        // the shared store can also belong to an unprocessed
                        // Missing event.
                        if let Some(ContentStoreRecord(cow)) = content_store_table
                            .get(&parent_content_hash)?
                            .map(|g| g.value())
                        {
                            reverted_parent_content = Some(cow.into_owned());
                        }
                    }
                    if !rc_already_decremented {
                        // Decrement RC for the deleted content
                        Database::decrement_content_rc_tx(parent_content_hash, content_rc_table)?;
                    }

                    // Track payload deletion for the parent's author.
                    // Already-Deleted is skipped (no bucket change), but
                    // Pruned/Invalid → Deleted and Missing/Processed →
                    // Deleted all need tracking.
                    if !matches!(old_state, Some(EventContentState::Deleted { .. })) {
                        if let Some(ref mut usage_table) = ids_data_usage_table {
                            let parent_author = parent_event_record.author();
                            Database::track_payload_deletion_tx(
                                parent_author,
                                parent_event_record.content_len(),
                                old_state.as_ref(),
                                usage_table,
                            )?;
                        }
                    }
                }
            } else {
                // We do not have this parent yet, so we mark it as missing
                let old_deleted_by = events_missing_table
                    .get(&(author, parent_id))?
                    .and_then(|record| record.value().deleted_by);
                let deleted_by = Self::merge_deleted_by_tx(
                    old_deleted_by,
                    (event.is_delete_parent_aux_content_set() && parent_is_aux)
                        .then_some(EventOrder::new(event.timestamp(), event_id)),
                    events_table,
                )?;
                events_missing_table
                    .insert(&(author, parent_id), &EventsMissingRecord { deleted_by })?;
                missing_parents.push(parent_id);
            }
            // If the event was considered a "head", it shouldn't as it has a child.
            events_heads_table.remove(&(author, parent_id))?;
        }

        events_table.insert(
            &event_id,
            &EventRecord {
                signed: event.into(),
            },
        )?;
        events_by_time_table.insert(&(event.timestamp(), event_id), &())?;

        // Track metadata for this event
        if let Some(ref mut usage_table) = ids_data_usage_table {
            Database::track_new_event_tx(author, usage_table)?;
        }

        // Handle content RC and state for this event.
        let content_hash = event.content_hash();
        if is_deleted {
            if let Some(ref mut usage_table) = ids_data_usage_table {
                Database::track_new_deleted_payload_tx(author, event.content_len(), usage_table)?;
            }
        } else {
            // Increment RC for the content hash (including empty content)
            Database::increment_content_rc_tx(content_hash, content_rc_table)?;

            // Track new payload (starts as missing)
            if let Some(ref mut usage_table) = ids_data_usage_table {
                Database::track_new_payload_tx(author, event.content_len(), usage_table)?;
            }

            if 0 < event.content_len() {
                // Regular content: mark as Missing, check content_missing
                events_content_state_table.insert(
                    &event_id,
                    &EventContentState::Missing {
                        last_fetch_attempt: None,
                        fetch_attempt_count: 0,
                        next_fetch_attempt: Timestamp::ZERO,
                    },
                )?;

                if content_store_table.get(&content_hash)?.is_none() {
                    events_content_missing_table.insert(&(Timestamp::ZERO, event_id), &())?;
                }
            } else {
                // Empty content: store it immediately, go straight to "processed"
                if content_store_table.get(&content_hash)?.is_none() {
                    content_store_table.insert(
                        &content_hash,
                        &ContentStoreRecord(Cow::Owned(EventContentRaw::new(vec![]))),
                    )?;
                }
                // Move from missing to current (was tracked as missing above)
                if let Some(ref mut usage_table) = ids_data_usage_table {
                    Database::track_payload_processed_tx(author, event.content_len(), usage_table)?;
                }
            }
        }

        Ok(InsertEventOutcome::Inserted {
            was_missing,
            is_deleted,
            deleted_parent,
            reverted_parent_content,
            missing_parents,
        }
        .validate())
    }

    /// Check if we should process content for this event.
    ///
    /// This function ensures idempotent content processing by checking the
    /// event's state in `events_content_state`:
    ///
    /// - **`Missing`** → `true`: Event was inserted but content hasn't been
    ///   processed yet. Side effects should be applied.
    /// - **No entry** → `false`: Content was already processed. Returning false
    ///   prevents duplicate side effects (e.g., incrementing reply_count
    ///   twice).
    /// - **`Deleted`/`Pruned`** → `false`: Ordinary processing is unwanted. The
    ///   caller may separately derive immutable replacement metadata from an
    ///   eligible Deleted social-post edit.
    ///
    /// After processing content, callers should remove the `Missing` marker
    /// from `events_content_state` to indicate processing is complete.
    pub(crate) fn can_insert_event_content_tx(
        VerifiedEventContent { event, .. }: &VerifiedEventContent,
        events_content_state_table: &impl events_content_state::ReadableTable,
    ) -> DbResult<bool> {
        let event_id = event.event_id.to_short();

        // Check content state
        if let Some(state) = events_content_state_table
            .get(&event_id)?
            .map(|g| g.value())
        {
            match state {
                EventContentState::Missing { .. } => {
                    // Content not yet processed, can insert
                    return Ok(true);
                }
                EventContentState::Deleted { .. }
                | EventContentState::Pruned
                | EventContentState::Invalid => {
                    // Content deleted, pruned, or invalid — cannot insert
                    return Ok(false);
                }
            }
        }

        // No state means content was already processed (came with event or processed
        // earlier) Return false to skip reprocessing
        Ok(false)
    }

    /// Mark an event's content as pruned.
    ///
    /// In the new model, RC was incremented when the event was inserted,
    /// so we decrement it here (unless already deleted/pruned).
    pub(crate) fn prune_event_content_tx(
        event_id: impl Into<ShortEventId>,
        content_hash: ContentHash,
        events_content_state_table: &mut events_content_state::Table,
        content_rc_table: &mut content_rc::Table,
        events_content_missing_table: &mut events_content_missing::Table,
        data_usage_info: Option<(RostraId, u32, &mut ids_data_usage::Table)>,
    ) -> DbResult<bool> {
        let event_id = event_id.into();

        // Check current state - if already deleted or pruned, handle appropriately
        let old_state = events_content_state_table
            .get(&event_id)?
            .map(|g| g.value());

        match old_state {
            Some(EventContentState::Deleted { .. }) => {
                // Already deleted, can't prune
                return Ok(false);
            }
            Some(EventContentState::Invalid) => {
                // Already invalid (RC already decremented), can't prune
                return Ok(false);
            }
            Some(EventContentState::Pruned) => {
                // Already pruned, nothing to do
                return Ok(true);
            }
            Some(EventContentState::Missing { .. }) | None => {
                // Can proceed to prune
            }
        }

        // Not yet deleted/pruned - decrement RC and mark as pruned
        Database::decrement_content_rc_tx(content_hash, content_rc_table)?;

        // Track payload pruning
        if let Some((author, content_len, usage_table)) = data_usage_info {
            Database::track_payload_pruning_tx(
                author,
                content_len,
                old_state.as_ref(),
                usage_table,
            )?;
        }

        events_content_state_table.insert(&event_id, &EventContentState::Pruned)?;
        if let Some(EventContentState::Missing {
            next_fetch_attempt, ..
        }) = old_state
        {
            events_content_missing_table.remove(&(next_fetch_attempt, event_id))?;
        }

        Ok(true)
    }

    pub(crate) fn get_missing_events_for_id_tx(
        author: RostraId,
        events_missing_table: &impl events_missing::ReadableTable,
    ) -> DbResult<Vec<ShortEventId>> {
        Ok(events_missing_table
            .range((author, ShortEventId::ZERO)..=(author, ShortEventId::MAX))?
            .map(|r| r.map(|(k, _v)| k.value().1))
            .collect::<Result<Vec<_>, _>>()?)
    }

    pub(crate) fn get_ids_with_missing_events_tx(
        after: Option<RostraId>,
        limit: usize,
        events_missing_table: &impl events_missing::ReadableTable,
    ) -> DbResult<Vec<RostraId>> {
        if limit == 0 {
            return Ok(Vec::new());
        }
        let start = after.map_or(std::ops::Bound::Unbounded, |author| {
            std::ops::Bound::Excluded((author, ShortEventId::MAX))
        });
        let mut authors = Vec::with_capacity(limit);

        for row in events_missing_table.range((start, std::ops::Bound::Unbounded))? {
            let author = row?.0.value().0;
            if authors.last() != Some(&author) {
                authors.push(author);
                if limit <= authors.len() {
                    break;
                }
            }
        }

        Ok(authors)
    }

    pub(crate) fn get_last_id_with_missing_events_tx(
        events_missing_table: &impl events_missing::ReadableTable,
    ) -> DbResult<Option<RostraId>> {
        Ok(events_missing_table
            .range((
                std::ops::Bound::<(RostraId, ShortEventId)>::Unbounded,
                std::ops::Bound::<(RostraId, ShortEventId)>::Unbounded,
            ))?
            .next_back()
            .transpose()?
            .map(|(key, _)| key.value().0))
    }

    pub(crate) fn get_heads_events_tx(
        author: RostraId,
        events_heads_table: &impl events_heads::ReadableTable,
    ) -> DbResult<Vec<ShortEventId>> {
        Ok(events_heads_table
            .range((author, ShortEventId::ZERO)..=(author, ShortEventId::MAX))?
            .map(|r| r.map(|(k, _v)| k.value().1))
            .collect::<Result<Vec<_>, _>>()?)
    }

    pub(crate) fn get_ids_with_heads_tx(
        after: Option<RostraId>,
        limit: usize,
        events_heads_table: &impl events_heads::ReadableTable,
    ) -> DbResult<Vec<RostraId>> {
        if limit == 0 {
            return Ok(Vec::new());
        }
        let start = after.map_or(std::ops::Bound::Unbounded, |author| {
            std::ops::Bound::Excluded((author, ShortEventId::MAX))
        });
        let mut authors = Vec::with_capacity(limit);

        for row in events_heads_table.range((start, std::ops::Bound::Unbounded))? {
            let author = row?.0.value().0;
            if authors.last() != Some(&author) {
                authors.push(author);
                if limit <= authors.len() {
                    break;
                }
            }
        }

        Ok(authors)
    }

    pub(crate) fn count_missing_events_for_id_tx(
        author: RostraId,
        events_missing_table: &impl events_missing::ReadableTable,
    ) -> DbResult<usize> {
        Ok(events_missing_table
            .range((author, ShortEventId::ZERO)..=(author, ShortEventId::MAX))?
            .count())
    }

    pub(crate) fn count_heads_events_tx(
        author: RostraId,
        events_heads_table: &impl events_heads::ReadableTable,
    ) -> DbResult<usize> {
        Ok(events_heads_table
            .range((author, ShortEventId::ZERO)..=(author, ShortEventId::MAX))?
            .count())
    }

    pub(crate) fn get_event_tx(
        event: impl Into<ShortEventId>,
        events_table: &impl events::ReadableTable,
    ) -> DbResult<Option<EventRecord>> {
        Ok(events_table.get(&event.into())?.map(|r| r.value()))
    }

    pub(crate) fn get_social_post_tx(
        event: impl Into<ShortEventId>,
        social_posts_table: &impl social_posts::ReadableTable,
    ) -> DbResult<Option<SocialPostRecord>> {
        Ok(social_posts_table.get(&event.into())?.map(|r| r.value()))
    }
    pub(crate) fn has_event_tx(
        event: impl Into<ShortEventId>,
        events_table: &impl events::ReadableTable,
    ) -> DbResult<bool> {
        Ok(events_table.get(&event.into())?.is_some())
    }

    /// Get the per-event content state (not the content itself).
    ///
    /// To get the actual content, use `get_event_content_full_tx` which also
    /// looks up the content from the content_store.
    pub(crate) fn get_event_content_state_tx(
        event: impl Into<ShortEventId>,
        events_content_state_table: &impl events_content_state::ReadableTable,
    ) -> DbResult<Option<EventContentState>> {
        Ok(events_content_state_table
            .get(&event.into())?
            .map(|r| r.value()))
    }

    /// Get the full content for an event, including looking it up from
    /// content_store.
    ///
    /// Returns:
    /// - `None` if no state recorded for this event
    /// - `Some(Present(content))` if content is available
    /// - `Some(Invalid(content))` if content was invalid
    /// - `Some(Deleted { deleted_by })` if content was deleted
    /// - `Some(Pruned)` if content was pruned
    /// - `Some(Missing)` if content is not in store
    pub(crate) fn get_event_content_full_tx(
        event_id: impl Into<ShortEventId>,
        content_hash: ContentHash,
        events_content_state_table: &impl events_content_state::ReadableTable,
        content_store_table: &impl content_store::ReadableTable,
    ) -> DbResult<Option<EventContentResult>> {
        let event_id = event_id.into();

        // Check if content is deleted or pruned
        // Check if deleted or pruned - return corresponding result
        if let Some(state) = events_content_state_table
            .get(&event_id)?
            .map(|r| r.value())
        {
            match state {
                EventContentState::Missing { .. } => {
                    // Content not yet processed - fall through to check
                    // content_store
                }
                EventContentState::Deleted { deleted_by } => {
                    return Ok(Some(EventContentResult::Deleted { deleted_by }));
                }
                EventContentState::Pruned => {
                    return Ok(Some(EventContentResult::Pruned));
                }
                EventContentState::Invalid => {
                    return Ok(Some(EventContentResult::Invalid));
                }
            }
        }

        // Not deleted/pruned/invalid - look up content from content_store
        Ok(Some(
            match content_store_table.get(&content_hash)?.map(|r| r.value()) {
                Some(ContentStoreRecord(content)) => {
                    EventContentResult::Present(content.into_owned())
                }
                None => EventContentResult::Missing,
            },
        ))
    }

    /// Check if content is available for an event.
    ///
    /// In the new model, content is available if:
    /// - Event is NOT in deleted/pruned state, AND
    /// - Content hash is in content_store
    pub(crate) fn has_event_content_tx(
        event_id: impl Into<ShortEventId>,
        content_hash: ContentHash,
        events_content_state_table: &impl events_content_state::ReadableTable,
        content_store_table: &impl content_store::ReadableTable,
    ) -> DbResult<bool> {
        let event_id = event_id.into();

        // If event has a content state, it means content is deleted or pruned
        if events_content_state_table.get(&event_id)?.is_some() {
            return Ok(false);
        }

        // Check if content is in store
        Ok(content_store_table.get(&content_hash)?.is_some())
    }

    /// Check if content is available for an event that was marked as missing.
    ///
    /// This is for cases where:
    /// - Event A was inserted but its content wasn't available yet
    /// - Later, content arrived via event B (which has the same content hash)
    /// - Now we want to check if event A can use that content
    ///
    /// In the new model, RC is managed at event insertion time, so this
    /// function doesn't touch RC. It just checks if content is available.
    ///
    /// Returns `true` if content is in store and event is not deleted/pruned.
    #[cfg(test)]
    pub(crate) fn is_content_available_for_event_tx(
        event_id: impl Into<ShortEventId>,
        content_hash: ContentHash,
        events_content_state_table: &impl events_content_state::ReadableTable,
        content_store_table: &impl content_store::ReadableTable,
    ) -> DbResult<bool> {
        let event_id = event_id.into();

        // Check event content state
        if let Some(state) = events_content_state_table
            .get(&event_id)?
            .map(|g| g.value())
        {
            match state {
                // Missing means content wasn't in store at event insertion,
                // but it might be now - check the store
                EventContentState::Missing { .. } => {}
                // Deleted, pruned, or invalid means content is not available
                EventContentState::Deleted { .. }
                | EventContentState::Pruned
                | EventContentState::Invalid => {
                    return Ok(false);
                }
            }
        }

        // Check if content is in store
        Ok(content_store_table.get(&content_hash)?.is_some())
    }

    pub(crate) fn insert_follow_tx(
        author: RostraId,
        event_order: EventOrder,
        content: content_kind::Follow,
        followees_table: &mut Table<(RostraId, RostraId), IdsFolloweesRecord>,
        followers_table: &mut Table<(RostraId, RostraId), IdsFollowersRecord>,
        follow_events_table: &mut Table<(RostraId, RostraId, Timestamp, ShortEventId), ()>,
        unfollowed_table: &mut Table<(RostraId, RostraId), IdsUnfollowedRecord>,
    ) -> DbResult<bool> {
        let followee = content.followee;
        let db_key = (author, followee);
        let epoch_boundary = unfollowed_table
            .get(&db_key)?
            .map(|record| record.value())
            .map(|record| EventOrder::new(record.ts, record.event_id));
        if epoch_boundary.is_some_and(|boundary| event_order <= boundary) {
            return Ok(false);
        }
        follow_events_table.insert(
            &(
                author,
                followee,
                event_order.timestamp(),
                event_order.event_id(),
            ),
            &(),
        )?;

        let existing = followees_table.get(&db_key)?.map(|v| v.value());
        if let Some(ref followees) = existing {
            if event_order <= EventOrder::new(followees.latest_ts, followees.latest_event_id) {
                let first_ts = Self::first_follow_ts_after_tx(
                    author,
                    followee,
                    epoch_boundary,
                    follow_events_table,
                )?
                .unwrap_or(followees.latest_ts);
                if first_ts == followees.first_ts {
                    return Ok(false);
                }
                followees_table.insert(&db_key, &followees.clone().with_first_ts(first_ts))?;
                return Ok(true);
            }
        }

        let timestamp = event_order.timestamp();
        let first_ts =
            Self::first_follow_ts_after_tx(author, followee, epoch_boundary, follow_events_table)?
                .unwrap_or(timestamp);

        let tags_selector = content.persona_tags_selector.clone();
        let selector = content.selector();
        followees_table.insert(
            &db_key,
            &IdsFolloweesRecord::new(
                timestamp,
                event_order.event_id(),
                first_ts,
                selector,
                tags_selector,
            ),
        )?;
        followers_table.insert(&(followee, author), &IdsFollowersRecord {})?;

        debug!(target: LOG_TARGET, follower = %author.to_short(), followee=%followee.to_short(), "Follow update");

        Ok(true)
    }

    #[allow(deprecated)]
    pub(crate) fn insert_unfollow_tx(
        author: RostraId,
        event_order: EventOrder,
        followee: RostraId,
        followees_table: &mut Table<(RostraId, RostraId), IdsFolloweesRecord>,
        followers_table: &mut Table<(RostraId, RostraId), IdsFollowersRecord>,
        follow_events_table: &mut Table<(RostraId, RostraId, Timestamp, ShortEventId), ()>,
        unfollowed_table: &mut Table<(RostraId, RostraId), IdsUnfollowedRecord>,
    ) -> DbResult<bool> {
        let db_key = (author, followee);
        if let Some(unfollowed) = unfollowed_table.get(&db_key)?.map(|v| v.value()) {
            if event_order <= EventOrder::new(unfollowed.ts, unfollowed.event_id) {
                return Ok(false);
            }
        }

        unfollowed_table.insert(
            &db_key,
            &IdsUnfollowedRecord {
                ts: event_order.timestamp(),
                event_id: event_order.event_id(),
            },
        )?;
        Self::prune_follow_events_through_tx(author, followee, event_order, follow_events_table)?;

        let existing = followees_table.get(&db_key)?.map(|v| v.value());
        if let Some(followees) = existing {
            if event_order < EventOrder::new(followees.latest_ts, followees.latest_event_id) {
                let first_ts = Self::first_follow_ts_after_tx(
                    author,
                    followee,
                    Some(event_order),
                    follow_events_table,
                )?
                .unwrap_or(followees.latest_ts);
                followees_table.insert(&db_key, &followees.with_first_ts(first_ts))?;
                debug!(target: LOG_TARGET, follower = %author.to_short(), followee=%followee.to_short(), "Follow epoch boundary update");
                return Ok(true);
            }
        }

        followees_table.remove(&db_key)?;
        followers_table.remove(&(followee, author))?;
        debug!(target: LOG_TARGET, follower = %author.to_short(), followee=%followee.to_short(), "Unfollow update");

        Ok(true)
    }

    /// Find the earliest follow timestamp strictly after an unfollow boundary.
    fn first_follow_ts_after_tx(
        author: RostraId,
        followee: RostraId,
        boundary: Option<EventOrder>,
        follow_events_table: &impl ids_follow_events::ReadableTable,
    ) -> DbResult<Option<Timestamp>> {
        let lower = boundary
            .map(|order| (author, followee, order.timestamp(), order.event_id()))
            .unwrap_or((author, followee, Timestamp::ZERO, ShortEventId::ZERO));
        let upper = (author, followee, Timestamp::MAX, ShortEventId::MAX);

        for entry in follow_events_table.range(lower..=upper)? {
            let (key, _) = entry?;
            let (_, _, timestamp, event_id) = key.value();
            let order = EventOrder::new(timestamp, event_id);
            if boundary.is_none_or(|boundary| boundary < order) {
                return Ok(Some(timestamp));
            }
        }
        Ok(None)
    }

    /// Discard follow history that cannot belong to this or any later epoch.
    fn prune_follow_events_through_tx(
        author: RostraId,
        followee: RostraId,
        boundary: EventOrder,
        follow_events_table: &mut Table<(RostraId, RostraId, Timestamp, ShortEventId), ()>,
    ) -> DbResult<()> {
        const BATCH_SIZE: usize = 256;
        let range = (author, followee, Timestamp::ZERO, ShortEventId::ZERO)
            ..=(author, followee, boundary.timestamp(), boundary.event_id());
        loop {
            // redb does not allow mutation while a range iterator borrows the
            // table. Bound the temporary key set and resume from the beginning
            // after deleting each batch.
            let keys = follow_events_table
                .range(range.clone())?
                .take(BATCH_SIZE)
                .map(|entry| entry.map(|(key, _)| key.value()))
                .collect::<Result<Vec<_>, _>>()?;
            let len = keys.len();
            for key in keys {
                follow_events_table.remove(&key)?;
            }
            if len < BATCH_SIZE {
                break;
            }
        }
        Ok(())
    }

    pub(crate) fn insert_latest_value_tx<K, V>(
        timestamp: Timestamp,
        key: &K,
        value: V,
        table: &mut redb_bincode::Table<'_, K, Latest<V>>,
    ) -> DbResult<bool>
    where
        K: bincode::Encode + bincode::Decode<()>,
        V: bincode::Encode + bincode::Decode<()>,
        V: LatestEventValue,
    {
        let event_order = EventOrder::new(timestamp, value.event_id());
        if let Some(existing_value) = table.get(key)?.map(|v| v.value()) {
            if event_order <= EventOrder::new(existing_value.ts, existing_value.inner.event_id()) {
                return Ok(false);
            }
        }

        table.insert(
            key,
            &Latest {
                ts: timestamp,
                inner: value,
            },
        )?;

        Ok(true)
    }

    pub(crate) fn read_self_id_tx(
        id_self_table: &impl ids_self::ReadableTable,
    ) -> Result<Option<IdSelfAccountRecord>, DbError> {
        Ok(id_self_table.get(&())?.map(|v| v.value()))
    }

    pub(crate) fn write_self_id_tx(
        self_id: RostraId,
        id_self_table: &mut Table<(), IdSelfAccountRecord>,
    ) -> DbResult<IdSelfAccountRecord> {
        let id_self_record = IdSelfAccountRecord {
            rostra_id: self_id,
            iroh_secret: rand::rng().random(),
        };
        let _ = id_self_table.insert(&(), &id_self_record)?;
        Ok(id_self_record)
    }

    pub(crate) fn read_head_tx(
        self_id: RostraId,
        events_heads_table: &impl ReadableTable<(RostraId, ShortEventId), EventsHeadsTableRecord>,
    ) -> DbResult<Option<ShortEventId>> {
        Ok(events_heads_table
            .range((self_id, ShortEventId::ZERO)..=(self_id, ShortEventId::MAX))?
            .next()
            .transpose()?
            .map(|(k, _)| k.value().1))
    }

    pub(crate) fn get_heads_tx(
        self_id: RostraId,
        events_heads_table: &impl events_heads::ReadableTable,
    ) -> DbResult<HashSet<ShortEventId>> {
        Ok(events_heads_table
            .range((self_id, ShortEventId::ZERO)..=(self_id, ShortEventId::MAX))?
            .map(|r| r.map(|(k, _)| k.value().1))
            .collect::<Result<HashSet<_>, _>>()?)
    }

    pub(crate) fn get_social_profile_tx(
        id: RostraId,
        table: &impl social_profiles::ReadableTable,
    ) -> DbResult<Option<IdSocialProfileRecord>> {
        Ok(table.get(&id)?.map(|v| v.value().inner))
    }

    pub(crate) fn get_random_table_key<K, V>(
        table: &impl ReadableTable<K, V>,
    ) -> Result<Option<K>, DbError>
    where
        K: RandomTableKey + bincode::Decode<()> + bincode::Encode,
        V: bincode::Decode<()> + bincode::Encode,
    {
        let pivot = K::random_key();

        let before_pivot = K::min_key()..pivot;
        let after_pivot = pivot..=K::max_key();

        if rand::rng().random() {
            if let Some(key) = get_first_in_range(table, after_pivot)? {
                return Ok(Some(key));
            }
            return get_last_in_range(table, before_pivot);
        }

        if let Some(key) = get_last_in_range(table, before_pivot)? {
            return Ok(Some(key));
        }
        get_first_in_range(table, after_pivot)
    }

    pub(crate) fn get_random_self_event(
        events_self_table: &impl ReadableTable<ShortEventId, ()>,
    ) -> Result<Option<ShortEventId>, DbError> {
        Self::get_random_table_key(events_self_table)
    }

    pub(crate) fn read_iroh_secret_tx(
        ids_self_t: &impl ids_self::ReadableTable,
    ) -> DbResult<iroh::SecretKey> {
        let self_id = Self::read_self_id_tx(ids_self_t)?
            .expect("Must have iroh secret generated after opening");
        Ok(iroh::SecretKey::from_bytes(&self_id.iroh_secret))
    }

    /// Increment reference count for content by its hash.
    ///
    /// Called when a new event referencing this content is inserted.
    pub(crate) fn increment_content_rc_tx(
        content_hash: ContentHash,
        content_rc_table: &mut content_rc::Table,
    ) -> DbResult<u64> {
        let current_count = content_rc_table
            .get(&content_hash)?
            .map(|g| g.value())
            .unwrap_or(0); // Default to 0 if missing (first reference)

        let new_count = current_count + 1;
        content_rc_table.insert(&content_hash, &new_count)?;
        Ok(new_count)
    }

    /// Decrement reference count for content by its hash.
    ///
    /// Called when an event's content is deleted or pruned.
    /// Note: This does NOT remove the content from content_store - that should
    /// be done separately via garbage collection when RC reaches 0.
    pub(crate) fn decrement_content_rc_tx(
        content_hash: ContentHash,
        content_rc_table: &mut content_rc::Table,
    ) -> DbResult<u64> {
        let current_count = match content_rc_table.get(&content_hash)?.map(|g| g.value()) {
            Some(count) => count,
            None => {
                // RC entry missing - this shouldn't happen in normal operation.
                // It means decrement was called without a corresponding increment.
                debug_assert!(
                    false,
                    "Decrementing RC for content with no RC entry: {content_hash}"
                );
                error!(
                    target: LOG_TARGET,
                    %content_hash,
                    "Decrementing RC for content with no RC entry - possible bug"
                );
                // Default to 1 to avoid underflow, will result in RC=0
                1
            }
        };

        if current_count <= 1 {
            // Count reached 0, remove the RC entry
            // (content_store cleanup is separate)
            content_rc_table.remove(&content_hash)?;
            Ok(0)
        } else {
            let new_count = current_count
                .checked_sub(1)
                .expect("Reference count should never underflow");
            content_rc_table.insert(&content_hash, &new_count)?;
            Ok(new_count)
        }
    }

    /// Get the reference count for content by its hash.
    #[cfg(test)]
    pub(crate) fn get_content_rc_tx(
        content_hash: ContentHash,
        content_rc_table: &impl content_rc::ReadableTable,
    ) -> DbResult<u64> {
        Ok(content_rc_table
            .get(&content_hash)?
            .map(|g| g.value())
            .unwrap_or(0)) // Default to 0 if missing
    }

    // ========================================================================
    // Data Usage Tracking
    // ========================================================================

    /// Size of event metadata in bytes (Event struct + signature).
    /// See rostra_core::event::Event documentation.
    pub const EVENT_METADATA_SIZE: u64 = 192;

    fn get_usage_mut(
        author: RostraId,
        ids_data_usage_table: &mut ids_data_usage::Table,
    ) -> DbResult<IdsDataUsageRecord> {
        Ok(ids_data_usage_table
            .get(&author)?
            .map(|g| g.value())
            .unwrap_or_default())
    }

    /// Track a newly inserted event (metadata only).
    ///
    /// Called once per event in `insert_event_tx`.
    pub(crate) fn track_new_event_tx(
        author: RostraId,
        ids_data_usage_table: &mut ids_data_usage::Table,
    ) -> DbResult<()> {
        let mut usage = Self::get_usage_mut(author, ids_data_usage_table)?;

        usage.current_metadata_size += Self::EVENT_METADATA_SIZE;
        usage.total_metadata_size += Self::EVENT_METADATA_SIZE;
        usage.current_metadata_num += 1;
        usage.total_metadata_num += 1;

        ids_data_usage_table.insert(&author, &usage)?;
        Ok(())
    }

    /// Track a newly inserted payload (starts as missing).
    ///
    /// Called in `insert_event_tx` when an event with `content_len > 0` is
    /// inserted and not deleted. The payload is counted in total and missing
    /// until content is received and processed.
    pub(crate) fn track_new_payload_tx(
        author: RostraId,
        content_len: u32,
        ids_data_usage_table: &mut ids_data_usage::Table,
    ) -> DbResult<()> {
        let len = u64::from(content_len);
        let mut usage = Self::get_usage_mut(author, ids_data_usage_table)?;

        usage.total_content_size += len;
        usage.total_payload_num += 1;
        usage.missing_payload_size += len;
        usage.missing_payload_num += 1;

        ids_data_usage_table.insert(&author, &usage)?;
        Ok(())
    }

    /// Track a newly inserted payload whose event starts in Deleted.
    ///
    /// The payload contributes directly to total and deleted usage without
    /// entering Missing or participating in reference counting.
    pub(crate) fn track_new_deleted_payload_tx(
        author: RostraId,
        content_len: u32,
        ids_data_usage_table: &mut ids_data_usage::Table,
    ) -> DbResult<()> {
        let len = u64::from(content_len);
        let mut usage = Self::get_usage_mut(author, ids_data_usage_table)?;

        usage.total_content_size += len;
        usage.total_payload_num += 1;
        usage.deleted_payload_size += len;
        usage.deleted_payload_num += 1;

        ids_data_usage_table.insert(&author, &usage)?;
        Ok(())
    }

    /// Track a payload that has been processed (missing → current).
    ///
    /// Called in `process_event_content_tx` when content transitions from
    /// `Missing` to processed.
    pub(crate) fn track_payload_processed_tx(
        author: RostraId,
        content_len: u32,
        ids_data_usage_table: &mut ids_data_usage::Table,
    ) -> DbResult<()> {
        let len = u64::from(content_len);
        let mut usage = Self::get_usage_mut(author, ids_data_usage_table)?;

        usage.missing_payload_size = usage.missing_payload_size.saturating_sub(len);
        usage.missing_payload_num = usage.missing_payload_num.saturating_sub(1);
        usage.current_content_size += len;
        usage.current_payload_num += 1;

        ids_data_usage_table.insert(&author, &usage)?;
        Ok(())
    }

    /// Track a payload that failed validation (missing → invalid).
    ///
    /// Called in `process_event_content_tx` when content fails deserialization.
    pub(crate) fn track_payload_invalid_tx(
        author: RostraId,
        content_len: u32,
        ids_data_usage_table: &mut ids_data_usage::Table,
    ) -> DbResult<()> {
        let len = u64::from(content_len);
        let mut usage = Self::get_usage_mut(author, ids_data_usage_table)?;

        usage.missing_payload_size = usage.missing_payload_size.saturating_sub(len);
        usage.missing_payload_num = usage.missing_payload_num.saturating_sub(1);
        usage.invalid_payload_size += len;
        usage.invalid_payload_num += 1;

        ids_data_usage_table.insert(&author, &usage)?;
        Ok(())
    }

    /// Track a payload deletion (missing/current/invalid/pruned → deleted).
    ///
    /// `old_state` determines which bucket the payload moves from:
    /// - `Some(Missing)` → moves from missing to deleted
    /// - `Some(Invalid)` → moves from invalid to deleted
    /// - `Some(Pruned)` → moves from pruned to deleted
    /// - `None` (processed) → moves from current to deleted
    pub(crate) fn track_payload_deletion_tx(
        author: RostraId,
        content_len: u32,
        old_state: Option<&EventContentState>,
        ids_data_usage_table: &mut ids_data_usage::Table,
    ) -> DbResult<()> {
        let len = u64::from(content_len);
        let mut usage = Self::get_usage_mut(author, ids_data_usage_table)?;

        match old_state {
            Some(EventContentState::Missing { .. }) => {
                usage.missing_payload_size = usage.missing_payload_size.saturating_sub(len);
                usage.missing_payload_num = usage.missing_payload_num.saturating_sub(1);
            }
            Some(EventContentState::Invalid) => {
                usage.invalid_payload_size = usage.invalid_payload_size.saturating_sub(len);
                usage.invalid_payload_num = usage.invalid_payload_num.saturating_sub(1);
            }
            Some(EventContentState::Pruned) => {
                usage.pruned_payload_size = usage.pruned_payload_size.saturating_sub(len);
                usage.pruned_payload_num = usage.pruned_payload_num.saturating_sub(1);
            }
            None => {
                usage.current_content_size = usage.current_content_size.saturating_sub(len);
                usage.current_payload_num = usage.current_payload_num.saturating_sub(1);
            }
            // Already deleted -- should not happen (caller guards against it)
            Some(EventContentState::Deleted { .. }) => {}
        }

        usage.deleted_payload_size += len;
        usage.deleted_payload_num += 1;

        ids_data_usage_table.insert(&author, &usage)?;
        Ok(())
    }

    /// Track a payload pruning (missing or current → pruned).
    ///
    /// `old_state` determines which bucket the payload moves from:
    /// - `Some(Missing)` → moves from missing to pruned
    /// - `None` (processed) → moves from current to pruned
    pub(crate) fn track_payload_pruning_tx(
        author: RostraId,
        content_len: u32,
        old_state: Option<&EventContentState>,
        ids_data_usage_table: &mut ids_data_usage::Table,
    ) -> DbResult<()> {
        let len = u64::from(content_len);
        let mut usage = Self::get_usage_mut(author, ids_data_usage_table)?;

        match old_state {
            Some(EventContentState::Missing { .. }) => {
                usage.missing_payload_size = usage.missing_payload_size.saturating_sub(len);
                usage.missing_payload_num = usage.missing_payload_num.saturating_sub(1);
            }
            None => {
                usage.current_content_size = usage.current_content_size.saturating_sub(len);
                usage.current_payload_num = usage.current_payload_num.saturating_sub(1);
            }
            _ => {}
        }

        usage.pruned_payload_size += len;
        usage.pruned_payload_num += 1;

        ids_data_usage_table.insert(&author, &usage)?;
        Ok(())
    }

    /// Get the data usage for an identity.
    pub(crate) fn get_data_usage_tx(
        author: RostraId,
        ids_data_usage_table: &impl ids_data_usage::ReadableTable,
    ) -> DbResult<IdsDataUsageRecord> {
        Ok(ids_data_usage_table
            .get(&author)?
            .map(|g| g.value())
            .unwrap_or_default())
    }
}