distributed cracking: relation between -s/-l value and Restore.Point value when cracked

[ytbe.use3]

Sure. So, you say that, dividing as you described here https://hashcat.net/forum/thread-6448-po...l#pid34346 will make sure that only one of the nodes cracks the password. Right?

Yes, but only if the password matches the mask.

Thank you. Got it! Also, is my assumption about dividing the keyspace unevenly which also makes sure that the password is cracked by only one node true? (off course, again if password matches mask). 

Sorry if I am being over cautious, as I do not know how internal implementations are done and wanted to make sure before I use it within my project.