@feltdb/core 0.6.13 → 0.7.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (83) hide show
  1. package/README.md +32 -0
  2. package/dist/agent-registry.js +1 -3
  3. package/dist/agent-runtime.js +8 -7
  4. package/dist/analytics-backend.js +3 -1
  5. package/dist/application-contract.js +1 -0
  6. package/dist/application-manifest.js +1 -0
  7. package/dist/artifact.js +2 -0
  8. package/dist/authorization.js +2 -0
  9. package/dist/bundle.js +2 -0
  10. package/dist/capability.js +1 -3
  11. package/dist/cell.js +9 -4
  12. package/dist/cli/commands.js +26 -2
  13. package/dist/cli/index.js +1 -1
  14. package/dist/collection.js +39 -31
  15. package/dist/create/package-versions.js +1 -1
  16. package/dist/create/server-source/crates/feltdb/src/bin/feltdb_node.rs +613 -27
  17. package/dist/create/server-source/crates/feltdb/src/causal_backlog_bound.rs +452 -0
  18. package/dist/create/server-source/crates/feltdb/src/causal_dependency_barrier.rs +208 -0
  19. package/dist/create/server-source/crates/feltdb/src/convergence.rs +16 -0
  20. package/dist/create/server-source/crates/feltdb/src/dedup_bound_investigation.rs +402 -0
  21. package/dist/create/server-source/crates/feltdb/src/distributed_transactions.rs +784 -24
  22. package/dist/create/server-source/crates/feltdb/src/durable_operation_identity.rs +418 -0
  23. package/dist/create/server-source/crates/feltdb/src/lib.rs +284 -0
  24. package/dist/create/server-source/crates/feltdb/src/replica_acknowledgements.rs +471 -0
  25. package/dist/create/server-source/crates/feltdb/src/replica_membership.rs +661 -0
  26. package/dist/create/server-source/crates/feltdb/src/tcp_transport.rs +72 -3
  27. package/dist/create/server-source/crates/feltdb/src/transaction_preconditions.rs +899 -0
  28. package/dist/create/server-source/crates/feltdb-server/src/main.rs +116 -4
  29. package/dist/db.d.ts +2 -2
  30. package/dist/db.d.ts.map +1 -1
  31. package/dist/db.js +48 -15
  32. package/dist/development-runtime-bridge.js +1 -1
  33. package/dist/distributed-indexing.js +7 -5
  34. package/dist/embedded-transaction.d.ts +9 -0
  35. package/dist/embedded-transaction.d.ts.map +1 -1
  36. package/dist/embedded-transaction.js +95 -3
  37. package/dist/feltdb.d.ts +16 -0
  38. package/dist/feltdb.d.ts.map +1 -1
  39. package/dist/file-db.d.ts.map +1 -1
  40. package/dist/file-db.js +9 -3
  41. package/dist/flowspec.js +2 -1
  42. package/dist/http-client.js +2 -0
  43. package/dist/http-db.d.ts +11 -0
  44. package/dist/http-db.d.ts.map +1 -1
  45. package/dist/http-db.js +32 -3
  46. package/dist/identity.js +1 -0
  47. package/dist/index-analytics.js +6 -7
  48. package/dist/index-backend.js +3 -3
  49. package/dist/index-dashboard.js +10 -13
  50. package/dist/index-manager.js +12 -11
  51. package/dist/index-monitoring.js +9 -4
  52. package/dist/index-store.js +2 -0
  53. package/dist/indexeddb-db.d.ts.map +1 -1
  54. package/dist/indexeddb-db.js +32 -23
  55. package/dist/memory-db.d.ts.map +1 -1
  56. package/dist/memory-db.js +8 -4
  57. package/dist/observe.js +2 -0
  58. package/dist/provider.js +2 -0
  59. package/dist/query-planner.js +2 -4
  60. package/dist/reactive-graph.js +6 -8
  61. package/dist/release.js +2 -0
  62. package/dist/sharding.js +11 -6
  63. package/dist/state-contract.js +3 -3
  64. package/dist/studio-app/assets/{feltdb_wasm-CJv3wHzi.js → feltdb_wasm-CD744e5D.js} +1 -1
  65. package/dist/studio-app/assets/feltdb_wasm_bg-CiIXhOLi.wasm +0 -0
  66. package/dist/studio-app/assets/index-DoROs8yx.js +28 -0
  67. package/dist/studio-app/index.html +1 -1
  68. package/dist/sync-contract.js +9 -2
  69. package/dist/telemetry.d.ts.map +1 -1
  70. package/dist/telemetry.js +32 -12
  71. package/dist/transaction.d.ts +127 -9
  72. package/dist/transaction.d.ts.map +1 -1
  73. package/dist/transaction.js +91 -5
  74. package/dist/wasm/feltdb_wasm_bg.wasm +0 -0
  75. package/dist/worker.js +2 -0
  76. package/dist/workload.js +2 -0
  77. package/dist/workspace/development-node.js +11 -10
  78. package/dist/workspace/investigation-lifecycle-manager.js +2 -0
  79. package/dist/workspace/investigation-supervisor.js +5 -3
  80. package/dist/workspace/workspace-connection.js +14 -5
  81. package/package.json +1 -1
  82. package/dist/studio-app/assets/feltdb_wasm_bg-C8TG8r2n.wasm +0 -0
  83. package/dist/studio-app/assets/index-DospFFYE.js +0 -28
