In that case, then all three software packages should agree within a certain tolerance...since all three are supposedly running the same basic algorithm (Buhlmann with Gradient Factors) and all three probably started with Eric Baker's FORTRAN code.
Just as I would expect an unmodified VPM-B and RGBM profile to be pretty close to each other (since they're almost the same algorithm...both based on the original VPM), I would expect various Buhlmann algorithms to be similar.
Redundancy in computing applications requires a minimum of three computers running the same algorithm. The system is fine as long as all three agree within tolerance. When one starts to diverge, it is singled out as a "bad" computer. This is evident in the way airplanes crossed the ocean before GPS (triple Inertial Navigation Units). It is also evident in the Space Shuttle navigation system. Three primary computers running the same algorithm. When one diverges out of tolerance, a fourth running the same algorithm is brought into comparison with the two "good" computers, assuming they are both good since they match. If the new computer doesn't match the other two, a fifth computer is brought in, but it is running a different software package that should return the same information as the first four. The true "bad" computer is singled out by comparison.
As such, regardless of the profile, when two computer algorithms (based on the same equations) compute one solution and a third computes a different solution, the most likely problem is with the one that is different (thank you Occam).
But thank you for confirming that people don't care because "it's not a profile *I'd* ever dive!"
Phil K., I'll send it to JJ and see what he says.