poolside

Our new foundation model

A model built specifically for the challenges of modern software engineering.

Your code & data

Fine-tune our model on how your business writes software, using your practices, libraries, APIs, and knowledge bases.

Your custom model

Your proprietary model that continuously learns how your developers write code. You become an AI company.

We're building foundation models, an API, and an Assistant to bring the power of generative AI to your developers

The poolside stack can be deployed to your own infrastructure. No data or code ever leaves your security boundary. Ideal for highly regulated industries like Financial Services, Defense, Technology as well as Retail, Tech and Systems Integrators.

Our flagship model

Introducing malibu, our biggest model built from the ground up for the most challenging software engineering problems

Train

malibu is trained using Reinforcement Learning from Code Execution Feedback, a novel approach to building AI models that improves performance in coding tasks.

Fine-tune

Your model ingests your codebases, documentation & knowledge bases to create a model that is uniquely suited to your dev teams & business.

Connect

poolside is deployed in your environment which allows you to securely and privately connect it to your data and tailor it to your needs.

Ship

Your model becomes a core part of accelerating your development teams and building better software, faster.

Code completion engine

Our code completion model, point, is fully integrated into the poolside stack and the fastest way to finish your sentences

1 million+ context window

for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'for (int i = 0; i < n; i++) { sum += arr[i]; } def fibonacci(n): return n if n <= 1 else fibonacci(n-1) + fibonacci(n-2) SELECT * FROM users WHERE age > 18 ORDER BY name addEventListener('click', (e) => console.log(e.target)) public static void quickSort(int[] arr, int low, int high) { std::vector<int> v; v.push_back(42); let result = array.filter(item => item > 10).map(item => item * 2); class Node { int data; Node next; } try { throw new Error('Oops!'); } catch (e) { console.error(e); } @app.route('/') def hello(): return 'Hello, World!'