Molten salt consisting primarily of eutectic LiCl-KCl is currently being used in electrorefiners in the Fuel Conditioning Facility at Idaho National Laboratory. Options are currently being evaluated for storing this salt outside of the argon atmosphere hot cell. The hygroscopic nature of eutectic LiCl-KCl makes is susceptible to deliquescence in air followed by extreme corrosion of metallic cannisters. In this study, the effect of occluding the salt into a zeolite on water sorption/desorption was tested. Two zeolites were investigated: Na-Y and zeolite 4A. Na-Y was ineffective at occluding a high percentage of the salt at either 10 or 20wt% loading. Zeolite-4A was effective at occluding the salt with high efficiency at both loading levels. Weight gain in salt occluded zeolite-4A (SOZ) from water sorption at 20% relative humidity and 40℃ was 17wt% for 10% SOZ and 10wt% for 20% SOZ. In both cases, neither deliquescence nor corrosion occurred over a period of 31 days. After hydration, most of the water could be driven off by heating the hydrated salt occluded zeolite to 530℃. However, some HCl forms during dehydration due to salt hydrolysis. Over a wide range of temperatures (320–700℃) and ramp rates (5, 10, and 20℃ min−1), HCl formation was no more than 0.6% of the Cl− in the original salt.

This paper gives two graph-based algorithms for radioactive decay computation. The first algorithm identifies the connected components of the graph induced from the given radioactive decay dynamics to reduce the size of the problem. The solutions are derived over the precalculated connected components, respectively and independently. The second algorithm utilizes acyclic structure of radioactive decay dynamics. The algorithm evaluates the reachable vertices of the induced system graph from the initially activated vertices and finds the minimal set of starting vertices populating the entire reachable vertices. Then, the decay calculations are performed over the reachable vertices from the identified minimal starting vertices, respectively, with the partitioned initial value over the reachable vertices. Formal arguments are given to show that the proposed graph inspired divide and conquer calculation methods perform the intended radioactive decay calculation. Empirical efforts comparing the proposed radioactive decay calculation algorithms are presented.