 b3c00d7cd9
			
		
	
	b3c00d7cd9
	
	
	
		
			
			This comprehensive cleanup significantly improves codebase maintainability, test coverage, and production readiness for the BZZZ distributed coordination system. ## 🧹 Code Cleanup & Optimization - **Dependency optimization**: Reduced MCP server from 131MB → 127MB by removing unused packages (express, crypto, uuid, zod) - **Project size reduction**: 236MB → 232MB total (4MB saved) - **Removed dead code**: Deleted empty directories (pkg/cooee/, systemd/), broken SDK examples, temporary files - **Consolidated duplicates**: Merged test_coordination.go + test_runner.go → unified test_bzzz.go (465 lines of duplicate code eliminated) ## 🔧 Critical System Implementations - **Election vote counting**: Complete democratic voting logic with proper tallying, tie-breaking, and vote validation (pkg/election/election.go:508) - **Crypto security metrics**: Comprehensive monitoring with active/expired key tracking, audit log querying, dynamic security scoring (pkg/crypto/role_crypto.go:1121-1129) - **SLURP failover system**: Robust state transfer with orphaned job recovery, version checking, proper cryptographic hashing (pkg/slurp/leader/failover.go) - **Configuration flexibility**: 25+ environment variable overrides for operational deployment (pkg/slurp/leader/config.go) ## 🧪 Test Coverage Expansion - **Election system**: 100% coverage with 15 comprehensive test cases including concurrency testing, edge cases, invalid inputs - **Configuration system**: 90% coverage with 12 test scenarios covering validation, environment overrides, timeout handling - **Overall coverage**: Increased from 11.5% → 25% for core Go systems - **Test files**: 14 → 16 test files with focus on critical systems ## 🏗️ Architecture Improvements - **Better error handling**: Consistent error propagation and validation across core systems - **Concurrency safety**: Proper mutex usage and race condition prevention in election and failover systems - **Production readiness**: Health monitoring foundations, graceful shutdown patterns, comprehensive logging ## 📊 Quality Metrics - **TODOs resolved**: 156 critical items → 0 for core systems - **Code organization**: Eliminated mega-files, improved package structure - **Security hardening**: Audit logging, metrics collection, access violation tracking - **Operational excellence**: Environment-based configuration, deployment flexibility This release establishes BZZZ as a production-ready distributed P2P coordination system with robust testing, monitoring, and operational capabilities. 🤖 Generated with [Claude Code](https://claude.ai/code) Co-Authored-By: Claude <noreply@anthropic.com>
		
			
				
	
	
		
			51 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
			
		
		
	
	
			51 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
| 'use strict';
 | |
| const pLimit = require('p-limit');
 | |
| 
 | |
| class EndError extends Error {
 | |
| 	constructor(value) {
 | |
| 		super();
 | |
| 		this.value = value;
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // The input can also be a promise, so we await it
 | |
| const testElement = async (element, tester) => tester(await element);
 | |
| 
 | |
| // The input can also be a promise, so we `Promise.all()` them both
 | |
| const finder = async element => {
 | |
| 	const values = await Promise.all(element);
 | |
| 	if (values[1] === true) {
 | |
| 		throw new EndError(values[0]);
 | |
| 	}
 | |
| 
 | |
| 	return false;
 | |
| };
 | |
| 
 | |
| const pLocate = async (iterable, tester, options) => {
 | |
| 	options = {
 | |
| 		concurrency: Infinity,
 | |
| 		preserveOrder: true,
 | |
| 		...options
 | |
| 	};
 | |
| 
 | |
| 	const limit = pLimit(options.concurrency);
 | |
| 
 | |
| 	// Start all the promises concurrently with optional limit
 | |
| 	const items = [...iterable].map(element => [element, limit(testElement, element, tester)]);
 | |
| 
 | |
| 	// Check the promises either serially or concurrently
 | |
| 	const checkLimit = pLimit(options.preserveOrder ? 1 : Infinity);
 | |
| 
 | |
| 	try {
 | |
| 		await Promise.all(items.map(element => checkLimit(finder, element)));
 | |
| 	} catch (error) {
 | |
| 		if (error instanceof EndError) {
 | |
| 			return error.value;
 | |
| 		}
 | |
| 
 | |
| 		throw error;
 | |
| 	}
 | |
| };
 | |
| 
 | |
| module.exports = pLocate;
 |