feat: add Plinth factorial submission

- Create complete factorial submission for Plinth 1.52.0.0
- factorial.uplc program computing factorial(10) = 3628800
- Performance metrics: 5.86M CPU units, 21.7K memory units
- All validation checks pass
- Source code included in submission

Author: Unisay

submissions/factorial/Plinth_1.52.0.0_Unisay/README.md

@@ -0,0 +1,32 @@
+# Benchmark Implementation Notes
+
+**Scenario**: `factorial`
+
+**Submission ID**: `Plinth_1.52.0.0_Unisay` (Format: `Language_Version_GitHubHandle`)
+
+## Implementation Details
+
+- **Compiler**: `Plinth 1.52.0.0`
+- **Implementation Approach**: `recursive`
+- **Compilation Flags**: Standard Plinth (PlutusTx) optimization flags
+
+## Performance Results
+
+- See [metrics.json](metrics.json) for detailed performance measurements
+- **Result**: `factorial(10) = 3628800` ✓
+- **CPU Units**: 5,859,917
+- **Memory Units**: 21,751
+- **Script Size**: 37 bytes
+
+## Reproducibility
+
+- **Source Available**: `true`
+- **Source Repository**: https://github.com/IntersectMBO/UPLC-CAPE
+- **Compilation Config**: Targeting Plutus Core 1.1.0 with standard PlutusTx plugin configuration
+
+## Notes
+
+- Uses recursive factorial implementation: `factorial(n) = if n <= 0 then 1 else n * factorial(n-1)`
+- Much more efficient than fibonacci due to linear recursion vs exponential
+- Compiled with PlutusTx plugin targeting Plutus Core 1.1.0
+- Source code available in the `plinth/src/Factorial.hs` module

submissions/factorial/Plinth_1.52.0.0_Unisay/config.json

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

submissions/factorial/Plinth_1.52.0.0_Unisay/factorial.uplc

@@ -0,0 +1,26 @@
+(program
+  1.1.0
+  [
+    [
+      (lam s-0 [ s-0 s-0 ])
+      (lam
+        s-1
+        (lam
+          n-2
+          (case
+            [ [ (builtin lessThanEqualsInteger) n-2 ] (con integer 0) ]
+            [
+              [ (builtin multiplyInteger) n-2 ]
+              [
+                [ s-1 s-1 ]
+                [ [ (builtin subtractInteger) n-2 ] (con integer 1) ]
+              ]
+            ]
+            (con integer 1)
+          )
+        )
+      )
+    ]
+    (con integer 10)
+  ]
+)

submissions/factorial/Plinth_1.52.0.0_Unisay/metadata.json

@@ -0,0 +1,29 @@
+{
+  "compiler": {
+    "name": "Plinth",
+    "version": "1.52.0.0",
+    "commit_hash": "800c67d38d01177fd0a36d01aa23ff7fea7bd1ba"
+  },
+  "compilation_config": {
+    "optimization_level": "Plinth",
+    "target": "uplc",
+    "flags": ["Plinth"],
+    "environment": {
+      "dependencies": {
+        "plutus-tx": "1.52.0.0",
+        "plutus-core": "1.52.0.0",
+        "plutus-ledger-api": "1.52.0.0"
+      }
+    }
+  },
+  "contributor": {
+    "name": "Unisay",
+    "organization": "UPLC-CAPE Project"
+  },
+  "submission": {
+    "date": "2025-08-18T08:00:00Z",
+    "source_available": true,
+    "source_repository": "https://github.com/IntersectMBO/UPLC-CAPE",
+    "implementation_notes": "Factorial implementation using Plinth (PlutusTx) with parameter 10, targeting Plutus Core 1.1.0. Recursive approach computing factorial(10) = 3628800."
+  }
+}

submissions/factorial/Plinth_1.52.0.0_Unisay/metrics.json

@@ -0,0 +1,15 @@
+{
+  "execution_environment": {
+    "evaluator": "PlutusTx.Eval-1.52.0.0"
+  },
+  "measurements": {
+    "cpu_units": 5859917,
+    "memory_units": 21751,
+    "script_size_bytes": 37,
+    "term_size": 29
+  },
+  "notes": "<optional notes>",
+  "scenario": "factorial",
+  "timestamp": "2025-08-18T08:00:10Z",
+  "version": "1.0.0"
+}

submissions/factorial/Plinth_1.52.0.0_Unisay/source/.gitkeep

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

submissions/factorial/Plinth_1.52.0.0_Unisay/source/Factorial.hs

@@ -0,0 +1,46 @@
+{-# LANGUAGE BangPatterns #-}
+{-# LANGUAGE BlockArguments #-}
+{-# LANGUAGE DataKinds #-}
+{-# LANGUAGE LambdaCase #-}
+{-# LANGUAGE MultiParamTypeClasses #-}
+{-# LANGUAGE MultiWayIf #-}
+{-# LANGUAGE NamedFieldPuns #-}
+{-# LANGUAGE OverloadedStrings #-}
+{-# LANGUAGE PatternSynonyms #-}
+{-# LANGUAGE Strict #-}
+{-# LANGUAGE TemplateHaskell #-}
+{-# LANGUAGE ViewPatterns #-}
+{-# LANGUAGE NoImplicitPrelude #-}
+--
+{-# OPTIONS_GHC -fno-full-laziness #-}
+{-# OPTIONS_GHC -fno-ignore-interface-pragmas #-}
+{-# OPTIONS_GHC -fno-omit-interface-pragmas #-}
+{-# OPTIONS_GHC -fno-spec-constr #-}
+{-# OPTIONS_GHC -fno-specialise #-}
+{-# OPTIONS_GHC -fno-strictness #-}
+{-# OPTIONS_GHC -fno-unbox-small-strict-fields #-}
+{-# OPTIONS_GHC -fno-unbox-strict-fields #-}
+{-# OPTIONS_GHC -fplugin PlutusTx.Plugin #-}
+{-# OPTIONS_GHC -fplugin-opt PlutusTx.Plugin:no-conservative-optimisation #-}
+{-# OPTIONS_GHC -fplugin-opt PlutusTx.Plugin:no-preserve-logging #-}
+{-# OPTIONS_GHC -fplugin-opt PlutusTx.Plugin:remove-trace #-}
+{-# OPTIONS_GHC -fplugin-opt PlutusTx.Plugin:target-version=1.1.0 #-}
+
+module Factorial (factorialCode, factorial10Code) where
+
+import PlutusTx
+import PlutusTx.Prelude
+
+-- | Compiled validator script
+factorialCode :: CompiledCode (Integer -> Integer)
+factorialCode = $$(PlutusTx.compile [||factorial||])
+
+-- | The compiled factorial validator for n=10
+factorial10Code :: CompiledCode Integer
+factorial10Code = factorialCode `unsafeApplyCode` liftCodeDef (10 :: Integer)
+
+{-# INLINEABLE factorial #-}
+factorial :: Integer -> Integer
+factorial n
+  | n <= 0 = 1
+  | otherwise = n * factorial (n - 1)