@@ -0,0 +1,418 @@
1
+ //! Durable operation identity.
2
+ //!
3
+ //! `(origin, sequence)` is an identity, not a counter. Receivers deduplicate on
4
+ //! it, so two operations must never be assigned the same one -- and that has to
5
+ //! hold across a process restart, which is where it did not.
6
+ //!
7
+ //! `dedup_bound_investigation.rs` established the failure: `feltdb_node` kept
8
+ //! the counter in memory and started it at 1 on every launch, while the causal
9
+ //! clock was rebuilt from the log. A restarted origin came back knowing its
10
+ //! causal position and not its identity position, re-issued identities its own
11
+ //! earlier operations already held, and its peers discarded the new writes as
12
+ //! duplicates -- with no error and no divergence signal.
13
+ //!
14
+ //! The authority is now the durable log, and specifically the log rather than
15
+ //! the causal clock. Those are **different identity domains**: the clock
16
+ //! component advances only on a successful apply, the sequence is burned by an
17
+ //! attempt, and they disagree by exactly the number of refused transactions.
18
+ //! `replication-convergence.md` fixes that the sequence is sparse and that
19
+ //! making it dense is a separate deferred decision, so nothing here derives
20
+ //! identity from the clock and nothing here makes the sequence dense.
21
+ //!
22
+ //! The invariant, stated precisely, because the weaker version is not enough:
23
+ //!
24
+ //! > no two **persisted** envelopes from one origin ever share a sequence.
25
+ //!
26
+ //! Not "restart usually finds the highest sequence". An identity is reserved
27
+ //! forever exactly when an envelope bearing it becomes durable, which is why a
28
+ //! number burned and then lost to a crash is safe to re-issue -- nothing
29
+ //! carrying it was ever written.
30
+
31
+ #[cfg(test)]
32
+ mod tests {
33
+ use crate::convergence::VectorClock;
34
+ use crate::distributed_transactions::{
35
+ DistributedTransactionExecutor, ReceiveOutcome, ReplicationMessage, SubmitOutcome,
36
+ TransactionEnvelope,
37
+ };
38
+ use crate::state_hash::StateHash;
39
+ use crate::transactions::{
40
+ ConsistencyContract, Operation, OperationCommand, OperationId, StateVersion,
41
+ };
42
+ use std::collections::HashMap;
43
+ use std::path::PathBuf;
44
+
45
+ fn zero_version() -> StateVersion {
46
+ StateVersion::new(VectorClock::new(), "0".repeat(64))
47
+ }
48
+
49
+ fn operation_at(node: &str, sequence: u64, payload: &str) -> Operation {
50
+ let mut fields = HashMap::new();
51
+ fields.insert("record".to_string(), serde_json::json!(payload));
52
+ Operation::new(
53
+ OperationId::new(node.to_string(), sequence),
54
+ zero_version(),
55
+ format!("tx_{payload}"),
56
+ OperationCommand {
57
+ op_type: "set".to_string(),
58
+ collection: "items".to_string(),
59
+ record_id: payload.to_string(),
60
+ fields,
61
+ },
62
+ node.to_string(),
63
+ )
64
+ }
65
+
66
+ /// Open a node over a log path, replaying it when it already exists --
67
+ /// which is what the node binary does on start.
68
+ fn open(node: &str, path: &PathBuf) -> DistributedTransactionExecutor {
69
+ let mut executor = DistributedTransactionExecutor::with_log(
70
+ node.to_string(),
71
+ StateHash::from_hex("0".repeat(64)),
72
+ Some(path.clone()),
73
+ )
74
+ .expect("executor");
75
+ if path.exists() {
76
+ executor.load_from_disk(path.clone()).expect("recover");
77
+ }
78
+ executor
79
+ }
80
+
81
+ /// Commit as the node binary does: chain the parent version forward on
82
+ /// success, and give each operation a distinct id.
83
+ ///
84
+ /// The operation id is taken from the executor's next identity, which is
85
+ /// exactly what the binary does now that the executor owns allocation.
86
+ fn commit(executor: &mut DistributedTransactionExecutor, node: &str, payload: &str) -> TransactionEnvelope {
87
+ let sequence = executor.next_origin_sequence();
88
+ let parent = chained_version(executor, node);
89
+ match executor
90
+ .submit_local_transaction(
91
+ format!("tx_{payload}"),
92
+ parent,
93
+ vec![operation_at(node, sequence, payload)],
94
+ ConsistencyContract::local(),
95
+ )
96
+ .expect("submit")
97
+ {
98
+ SubmitOutcome::Admitted(envelope) => envelope,
99
+ SubmitOutcome::CapacityExceeded { .. } => panic!("unexpected capacity refusal"),
100
+ }
101
+ }
102
+
103
+ /// The parent version this node would commit on top of.
104
+ fn chained_version(executor: &DistributedTransactionExecutor, node: &str) -> StateVersion {
105
+ match executor.get_replica_state(node) {
106
+ Some(replica) => StateVersion::new(replica.vector_clock.clone(), replica.state_hash.to_string()),
107
+ None => zero_version(),
108
+ }
109
+ }
110
+
111
+ fn message(envelope: TransactionEnvelope) -> ReplicationMessage {
112
+ let origin = envelope.originating_node.clone();
113
+ let sequence = envelope.envelope_id.sequence;
114
+ ReplicationMessage::new(envelope, origin, "receiver".to_string(), sequence)
115
+ }
116
+
117
+ // -- allocation --------------------------------------------------------
118
+
119
+ #[test]
120
+ fn identity_a_fresh_origin_starts_at_one() {
121
+ let dir = tempfile::tempdir().unwrap();
122
+ let mut node = open("A", &dir.path().join("operations.jsonl"));
123
+ assert_eq!(node.next_origin_sequence(), 1, "a brand-new origin legitimately starts at 1");
124
+ assert_eq!(commit(&mut node, "A", "first").envelope_id.sequence, 1);
125
+ }
126
+
127
+ #[test]
128
+ fn identity_restart_after_three_operations_continues_at_four() {
129
+ let dir = tempfile::tempdir().unwrap();
130
+ let path = dir.path().join("operations.jsonl");
131
+ {
132
+ let mut node = open("A", &path);
133
+ for payload in ["one", "two", "three"] {
134
+ commit(&mut node, "A", payload);
135
+ }
136
+ assert_eq!(node.next_origin_sequence(), 4);
137
+ }
138
+ let restarted = open("A", &path);
139
+ assert_eq!(
140
+ restarted.next_origin_sequence(),
141
+ 4,
142
+ "identity is recovered from the durable log, not reset"
143
+ );
144
+ }
145
+
146
+ #[test]
147
+ fn identity_is_recovered_even_without_replaying_the_log() {
148
+ // `with_log` recovers identity too, so a caller that opens an existing
149
+ // log and issues an operation without calling load_from_disk still
150
+ // cannot re-issue an identity that log contains.
151
+ let dir = tempfile::tempdir().unwrap();
152
+ let path = dir.path().join("operations.jsonl");
153
+ {
154
+ let mut node = open("A", &path);
155
+ commit(&mut node, "A", "one");
156
+ commit(&mut node, "A", "two");
157
+ }
158
+ let reopened = DistributedTransactionExecutor::with_log(
159
+ "A".to_string(),
160
+ StateHash::from_hex("0".repeat(64)),
161
+ Some(path),
162
+ )
163
+ .expect("executor");
164
+ assert_eq!(reopened.next_origin_sequence(), 3);
165
+ }
166
+
167
+ #[test]
168
+ fn identity_spaces_are_independent_per_origin() {
169
+ // A receiver that has applied another node's high sequences must not
170
+ // inflate its own identity space: the log holds replicated envelopes
171
+ // too, and another node's sequence says nothing about this one's.
172
+ let dir = tempfile::tempdir().unwrap();
173
+ let path = dir.path().join("operations.jsonl");
174
+ let mut receiver = open("receiver", &path);
175
+
176
+ for position in 1..=9u64 {
177
+ let mut envelope = TransactionEnvelope::new(
178
+ "A".to_string(),
179
+ position,
180
+ format!("tx_a{position}"),
181
+ vec![operation_at("A", position, &format!("a{position}"))],
182
+ ConsistencyContract::local(),
183
+ );
184
+ let mut clock = VectorClock::new();
185
+ clock.clocks.insert("A".to_string(), position);
186
+ envelope.vector_clock = clock;
187
+ receiver.receive_replicated(message(envelope), zero_version()).expect("receive");
188
+ }
189
+
190
+ assert_eq!(
191
+ receiver.next_origin_sequence(),
192
+ 1,
193
+ "nine applied envelopes from A leave this node's own identity space untouched"
194
+ );
195
+ assert_eq!(commit(&mut receiver, "receiver", "mine").envelope_id.sequence, 1);
196
+
197
+ let restarted = open("receiver", &path);
198
+ assert_eq!(restarted.next_origin_sequence(), 2, "and recovery filters by origin too");
199
+ }
200
+
201
+ // -- crash boundaries --------------------------------------------------
202
+
203
+ #[test]
204
+ fn identity_survives_a_crash_after_the_operation_became_durable() {
205
+ let dir = tempfile::tempdir().unwrap();
206
+ let path = dir.path().join("operations.jsonl");
207
+ {
208
+ let mut node = open("A", &path);
209
+ commit(&mut node, "A", "durable");
210
+ // The process dies here: no clean shutdown, no flush of any
211
+ // in-memory counter. The envelope is already fsynced.
212
+ }
213
+ let restarted = open("A", &path);
214
+ assert_eq!(
215
+ restarted.next_origin_sequence(),
216
+ 2,
217
+ "the identity of a durable operation is never re-issued"
218
+ );
219
+ }
220
+
221
+ #[test]
222
+ fn identity_burned_without_persistence_is_safely_reissued_after_a_crash() {
223
+ // allocate -> crash before persistence -> restart.
224
+ //
225
+ // The number is re-issued, and that is correct rather than a lapse: no
226
+ // envelope bearing it was ever written, so nothing can collide with it.
227
+ // Reserving it forever would leak identity on every refused
228
+ // transaction and would make the durable sequence advance past
229
+ // operations that never existed.
230
+ let dir = tempfile::tempdir().unwrap();
231
+ let path = dir.path().join("operations.jsonl");
232
+ {
233
+ let mut node = open("A", &path);
234
+ commit(&mut node, "A", "one");
235
+ let burned = node.allocate_origin_sequence();
236
+ assert_eq!(burned, 2, "claimed but never persisted");
237
+ }
238
+ let mut restarted = open("A", &path);
239
+ assert_eq!(
240
+ restarted.next_origin_sequence(),
241
+ 2,
242
+ "the log holds only sequence 1, so 2 is free and is re-issued"
243
+ );
244
+ assert_eq!(commit(&mut restarted, "A", "two").envelope_id.sequence, 2);
245
+ }
246
+
247
+ #[test]
248
+ fn identity_allocation_stays_sparse_because_the_frozen_contract_says_so() {
249
+ // A burned number leaves a gap within a single process lifetime.
250
+ // Making the sequence dense is a separate deferred decision
251
+ // (replication-convergence.md) and is deliberately not made here.
252
+ let dir = tempfile::tempdir().unwrap();
253
+ let mut node = open("A", &dir.path().join("operations.jsonl"));
254
+ commit(&mut node, "A", "one");
255
+ let _burned = node.allocate_origin_sequence();
256
+ assert_eq!(
257
+ commit(&mut node, "A", "three").envelope_id.sequence,
258
+ 3,
259
+ "the attempt burned 2; the sequence is sparse, as the contract fixes it"
260
+ );
261
+ }
262
+
263
+ #[test]
264
+ fn identity_is_not_burned_by_a_capacity_refusal() {
265
+ // A refusal admits nothing, so it must not consume an identity either:
266
+ // there is no operation for that number to account for.
267
+ use crate::distributed_transactions::CausalCapacity;
268
+ let dir = tempfile::tempdir().unwrap();
269
+ let mut node = open("A", &dir.path().join("operations.jsonl"));
270
+ node.set_causal_capacity(CausalCapacity::new(0, usize::MAX));
271
+
272
+ let before = node.next_origin_sequence();
273
+ let outcome = node
274
+ .submit_local_transaction(
275
+ "tx_refused".to_string(),
276
+ zero_version(),
277
+ vec![operation_at("A", 1, "refused")],
278
+ ConsistencyContract::local(),
279
+ )
280
+ .expect("submit");
281
+ assert!(matches!(outcome, SubmitOutcome::CapacityExceeded { .. }));
282
+ assert_eq!(node.next_origin_sequence(), before, "a refusal consumes no identity");
283
+ }
284
+
285
+ #[test]
286
+ fn identity_holds_across_many_restart_cycles() {
287
+ let dir = tempfile::tempdir().unwrap();
288
+ let path = dir.path().join("operations.jsonl");
289
+ let mut issued = Vec::new();
290
+ for cycle in 0..25 {
291
+ let mut node = open("A", &path);
292
+ for index in 0..4 {
293
+ issued.push(commit(&mut node, "A", &format!("c{cycle}_{index}")).envelope_id.sequence);
294
+ }
295
+ }
296
+ let mut unique = issued.clone();
297
+ unique.sort_unstable();
298
+ unique.dedup();
299
+ assert_eq!(
300
+ unique.len(),
301
+ issued.len(),
302
+ "100 operations across 25 restart cycles produced no repeated identity"
303
+ );
304
+ assert_eq!(issued.len(), 100);
305
+ }
306
+
307
+ // -- the regression, at executor level ---------------------------------
308
+
309
+ #[test]
310
+ fn identity_a_receiver_accepts_writes_from_an_origin_that_restarted() {
311
+ // The exact failure #210 found, now at the executor boundary.
312
+ let origin_dir = tempfile::tempdir().unwrap();
313
+ let origin_path = origin_dir.path().join("operations.jsonl");
314
+ let receiver_dir = tempfile::tempdir().unwrap();
315
+ let mut receiver = open("receiver", &receiver_dir.path().join("operations.jsonl"));
316
+
317
+ let before = {
318
+ let mut origin = open("A", &origin_path);
319
+ commit(&mut origin, "A", "before")
320
+ };
321
+ assert!(matches!(
322
+ receiver.receive_replicated(message(before), zero_version()).expect("receive"),
323
+ ReceiveOutcome::Applied { .. }
324
+ ));
325
+
326
+ // The origin restarts and commits again.
327
+ let after = {
328
+ let mut origin = open("A", &origin_path);
329
+ commit(&mut origin, "A", "after")
330
+ };
331
+ assert_eq!(after.envelope_id.sequence, 2, "the identity did not restart");
332
+
333
+ let outcome = receiver.receive_replicated(message(after), zero_version()).expect("receive");
334
+ assert!(
335
+ matches!(outcome, ReceiveOutcome::Applied { .. }),
336
+ "a write from a restarted origin must be applied, not discarded: {outcome:?}"
337
+ );
338
+ assert_eq!(receiver.causal_frontier().get("A"), 2, "and the frontier advances");
339
+
340
+ let state = receiver.canonical_state().expect("state");
341
+ assert!(state.records.contains_key(&("items".to_string(), "after".to_string())));
342
+ assert!(state.records.contains_key(&("items".to_string(), "before".to_string())));
343
+ }
344
+
345
+ #[test]
346
+ fn identity_a_genuine_retransmission_is_still_refused() {
347
+ // The fix must not weaken deduplication: the same envelope twice is
348
+ // still one operation, and a *new* operation after it is still new.
349
+ let origin_dir = tempfile::tempdir().unwrap();
350
+ let receiver_dir = tempfile::tempdir().unwrap();
351
+ let mut origin = open("A", &origin_dir.path().join("operations.jsonl"));
352
+ let mut receiver = open("receiver", &receiver_dir.path().join("operations.jsonl"));
353
+
354
+ let first = commit(&mut origin, "A", "one");
355
+ receiver.receive_replicated(message(first.clone()), zero_version()).expect("receive");
356
+ assert_eq!(
357
+ receiver.receive_replicated(message(first), zero_version()).expect("receive"),
358
+ ReceiveOutcome::AlreadyKnown,
359
+ "a retransmission is refused"
360
+ );
361
+
362
+ let second = commit(&mut origin, "A", "two");
363
+ assert!(
364
+ matches!(
365
+ receiver.receive_replicated(message(second), zero_version()).expect("receive"),
366
+ ReceiveOutcome::Applied { .. }
367
+ ),
368
+ "and a new operation after a duplicate is still accepted"
369
+ );
370
+ assert_eq!(receiver.causal_frontier().get("A"), 2);
371
+ }
372
+
373
+ #[test]
374
+ fn identity_no_collision_when_the_origin_restarts_while_the_receiver_holds_a_backlog() {
375
+ // The two mechanisms have to compose: the receiver is holding causal
376
+ // backlog from this origin when the origin restarts, so a colliding
377
+ // identity would land on a pending entry rather than an applied one.
378
+ let origin_dir = tempfile::tempdir().unwrap();
379
+ let origin_path = origin_dir.path().join("operations.jsonl");
380
+ let receiver_dir = tempfile::tempdir().unwrap();
381
+ let mut receiver = open("receiver", &receiver_dir.path().join("operations.jsonl"));
382
+
383
+ let (first, second) = {
384
+ let mut origin = open("A", &origin_path);
385
+ (commit(&mut origin, "A", "one"), commit(&mut origin, "A", "two"))
386
+ };
387
+
388
+ // Only the second is delivered, so it is held waiting for the first.
389
+ assert!(matches!(
390
+ receiver.receive_replicated(message(second), zero_version()).expect("receive"),
391
+ ReceiveOutcome::PendingDependencies { .. }
392
+ ));
393
+ assert_eq!(receiver.pending_causal_count(), 1);
394
+
395
+ // The origin restarts, with the receiver still holding that backlog.
396
+ let third = {
397
+ let mut origin = open("A", &origin_path);
398
+ commit(&mut origin, "A", "three")
399
+ };
400
+ assert_eq!(third.envelope_id.sequence, 3, "no collision with the held entry");
401
+
402
+ let held = receiver.receive_replicated(message(third), zero_version()).expect("receive");
403
+ assert!(
404
+ matches!(held, ReceiveOutcome::PendingDependencies { .. }),
405
+ "it is held on its own merits, not mistaken for the entry already pending: {held:?}"
406
+ );
407
+ assert_eq!(receiver.pending_causal_count(), 2);
408
+
409
+ // The gap closes and everything applies exactly once.
410
+ receiver.receive_replicated(message(first), zero_version()).expect("receive");
411
+ assert_eq!(receiver.pending_causal_count(), 0);
412
+ assert_eq!(receiver.causal_frontier().get("A"), 3);
413
+ let state = receiver.canonical_state().expect("state");
414
+ for record in ["one", "two", "three"] {
415
+ assert!(state.records.contains_key(&("items".to_string(), record.to_string())));
416
+ }
417
+ }
418
+ }