Upgrade pipeline to include cross-language decoders, specifications, dependencies, and database offline in LLM capsule transmission via 67 packets

VerifyLanguageU.java

@@ -1,342 +1,347 @@
-// ZYMATICA | Language-U Cross-Language Verification Engine (Java)
-// Watermark: ip zymatica.space | astronautshe.com
-
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.IOException;
-import java.util.ArrayList;
-import java.util.List;
-
-public class VerifyLanguageU {
-
-    static class SparseTransition {
-        long key;
-        int sym;
-        long count;
-        SparseTransition(long key, int sym, long count) {
-            this.key = key;
-            this.sym = sym;
-            this.count = count;
-        }
-    }
-
-    static class RadicalPredictor {
-        long alpha;
-        long weight;
-        List<SparseTransition> transRC = new ArrayList<>();
-        List<SparseTransition> transRF = new ArrayList<>();
-        List<SparseTransition> transRA = new ArrayList<>();
-        int prevRC = 0;
-        int prevRF = 0;
-        int prevRA = 0;
-
-        RadicalPredictor(long alpha, long weight) {
-            this.alpha = alpha;
-            this.weight = weight;
-        }
-
-        void observe(int rc, int rf, int ra) {
-            long keyRC = prevRC;
-            boolean found = false;
-            for (SparseTransition entry : transRC) {
-                if (entry.key == keyRC && entry.sym == rc) {
-                    entry.count += weight;
-                    found = true;
-                    break;
-                }
-            }
-            if (!found && transRC.size() < 256) {
-                transRC.add(new SparseTransition(keyRC, rc, weight));
-            }
-
-            long keyRF = ((long)rc << 8) | prevRF;
-            found = false;
-            for (SparseTransition entry : transRF) {
-                if (entry.key == keyRF && entry.sym == rf) {
-                    entry.count += weight;
-                    found = true;
-                    break;
-                }
-            }
-            if (!found && transRF.size() < 256) {
-                transRF.add(new SparseTransition(keyRF, rf, weight));
-            }
-
-            long keyRA = ((long)rc << 16) | ((long)rf << 8) | prevRA;
-            found = false;
-            for (SparseTransition entry : transRA) {
-                if (entry.key == keyRA && entry.sym == ra) {
-                    entry.count += weight;
-                    found = true;
-                    break;
-                }
-            }
-            if (!found && transRA.size() < 256) {
-                transRA.add(new SparseTransition(keyRA, ra, weight));
-            }
-
-            prevRC = rc;
-            prevRF = rf;
-            prevRA = ra;
-        }
-
-        long[] getCumFreqsRC(int prevRC) {
-            long[] freqs = new long[256];
-            for (int i = 0; i < 256; i++) freqs[i] = alpha;
-            for (SparseTransition entry : transRC) {
-                if (entry.key == prevRC) {
-                    freqs[entry.sym] += entry.count;
-                }
-            }
-            long[] cumFreqs = new long[257];
-            for (int i = 0; i < 256; i++) {
-                cumFreqs[i + 1] = cumFreqs[i] + freqs[i];
-            }
-            return cumFreqs;
-        }
-
-        long[] getCumFreqsRF(int currRC, int prevRF) {
-            long[] freqs = new long[256];
-            for (int i = 0; i < 256; i++) freqs[i] = alpha;
-            long key = ((long)currRC << 8) | prevRF;
-            for (SparseTransition entry : transRF) {
-                if (entry.key == key) {
-                    freqs[entry.sym] += entry.count;
-                }
-            }
-            long[] cumFreqs = new long[257];
-            for (int i = 0; i < 256; i++) {
-                cumFreqs[i + 1] = cumFreqs[i] + freqs[i];
-            }
-            return cumFreqs;
-        }
-
-        long[] getCumFreqsRA(int currRC, int currRF, int prevRA) {
-            long[] freqs = new long[256];
-            for (int i = 0; i < 256; i++) freqs[i] = alpha;
-            long key = ((long)currRC << 16) | ((long)currRF << 8) | prevRA;
-            for (SparseTransition entry : transRA) {
-                if (entry.key == key) {
-                    freqs[entry.sym] += entry.count;
-                }
-            }
-            long[] cumFreqs = new long[257];
-            for (int i = 0; i < 256; i++) {
-                cumFreqs[i + 1] = cumFreqs[i] + freqs[i];
-            }
-            return cumFreqs;
-        }
-    }
-
-    static class BitReader {
-        byte[] buffer;
-        int bitIndex = 0;
-        int totalBits;
-
-        BitReader(byte[] buffer) {
-            this.buffer = buffer;
-            this.totalBits = buffer.length * 8;
-        }
-
-        int readBit() {
-            if (bitIndex >= totalBits) return 0;
-            int bytePos = bitIndex / 8;
-            int bitPos = 7 - (bitIndex % 8);
-            int bit = (buffer[bytePos] >> bitPos) & 1;
-            bitIndex++;
-            return bit;
-        }
-    }
-
-    static class ConceptRadicals {
-        int rc, rf, ra;
-        ConceptRadicals(int rc, int rf, int ra) {
-            this.rc = rc; this.rf = rf; this.ra = ra;
-        }
-    }
-
-    static int readVarint(byte[] data, int[] state) {
-        int val = 0;
-        int shift = 0;
-        while (true) {
-            if (state[0] >= data.length) break;
-            int b = data[state[0]] & 0xFF;
-            state[0]++;
-            val |= (b & 0x7F) << shift;
-            if ((b & 0x80) == 0) break;
-            shift += 7;
-        }
-        return val;
-    }
-
-    static List<String> decompressVocab(byte[] data, int numTokens) {
-        List<String> tokens = new ArrayList<>();
-        int[] state = {0};
-        String prev = "";
-        for (int i = 0; i < numTokens; i++) {
-            if (state[0] >= data.length) break;
-            int common = readVarint(data, state);
-            int suffixLen = readVarint(data, state);
-            byte[] suffixBytes = new byte[suffixLen];
-            System.arraycopy(data, state[0], suffixBytes, 0, suffixLen);
-            state[0] += suffixLen;
-            
-            String suffix = new String(suffixBytes);
-            String token = prev.substring(0, Math.min(common, prev.length())) + suffix;
-            tokens.add(token);
-            prev = token;
-        }
-        return tokens;
-    }
-
-    static List<ConceptRadicals> decode(byte[] encodedBytes, int numConcepts, long alpha, long weight) {
-        RadicalPredictor pred = new RadicalPredictor(alpha, weight);
-        BitReader r = new BitReader(encodedBytes);
-
-        long value = 0;
-        for (int i = 0; i < 32; i++) {
-            value = (value << 1) | r.readBit();
-        }
-
-        long low = 0;
-        long high = 0xFFFFFFFFL;
-        List<ConceptRadicals> decoded = new ArrayList<>();
-
-        for (int cIdx = 0; cIdx < numConcepts; cIdx++) {
-            int prevRC = pred.prevRC;
-            int prevRF = pred.prevRF;
-            int prevRA = pred.prevRA;
-            int[] symbols = new int[3];
-
-            for (int step = 0; step < 3; step++) {
-                long[] cumFreqs;
-                if (step == 0) {
-                    cumFreqs = pred.getCumFreqsRC(prevRC);
-                } else if (step == 1) {
-                    cumFreqs = pred.getCumFreqsRF(symbols[0], prevRF);
-                } else {
-                    cumFreqs = pred.getCumFreqsRA(symbols[0], symbols[1], prevRA);
-                }
-
-                long total = cumFreqs[256];
-                long rangeWidth = high - low + 1;
-                long scaledVal = (((value - low) + 1) * total - 1) / rangeWidth;
-
-                int sym = 0;
-                int lIdx = 0, rIdx = 255;
-                while (lIdx <= rIdx) {
-                    int mIdx = (lIdx + rIdx) / 2;
-                    if (cumFreqs[mIdx] <= scaledVal && scaledVal < cumFreqs[mIdx + 1]) {
-                        sym = mIdx;
-                        break;
-                    } else if (scaledVal >= cumFreqs[mIdx + 1]) {
-                        lIdx = mIdx + 1;
-                    } else {
-                        rIdx = mIdx - 1;
-                    }
-                }
-
-                symbols[step] = sym;
-                long cumLow = cumFreqs[sym];
-                long cumHigh = cumFreqs[sym + 1];
-
-                high = low + (rangeWidth * cumHigh) / total - 1;
-                low = low + (rangeWidth * cumLow) / total;
-
-                while (true) {
-                    if (high < 0x80000000L) {
-                        low <<= 1;
-                        high = (high << 1) | 1;
-                        value = (value << 1) | r.readBit();
-                    } else if (low >= 0x80000000L) {
-                        low = (low - 0x80000000L) << 1;
-                        high = ((high - 0x80000000L) << 1) | 1;
-                        value = ((value - 0x80000000L) << 1) | r.readBit();
-                    } else if (low >= 0x40000000L && high < 0xC0000000L) {
-                        low = (low - 0x40000000L) << 1;
-                        high = ((high - 0x40000000L) << 1) | 1;
-                        value = ((value - 0x40000000L) << 1) | r.readBit();
-                    } else {
-                        break;
-                    }
-                    low &= 0xFFFFFFFFL;
-                    high &= 0xFFFFFFFFL;
-                    value &= 0xFFFFFFFFL;
-                }
-            }
-
-            decoded.add(new ConceptRadicals(symbols[0], symbols[1], symbols[2]));
-            pred.observe(symbols[0], symbols[1], symbols[2]);
-        }
-        return decoded;
-    }
-
-    public static void main(String[] args) throws IOException {
-        System.out.println("======================================================================");
-        System.out.println("ZYMATICA | Cross-Language Java Decompressor & Range-Decoder");
-        System.out.println("======================================================================\n");
-
-        File namesFile = new File("frameworks_names.bin");
-        File coordsFile = new File("frameworks_coordinates.bin");
-
-        if (!namesFile.exists() || !coordsFile.exists()) {
-            System.err.println("[!] Error: Binary transport files not found. Run run_ultimate_pipeline.py first.");
-            System.exit(1);
-        }
-
-        // 1. Read names binary
-        byte[] namesBytes = new byte[(int) namesFile.length()];
-        try (FileInputStream fis = new FileInputStream(namesFile)) {
-            fis.read(namesBytes);
-        }
-
-        // 2. Read coordinates binary
-        byte[] coordsBytes = new byte[(int) coordsFile.length()];
-        try (FileInputStream fis = new FileInputStream(coordsFile)) {
-            fis.read(coordsBytes);
-        }
-
-        // 3. Decompress vocabulary names
-        List<String> names = decompressVocab(namesBytes, 49);
-        System.out.println("[1] Java Vocab Decompression: SUCCESS (" + names.size() + " names restored).");
-
-        // 4. Formulate expected radicals based on the same rules
-        List<ConceptRadicals> expected = new ArrayList<>();
-        for (String name : names) {
-            int domain = 1;
-            String lower = name.toLowerCase();
-            if (lower.contains("pixi") || lower.contains("phaser") || lower.contains("away") || lower.contains("p5")) {
-                domain = 2;
-            } else if (lower.contains("scenejs") || lower.contains("glam") || lower.contains("deck") || lower.contains("cesium") || lower.contains("luma") || lower.contains("philo")) {
-                domain = 7;
-            }
-            int rc = (domain << 4) | 2;
-            int rf = (1 << 4) | 2;
-            int ra = (15 << 4) | 12;
-            expected.add(new ConceptRadicals(rc, rf, ra));
-        }
-
-        // 5. Decode radicals using Yang range decoder in Java
-        List<ConceptRadicals> decoded = decode(coordsBytes, 49, 1, 128);
-        System.out.println("[2] Java Yang Range Decoder execution: SUCCESS.");
-
-        // 6. Assert exact equivalence (dynamic validation)
-        boolean match = true;
-        for (int i = 0; i < 49; i++) {
-            ConceptRadicals exp = expected.get(i);
-            ConceptRadicals dec = decoded.get(i);
-            if (exp.rc != dec.rc || exp.rf != dec.rf || exp.ra != dec.ra) {
-                System.err.println("[!] Mismatch at index " + i + " (" + names.get(i) + "): Expected RC=" + exp.rc + ", RF=" + exp.rf + ", RA=" + exp.ra + " | Decoded RC=" + dec.rc + ", RF=" + dec.rf + ", RA=" + dec.ra);
-                match = false;
-                break;
-            }
-        }
-
-        if (match) {
-            System.out.println("\n[SUCCESS] Java range-decoder verification: 100% MATCH!");
-        } else {
-            System.err.println("\n[ERROR] Java dynamic coordinate check failed!");
-            System.exit(1);
-        }
-    }
-}
+// ZYMATICA | Language-U Cross-Language Verification Engine (Java)
+// Watermark: ip zymatica.space | astronautshe.com
+
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.IOException;
+import java.util.ArrayList;
+import java.util.List;
+
+public class VerifyLanguageU {
+
+    static class SparseTransition {
+        long key;
+        int sym;
+        long count;
+        SparseTransition(long key, int sym, long count) {
+            this.key = key;
+            this.sym = sym;
+            this.count = count;
+        }
+    }
+
+    static class RadicalPredictor {
+        long alpha;
+        long weight;
+        List<SparseTransition> transRC = new ArrayList<>();
+        List<SparseTransition> transRF = new ArrayList<>();
+        List<SparseTransition> transRA = new ArrayList<>();
+        int prevRC = 0;
+        int prevRF = 0;
+        int prevRA = 0;
+
+        RadicalPredictor(long alpha, long weight) {
+            this.alpha = alpha;
+            this.weight = weight;
+        }
+
+        void observe(int rc, int rf, int ra) {
+            long keyRC = prevRC;
+            boolean found = false;
+            for (SparseTransition entry : transRC) {
+                if (entry.key == keyRC && entry.sym == rc) {
+                    entry.count += weight;
+                    found = true;
+                    break;
+                }
+            }
+            if (!found && transRC.size() < 256) {
+                transRC.add(new SparseTransition(keyRC, rc, weight));
+            }
+
+            long keyRF = ((long)rc << 8) | prevRF;
+            found = false;
+            for (SparseTransition entry : transRF) {
+                if (entry.key == keyRF && entry.sym == rf) {
+                    entry.count += weight;
+                    found = true;
+                    break;
+                }
+            }
+            if (!found && transRF.size() < 256) {
+                transRF.add(new SparseTransition(keyRF, rf, weight));
+            }
+
+            long keyRA = ((long)rc << 16) | ((long)rf << 8) | prevRA;
+            found = false;
+            for (SparseTransition entry : transRA) {
+                if (entry.key == keyRA && entry.sym == ra) {
+                    entry.count += weight;
+                    found = true;
+                    break;
+                }
+            }
+            if (!found && transRA.size() < 256) {
+                transRA.add(new SparseTransition(keyRA, ra, weight));
+            }
+
+            prevRC = rc;
+            prevRF = rf;
+            prevRA = ra;
+        }
+
+        long[] getCumFreqsRC(int prevRC) {
+            long[] freqs = new long[256];
+            for (int i = 0; i < 256; i++) freqs[i] = alpha;
+            for (SparseTransition entry : transRC) {
+                if (entry.key == prevRC) {
+                    freqs[entry.sym] += entry.count;
+                }
+            }
+            long[] cumFreqs = new long[257];
+            for (int i = 0; i < 256; i++) {
+                cumFreqs[i + 1] = cumFreqs[i] + freqs[i];
+            }
+            return cumFreqs;
+        }
+
+        long[] getCumFreqsRF(int currRC, int prevRF) {
+            long[] freqs = new long[256];
+            for (int i = 0; i < 256; i++) freqs[i] = alpha;
+            long key = ((long)currRC << 8) | prevRF;
+            for (SparseTransition entry : transRF) {
+                if (entry.key == key) {
+                    freqs[entry.sym] += entry.count;
+                }
+            }
+            long[] cumFreqs = new long[257];
+            for (int i = 0; i < 256; i++) {
+                cumFreqs[i + 1] = cumFreqs[i] + freqs[i];
+            }
+            return cumFreqs;
+        }
+
+        long[] getCumFreqsRA(int currRC, int currRF, int prevRA) {
+            long[] freqs = new long[256];
+            for (int i = 0; i < 256; i++) freqs[i] = alpha;
+            long key = ((long)currRC << 16) | ((long)currRF << 8) | prevRA;
+            for (SparseTransition entry : transRA) {
+                if (entry.key == key) {
+                    freqs[entry.sym] += entry.count;
+                }
+            }
+            long[] cumFreqs = new long[257];
+            for (int i = 0; i < 256; i++) {
+                cumFreqs[i + 1] = cumFreqs[i] + freqs[i];
+            }
+            return cumFreqs;
+        }
+    }
+
+    static class BitReader {
+        byte[] buffer;
+        int bitIndex = 0;
+        int totalBits;
+
+        BitReader(byte[] buffer) {
+            this.buffer = buffer;
+            this.totalBits = buffer.length * 8;
+        }
+
+        int readBit() {
+            if (bitIndex >= totalBits) return 0;
+            int bytePos = bitIndex / 8;
+            int bitPos = 7 - (bitIndex % 8);
+            int bit = (buffer[bytePos] >> bitPos) & 1;
+            bitIndex++;
+            return bit;
+        }
+    }
+
+    static class ConceptRadicals {
+        int rc, rf, ra;
+        ConceptRadicals(int rc, int rf, int ra) {
+            this.rc = rc; this.rf = rf; this.ra = ra;
+        }
+    }
+
+    static int readVarint(byte[] data, int[] state) {
+        int val = 0;
+        int shift = 0;
+        while (true) {
+            if (state[0] >= data.length) break;
+            int b = data[state[0]] & 0xFF;
+            state[0]++;
+            val |= (b & 0x7F) << shift;
+            if ((b & 0x80) == 0) break;
+            shift += 7;
+        }
+        return val;
+    }
+
+    static List<String> decompressVocab(byte[] data, int numTokens) {
+        List<String> tokens = new ArrayList<>();
+        int[] state = {0};
+        String prev = "";
+        for (int i = 0; i < numTokens; i++) {
+            if (state[0] >= data.length) break;
+            int common = readVarint(data, state);
+            int suffixLen = readVarint(data, state);
+            byte[] suffixBytes = new byte[suffixLen];
+            System.arraycopy(data, state[0], suffixBytes, 0, suffixLen);
+            state[0] += suffixLen;
+            
+            String suffix = new String(suffixBytes);
+            String token = prev.substring(0, Math.min(common, prev.length())) + suffix;
+            tokens.add(token);
+            prev = token;
+        }
+        return tokens;
+    }
+
+    static List<ConceptRadicals> decode(byte[] encodedBytes, int numConcepts, long alpha, long weight) {
+        RadicalPredictor pred = new RadicalPredictor(alpha, weight);
+        BitReader r = new BitReader(encodedBytes);
+
+        long value = 0;
+        for (int i = 0; i < 32; i++) {
+            value = (value << 1) | r.readBit();
+        }
+
+        long low = 0;
+        long high = 0xFFFFFFFFL;
+        List<ConceptRadicals> decoded = new ArrayList<>();
+
+        for (int cIdx = 0; cIdx < numConcepts; cIdx++) {
+            int prevRC = pred.prevRC;
+            int prevRF = pred.prevRF;
+            int prevRA = pred.prevRA;
+            int[] symbols = new int[3];
+
+            for (int step = 0; step < 3; step++) {
+                long[] cumFreqs;
+                if (step == 0) {
+                    cumFreqs = pred.getCumFreqsRC(prevRC);
+                } else if (step == 1) {
+                    cumFreqs = pred.getCumFreqsRF(symbols[0], prevRF);
+                } else {
+                    cumFreqs = pred.getCumFreqsRA(symbols[0], symbols[1], prevRA);
+                }
+
+                long total = cumFreqs[256];
+                long rangeWidth = high - low + 1;
+                long scaledVal = (((value - low) + 1) * total - 1) / rangeWidth;
+
+                int sym = 0;
+                int lIdx = 0, rIdx = 255;
+                while (lIdx <= rIdx) {
+                    int mIdx = (lIdx + rIdx) / 2;
+                    if (cumFreqs[mIdx] <= scaledVal && scaledVal < cumFreqs[mIdx + 1]) {
+                        sym = mIdx;
+                        break;
+                    } else if (scaledVal >= cumFreqs[mIdx + 1]) {
+                        lIdx = mIdx + 1;
+                    } else {
+                        rIdx = mIdx - 1;
+                    }
+                }
+
+                symbols[step] = sym;
+                long cumLow = cumFreqs[sym];
+                long cumHigh = cumFreqs[sym + 1];
+
+                high = low + (rangeWidth * cumHigh) / total - 1;
+                low = low + (rangeWidth * cumLow) / total;
+
+                while (true) {
+                    if (high < 0x80000000L) {
+                        low <<= 1;
+                        high = (high << 1) | 1;
+                        value = (value << 1) | r.readBit();
+                    } else if (low >= 0x80000000L) {
+                        low = (low - 0x80000000L) << 1;
+                        high = ((high - 0x80000000L) << 1) | 1;
+                        value = ((value - 0x80000000L) << 1) | r.readBit();
+                    } else if (low >= 0x40000000L && high < 0xC0000000L) {
+                        low = (low - 0x40000000L) << 1;
+                        high = ((high - 0x40000000L) << 1) | 1;
+                        value = ((value - 0x40000000L) << 1) | r.readBit();
+                    } else {
+                        break;
+                    }
+                    low &= 0xFFFFFFFFL;
+                    high &= 0xFFFFFFFFL;
+                    value &= 0xFFFFFFFFL;
+                }
+            }
+
+            decoded.add(new ConceptRadicals(symbols[0], symbols[1], symbols[2]));
+            pred.observe(symbols[0], symbols[1], symbols[2]);
+        }
+        return decoded;
+    }
+
+    public static void main(String[] args) throws IOException {
+        System.out.println("======================================================================");
+        System.out.println("ZYMATICA | Cross-Language Java Decompressor & Range-Decoder");
+        System.out.println("======================================================================\n");
+
+        File namesFile = new File("Language-U-Browser/frameworks_names.bin");
+        File coordsFile = new File("Language-U-Browser/frameworks_coordinates.bin");
+
+        if (!namesFile.exists() || !coordsFile.exists()) {
+            namesFile = new File("frameworks_names.bin");
+            coordsFile = new File("frameworks_coordinates.bin");
+        }
+
+        if (!namesFile.exists() || !coordsFile.exists()) {
+            System.err.println("[!] Error: Binary transport files not found. Run run_ultimate_pipeline.py first.");
+            System.exit(1);
+        }
+
+        // 1. Read names binary
+        byte[] namesBytes = new byte[(int) namesFile.length()];
+        try (FileInputStream fis = new FileInputStream(namesFile)) {
+            fis.read(namesBytes);
+        }
+
+        // 2. Read coordinates binary
+        byte[] coordsBytes = new byte[(int) coordsFile.length()];
+        try (FileInputStream fis = new FileInputStream(coordsFile)) {
+            fis.read(coordsBytes);
+        }
+
+        // 3. Decompress vocabulary names
+        List<String> names = decompressVocab(namesBytes, 49);
+        System.out.println("[1] Java Vocab Decompression: SUCCESS (" + names.size() + " names restored).");
+
+        // 4. Formulate expected radicals based on the same rules
+        List<ConceptRadicals> expected = new ArrayList<>();
+        for (String name : names) {
+            int domain = 1;
+            String lower = name.toLowerCase();
+            if (lower.contains("pixi") || lower.contains("phaser") || lower.contains("away") || lower.contains("p5")) {
+                domain = 2;
+            } else if (lower.contains("scenejs") || lower.contains("glam") || lower.contains("deck") || lower.contains("cesium") || lower.contains("luma") || lower.contains("philo")) {
+                domain = 7;
+            }
+            int rc = (domain << 4) | 2;
+            int rf = (1 << 4) | 2;
+            int ra = (15 << 4) | 12;
+            expected.add(new ConceptRadicals(rc, rf, ra));
+        }
+
+        // 5. Decode radicals using Yang range decoder in Java
+        List<ConceptRadicals> decoded = decode(coordsBytes, 49, 1, 128);
+        System.out.println("[2] Java Yang Range Decoder execution: SUCCESS.");
+
+        // 6. Assert exact equivalence (dynamic validation)
+        boolean match = true;
+        for (int i = 0; i < 49; i++) {
+            ConceptRadicals exp = expected.get(i);
+            ConceptRadicals dec = decoded.get(i);
+            if (exp.rc != dec.rc || exp.rf != dec.rf || exp.ra != dec.ra) {
+                System.err.println("[!] Mismatch at index " + i + " (" + names.get(i) + "): Expected RC=" + exp.rc + ", RF=" + exp.rf + ", RA=" + exp.ra + " | Decoded RC=" + dec.rc + ", RF=" + dec.rf + ", RA=" + dec.ra);
+                match = false;
+                break;
+            }
+        }
+
+        if (match) {
+            System.out.println("\n[SUCCESS] Java range-decoder verification: 100% MATCH!");
+        } else {
+            System.err.println("\n[ERROR] Java dynamic coordinate check failed!");
+            System.exit(1);
+        }
+    }
+}

