Probably not. Bog randomly generates each board. With 16 dice, there are 16 factorial times 6 possible boards (125 trillion), but this calculation counts identical boards repeatedly. For extra credit, feel free to calculate the actual number of possibilities.
Yes, though the dictionary is stored in a lossy format, which sometimes gives credit for non-existent words.
Bog stores the word list in a Bloom Filter. This allows the word list to be compressed to a small size, but leaves open a small probability of false positives (approximately 2%). While this could potentially be used for cheating, it would require an enormous number of words to be entered to acheive any substantial rewards.
Several years ago, I worked on a Java application for measuring the acidity of peat bogs. This application was distributed under the namespace net.healeys.reverend.bog. Needless to say, if I put Bog under the same namespace, there would be collision problems if I ever attempted to merge the functionality of the two applications, so I just gave bog its own namespace.