KaoruAK

7 ms·

1. 31.▲
   by KaoruAK 1y ago

   Here’s the paper and code: https://doi.org/10.17605/OSF.IO/74DXZ Here’s the code and how to implement it: https://github.com/POlLLOGAMER/RfC-Reinforcement-for-Creativ... RfC trains agents to
2. 32.▲
   by KaoruAK 1y ago

   Here’s the paper and code: https://doi.org/10.17605/OSF.IO/74DXZ Here’s the code and how to implement it: https://github.com/POlLLOGAMER/RfC-Reinforcement-for-Creativ... RfC (Reinforcement fo
3. 33.▲
   by KaoruAK 1y ago

   A public technical blueprint describing the Habitual Network (HN), an architecture for explicit habit-based learning and reasoning in AI. DOI: https://doi.org/10.17605/OSF.IO/S9YEX
4. 34.▲
   by KaoruAK 1y ago

   The Partition Problem: given integers, decide if they can be split into two subsets of equal sum. Example: {10, 10, 100, 100} → solvable since {10, 100} and {10, 100} balance. Now extend this to duplicated powers-of-ten: {10, 100, …, 10^n,
5. 35.▲
   I made a deterministic π-driven algorithm that solves Partition in O(log n)(osf.io)

   1 points by KaoruAK 1y ago|1 comments
6. 36.▲
   by KaoruAK 1y ago

   Partition is NP-complete. I built a deterministic polynomial algorithm: a variant of my O(n²) solver, now running in O(log n) time and O(1) extra space. More elements → runtime grows slower. Implications: breaks RSA, ECC, AES, SHA-256,
7. 37.▲
   Approximation to Euler's Totient φ(n) for semiprimes – implications for RSA?(osf.io)

   7 points by KaoruAK 1y ago|1 comments
8. 38.▲
   by KaoruAK 1y ago

   Preprint proposing an analytical approximation to Euler’s totient function φ(n) when n = pq with large primes. While not exact, the method (the “Kaoru Method”) shows decreasing relative error as n grows and p, q are more balanced. Given the
9. 39.▲
   AI Emotions: System Prompt for Artificial Emotional States in LLMs(osf.io)

   1 points by KaoruAK 1y ago|1 comments
10. 40.▲
    by KaoruAK 1y ago

    I just released a short paper titled “AI Emotions: A System Prompt for Artificial Emotions”. It presents a compact system-prompt for LLMs that induces an artificial emotional processing loop, affecting internal reasoning rather than just su
11. 41.▲
    DIAC ∞ 2: A Post-Quantum, P=NP-Resistant Hybrid Encryption System(osf.io)

    2 points by KaoruAK 1y ago|1 comments
12. 42.▲
    by KaoruAK 1y ago

    DIAC ∞ 2 is an novel asymmetric encryption system that I designed specifically to be resistant even if P=NP, and it is a post-quantum cipher. Here is the OSF link, where the repository contains the PDF explaining DIAC ∞ 2 and its demo code
13. 43.▲
    New AI architecture trains in seconds on CPU (GAIA)(osf.io)

    4 points by KaoruAK 1y ago|1 comments
14. 44.▲
    by KaoruAK 1y ago

    I’ve been working on an alternative architecture to Transformers called GAIA. It trains in seconds on CPU and is based on hashing with π-driven partition regularization. Paper and implementation are available here: https://doi.or
15. 45.▲
    TFS Countdown: August 17, 2025 6 PM GMT-6, No context(bitcoin.org)

    2 points by KaoruAK 1y ago|0 comments
16. 46.▲
    Show HN: DNC – A Decentralized Economic Protocol (No Blockchain)(github.com)

    4 points by KaoruAK 1y ago|0 comments
17. 47.▲
    A deterministic π-driven algorithm for the Partition Problem (NP-complete)(osf.io)

    2 points by KaoruAK 1y ago|0 comments
18. 48.▲
    Show HN: DIAC – Open-Source Quantum-Resistant Cryptosystem(osf.io)

    5 points by KaoruAK 1y ago|0 comments