Compare commits
1 Commits
mimo/code/
...
burn/20260
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
b5ed262581 |
@@ -1,18 +1,13 @@
|
||||
|
||||
class MemoryOptimizer {
|
||||
constructor(options = {}) {
|
||||
this.threshold = options.threshold || 0.3;
|
||||
this.decayRate = options.decayRate || 0.01;
|
||||
this.lastRun = Date.now();
|
||||
this.threshold = options.threshold || 0.8;
|
||||
this.decayRate = options.decayRate || 0.05;
|
||||
}
|
||||
optimize(memories) {
|
||||
const now = Date.now();
|
||||
const elapsed = (now - this.lastRun) / 1000;
|
||||
this.lastRun = now;
|
||||
return memories.map(m => {
|
||||
const decay = (m.importance || 1) * this.decayRate * elapsed;
|
||||
return { ...m, strength: Math.max(0, (m.strength || 1) - decay) };
|
||||
}).filter(m => m.strength > this.threshold || m.locked);
|
||||
optimize(memory) {
|
||||
console.log('Optimizing memory...');
|
||||
// Heuristic-based pruning
|
||||
return memory.filter(m => m.strength > this.threshold);
|
||||
}
|
||||
}
|
||||
export default MemoryOptimizer;
|
||||
|
||||
@@ -173,9 +173,7 @@ const SpatialMemory = (() => {
|
||||
let _entityLines = []; // entity resolution lines (issue #1167)
|
||||
let _camera = null; // set by setCamera() for LOD culling
|
||||
const ENTITY_LOD_DIST = 50; // hide entity lines when camera > this from midpoint
|
||||
const CONNECTION_LOD_DIST = 60; // hide connection lines when camera > this from midpoint
|
||||
let _initialized = false;
|
||||
let _constellationVisible = true; // toggle for constellation view
|
||||
|
||||
// ─── CRYSTAL GEOMETRY (persistent memories) ───────────
|
||||
function createCrystalGeometry(size) {
|
||||
@@ -320,43 +318,10 @@ const SpatialMemory = (() => {
|
||||
if (!obj || !obj.data.connections) return;
|
||||
obj.data.connections.forEach(targetId => {
|
||||
const target = _memoryObjects[targetId];
|
||||
if (target) _drawSingleConnection(obj, target);
|
||||
if (target) _createConnectionLine(obj, target);
|
||||
});
|
||||
}
|
||||
|
||||
function _drawSingleConnection(src, tgt) {
|
||||
const srcId = src.data.id;
|
||||
const tgtId = tgt.data.id;
|
||||
// Deduplicate — only draw from lower ID to higher
|
||||
if (srcId > tgtId) return;
|
||||
// Skip if already exists
|
||||
const exists = _connectionLines.some(l =>
|
||||
(l.userData.from === srcId && l.userData.to === tgtId) ||
|
||||
(l.userData.from === tgtId && l.userData.to === srcId)
|
||||
);
|
||||
if (exists) return;
|
||||
|
||||
const points = [src.mesh.position.clone(), tgt.mesh.position.clone()];
|
||||
const geo = new THREE.BufferGeometry().setFromPoints(points);
|
||||
const srcStrength = src.mesh.userData.strength || 0.7;
|
||||
const tgtStrength = tgt.mesh.userData.strength || 0.7;
|
||||
const blendedStrength = (srcStrength + tgtStrength) / 2;
|
||||
const lineOpacity = 0.15 + blendedStrength * 0.55;
|
||||
const srcColor = new THREE.Color(REGIONS[src.region]?.color || 0x334455);
|
||||
const tgtColor = new THREE.Color(REGIONS[tgt.region]?.color || 0x334455);
|
||||
const lineColor = new THREE.Color().lerpColors(srcColor, tgtColor, 0.5);
|
||||
const mat = new THREE.LineBasicMaterial({
|
||||
color: lineColor,
|
||||
transparent: true,
|
||||
opacity: lineOpacity
|
||||
});
|
||||
const line = new THREE.Line(geo, mat);
|
||||
line.userData = { type: 'connection', from: srcId, to: tgtId, baseOpacity: lineOpacity };
|
||||
line.visible = _constellationVisible;
|
||||
_scene.add(line);
|
||||
_connectionLines.push(line);
|
||||
}
|
||||
|
||||
return { ring, disc, glowDisc, sprite };
|
||||
}
|
||||
|
||||
@@ -434,7 +399,7 @@ const SpatialMemory = (() => {
|
||||
return [cx + Math.cos(angle) * dist, cy + height, cz + Math.sin(angle) * dist];
|
||||
}
|
||||
|
||||
// ─── CONNECTIONS (constellation-aware) ───────────────
|
||||
// ─── CONNECTIONS ─────────────────────────────────────
|
||||
function _drawConnections(memId, connections) {
|
||||
const src = _memoryObjects[memId];
|
||||
if (!src) return;
|
||||
@@ -445,23 +410,9 @@ const SpatialMemory = (() => {
|
||||
|
||||
const points = [src.mesh.position.clone(), tgt.mesh.position.clone()];
|
||||
const geo = new THREE.BufferGeometry().setFromPoints(points);
|
||||
// Strength-encoded opacity: blend source/target strengths, min 0.15, max 0.7
|
||||
const srcStrength = src.mesh.userData.strength || 0.7;
|
||||
const tgtStrength = tgt.mesh.userData.strength || 0.7;
|
||||
const blendedStrength = (srcStrength + tgtStrength) / 2;
|
||||
const lineOpacity = 0.15 + blendedStrength * 0.55;
|
||||
// Blend source/target region colors for the line
|
||||
const srcColor = new THREE.Color(REGIONS[src.region]?.color || 0x334455);
|
||||
const tgtColor = new THREE.Color(REGIONS[tgt.region]?.color || 0x334455);
|
||||
const lineColor = new THREE.Color().lerpColors(srcColor, tgtColor, 0.5);
|
||||
const mat = new THREE.LineBasicMaterial({
|
||||
color: lineColor,
|
||||
transparent: true,
|
||||
opacity: lineOpacity
|
||||
});
|
||||
const mat = new THREE.LineBasicMaterial({ color: 0x334455, transparent: true, opacity: 0.2 });
|
||||
const line = new THREE.Line(geo, mat);
|
||||
line.userData = { type: 'connection', from: memId, to: targetId, baseOpacity: lineOpacity };
|
||||
line.visible = _constellationVisible;
|
||||
line.userData = { type: 'connection', from: memId, to: targetId };
|
||||
_scene.add(line);
|
||||
_connectionLines.push(line);
|
||||
});
|
||||
@@ -538,43 +489,6 @@ const SpatialMemory = (() => {
|
||||
});
|
||||
}
|
||||
|
||||
function _updateConnectionLines() {
|
||||
if (!_constellationVisible) return;
|
||||
if (!_camera) return;
|
||||
const camPos = _camera.position;
|
||||
|
||||
_connectionLines.forEach(line => {
|
||||
const posArr = line.geometry.attributes.position.array;
|
||||
const mx = (posArr[0] + posArr[3]) / 2;
|
||||
const my = (posArr[1] + posArr[4]) / 2;
|
||||
const mz = (posArr[2] + posArr[5]) / 2;
|
||||
const dist = camPos.distanceTo(new THREE.Vector3(mx, my, mz));
|
||||
|
||||
if (dist > CONNECTION_LOD_DIST) {
|
||||
line.visible = false;
|
||||
} else {
|
||||
line.visible = true;
|
||||
const fade = Math.max(0, 1 - (dist / CONNECTION_LOD_DIST));
|
||||
// Restore base opacity from userData if stored, else use material default
|
||||
const base = line.userData.baseOpacity || line.material.opacity || 0.4;
|
||||
line.material.opacity = base * fade;
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
function toggleConstellation() {
|
||||
_constellationVisible = !_constellationVisible;
|
||||
_connectionLines.forEach(line => {
|
||||
line.visible = _constellationVisible;
|
||||
});
|
||||
console.info('[Mnemosyne] Constellation', _constellationVisible ? 'shown' : 'hidden');
|
||||
return _constellationVisible;
|
||||
}
|
||||
|
||||
function isConstellationVisible() {
|
||||
return _constellationVisible;
|
||||
}
|
||||
|
||||
// ─── REMOVE A MEMORY ─────────────────────────────────
|
||||
function removeMemory(memId) {
|
||||
const obj = _memoryObjects[memId];
|
||||
@@ -630,7 +544,6 @@ const SpatialMemory = (() => {
|
||||
});
|
||||
|
||||
_updateEntityLines();
|
||||
_updateConnectionLines();
|
||||
|
||||
Object.values(_regionMarkers).forEach(marker => {
|
||||
if (marker.ring && marker.ring.material) {
|
||||
@@ -953,7 +866,7 @@ const SpatialMemory = (() => {
|
||||
getCrystalMeshes, getMemoryFromMesh, highlightMemory, clearHighlight, getSelectedId,
|
||||
exportIndex, importIndex, searchNearby, REGIONS,
|
||||
saveToStorage, loadFromStorage, clearStorage,
|
||||
runGravityLayout, setCamera, toggleConstellation, isConstellationVisible
|
||||
runGravityLayout, setCamera
|
||||
};
|
||||
})();
|
||||
|
||||
|
||||
@@ -1340,6 +1340,74 @@ class MnemosyneArchive:
|
||||
results.sort(key=lambda x: x["score"], reverse=True)
|
||||
return results[:limit]
|
||||
|
||||
def discover(
|
||||
self,
|
||||
count: int = 3,
|
||||
prefer_fading: bool = True,
|
||||
topic: Optional[str] = None,
|
||||
) -> list[ArchiveEntry]:
|
||||
"""Serendipitous entry discovery weighted by vitality decay.
|
||||
|
||||
Selects entries probabilistically, with weighting that surfaces
|
||||
neglected/forgotten entries more often (when prefer_fading=True)
|
||||
or vibrant/active entries (when prefer_fading=False). Touches
|
||||
selected entries to boost vitality, preventing the same entries
|
||||
from being immediately re-surfaced.
|
||||
|
||||
Args:
|
||||
count: Number of entries to discover (default 3).
|
||||
prefer_fading: If True (default), weight toward fading entries.
|
||||
If False, weight toward vibrant entries.
|
||||
topic: If set, restrict to entries with this topic (case-insensitive).
|
||||
|
||||
Returns:
|
||||
List of ArchiveEntry, up to count entries.
|
||||
"""
|
||||
import random
|
||||
|
||||
candidates = list(self._entries.values())
|
||||
|
||||
if not candidates:
|
||||
return []
|
||||
|
||||
if topic:
|
||||
topic_lower = topic.lower()
|
||||
candidates = [e for e in candidates if topic_lower in [t.lower() for t in e.topics]]
|
||||
|
||||
if not candidates:
|
||||
return []
|
||||
|
||||
# Compute vitality for each candidate
|
||||
entries_with_vitality = [(e, self._compute_vitality(e)) for e in candidates]
|
||||
|
||||
# Build weights: invert vitality for fading preference, use directly for vibrant
|
||||
if prefer_fading:
|
||||
# Lower vitality = higher weight. Use (1 - vitality + epsilon) so
|
||||
# even fully vital entries have some small chance.
|
||||
weights = [1.0 - v + 0.01 for _, v in entries_with_vitality]
|
||||
else:
|
||||
# Higher vitality = higher weight. Use (vitality + epsilon).
|
||||
weights = [v + 0.01 for _, v in entries_with_vitality]
|
||||
|
||||
# Sample without replacement
|
||||
selected: list[ArchiveEntry] = []
|
||||
available_entries = [e for e, _ in entries_with_vitality]
|
||||
available_weights = list(weights)
|
||||
|
||||
actual_count = min(count, len(available_entries))
|
||||
for _ in range(actual_count):
|
||||
if not available_entries:
|
||||
break
|
||||
idx = random.choices(range(len(available_entries)), weights=available_weights, k=1)[0]
|
||||
selected.append(available_entries.pop(idx))
|
||||
available_weights.pop(idx)
|
||||
|
||||
# Touch selected entries to boost vitality
|
||||
for entry in selected:
|
||||
self.touch(entry.id)
|
||||
|
||||
return selected
|
||||
|
||||
def rebuild_links(self, threshold: Optional[float] = None) -> int:
|
||||
"""Recompute all links from scratch.
|
||||
|
||||
|
||||
@@ -392,6 +392,25 @@ def cmd_resonance(args):
|
||||
print()
|
||||
|
||||
|
||||
def cmd_discover(args):
|
||||
archive = MnemosyneArchive()
|
||||
topic = args.topic if args.topic else None
|
||||
results = archive.discover(
|
||||
count=args.count,
|
||||
prefer_fading=not args.vibrant,
|
||||
topic=topic,
|
||||
)
|
||||
if not results:
|
||||
print("No entries to discover.")
|
||||
return
|
||||
for entry in results:
|
||||
v = archive.get_vitality(entry.id)
|
||||
print(f"[{entry.id[:8]}] {entry.title}")
|
||||
print(f" Topics: {', '.join(entry.topics) if entry.topics else '(none)'}")
|
||||
print(f" Vitality: {v['vitality']:.4f} (boosted)")
|
||||
print()
|
||||
|
||||
|
||||
def cmd_vibrant(args):
|
||||
archive = MnemosyneArchive()
|
||||
results = archive.vibrant(limit=args.limit)
|
||||
@@ -499,6 +518,11 @@ def main():
|
||||
rs.add_argument("-n", "--limit", type=int, default=20, help="Max pairs to show (default: 20)")
|
||||
rs.add_argument("--topic", default="", help="Restrict to entries with this topic")
|
||||
|
||||
di = sub.add_parser("discover", help="Serendipitous entry exploration")
|
||||
di.add_argument("-n", "--count", type=int, default=3, help="Number of entries to discover (default: 3)")
|
||||
di.add_argument("-t", "--topic", default="", help="Filter to entries with this topic")
|
||||
di.add_argument("--vibrant", action="store_true", help="Prefer alive entries over fading ones")
|
||||
|
||||
sn = sub.add_parser("snapshot", help="Point-in-time backup and restore")
|
||||
sn_sub = sn.add_subparsers(dest="snapshot_cmd")
|
||||
sn_create = sn_sub.add_parser("create", help="Create a new snapshot")
|
||||
@@ -543,6 +567,7 @@ def main():
|
||||
"fading": cmd_fading,
|
||||
"vibrant": cmd_vibrant,
|
||||
"resonance": cmd_resonance,
|
||||
"discover": cmd_discover,
|
||||
"snapshot": cmd_snapshot,
|
||||
}
|
||||
dispatch[args.command](args)
|
||||
|
||||
@@ -1,14 +0,0 @@
|
||||
|
||||
class Reasoner:
|
||||
def __init__(self, rules):
|
||||
self.rules = rules
|
||||
def evaluate(self, entries):
|
||||
return [r['action'] for r in self.rules if self._check(r['condition'], entries)]
|
||||
def _check(self, cond, entries):
|
||||
if cond.startswith('count'):
|
||||
# e.g. count(type=anomaly)>3
|
||||
p = cond.replace('count(', '').split(')')
|
||||
key, val = p[0].split('=')
|
||||
count = sum(1 for e in entries if e.get(key) == val)
|
||||
return eval(f"{count}{p[1]}")
|
||||
return False
|
||||
@@ -1,22 +0,0 @@
|
||||
|
||||
"""Resonance Linker — Finds second-degree connections in the holographic graph."""
|
||||
|
||||
class ResonanceLinker:
|
||||
def __init__(self, archive):
|
||||
self.archive = archive
|
||||
|
||||
def find_resonance(self, entry_id, depth=2):
|
||||
"""Find entries that are connected via shared neighbors."""
|
||||
if entry_id not in self.archive._entries: return []
|
||||
|
||||
entry = self.archive._entries[entry_id]
|
||||
neighbors = set(entry.links)
|
||||
resonance = {}
|
||||
|
||||
for neighbor_id in neighbors:
|
||||
if neighbor_id in self.archive._entries:
|
||||
for second_neighbor in self.archive._entries[neighbor_id].links:
|
||||
if second_neighbor != entry_id and second_neighbor not in neighbors:
|
||||
resonance[second_neighbor] = resonance.get(second_neighbor, 0) + 1
|
||||
|
||||
return sorted(resonance.items(), key=lambda x: x[1], reverse=True)
|
||||
@@ -1,6 +0,0 @@
|
||||
[
|
||||
{
|
||||
"condition": "count(type=anomaly)>3",
|
||||
"action": "alert"
|
||||
}
|
||||
]
|
||||
Reference in New Issue
Block a user