diff --git a/Golden_Repo/m/METIS/METIS-5.1.0-GCCcore-11.3.0-IDX64.eb b/Golden_Repo/m/METIS/METIS-5.1.0-GCCcore-11.3.0-IDX64.eb
index 1a58a5a0933f76113ad56aeaa0281eecb88301b6..1919be341e179bf0460e17e8acd23e086d586baa 100644
--- a/Golden_Repo/m/METIS/METIS-5.1.0-GCCcore-11.3.0-IDX64.eb
+++ b/Golden_Repo/m/METIS/METIS-5.1.0-GCCcore-11.3.0-IDX64.eb
@@ -1,50 +1,30 @@
 name = 'METIS'
-
 version = '5.1.0'
-
 versionsuffix = '-IDX64'
-
 homepage = 'http://glaros.dtc.umn.edu/gkhome/metis/metis/overview'
 
 description = """METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes,
-
 and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the
-
 multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes.
-
 """
 
 toolchain = {'name': 'GCCcore', 'version': '11.3.0'}
-
 toolchainopts = {'pic': True}
 
 source_urls = [
-
     'https://src.fedoraproject.org/repo/pkgs/metis/metis-5.1.0.tar.gz/5465e67079419a69e0116de24fce58fe/'
 ]
-
 sources = [SOURCELOWER_TAR_GZ]
-
 patches = ['METIS-5.1.0-IDX64.patch']
-
 checksums = [
-
-    '76faebe03f6c963127dbb73c13eab58c9a3faeae48779f049066a21c087c5db2',  # metis-5.1.0.tar.gz
-
-    # METIS-5.1.0-IDX64.patch
-
+    '76faebe03f6c963127dbb73c13eab58c9a3faeae48779f049066a21c087c5db2',  
     '382337016508006671e5495652f25a7f835e56134681a21b0c8525b4b88ab99e',
-
 ]
 
 builddependencies = [
-
     ('binutils', '2.38'),
-
     ('CMake', '3.23.1')
-
 ]
 
 configopts = ['', 'shared=1']
-
 moduleclass = 'math'
diff --git a/Golden_Repo/m/METIS/METIS-5.1.0-GCCcore-11.3.0-RTW64-IDX32.eb b/Golden_Repo/m/METIS/METIS-5.1.0-GCCcore-11.3.0-RTW64-IDX32.eb
index 8a727942e044715d61346709d5a58ca714b59db7..4d4926823e3747949c2d702dd9c0fe261d0fd085 100644
--- a/Golden_Repo/m/METIS/METIS-5.1.0-GCCcore-11.3.0-RTW64-IDX32.eb
+++ b/Golden_Repo/m/METIS/METIS-5.1.0-GCCcore-11.3.0-RTW64-IDX32.eb
@@ -23,6 +23,7 @@ checksums = [
 ]
 
 builddependencies = [
+    ('binutils', '2.38'),
     ('CMake', '3.23.1')
 ]
 
diff --git a/Golden_Repo/m/METIS/METIS-5.1.0-foss-2022a.eb b/Golden_Repo/m/METIS/METIS-5.1.0-foss-2022a.eb
index 3f716841a413062f2139b7ad28b624aa6346e9a9..0e54b52a99d10729a14390b55df64a330fae36e2 100644
--- a/Golden_Repo/m/METIS/METIS-5.1.0-foss-2022a.eb
+++ b/Golden_Repo/m/METIS/METIS-5.1.0-foss-2022a.eb
@@ -2,9 +2,9 @@ name = 'METIS'
 version = '5.1.0'
 
 homepage = 'http://glaros.dtc.umn.edu/gkhome/metis/metis/overview'
-description = """METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes,
- and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the
- multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes."""
+description = """METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, 
+and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the 
+multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes."""
 
 toolchain = {'name': 'foss', 'version': '2022a'}
 toolchainopts = {'optarch': True, 'pic': True}
diff --git a/Golden_Repo/m/METIS/METIS-5.1.0-gpsmkl-2022a.eb b/Golden_Repo/m/METIS/METIS-5.1.0-gpsmkl-2022a.eb
index 2d92037e5d6af4150375d64271eeed58a89990d5..79d61669fa0f7c6b57b9248d1727b5b33565c2c8 100644
--- a/Golden_Repo/m/METIS/METIS-5.1.0-gpsmkl-2022a.eb
+++ b/Golden_Repo/m/METIS/METIS-5.1.0-gpsmkl-2022a.eb
@@ -2,9 +2,9 @@ name = 'METIS'
 version = '5.1.0'
 
 homepage = 'http://glaros.dtc.umn.edu/gkhome/metis/metis/overview'
-description = """METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes,
- and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the
- multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes."""
+description = """METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, 
+and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the 
+multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes."""
 
 toolchain = {'name': 'gpsmkl', 'version': '2022a'}
 toolchainopts = {'optarch': True, 'pic': True}