Integrated Reasoning builds efficient computer processors that are tailored to the memory access patterns of Karp's 21 NP-complete problems. We’re making it 100x - 10,000x faster to perform computations like scheduling airline pilots or optimizing packing layouts for shipping containers.
David Cox is excited about building technology that empowers people to accomplish things that would otherwise be impossible. He believes that computers should extend, rather than attempt to replace, the capabilities of the human mind. David's best work includes a resource control system for iOS which computes and applies the best of 2.89 x 10^76 possible memory management policies faster than you can blink to ensure a snappy UX on over 1.5 billion Apple devices every day.
Problem:
Logistics is expensive.
Imagine you’re a shipping company. Every day, you need to pack 100,000 boxes into shipping containers. How many containers do you need? Which boxes go into which containers? A common solution to this problem is to run Google’s “OR-Tools” software in the cloud. This works, but it’s slow and the costs add up. Integrated Reasoning builds an alternative solution that is faster and cheaper.
Solution:
Integrated Reasoning provides hardware for solving optimization problems that can be quickly deployed in the cloud and scaled as needed. You don’t need any knowledge of hardware or firmware to use our products, and we provide generous support to make sure that the transition is smooth.
Reach out to us!
We’re working on a series of hardware products for optimization. We would love to hear from folks that work on scheduling, routing, packing, networks, or other optimization problems; even if you’re not sure if our hardware could help.
You can reach out to Brycen and David at hello@ir.design or find out more at ir.design.
Insanely fast silicon for NP-complete algorithms.
I founded Integrated Reasoning in December of 2021. I started working on the idea full-time as of March 2022.
Integrated Reasoning designs processors that are tailored to the memory access patterns of NP-complete algorithms. Think GPUs but for optimization and constraint satisfaction problems (e.g. the knapsack problem.)
Computing solutions to many NP-complete problems requires a massive amount of data transfer between the CPU and DRAM. Memory bandwidth is the bottleneck of modern computing, as discussed in "Hitting the memory wall: Implications of the obvious." [1]
The memory wall is such a critical problem that it motivated much of the design behind Apple's M1 architecture. See also this excellent 2017 article [2] by Brendan Gregg, who is widely known for his expertise in system performance engineering.
I believe Integrated Reasoning presents a win-win-win:
[1] Wulf, Wm A., and Sally A. McKee. "Hitting the memory wall: Implications of the obvious." ACM SIGARCH computer architecture news 23.1 (1995): 20-24. [2 ] https://www.brendangregg.com/blog/2017-05-09/cpu-utilization-is-wrong.html
Note: Integrated Reasoning does not aim to answer the famous P versus NP question.