diff --git a/src/ScadaLink.AuditLog/Site/RingBufferFallback.cs b/src/ScadaLink.AuditLog/Site/RingBufferFallback.cs
new file mode 100644
index 0000000..932ae7e
--- /dev/null
+++ b/src/ScadaLink.AuditLog/Site/RingBufferFallback.cs
@@ -0,0 +1,108 @@
+using System.Runtime.CompilerServices;
+using System.Threading.Channels;
+using ScadaLink.Commons.Entities.Audit;
+
+namespace ScadaLink.AuditLog.Site;
+
+/// <summary>
+/// Drop-oldest in-memory ring buffer used by <see cref="FallbackAuditWriter"/>
+/// when the primary SQLite writer is throwing. Capacity is fixed at construction
+/// (default 1024). When full, the oldest event is silently dropped to make room
+/// for the newest — preserving the most recent picture of activity in the face
+/// of an extended SQLite outage — and <see cref="RingBufferOverflowed"/> is
+/// raised so a health counter can record the loss.
+/// </summary>
+/// <remarks>
+/// <para>
+/// Backed by a <see cref="Channel{T}"/> with
+/// <see cref="BoundedChannelFullMode.DropOldest"/>. The channel doesn't natively
+/// notify on drop, so this class compares <c>Reader.Count</c> before and after
+/// each enqueue: any time we hit capacity and a subsequent enqueue keeps the
+/// count at capacity, exactly one event has been dropped.
+/// </para>
+/// <para>
+/// Per the M2 plan: the ring is the absolute-last-resort buffer for the
+/// hot-path; it is NOT a substitute for the bounded
+/// <see cref="SqliteAuditWriter"/> write queue.
+/// </para>
+/// </remarks>
+public sealed class RingBufferFallback
+{
+    private readonly Channel<AuditEvent> _channel;
+    private readonly int _capacity;
+
+    /// <summary>
+    /// Raised once each time a drop-oldest overflow occurs. Hooked by
+    /// <see cref="FallbackAuditWriter"/>'s health counter wiring.
+    /// </summary>
+    public event Action? RingBufferOverflowed;
+
+    public RingBufferFallback(int capacity = 1024)
+    {
+        if (capacity <= 0)
+        {
+            throw new ArgumentOutOfRangeException(nameof(capacity), "capacity must be > 0.");
+        }
+
+        _capacity = capacity;
+        _channel = Channel.CreateBounded<AuditEvent>(new BoundedChannelOptions(capacity)
+        {
+            FullMode = BoundedChannelFullMode.DropOldest,
+            SingleReader = true,
+            SingleWriter = false,
+        });
+    }
+
+    /// <summary>Current event count in the ring (for diagnostics/tests).</summary>
+    public int Count => _channel.Reader.Count;
+
+    /// <summary>
+    /// Try to enqueue an event. Returns <see langword="true"/> on success (even
+    /// when an overflow caused an older event to be dropped); returns
+    /// <see langword="false"/> only when the ring has been
+    /// <see cref="Complete"/>-d.
+    /// </summary>
+    public bool TryEnqueue(AuditEvent evt)
+    {
+        ArgumentNullException.ThrowIfNull(evt);
+
+        // DropOldest TryWrite always succeeds unless the channel is completed.
+        // Detect overflow by comparing the count before vs. after: if we were
+        // already at capacity and remain at capacity, exactly one event was
+        // dropped to make room for evt.
+        var beforeCount = _channel.Reader.Count;
+        if (!_channel.Writer.TryWrite(evt))
+        {
+            return false;
+        }
+
+        if (beforeCount >= _capacity)
+        {
+            // The new event displaced an existing one.
+            RingBufferOverflowed?.Invoke();
+        }
+
+        return true;
+    }
+
+    /// <summary>
+    /// Drain the ring in FIFO order. Yields available events immediately and
+    /// then completes when the channel is empty AND <see cref="Complete"/> has
+    /// been called. Callers that only want to drain what's currently buffered
+    /// must call <see cref="Complete"/> first.
+    /// </summary>
+    public async IAsyncEnumerable<AuditEvent> DrainAsync(
+        [EnumeratorCancellation] CancellationToken cancellationToken)
+    {
+        await foreach (var evt in _channel.Reader.ReadAllAsync(cancellationToken).ConfigureAwait(false))
+        {
+            yield return evt;
+        }
+    }
+
+    /// <summary>
+    /// Mark the ring as no-more-writes. <see cref="DrainAsync"/> will yield the
+    /// remaining events and then complete.
+    /// </summary>
+    public void Complete() => _channel.Writer.TryComplete();
+}
diff --git a/tests/ScadaLink.AuditLog.Tests/Site/RingBufferFallbackTests.cs b/tests/ScadaLink.AuditLog.Tests/Site/RingBufferFallbackTests.cs
new file mode 100644
index 0000000..8f92802
--- /dev/null
+++ b/tests/ScadaLink.AuditLog.Tests/Site/RingBufferFallbackTests.cs
@@ -0,0 +1,91 @@
+using ScadaLink.AuditLog.Site;
+using ScadaLink.Commons.Entities.Audit;
+using ScadaLink.Commons.Types.Enums;
+
+namespace ScadaLink.AuditLog.Tests.Site;
+
+/// <summary>
+/// Bundle B (M2-T3) tests for <see cref="RingBufferFallback"/> — the
+/// drop-oldest fallback used by <see cref="FallbackAuditWriter"/> when the
+/// primary SQLite writer is throwing.
+/// </summary>
+public class RingBufferFallbackTests
+{
+    private static AuditEvent NewEvent(string? target = null)
+    {
+        return new AuditEvent
+        {
+            EventId = Guid.NewGuid(),
+            OccurredAtUtc = DateTime.UtcNow,
+            Channel = AuditChannel.ApiOutbound,
+            Kind = AuditKind.ApiCall,
+            Status = AuditStatus.Delivered,
+            Target = target,
+            PayloadTruncated = false,
+            ForwardState = AuditForwardState.Pending,
+        };
+    }
+
+    [Fact]
+    public async Task Enqueue_1025_Into_1024Cap_Ring_DropsOldest_AndRaisesOverflowOnce()
+    {
+        var ring = new RingBufferFallback(capacity: 1024);
+        var overflowCount = 0;
+        ring.RingBufferOverflowed += () => Interlocked.Increment(ref overflowCount);
+
+        var events = Enumerable.Range(0, 1025).Select(i => NewEvent(target: i.ToString())).ToList();
+        foreach (var e in events)
+        {
+            Assert.True(ring.TryEnqueue(e));
+        }
+
+        Assert.Equal(1, overflowCount);
+
+        // The surviving 1024 are events[1..1024] (oldest dropped).
+        var drained = new List<AuditEvent>();
+        ring.Complete();
+        await foreach (var e in ring.DrainAsync(CancellationToken.None))
+        {
+            drained.Add(e);
+        }
+
+        Assert.Equal(1024, drained.Count);
+        Assert.Equal("1", drained[0].Target);
+        Assert.Equal("1024", drained[^1].Target);
+    }
+
+    [Fact]
+    public async Task DrainAsync_Yields_FIFO_Then_Completes_When_Empty()
+    {
+        var ring = new RingBufferFallback(capacity: 16);
+        var enqueued = Enumerable.Range(0, 5).Select(i => NewEvent(target: i.ToString())).ToList();
+        foreach (var e in enqueued)
+        {
+            Assert.True(ring.TryEnqueue(e));
+        }
+
+        ring.Complete();
+
+        var drained = new List<AuditEvent>();
+        await foreach (var e in ring.DrainAsync(CancellationToken.None))
+        {
+            drained.Add(e);
+        }
+
+        Assert.Equal(5, drained.Count);
+        for (int i = 0; i < 5; i++)
+        {
+            Assert.Equal(i.ToString(), drained[i].Target);
+        }
+    }
+
+    [Fact]
+    public void TryEnqueue_AllSucceeds_ReturnsTrue()
+    {
+        var ring = new RingBufferFallback(capacity: 16);
+        for (int i = 0; i < 8; i++)
+        {
+            Assert.True(ring.TryEnqueue(NewEvent()));
+        }
+    }
+}