Find open source projects actively accepting contributors. Search repositories, filter by program milestones, difficulty tags, or tech stack.
Use our Orbit AI Matcher to find out! Get instant matching scores based on your developer skills, preferred frameworks, and contribution experience.
Convert your selected open-source project into a winning GSoC, LFX, or Outreachy application using Proposal Studio.
<p>The SunPy database module enables users to manage files on a disk, or a network hosted database. Users can find files by using physical parameters such as wavelength, time etc. or by using attributes such as instrument name. Queries can also be combined to form complex queries.</p> <p>The first part of the project would involve making several modifications to the database module used by SunPy to integrate the Fido interface with the database which will enable users to use only the Fido to make queries, instead of making separate queries for separate clients like VSO, LightCurve etc.</p> <p>The second part involves improving the caching mechanism to enable query result based caching instead of the current query based caching.</p>
<p>There are several key features missing in Sage for modular abelian varieties. The goal of this project is to implement as much as possible. I will start with functions related to l-series and homology classes that currently raise a NotImplementedError. Then I will implement as much as possible from 16.5 of the <a href="https://magma.maths.usyd.edu.au/magma/overview/2/17/16/" target="_blank">Magma documentation</a>.</p>
This project focuses on improving the Geometry Verification and Validation (V&V) GUI in Qt for the Arbalest application in BRL-CAD. Currently, the prototype GUI provides basic validation output but has several usability limitations such as truncated full-path display, flat result presentation, and limited export options for validation results. These issues make it difficult for users to clearly interpret geometry validation outcomes. In this project, I plan to improve the usability and clarity of the existing V&V GUI by restructuring how validation results are displayed, fixing the full-path column visibility issue, and adding grouped result visualization for easier navigation. I will also implement a downloadable validation report feature that allows users to export results in structured formats such as TXT or JSON, making validation outputs easier to review and share. The expected deliverables include updating the existing V&V GUI implementation to work with the current Arbalest codebase, improving the results panel layout based on a proposed UI mockup, and adding a report generation module integrated into the GUI workflow. These improvements will make the validation interface more practical and user-friendly while keeping the scope aligned with the current prototype architecture.
The Programs & Events Dashboard tracks editing activity across thousands of Wikimedia programs, but generating a system-wide picture of that impact remains manual and resource-intensive. WMF staff must stitch together per-campaign exports to answer basic questions like "How many total edits have all programs produced this year?" — there is no single place to see the Dashboard's global impact. This project builds that infrastructure in three layers. First, a SystemStat model and SystemStatUpdateWorker (Sidekiq) that computes and caches daily snapshots of global metrics - total edits, pageviews, articles improved, new and retained editors, and per-wiki breakdowns, so that all aggregations are pre-computed and never run on-demand against the full dataset. Second, an asynchronous system-wide CSV export pipeline that allows admins to request a download of all non-private program data, generated in the background and delivered via notification when ready - handling the full data scale without memory exhaustion. Third, a React-based "System Stats" admin dashboard that visualizes global trends, wiki distributions, and editor retention over time, backed by a JSON API endpoint for direct consumption by the WMF Community Data and Evaluation team. Deliverables: SystemStat model + daily background worker; admin-only async CSV export pipeline; "System Stats" React dashboard with trend charts and retention metrics; public JSON API with date-range filtering; full RSpec/Jest test coverage; and end-user documentation for WMF staff.
This project focuses on improving how relational triples are extracted from Hindi Wikipedia text for the DBpedia Hindi chapter. Currently, most structured data comes from infoboxes, while a large amount of useful information in free text remains unused. Existing approaches either rely on prompts, which are inconsistent, or rule-based systems that cannot handle the variety of Hindi sentence structures. There is also no proper system to use human feedback to improve results over time. To address this, I will fine-tune a small language model specifically for Hindi triple extraction, with a focus on correctly identifying predicates. The system will also include a layer that maps extracted relations to DBpedia ontology properties, ensuring compatibility with the knowledge graph. A simple interface will be built to allow users to review, correct, and improve extracted triples, creating better training data over time. The final outcome will be a working pipeline that extracts structured triples from Hindi text, a feedback system for continuous improvement, and a dataset of validated triples. This will help improve the coverage and quality of the Hindi DBpedia knowledge graph.
When an IPsec-encrypted packet matches a trap policy in the kernel, the kernel notifies IKE daemon (Pluto) via an ACQUIRE Netlink message. Then Pluto identifies that to which connection does this packet belong to by doing a lookup through all the loaded connections. Currently this is done in O(N) time (scanning through all the connections and the connection with highest priority is choosen). This Project aims to reduce this by using a hashtable to find the connection by using a unqiue id which is passed to the kernel while installing the policy. A complication arises with Opportunistic IPsec. Multiple clones of the same template connection would inherit the same reqid, causing collisions both in the hashtable and in the kernel's SA binding. This is addressed by a global counter that assigns a guaranteed unique reqid to each clone of the template connection. The deliverables would be the following , 1.Unique id placed in the policy before sending it to the kernel. 2.ACQUIRE lookup path using the hashtable 3.Guaranteed unique reqid for opportunistic connection clones via a global counter. 4.Display of the reqid in the status as well. 5. New Tests for functional testing and updating the current testsuites.c
XRefer is a binary analysis tool built by Mandiant FLARE that uses cross-reference correlation, capa integration, and LLM-powered cluster analysis to help malware analysts navigate complex binaries faster. Today it requires IDA Pro, Binary Ninja, or a configured Ghidra environment to run, locking out students and researchers who lack commercial licenses or heavyweight setups. This project implements a fully functional Radare2 backend for XRefer via the r2pipe Python bindings, paired with a standalone CLI that auto-detects the best available disassembler and falls back to Radare2 when none are found. Radare2 is free, open-source, cross-platform, and pip-installable, making it the right foundation for democratizing XRefer access. The backend maps every method of the BackEnd abstract base class to verified r2pipe commands, handles known r2 edge cases including the aflj NaN-value bug and pdfj integer overflow, and includes targeted refinements to the base abstraction layer. Deliverables are: a complete Radare2 backend module passing integration tests against the Ghidra backend on a three-binary reference corpus; a standalone CLI installable with pip; a test suite with pre-recorded JSON fixtures enabling CI without a live r2 installation; and full documentation covering setup, architecture, and guidance for adding future backends.
The goal of this project is to create a more efficient immutable list in Scala. In order to do this, we intend to use block-based arrays, to improve cache locality and reduce pointer chasing. This approach will help to address performance issues with traditional linked lists.
This project aims to develop a Python library that abstracts multiple RDF triplestore systems into a unified, developer-friendly interface. By standardizing how applications interact with different SPARQL backends, the library will simplify the use of semantic web technologies and promote greater flexibility in backend selection. The work will involve comparative research on triplestore architectures, performance benchmarking, and the design of an extensible abstraction layer. Deliverables include a well-documented codebase, performance analysis, and integration of four triplestore systems, supported by real-world testing and usage examples.
etcd is a distributed key-value store that serves as the backbone for Kubernetes and other cloud-native systems, storing critical configuration and state data. However, at scale, multiple applications constantly querying etcd for current state and watching for changes can overload the server and create expensive catch-up scenarios for slow subscribers. This project developed an experimental caching solution that brings Kubernetes' proven watch cache pattern to any infrastructure project without depending on the Kubernetes codebase. Core Components: (1) Watch Demultiplexer: Consolidates multiple client watch subscriptions into a single upstream etcd connection, then broadcasts events to all subscribers, reducing server load; (2) Event History Buffer: Maintains an append-only ring buffer of recent watch events, enabling lagging watchers to catch up from local history rather than reopening expensive upstream watches; (3) B-Tree State Mirror: After an initial snapshot, builds and maintains an in-memory B-Tree of current key/value state, applying watch events incrementally for fast range queries and lookups; (4) Point-in-Time Snapshots: Preserves historical B-Tree snapshots in a ring buffer, allowing exact stale reads at specific revisions without hitting etcd; (5) Resilient Control Loop: Handles initialization, upstream errors, compaction events, and automatic cache rebuilding with proper client notification.
The project tackles inefficiencies in API contract testing for microservices, focusing on schema management, validation, and consistency across distributed systems, which often cause bugs and delays due to fragmented schemas and poor versioning. I propose enhancing Keploy’s contract testing by implementing local schema storage as a mock registry, unifying schemas into a single service contract, adding advanced comparison with dependency resolution and real-time validation, and introducing provider-driven testing with contract publishing and rollback capabilities. My solution builds on a Go-based prototype, utilizing tools like Cobra, YAML, and Docker, with extensibility to S3. Deliverables include an integrated CLI with versioning and multi-format support, schema merging with diffing and real-time validation, and a provider-driven testing framework with rollback, all supported by comprehensive documentation and tests. This will streamline microservice interactions, ensuring scalability and consistency for developers.
Mifos X and Apache Fineract are widely used by financial institutions of all different sizes and methods around the world. This project is focused on testing the security of the Mifos X platform. Under the guidance of Godfrey Kutumela, the 175-hour project will utilize both Static Application Security Testing (SAST) and Dynamic Application Security Testing (DAST) scanning. These comprehensive testing methods will scrutinize the platform's security layers, uncovering vulnerabilities and providing insights for enhancement. The initiative will contribute to reinforcing the platform's defenses, ensuring that Mifos X remains a trusted option for its users, especially businesses that rely on it for financial services.
The aim of the project is to implement launching of chapters incrementally and sequentially, to avoid the large time gap when publishing a topic as a whole. The curriculum admins can stay updated with the chapter publication notifications, and the learner can also identify the upcoming and newly published chapters, as well as subscribe to the new launches in a topic.
In this project, we aim to implement piecewise function on the polyhedral complex for general purpose for SageMath. Generally, this project should achieve efficient symbolic and numerical evaluation of piecewise functions given sub-domains and functional coefficients provided by users. Considering the computational complexity, efficient piece searching algorithm should also be designed, especially for the case of a large number of pieces being provided. Besides general purposes, improvements would also be considered with specific purposes, if provided, of piecewise linear function including but not limited to approximation, evaluation of definite integrals, and regression. Lastly, the whole project should be compatible and communicate well with other objects in SageMath.
On Perfetto, users can get brilliant insights into the performance of applications through trace visualizations and metrics. Recently, core web vitals shaped a different view of a smooth website by bringing the Interaction to Next Paint metric to the light. Therefore, there is a need to update the Perfetto with the latest revolutionary metrics to provide better and faster insights to the developers of their web applications. The goal of this project is to improve the Perfetto tracing tool and visualize the core web vital metrics and INP in a consistent manner. Make Perfetto Perfect!
<p>CGAL’s Axis-Aligned Bounding Box Tree is an acceleration structure which speeds up common tasks such as collision-detection. It is used both directly and throughout other packages in the library, so any performance improvements made to this package will pay dividends elsewhere. The package has already been a major target of performance optimization, but one approach that hasn’t yet been fully explored is the use of SIMD, a type of parallel computation where the processor operates on several data values at a time. The introduction of SIMD optimizations to the AABB tree has the potential to substantially improve performance by better taking advantage of the capabilities of modern computer processors.</p>
<p>HA-Auto is a Domain Specific Language (DSL) based on the model interpretation paradigm, that enables users to program complex automation scenarios, for connected IoT devices, that go beyond simple automation rules. To make HA-Auto even easier to use, the language has been integrated in Node-RED’s flow-based low-code environment.</p>
<p>Salt offers a nice wrapper around libvirt. However the migration functions are calling virsh and not exposing all options. This project is about rewriting the salt migration functions to use the python-libvirt API, but also to expose as much as possible of the libvirt migration options.</p> <p>Salt also allows users to describe the guests using a state. Once the migration functions are exposed, the virt.running state would need to be modified to handle migrating the guest to another host.</p>
<p>The Data Retriever is a package manager for data. The Data retriever automatically finds, downloads and pre-processes publicly available datasets and it stores these datasets in a ready-to-analyse state. The Data Retriever handles tabular data and spatial data forms. The goal of the project is to add support that will enable the Data Retriever platform to have the capability of ingesting other forms of raw data. The project will introduce the support for raw data formats of XML, JSON, NetCDF, HDF, Excel, SQlite and Geojson data sources.</p>
<ul> <li>RDKit is a collection of cheminformatics and machine learning tools written in C++ and Python. Which is more important, it allows you to work with many representations of chemical data and has a power to extract almost each chemical descriptor from the data you have. An added functionality to this would be to be able to find chemical insights from the molecules. This includes being able to find properties of the molecules which are required quite often.</li> <li>This project aims to add using trained neural networks for property prediction of molecules. Quantum Chemical calculations / Molecular Dynamics / Monte Carlo Simulations for finding out molecular properties have proven to be extremely time consuming and alternate “Neural Network Potentials” have been proposed instead. I aim to add property prediction NNPs like ANI which provide accuracy comparable to Quantum Mechanical Approaches like Density Functional Theory / MD / MC but do the job in a fraction of the time to the existing ML package of RDKit. Having a dependable and accurate tool as a part of the library would remove a significant bottleneck from the pipeline.</li> </ul>
<p>The project aims to parse numbers written in natural language. This needs to be done while keeping incorporation with dateparser and price-parser in mind. We also need to provide support for multiple languages.</p>
<p>Parallelism is used to improve performance. In sequential languages, parallelism is introduced with parallel constructs. However, it doesn’t come without a downside. Early outlining by the frontend is preventing existing optimization passes. The intent is to enhance and improve the existing “OpenMPOpt” optimization pass, thus improving performance of parallel programs.</p>