How does Ruby optimize constant lookup using cache invalidation strategies?

Ruby caches resolved constants and invalidates them when module structure changes.

Constant lookup is expensive due to nested module resolution. Ruby caches resolved constants with versioning per module/class. When a module is reopened or modified, cache is invalidated globally or per scope. This allows fast repeated constant access while preserving correctness in dynamic environments.