OpenAI to Acquire Developer Tool Startup Pierre Computer, Targeting Microsoft's GitHub Code Hosting Business

Deep News
11/04

On November 4, OpenAI will acquire developer tool startup Pierre Computer, further expanding the capabilities of its Codex programming platform and launching a challenge to the code hosting market long dominated by Microsoft (ASX: MSFT)GitHub.

Some of Pierre Computer's technology is already being used in Codex, and OpenAI plans to further integrate its code storage functionality.

Financial terms of the deal have not been disclosed, and Pierre's existing open-source projects will remain open-source.

This acquisition means OpenAI is expanding from providing AI-assisted programming tools further into software development infrastructure areas such as code storage, review, and delivery.

As AI agents take on more and more programming tasks, the traditional GitHub platform designed for human developers is facing new competitive pressure.

Previously, Cursor launched its GitHub competitor Origin in August, and former GitHub CEO Thomas Dohmke also announced a competing product last month.

Earlier this week, OpenAI also unveiled a new technology called Pando, aimed at addressing the challenges brought by the surge in code generated by AI agents.

OpenAI said Pando has reduced the time required to push code changes by nearly 80%, and it is currently exploring ways to make the technology available to customers.

It is worth noting that Microsoft currently holds nearly a quarter equity stake in OpenAI, but competition between the two sides in the fields of AI and software development tools continues to expand.

This acquisition further demonstrates that OpenAI is trying to develop Codex from an AI programming assistant into a software development platform covering code generation, storage, review, and delivery.

免責聲明:投資有風險,本文並非投資建議,以上內容不應被視為任何金融產品的購買或出售要約、建議或邀請,作者或其他用戶的任何相關討論、評論或帖子也不應被視為此類內容。本文僅供一般參考,不考慮您的個人投資目標、財務狀況或需求。TTM對信息的準確性和完整性不承擔任何責任或保證,投資者應自行研究並在投資前尋求專業建議。

熱議股票

  1. 1
     
     
     
     
  2. 2
     
     
     
     
  3. 3
     
     
     
     
  4. 4
     
     
     
     
  5. 5
     
     
     
     
  6. 6
     
     
     
     
  7. 7
     
     
     
     
  8. 8
     
     
     
     
  9. 9
     
     
     
     
  10. 10