Can Rainbow Servant be combined with Versatile Spellcaster and Spontaneous Divination to cast all Cleric spells spontaneously?

A ridiculous idea has occurred to me and I’m looking to verify if really works. Consider the following build:

  • Wizard 5/Rainbow Servant 10 (a class from Complete Divine)
  • At Wizard 5, take Spontaneous Divination from Complete Champion so that you qualify for Versatile Spellcaster from Races of the Dragon.
  • Take Versatile Spellcaster at some point.
  • At Rainbow Servant 10, you gain access to the entire Cleric spell list.
  • Put together, Versatile Spellcaster and Rainbow Servant 10 should let a Wizard cast spontaneously from the entire Cleric spell list.

This gives me two questions, the first as a focus and the second as a supplemental:

  1. Does this actually work? My first objection is that I’m not quite sure if the Wizard automatically knows all of the Cleric spells at Rainbow Servant 10. If you have to record them in your spellbook, you’ll soon run out of gold.
  2. If this does work, can the "powerful non-Diviner spellcaster class that can also cast spontaneously from the entire Cleric spell list" idea be done better? The term "Rainbow Warake" seems to be in my memory.

Problem Creating Rainbow Table

I’m taking a security course and I’m working on a project where I have to use password cracking tool. I’m using Rainbowcrack tool for password cracking to create Rainbow Tables but I get this error message when I try to generate the tables.

“can’t create file md5_loweralpha#1-7_0_1000x1000_0.rt”

This is the command I used:

rtgen md5 loweralpha 1 7 0 1000 1000 0

Here is a screenshot: Screenshot that shows the error message I get when creating Rainbow Tables

I don’t know what’s the problem, I really need your help. Thank you.

Is there a difference between a rainbow table and a dictionary attack?

I’m trying to learn a bit more about the different types of attacks but as far as I understand it, a rainbow table is a large collection of prehashed data which is the compared to hashed data gathered from a target. A dictionary seems very similar but I’m struggling to find anything that can specify the differences between the two, if there are any.

Many thanks!

Anonymizing IP addresses using (sha) hashes; how to circumvent rainbow table attacks?

Under GDPR, IP addresses are personal data. I have no need to trace back IP to specific users, but I would like to limit downloads to 1 per IP*. I do not want to store plain IPs.

First “solution”/idea would be to hash the IP. I could store the hash 12ca17b49af2289436f303e0166030a21e525d266e209267433801a8fd4071a0. Problem: hashing all 4294967296 possible IP addresses is simple, and someone will easily find that 127.0.0.1 is the stored IP.

Adding salt holds the same problem, you can calculate all the IPs again with this salt and arrive at the same problem.

Is there a solution for this?

* Use case here is simplified, please do not comment on reasons why I want this 😉

Rainbow flare effect on Industar 50-2

I am reproducibly getting the kind of rainbow-streak flare seen in the attached image on my copy of the Industar 50-2 (a russian 50mm f3.5 tessar-ish M42 pancake). The pattern does rotate when focusing the lens (which has a rotating front element).

Shot wide open, on a 24MP Sony APS-C, no post except scaling down

Is this an effect inherent to the Industar design or manufacturing process, or a lucky manufacturing defect, or an acquired defect, and what is optically happening here?

There is no recognizable damage to the optics, nor are there notable performance problems with this copy.

Not looking for advice on fixing or avoiding the effect since it seems quite useful – if anything, looking for advice on how not to accidentally fix it.

Necessary Conditions for a Graph not possible to Rainbow Color?

Suppose we have a $ t$ -uniform hypergraph ($ t \ge 3$ ) $ G$ , and have $ v \ge t$ colors available. A question in my research is equivalent to asking what the necessary and sufficient conditions are on $ G$ for which no possible vertex coloring of $ G$ has every edge rainbow colored. As long as there exists some edge that is not rainbow for every possible coloring of $ G$ , that’s enough.

A sufficient condition I’ve determined is if $ v = t$ and $ G$ contains 3 distinct edges $ E_1, E_2, E_3$ for which $ |E_1 \cap E_2| \ge t/2$ and $ E_3$ contains the symmetric difference of $ E_1, E_2$ , it is not possible to have all $ E_1, E_2, E_3$ be rainbow, and the argument is simple. However, this is not a necessary condition, as other examples of $ G$ can be formed. I don’t even know of a sufficient condition for when $ v = t+1$ , or of all necessary conditions even when $ v = t = 3$ .

Has this problem been studied before?