feat(fibonacci): add Plutarch 1.10.1 submission by SeungheonOh

Cherry-picked Plutarch fibonacci submission from PR #28:
- CPU units: 159,193,455,218
- Memory units: 583,897,822
- Script size: 50 bytes
- Implements fibonacci using fix point combinators

Author: Unisay

submissions/fibonacci/Plutarch_1.10.1_SeungheonOh/README.md

@@ -0,0 +1,25 @@
+# Benchmark Implementation Notes
+
+**Scenario**: `fibonacci`
+
+**Submission ID**: `Plutarch_1.10.1_SeungheonOh`
+
+## Implementation Details
+
+- **Compiler**: `Plutarch v1.10.1`
+- **Implementation Approach**: `recursive`
+- **Compilation Flags**: N/A
+
+## Performance Results
+
+- See [metrics.json](metrics.json) for detailed performance measurements
+
+## Reproducibility
+
+- **Source Available**: true
+- **Source Repository**: N/A
+- **Compilation Config**: describe any non-default parameters
+
+## Notes
+
+I provided two different fix point combinator: `pfix'` and `pfix''`. They have different performance trade offs. `pfix'` will generate smaller script with bigger CPU and Memory cost while `pfix''` will generate bigger script(in terms of size) with smaller CPU and Memory cost.

submissions/fibonacci/Plutarch_1.10.1_SeungheonOh/config.json

@@ -0,0 +1,6 @@
+{
+  "comment": "Optional: Include compilation parameters that affect UPLC output",
+  "optimization_flags": [],
+  "compiler_settings": {},
+  "build_environment": {}
+}

submissions/fibonacci/Plutarch_1.10.1_SeungheonOh/fibonacci.uplc

@@ -0,0 +1,40 @@
+(program
+  1.1.0
+  [
+    [
+      (lam i-0 [ i-0 i-0 ])
+      (lam
+        i-1
+        (lam
+          i-2
+          (force
+            (case
+              (constr
+                0
+                [ [ (builtin lessThanEqualsInteger) i-2 ] (con integer 1) ]
+                (delay i-2)
+                (delay
+                  [
+                    [
+                      (builtin addInteger)
+                      [
+                        [ i-1 i-1 ]
+                        [ [ (builtin subtractInteger) i-2 ] (con integer 1) ]
+                      ]
+                    ]
+                    [
+                      [ i-1 i-1 ]
+                      [ [ (builtin subtractInteger) i-2 ] (con integer 2) ]
+                    ]
+                  ]
+                )
+              )
+              (force (builtin ifThenElse))
+            )
+          )
+        )
+      )
+    ]
+    (con integer 25)
+  ]
+)

submissions/fibonacci/Plutarch_1.10.1_SeungheonOh/metadata.json

@@ -0,0 +1,27 @@
+{
+  "compiler": {
+    "name": "Plutarch",
+    "version": "1.10.1",
+    "commit_hash": "75c06ef1e77742916574414975f76ddac59cce4a"
+  },
+  "compilation_config": {
+    "optimization_level": "Plutarch",
+    "target": "uplc",
+    "flags": ["Plutarch"],
+    "environment": {
+      "dependencies": {
+        "plutarch": "1.10.1"
+      }
+    }
+  },
+  "contributor": {
+    "name": "Seungheon Oh",
+    "organization": "IOG",
+    "contact": "seungheon.oh@iohk.io"
+  },
+  "submission": {
+    "date": "2025-08-19T00:00:00Z",
+    "source_available": true,
+    "implementation_notes": "Plutarch"
+  }
+}

submissions/fibonacci/Plutarch_1.10.1_SeungheonOh/metrics.json

@@ -0,0 +1,15 @@
+{
+  "execution_environment": {
+    "evaluator": "PlutusTx.Eval-unknown"
+  },
+  "measurements": {
+    "cpu_units": 159193455218,
+    "memory_units": 583897822,
+    "script_size_bytes": 50,
+    "term_size": 43
+  },
+  "notes": "<optional notes>",
+  "scenario": "fibonacci",
+  "timestamp": "2025-08-20T05:56:42Z",
+  "version": "1.0.0"
+}

submissions/fibonacci/Plutarch_1.10.1_SeungheonOh/source/.gitkeep

@@ -0,0 +1 @@
+# Optional: Place your source code files here

submissions/fibonacci/Plutarch_1.10.1_SeungheonOh/source/fibo.hs

@@ -0,0 +1,42 @@
+module Main where
+
+import Control.Lens (traverseOf)
+import Plutarch.Internal.Term (compile, punsafeCoerce)
+import Plutarch.Prelude
+import Plutarch.Script
+import PlutusCore (FreeVariableError, runQuoteT)
+import PlutusCore.Pretty
+import UntypedPlutusCore (
+  fakeNameDeBruijn,
+  progTerm,
+  programMapNames,
+  unDeBruijnTerm,
+ )
+
+-- this is faster than `Plutarch.Internal.Fix.pfix`.
+pfix' :: (Term s (a :--> b) -> Term s (a :--> b)) -> Term s (a :--> b)
+pfix' f =
+  (plam $ \r -> (punsafeCoerce r) # r)
+    # (plam $ \r -> f ((punsafeCoerce r) # r))
+
+-- this is faster than `pfix'` but generates more bloat uplc.
+pfix'' :: (Term s (a :--> b) -> Term s (a :--> b)) -> Term s (a :--> b)
+pfix'' f =
+  (plam $ \r -> f ((punsafeCoerce r) # r))
+    # (plam $ \r -> f ((punsafeCoerce r) # r))
+
+pfibo :: Term s (PInteger :--> PInteger)
+pfibo =
+  pfix' $ \r -> plam $ \x ->
+    pif (x #<= 1) x (r # (x - 1) + r # (x - 2))
+
+main :: IO ()
+main =
+  case compile mempty $ pfibo # 25 of
+    Left _ -> error "compiliation failed"
+    Right (Script s) ->
+      case runQuoteT $
+        traverseOf progTerm unDeBruijnTerm $
+          programMapNames fakeNameDeBruijn s of
+        Left (_ :: FreeVariableError) -> error "debruijn conversion failed"
+        Right s' -> print $ prettyPlcClassic s'