frameworks_metadata.json

@@ -1,8 +1,8 @@
 {
   "frameworks_count": 49,
-  "compressed_size": 373,
-  "sha256": "573acd8edada38afa62af9fd8d3621324342db37025b69d77ed45a74c1af24e4",
-  "packets_count": 3,
+  "compressed_size": 16601,
+  "sha256": "6015f0909358ae8674503b876b196e6744132dd2735e41c502f8443c6c36a83a",
+  "packets_count": 67,
   "svd_rank": 2,
   "dct_coefficients": 0,
   "singular_values": [

packets/packet_00.bin

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:75762b6bb5b34216a91d4d7143c038721a566aec276c3f8188eda42d46ce1d3e
+oid sha256:9865468f6352981c201ebe855ab38109467a3fe9f2654b753e1c2450cc8dd04a
 size 255

packets/packet_01.bin

@@ -1,3 +1,3 @@
 version https://git-lfs.github.com/spec/v1
-oid sha256:d3bf3d0e022694b241d994ca2d0e8dda771dac90a63667a92bf56bc4bfd71466
+oid sha256:bc7d5c973e819713fc38515e459c8bc9fcfc50eb959bc17c3e87a97298cc9a2e
 size 255

packets/packet_02.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8abe2c3eb2961144a5831b5c6afae2288164f61be31f277ed6af05eb0fa58567
+size 255

packets/packet_03.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a19b2da3b0fb5edd8d677591d7d1b156c04f13b4c267734733b5e78a0127a100
+size 255

packets/packet_04.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:7c93c5d20df2c3fdca02c75c869f5dad97a48362284881c66ebaf76df2c16aee
+size 255

packets/packet_05.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e6af21cd23f59f3d8b209444fca03c4242aa3304a44905a9311041e28e61f789
+size 255

packets/packet_06.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:53fc619f934f35b2a2e7d66eb7092b48c4ba3e32c0ef394116f606d1c05e5dd1
+size 255

packets/packet_07.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e9bc511bb3a98185ef654310d99199526ec421e3666e32ef8757bc948059857b
+size 255

packets/packet_08.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d8b55d01afe2ac5ebbbc6af6ba736888647a50eda592dcaf123a5698b9735b12
+size 255

packets/packet_09.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5fa5843e769c2297a3f09dd914680f6424b6e6ff8c8896ac05709bf30c3c29b4
+size 255

packets/packet_10.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:90b9df312be6be62cb798481da1639a3d0c2d98f68e5d983a2e69933ed647856
+size 255

packets/packet_11.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d893da3ad44d19a1e73f9ca60c7a4ab2a8e34487124016db943f692a95fdbff0
+size 255

packets/packet_12.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ed27f4f9991619f48df26c2c0ee0185dd1d29770634fec53cbeb6dae4f19f8b0
+size 255

packets/packet_13.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:c711fe350c5f85fdabe82f4db38159e6112b03089f8f84c99d810130be8b8cbf
+size 255

packets/packet_14.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9c4f7998fc277751aba24481ec442a028a094c83222f725a2f86b736ec76cdfd
+size 255

packets/packet_15.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1d0539d8eb86137704c522fbb212004646f802820c34aa2dc3942f7a84b87b25
+size 255

packets/packet_16.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4975b9e3380cd1f61b00d3fdd37cb2772065e55d76f3e745a96e0be2cf17546a
+size 255

packets/packet_17.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ba2d6865e150dc469051351e3f0807d0676f85eadfb978674111f443c04021e2
+size 255

packets/packet_18.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dd7fd24c3fd2dbf397def70ae71752e3c8f6b6f8e115ebebd7076bf807dd6d82
+size 255

packets/packet_19.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5db3b8cea4883918b02a659a0aba14ee46d67e935d992433dfcf5c8358dc2519
+size 255

packets/packet_20.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d0b61b1ea681c3af0d8953f0a12ca04a0ad818242717157fab171c672b7b27ff
+size 255

packets/packet_21.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a57255aa10f48749160ec424d70d9f4a9d696a51d542a64c1712773f288b74bc
+size 255

packets/packet_22.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8af1488bf223c9e90f683c5b892bea11938822aa9d71f4e2409c11aa9cdde9ef
+size 255

packets/packet_23.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0c214831f9cba0d92b0f0d567939c67c6253e74aaf22561c03b6688bc75c5779
+size 255

packets/packet_24.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dae02a139580943f140a5309b43666e7de87d1d05ba29144377c15ba3fad23bc
+size 255

packets/packet_25.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5aee1cffa54f434ddc84a8604e38123aba706d8def6b21f75c1009b8e1cfce6d
+size 255

packets/packet_26.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:25dc6cf840a5d2833a1800d1a80d57fde8d74d7e30c93cccbce4f4afc9525c73
+size 255

packets/packet_27.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dd59d13ba8c09741d3ab2bd5726a62a9e86c24356ab7cf3bbaf101619c47cbaa
+size 255

packets/packet_28.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:aeb6b93c827197812f470f6cb6dc8dd4743c8b1a1e4388bec135f3fae99a798d
+size 255

packets/packet_29.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a94983e8ea278c8ea103ec77d75d9bbbb8a8c78ede87988be0846aa69e455ee8
+size 255

packets/packet_30.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:80aaf26754e37927f1ec027e4750285668eba98b7a774443fda2f302b134c908
+size 255

packets/packet_31.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:b052a459f43f34276817e9e4836ed3d33f2aaf76a79dc1ab673e632890456bac
+size 255

packets/packet_32.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:27f0b00a1d665fdb4f0b6ed511284b79fab9c759e790e355ad11942fff1dc812
+size 255

packets/packet_33.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d7e0ae2b5a15cd7e27b5eb0057a83ee6972f23b2ede2ed84007ade21ac519fbd
+size 255

packets/packet_34.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:bb7c6809f2cc6567c1953cf9372d4f48414d681c16a78a732daadd18c46661ae
+size 255

packets/packet_35.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a37a1c3e95dae869f93fc5eecdce4bcbbe3fe71341586d7cc339effe88a13f1c
+size 255

packets/packet_36.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:183100806dea1cb4a7f753b936dcfbaefda1c09f823cc2dde79406b9bb8ca834
+size 255

packets/packet_37.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8ba7b4eff08fb9da13c630994591cf85810dde28c4d71fa5aff56a468f1d2f48
+size 255

packets/packet_38.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a4afe8e57592936cfb15380d3b891cb4b939419884a14123fc263b2c9d85025e
+size 255

packets/packet_39.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:423bd4f613700701bfae2199bfab5d80d7a5356ac93224d9baefa7f3cbfd4abf
+size 255

packets/packet_40.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:66cb31901fe1b294e77506a25e5c2e3ccd5ccbd077ca43735c9ec02d5c2d3d15
+size 255

packets/packet_41.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:27acd49ed0d7d5210b0791bc279fe2936c66b8a35d61764e54847e669aa296eb
+size 255

packets/packet_42.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4fda7d876b3e065af1209fbdff931911c861046eac3a121f8241d5ae37beae36
+size 255

packets/packet_43.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:4197ac636eeaf9eeed8f3321ca9eaa9a0b110d6271aa03cc8a95284d26b86871
+size 255

packets/packet_44.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:2c64157f30ff4cf1d15110dc92c011baa4687b2148c81b0141247b9880da1423
+size 255

packets/packet_45.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:68eccfe75c683345986ef88626fe76b1a0c4b4f31966e1031261d48a62d651dd
+size 255

packets/packet_46.bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:679d96982d298d96bddc10ce26b0faee6fd4e8b8b6e11f9b027b8b3475eff394
+size 255