I am fairly certain that there's no known diagrammatic proof of the uniqueness of prime decompositions. That answers the "who is it due to?" question.
Of course, a diagrammatic argument may still be out there, waiting to be discovered. But, echoing Ryan's comment, I expect that line of argument to be very difficult, for the following reason.
Suppose you're looking at a diagram $D(K)$ of some composite knot. Perhaps the diagram even shows $K$ to be a connected sum in some fashion. The crux of what you need to show is that there is no alternate prime decomposition besides the one you see. In other words, you would need to show that any prime decomposition of $K$ is visible in some (suitably nice) diagram.
At present, the Jones polynomial and its relatives are only known to place strong restrictions on diagrams for certain classes of knots and links. These include alternating links (where everything is easiest) and, to a smaller extent, adequate and semi-adequate links. It's conjectured that if a semi-adequate knot is composite, every semi-adequate diagram must also be composite -- and that conjecture is probably within reach. (See this paper by Ozawa, as well as Problem 10.76 in this book.) ButHowever, any solution is likely to involve essential surfaces, which you want to avoid. Furthermore, the semi-adequate setting is essentially as far asthe limit of where current knowledge about Jones-type invariants can reach diagrammatic information.
Without these invariants, you find yourself looking at problems like the additivity of crossing number, which are known to be devilishly hard. In particular, if the additivity conjecture does get solved, the solution would surely involve something beyond purely diagrammatic methods.