 131868bdca
			
		
	
	131868bdca
	
	
	
		
			
			Major security, observability, and configuration improvements:
## Security Hardening
- Implemented configurable CORS (no more wildcards)
- Added comprehensive auth middleware for admin endpoints
- Enhanced webhook HMAC validation
- Added input validation and rate limiting
- Security headers and CSP policies
## Configuration Management
- Made N8N webhook URL configurable (WHOOSH_N8N_BASE_URL)
- Replaced all hardcoded endpoints with environment variables
- Added feature flags for LLM vs heuristic composition
- Gitea fetch hardening with EAGER_FILTER and FULL_RESCAN options
## API Completeness
- Implemented GetCouncilComposition function
- Added GET /api/v1/councils/{id} endpoint
- Council artifacts API (POST/GET /api/v1/councils/{id}/artifacts)
- /admin/health/details endpoint with component status
- Database lookup for repository URLs (no hardcoded fallbacks)
## Observability & Performance
- Added OpenTelemetry distributed tracing with goal/pulse correlation
- Performance optimization database indexes
- Comprehensive health monitoring
- Enhanced logging and error handling
## Infrastructure
- Production-ready P2P discovery (replaces mock implementation)
- Removed unused Redis configuration
- Enhanced Docker Swarm integration
- Added migration files for performance indexes
## Code Quality
- Comprehensive input validation
- Graceful error handling and failsafe fallbacks
- Backwards compatibility maintained
- Following security best practices
🤖 Generated with [Claude Code](https://claude.ai/code)
Co-Authored-By: Claude <noreply@anthropic.com>
		
	
		
			
				
	
	
		
			34 lines
		
	
	
		
			676 B
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			34 lines
		
	
	
		
			676 B
		
	
	
	
		
			Go
		
	
	
	
	
	
| //go:build !amd64 || appengine || !gc || noasm
 | |
| // +build !amd64 appengine !gc noasm
 | |
| 
 | |
| // Copyright 2019+ Klaus Post. All rights reserved.
 | |
| // License information can be found in the LICENSE file.
 | |
| 
 | |
| package flate
 | |
| 
 | |
| import (
 | |
| 	"encoding/binary"
 | |
| 	"math/bits"
 | |
| )
 | |
| 
 | |
| // matchLen returns the maximum common prefix length of a and b.
 | |
| // a must be the shortest of the two.
 | |
| func matchLen(a, b []byte) (n int) {
 | |
| 	for ; len(a) >= 8 && len(b) >= 8; a, b = a[8:], b[8:] {
 | |
| 		diff := binary.LittleEndian.Uint64(a) ^ binary.LittleEndian.Uint64(b)
 | |
| 		if diff != 0 {
 | |
| 			return n + bits.TrailingZeros64(diff)>>3
 | |
| 		}
 | |
| 		n += 8
 | |
| 	}
 | |
| 
 | |
| 	for i := range a {
 | |
| 		if a[i] != b[i] {
 | |
| 			break
 | |
| 		}
 | |
| 		n++
 | |
| 	}
 | |
| 	return n
 | |
| 
 | |
| }
 |