Iacob is a speedcubing method invented by me in February 2023. It relies heavily on algorithms but also on intuition, making this a likable and fast method.
Steps
Solve EO and build a (pseudo) face on the D layer without the DFR corner (EoFace-1C / EoVFace)
The first thing you need to do is to orient the edges. This might seem complicated at first but it’s actually really easy and should only take around 5 moves. Next, you need to make the PseudoFace (intuitively; the side colors don't have to match) without the DFR corner on the bottom of the cube.
Solve the E layer (Belt)
The second step is pretty easy and intuitive. If you ask me, the best way to solve the belt is by using keyhole since you don’t have the DFR corner in place.
Insert the DFR corner while orienting the top layer corners (CLS)
The best thing to do here is to learn the CLS algs set. It has over 100 algorithms (104) and inserts the DFR corner while orienting the top layer corners.
Fix parities and permute the last & first layers.
In this step you need to permute the first and last layers. Since this is a “belt-based method” parities may appear. Fortunately, you only need to remember and do 3 moves in order to fix them: M2 U2 M2. After you corrected the parity error (or didn’t have parities), you can use PLL on the last layer and then rotate and use PLL again to permute the first layer, or you can just do PLL + IPFL. Another way would be to 1-look this step, though you would have to learn a huge amount of algorithms.
Daylen Hall Variant
(aka The Horrormusician Variant; from speedsolving.com)
Solve EoFace-1C
Solve 3-Quarter Belt
Path A - Make a pseudo pair with the remaining corner and belt edge, then use Winter Variation (27 algorithms) to insert the pair while orienting the top layer.
Path B - Do WV or SV to insert your last pair.
Do step 4 as normal. (PLL and IPFL).
Steps Preview
(use the arrows to view the next image)
Tutorials
(official tutorial)
(tutorial made by The Horrormusician)
Improvements
1-Look the last step
Combine the first two steps to lower the move count
Other
10 seconds solve by Daylen Hall (D.H. variant)
30 seconds solve by Jacob Hughes (? variant)
Original PDF (removed)
Important details
(added 27.11.2023)
This is the first and the only method I have made.
The method in it's current state isn't really good, and sadly it can not achieve its full potential without having to learn an algorithm set that permutes both the UP and DOWN layers at the same time (PBL).