Looking for someone to expand my 3D a* pathfinding algorithm with Jump Point Search

Hello, I'm a game developer working on a 3D sci-fi game in lua. In this game I have a uniform grid of cells. I'm in need of an extremely fast pathfinding algorithm that can find the shortest path between two cells. I've already implemented a rather small a* pathfinder using a priority heap for open set insertion, but it's just not quite fast enough. I'm looking for someone to take my existing code and expand upon it with Jump Point Search for optimization. The code I have is small and easy to read and work with. This shows the massive speed up that can be made by properly implementing JPS into a* A*: [login to view URL] A* + JPS: [login to view URL] This is what I'm wanting. We'd also be in contact so I can clarify any questions regarding API in the environment I'm working in or other questions. Below I'll attach the files I've made so far that you'll be working with