How computer science and graph theory eliminate circular payments so your group settles in up to 83% fewer transfers.
The Problem We Solve: In a group of 5 friends on a road trip, 15 different expenses can easily generate 10 to 12 overlapping, circular debts. Contri computes the minimum cash flow graph so everyone is squared away in just 2 or 3 direct payments.
Imagine three flatmates: Aman, Rohan, and Vikram:
Without simplification, this requires 6 separate bank transfers back and forth. Aman sends money to Rohan, Rohan sends money to Vikram, and Vikram sends money to Aman. It’s dizzying, fees add up, and people forget.
Contri ignores the messy web of individual micro-debts and looks only at the Net Balance of each individual:
Net Balance = (Total Money Paid) - (Total Fair Share Consumed)
Using our previous example:
Instead of 6 transactions, Contri's algorithm produces a single, elegant instruction:
Single Transfer Solution: Vikram pays Rohan ₹300. Done. Aman does nothing. 6 payments become 1.
Mathematically, this is modeled as a directed debt graph. Finding the absolute minimal number of edges in a debt network is related to the Subset Sum problem (which is NP-complete).
Contri runs an optimized Greedy Flow Network Matching Algorithm in real-time on your mobile device:
This reduces typical group settlement overhead from O(N²) chaotic payment notifications down to at most N - 1 clean transfers.
Many older apps (like Splitwise) treat debt simplification as an expensive "Pro" luxury. When you don't pay their monthly fee, they intentionally leave debts complicated and unsimplified to incentivize upgrades.
At Contri, we believe math should be free. Group friendships shouldn't suffer from avoidable financial confusion. Contri provides full, unrestricted debt simplification on every group, completely free, with zero ads.