Aluode commited on
Commit
705b97a
·
verified ·
1 Parent(s): 4a184da

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +33 -14
README.md CHANGED
@@ -1,20 +1,39 @@
1
  ---
2
- title: Neuromorphic Molecular Solver
3
- emoji: 🚀
4
- colorFrom: red
5
- colorTo: red
6
- sdk: docker
7
- app_port: 8501
8
- tags:
9
- - streamlit
10
  pinned: false
11
- short_description: Brain inspired systems solve molecules (vibe research)
12
- license: mit
13
  ---
14
 
15
- # Welcome to Streamlit!
16
 
17
- Edit `/src/streamlit_app.py` to customize this app to your heart's desire. :heart:
18
 
19
- If you have any questions, checkout our [documentation](https://docs.streamlit.io) and [community
20
- forums](https://discuss.streamlit.io).
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
  ---
2
+ title: Neuromorphic Molecular Constraint Solver
3
+ emoji: 🧬
4
+ colorFrom: blue
5
+ colorTo: green
6
+ sdk: streamlit
7
+ sdk_version: 1.27.2
8
+ app_file: app.py
 
9
  pinned: false
 
 
10
  ---
11
 
12
+ ## Neuromorphic Molecular Constraint Solver
13
 
14
+ This is a demonstration of a novel approach to *de novo* molecular generation. Instead of using a traditional generative model (like a VAE or GAN), this system translates chemical rules into a large Boolean Satisfiability (3-SAT) problem and solves it using a custom solver inspired by neuromorphic computing principles.
15
 
16
+ ### How it Works
17
+
18
+ The process involves two main stages:
19
+
20
+ 1. **Encoding**: User-defined chemical properties (molecular weight, number of aromatic rings, forbidden functional groups, minimum atom count) are compiled into a massive 3-SAT problem. This includes complex chemical intelligence like valence rules (e.g., Carbon must have 4 bonds) and graph connectivity, which are encoded using cardinality constraints.
21
+
22
+ 2. **Solving**: A memory-efficient, sparse solver inspired by P-KAS (Phase-Keyed Associative Storage) and Kuramoto oscillators finds a satisfying assignment for the tens of thousands of variables and clauses. This method finds a solution by relaxing into a stable state rather than through algorithmic search.
23
+
24
+ The key advantage is **generation by construction**. The output is guaranteed to satisfy the hard constraints, leading to a very high validity rate.
25
+
26
+ ### How to Use the Demo
27
+
28
+ 1. Use the sidebar on the left to set your desired molecular properties.
29
+ 2. **Crucially, set a "Minimum atom count" greater than 0** to avoid trivial solutions like H₂O. A value of 10-15 is a good starting point.
30
+ 3. Click the "Generate Molecules" button.
31
+ 4. Be patient. The encoding and solving process for such a large constraint problem can take 10-30 seconds per molecule.
32
+
33
+ ### Limitations & Current Status
34
+
35
+ This is a proof of concept and has several important limitations:
36
+
37
+ * **Graph Generation, Not Full Chemistry**: The solver's primary output is a **structural graph** of atoms and their connections. It does not yet solve for bond orders (single, double, triple).
38
+ * **Visualization**: The RDKit visualizer assumes all bonds are `SINGLE` for drawing purposes. This means that even if the solver finds a valid graph where an atom has the correct *number* of bonds, the drawing may appear chemically incorrect (e.g., a Carbon with four single bonds to two atoms). The atom labels (`ID:Element`) are provided to help you inspect the raw graph structure.
39
+ * **Approximate Solver**: The neuromorphic solver is a heuristic method that aims for very high satisfaction (99%+). It is not a formal, complete SAT solver and may not find a perfect 100% solution for extremely difficult or unsatisfiable problems.