Integrate BACKBEAT SDK and resolve KACHING license validation

Major integrations and fixes:
- Added BACKBEAT SDK integration for P2P operation timing
- Implemented beat-aware status tracking for distributed operations
- Added Docker secrets support for secure license management
- Resolved KACHING license validation via HTTPS/TLS
- Updated docker-compose configuration for clean stack deployment
- Disabled rollback policies to prevent deployment failures
- Added license credential storage (CHORUS-DEV-MULTI-001)

Technical improvements:
- BACKBEAT P2P operation tracking with phase management
- Enhanced configuration system with file-based secrets
- Improved error handling for license validation
- Clean separation of KACHING and CHORUS deployment stacks

🤖 Generated with [Claude Code](https://claude.ai/code)

Co-Authored-By: Claude <noreply@anthropic.com>

vendor/github.com/libp2p/go-libp2p-pubsub/timecache/first_seen_cache.go

@@ -0,0 +1,56 @@
+package timecache
+
+import (
+	"context"
+	"sync"
+	"time"
+)
+
+// FirstSeenCache is a time cache that only marks the expiry of a message when first added.
+type FirstSeenCache struct {
+	lk  sync.RWMutex
+	m   map[string]time.Time
+	ttl time.Duration
+
+	done func()
+}
+
+var _ TimeCache = (*FirstSeenCache)(nil)
+
+func newFirstSeenCache(ttl time.Duration) *FirstSeenCache {
+	tc := &FirstSeenCache{
+		m:   make(map[string]time.Time),
+		ttl: ttl,
+	}
+
+	ctx, done := context.WithCancel(context.Background())
+	tc.done = done
+	go background(ctx, &tc.lk, tc.m)
+
+	return tc
+}
+
+func (tc *FirstSeenCache) Done() {
+	tc.done()
+}
+
+func (tc *FirstSeenCache) Has(s string) bool {
+	tc.lk.RLock()
+	defer tc.lk.RUnlock()
+
+	_, ok := tc.m[s]
+	return ok
+}
+
+func (tc *FirstSeenCache) Add(s string) bool {
+	tc.lk.Lock()
+	defer tc.lk.Unlock()
+
+	_, ok := tc.m[s]
+	if ok {
+		return false
+	}
+
+	tc.m[s] = time.Now().Add(tc.ttl)
+	return true
+}

vendor/github.com/libp2p/go-libp2p-pubsub/timecache/last_seen_cache.go

@@ -0,0 +1,58 @@
+package timecache
+
+import (
+	"context"
+	"sync"
+	"time"
+)
+
+// LastSeenCache is a time cache that extends the expiry of a seen message when added
+// or checked for presence with Has..
+type LastSeenCache struct {
+	lk  sync.Mutex
+	m   map[string]time.Time
+	ttl time.Duration
+
+	done func()
+}
+
+var _ TimeCache = (*LastSeenCache)(nil)
+
+func newLastSeenCache(ttl time.Duration) *LastSeenCache {
+	tc := &LastSeenCache{
+		m:   make(map[string]time.Time),
+		ttl: ttl,
+	}
+
+	ctx, done := context.WithCancel(context.Background())
+	tc.done = done
+	go background(ctx, &tc.lk, tc.m)
+
+	return tc
+}
+
+func (tc *LastSeenCache) Done() {
+	tc.done()
+}
+
+func (tc *LastSeenCache) Add(s string) bool {
+	tc.lk.Lock()
+	defer tc.lk.Unlock()
+
+	_, ok := tc.m[s]
+	tc.m[s] = time.Now().Add(tc.ttl)
+
+	return !ok
+}
+
+func (tc *LastSeenCache) Has(s string) bool {
+	tc.lk.Lock()
+	defer tc.lk.Unlock()
+
+	_, ok := tc.m[s]
+	if ok {
+		tc.m[s] = time.Now().Add(tc.ttl)
+	}
+
+	return ok
+}

vendor/github.com/libp2p/go-libp2p-pubsub/timecache/time_cache.go

@@ -0,0 +1,52 @@
+package timecache
+
+import (
+	"time"
+
+	logger "github.com/ipfs/go-log/v2"
+)
+
+var log = logger.Logger("pubsub/timecache")
+
+// Stategy is the TimeCache expiration strategy to use.
+type Strategy uint8
+
+const (
+	// Strategy_FirstSeen expires an entry from the time it was added.
+	Strategy_FirstSeen Strategy = iota
+	// Stategy_LastSeen expires an entry from the last time it was touched by an Add or Has.
+	Strategy_LastSeen
+)
+
+// TimeCache is a cahe of recently seen messages (by id).
+type TimeCache interface {
+	// Add adds an id into the cache, if it is not already there.
+	// Returns true if the id was newly added to the cache.
+	// Depending on the implementation strategy, it may or may not update the expiry of
+	// an existing entry.
+	Add(string) bool
+	// Has checks the cache for the presence of an id.
+	// Depending on the implementation strategy, it may or may not update the expiry of
+	// an existing entry.
+	Has(string) bool
+	// Done signals that the user is done with this cache, which it may stop background threads
+	// and relinquish resources.
+	Done()
+}
+
+// NewTimeCache defaults to the original ("first seen") cache implementation
+func NewTimeCache(ttl time.Duration) TimeCache {
+	return NewTimeCacheWithStrategy(Strategy_FirstSeen, ttl)
+}
+
+func NewTimeCacheWithStrategy(strategy Strategy, ttl time.Duration) TimeCache {
+	switch strategy {
+	case Strategy_FirstSeen:
+		return newFirstSeenCache(ttl)
+	case Strategy_LastSeen:
+		return newLastSeenCache(ttl)
+	default:
+		// Default to the original time cache implementation
+		return newFirstSeenCache(ttl)
+	}
+}

vendor/github.com/libp2p/go-libp2p-pubsub/timecache/util.go

@@ -0,0 +1,35 @@
+package timecache
+
+import (
+	"context"
+	"sync"
+	"time"
+)
+
+var backgroundSweepInterval = time.Minute
+
+func background(ctx context.Context, lk sync.Locker, m map[string]time.Time) {
+	ticker := time.NewTicker(backgroundSweepInterval)
+	defer ticker.Stop()
+
+	for {
+		select {
+		case now := <-ticker.C:
+			sweep(lk, m, now)
+
+		case <-ctx.Done():
+			return
+		}
+	}
+}
+
+func sweep(lk sync.Locker, m map[string]time.Time, now time.Time) {
+	lk.Lock()
+	defer lk.Unlock()
+
+	for k, expiry := range m {
+		if expiry.Before(now) {
+			delete(m, k)
+		}
+	}
+}