@quenty/ellipticcurvecryptography 1.11.0 → 1.13.0

package/CHANGELOG.md

@@ -3,170 +3,104 @@
 All notable changes to this project will be documented in this file.
 See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
 
-# [1.11.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.10.0...@quenty/ellipticcurvecryptography@1.11.0) (2026-04-23)
+# [1.13.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.12.0...@quenty/ellipticcurvecryptography@1.13.0) (2026-07-14)
 
-**Note:** Version bump only for package @quenty/ellipticcurvecryptography
+### Features
 
+- **ellipticcurvecryptography:** convert package to --!strict ([48e814a](https://github.com/Quenty/NevermoreEngine/commit/48e814abb5f01f54627dd4f827a287fb98f405bc))
 
+# [1.12.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.11.0...@quenty/ellipticcurvecryptography@1.12.0) (2026-05-29)
+
+**Note:** Version bump only for package @quenty/ellipticcurvecryptography
 
+# [1.11.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.10.0...@quenty/ellipticcurvecryptography@1.11.0) (2026-04-23)
 
+**Note:** Version bump only for package @quenty/ellipticcurvecryptography
 
 # [1.10.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.9.0...@quenty/ellipticcurvecryptography@1.10.0) (2026-02-20)
 
-
 ### Features
 
-* **cli:** add CI annotation support to game and plugin templates ([#666](https://github.com/Quenty/NevermoreEngine/issues/666)) ([098971b](https://github.com/Quenty/NevermoreEngine/commit/098971bb04dfe40be09f475330b69a48b38c54c5))
-
-
-
-
+- **cli:** add CI annotation support to game and plugin templates ([#666](https://github.com/Quenty/NevermoreEngine/issues/666)) ([098971b](https://github.com/Quenty/NevermoreEngine/commit/098971bb04dfe40be09f475330b69a48b38c54c5))
 
 # [1.9.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.8.0...@quenty/ellipticcurvecryptography@1.9.0) (2026-02-19)
 
-
 ### Features
 
-* **cli:** add aggregated batch test execution ([58f20e4](https://github.com/Quenty/NevermoreEngine/commit/58f20e437540c597ea445f47d47076c08ea9ca21))
-
-
-
-
+- **cli:** add aggregated batch test execution ([58f20e4](https://github.com/Quenty/NevermoreEngine/commit/58f20e437540c597ea445f47d47076c08ea9ca21))
 
 # [1.8.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.7.3...@quenty/ellipticcurvecryptography@1.8.0) (2026-02-17)
 
-
 ### Features
 
-* Add CI/CD batch unit testing ([016a366](https://github.com/Quenty/NevermoreEngine/commit/016a3663509c8fffa518b07cfc49ebecba2a1fa6))
-
-
-
-
+- Add CI/CD batch unit testing ([016a366](https://github.com/Quenty/NevermoreEngine/commit/016a3663509c8fffa518b07cfc49ebecba2a1fa6))
 
 ## [1.7.3](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.7.2...@quenty/ellipticcurvecryptography@1.7.3) (2026-01-12)
 
-
 ### Bug Fixes
 
-* Fix dependency installation process for pnpm ([9651b09](https://github.com/Quenty/NevermoreEngine/commit/9651b09af34f252ef3f9c7c539793cc878dd8cba))
-
-
-
-
+- Fix dependency installation process for pnpm ([9651b09](https://github.com/Quenty/NevermoreEngine/commit/9651b09af34f252ef3f9c7c539793cc878dd8cba))
 
 ## [1.7.2](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.7.1...@quenty/ellipticcurvecryptography@1.7.2) (2026-01-10)
 
 **Note:** Version bump only for package @quenty/ellipticcurvecryptography
 
-
-
-
-
 ## [1.7.1](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.7.0...@quenty/ellipticcurvecryptography@1.7.1) (2026-01-03)
 
 **Note:** Version bump only for package @quenty/ellipticcurvecryptography
 
-
-
-
-
 # [1.7.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.6.2...@quenty/ellipticcurvecryptography@1.7.0) (2025-05-10)
 
 **Note:** Version bump only for package @quenty/ellipticcurvecryptography
 
-
-
-
-
 ## [1.6.2](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.6.0...@quenty/ellipticcurvecryptography@1.6.2) (2025-04-07)
 
-
 ### Bug Fixes
 
-* Add types to packages ([2374fb2](https://github.com/Quenty/NevermoreEngine/commit/2374fb2b043cfbe0e9b507b3316eec46a4e353a0))
-* Bump package versions for republishing ([ba47c62](https://github.com/Quenty/NevermoreEngine/commit/ba47c62e32170bf74377b0c658c60b84306dc294))
-
-
-
-
+- Add types to packages ([2374fb2](https://github.com/Quenty/NevermoreEngine/commit/2374fb2b043cfbe0e9b507b3316eec46a4e353a0))
+- Bump package versions for republishing ([ba47c62](https://github.com/Quenty/NevermoreEngine/commit/ba47c62e32170bf74377b0c658c60b84306dc294))
 
 ## [1.6.1](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.6.0...@quenty/ellipticcurvecryptography@1.6.1) (2025-04-07)
 
-
 ### Bug Fixes
 
-* Add types to packages ([2374fb2](https://github.com/Quenty/NevermoreEngine/commit/2374fb2b043cfbe0e9b507b3316eec46a4e353a0))
-
-
-
-
+- Add types to packages ([2374fb2](https://github.com/Quenty/NevermoreEngine/commit/2374fb2b043cfbe0e9b507b3316eec46a4e353a0))
 
 # [1.6.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.5.0...@quenty/ellipticcurvecryptography@1.6.0) (2025-04-02)
 
-
 ### Bug Fixes
 
-* Fix broken tests ([96485ff](https://github.com/Quenty/NevermoreEngine/commit/96485ff69dbba007d13ea4b5fe82f67244fda14c))
-
-
-
-
+- Fix broken tests ([96485ff](https://github.com/Quenty/NevermoreEngine/commit/96485ff69dbba007d13ea4b5fe82f67244fda14c))
 
 # [1.5.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.4.0...@quenty/ellipticcurvecryptography@1.5.0) (2024-09-25)
 
-
 ### Bug Fixes
 
-* Rename `:sub()` to `string.sub` ([6874e06](https://github.com/Quenty/NevermoreEngine/commit/6874e06e456d7094a2d7f25a3a7b24a40d77fe3c))
-
-
-
-
+- Rename `:sub()` to `string.sub` ([6874e06](https://github.com/Quenty/NevermoreEngine/commit/6874e06e456d7094a2d7f25a3a7b24a40d77fe3c))
 
 # [1.4.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.3.0...@quenty/ellipticcurvecryptography@1.4.0) (2024-05-09)
 
-
 ### Bug Fixes
 
-* Fix .package-lock.json replicating in packages ([75d0efe](https://github.com/Quenty/NevermoreEngine/commit/75d0efeef239f221d93352af71a5b3e930ec23c5))
-
-
-
-
+- Fix .package-lock.json replicating in packages ([75d0efe](https://github.com/Quenty/NevermoreEngine/commit/75d0efeef239f221d93352af71a5b3e930ec23c5))
 
 # [1.3.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.2.0...@quenty/ellipticcurvecryptography@1.3.0) (2024-05-03)
 
-
 ### Bug Fixes
 
-* Native calls was erroring stuff ([949c41d](https://github.com/Quenty/NevermoreEngine/commit/949c41de617e38c33da8d7d4351cc9fa34ae529d))
-
-
-
-
+- Native calls was erroring stuff ([949c41d](https://github.com/Quenty/NevermoreEngine/commit/949c41de617e38c33da8d7d4351cc9fa34ae529d))
 
 # [1.2.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/ellipticcurvecryptography@1.1.0...@quenty/ellipticcurvecryptography@1.2.0) (2023-12-14)
 
-
 ### Performance Improvements
 
-* Improve performance of elliptic curve crypto module, saving 100ms of startup compute time on server start ([b9b500e](https://github.com/Quenty/NevermoreEngine/commit/b9b500e33b0b297c0510b28ce272c553d19408e6))
-
-
-
-
+- Improve performance of elliptic curve crypto module, saving 100ms of startup compute time on server start ([b9b500e](https://github.com/Quenty/NevermoreEngine/commit/b9b500e33b0b297c0510b28ce272c553d19408e6))
 
 # 1.1.0 (2023-03-31)
 
-
 ### Features
 
-* Add EllipticCurveCryptography package ([18e7eb1](https://github.com/Quenty/NevermoreEngine/commit/18e7eb1b0d6cb833c783401f743b4f6258bcc2fc))
-
-
-
-
+- Add EllipticCurveCryptography package ([18e7eb1](https://github.com/Quenty/NevermoreEngine/commit/18e7eb1b0d6cb833c783401f743b4f6258bcc2fc))
 
 # v1.1.0 (Fri Mar 31 2023)
 

package/deploy.nevermore.json

@@ -0,0 +1,10 @@
+{
+  "targets": {
+    "test": {
+      "universeId": 9716264427,
+      "placeId": 128881774013332,
+      "project": "test/default.project.json",
+      "scriptTemplate": "test/scripts/Server/ServerMain.server.lua"
+    }
+  }
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@quenty/ellipticcurvecryptography",
-  "version": "1.11.0",
+  "version": "1.13.0",
   "description": "Elliptic curve cryptography forked from BoatBomber, forked from ComputerCraft",
   "keywords": [
     "Roblox",
@@ -35,5 +35,5 @@
   "publishConfig": {
     "access": "public"
   },
-  "gitHead": "9413391da8b6f9026762285b601fd1d37d385a54"
+  "gitHead": "13f0162f4971a77378e55e9b7236aea94f0dd3a8"
 }

package/src/Shared/EllipticCurveCryptography/arith.lua

@@ -1,9 +1,12 @@
---!nonstrict
+--!strict
 -- Big integer arithmetic for 168-bit (and 336-bit) numbers
 -- Numbers are represented as little-endian tables of 24-bit integers
 local twoPower = require(script.Parent.twoPower)
 
-local function isEqual(a, b)
+type BigInt = { number }
+type DoubleInt = { number }
+
+local function isEqual(a: BigInt, b: BigInt): boolean
 	return a[1] == b[1]
 		and a[2] == b[2]
 		and a[3] == b[3]
@@ -13,7 +16,7 @@ local function isEqual(a, b)
 		and a[7] == b[7]
 end
 
-local function compare(a, b)
+local function compare(a: BigInt, b: BigInt): number
 	for i = 7, 1, -1 do
 		if a[i] > b[i] then
 			return 1
@@ -25,7 +28,7 @@ local function compare(a, b)
 	return 0
 end
 
-local function add(a, b)
+local function add(a: BigInt, b: BigInt): BigInt
 	-- c7 may be greater than 2^24 before reduction
 	local c1 = a[1] + b[1]
 	local c2 = a[2] + b[2]
@@ -63,7 +66,7 @@ local function add(a, b)
 	return { c1, c2, c3, c4, c5, c6, c7 }
 end
 
-local function sub(a, b)
+local function sub(a: BigInt, b: BigInt): BigInt
 	-- c7 may be negative before reduction
 	local c1 = a[1] - b[1]
 	local c2 = a[2] - b[2]
@@ -101,7 +104,7 @@ local function sub(a, b)
 	return { c1, c2, c3, c4, c5, c6, c7 }
 end
 
-local function rShift(a)
+local function rShift(a: BigInt): BigInt
 	local c1 = a[1]
 	local c2 = a[2]
 	local c3 = a[3]
@@ -134,7 +137,7 @@ local function rShift(a)
 	return { c1, c2, c3, c4, c5, c6, c7 }
 end
 
-local function addDouble(a, b)
+local function addDouble(a: DoubleInt, b: DoubleInt): DoubleInt
 	-- a and b are 336-bit integers (14 words)
 	local c1 = a[1] + b[1]
 	local c2 = a[2] + b[2]
@@ -207,7 +210,7 @@ local function addDouble(a, b)
 	return { c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14 }
 end
 
-local function mult(a, b, half_multiply)
+local function mult(a: BigInt, b: BigInt, half_multiply: boolean): DoubleInt
 	local a1, a2, a3, a4, a5, a6, a7 = a[1], a[2], a[3], a[4], a[5], a[6], a[7]
 	local b1, b2, b3, b4, b5, b6, b7 = b[1], b[2], b[3], b[4], b[5], b[6], b[7]
 
@@ -218,7 +221,13 @@ local function mult(a, b, half_multiply)
 	local c5 = a1 * b5 + a2 * b4 + a3 * b3 + a4 * b2 + a5 * b1
 	local c6 = a1 * b6 + a2 * b5 + a3 * b4 + a4 * b3 + a5 * b2 + a6 * b1
 	local c7 = a1 * b7 + a2 * b6 + a3 * b5 + a4 * b4 + a5 * b3 + a6 * b2 + a7 * b1
-	local c8, c9, c10, c11, c12, c13, c14
+	local c8: number = 0
+	local c9: number = 0
+	local c10: number = 0
+	local c11: number = 0
+	local c12: number = 0
+	local c13: number = 0
+	local c14: number = 0
 	if not half_multiply then
 		c8 = a2 * b7 + a3 * b6 + a4 * b5 + a5 * b4 + a6 * b3 + a7 * b2
 		c9 = a3 * b7 + a4 * b6 + a5 * b5 + a6 * b4 + a7 * b3
@@ -277,7 +286,7 @@ local function mult(a, b, half_multiply)
 	return { c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14 }
 end
 
-local function square(a)
+local function square(a: BigInt): DoubleInt
 	-- returns a 336-bit integer (14 words)
 	local a1, a2, a3, a4, a5, a6, a7 = a[1], a[2], a[3], a[4], a[5], a[6], a[7]
 
@@ -340,8 +349,8 @@ local function square(a)
 	return { c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14 }
 end
 
-local function encodeInt(a)
-	local enc = table.create(21)
+local function encodeInt(a: BigInt): { number }
+	local enc: { number } = table.create(21)
 
 	for i = 1, 7 do
 		local word = a[i]
@@ -354,9 +363,9 @@ local function encodeInt(a)
 	return enc
 end
 
-local function decodeInt(enc)
-	local a = {}
-	local encCopy = table.create(21)
+local function decodeInt(enc: { number }): BigInt
+	local a: BigInt = {}
+	local encCopy: { number } = table.create(21)
 
 	for i = 1, 21 do
 		local byte = enc[i]
@@ -379,26 +388,27 @@ local function decodeInt(enc)
 	return a
 end
 
-local function mods(d, w)
-	local result = d[1] % twoPower[w]
+local function mods(d: BigInt, w: number): number
+	local result = d[1] % (twoPower :: any)[w]
 
-	if result >= twoPower[w - 1] then
-		result -= twoPower[w]
+	if result >= (twoPower :: any)[w - 1] then
+		result -= (twoPower :: any)[w]
 	end
 
 	return result
 end
 
 -- Represents a 168-bit number as the (2^w)-ary Non-Adjacent Form
-local function NAF(d, w)
-	local t, t_len = {}, 0
-	local newD = { table.unpack(d) }
+local function NAF(d: BigInt, w: number): { number }
+	local t: { number } = {}
+	local t_len = 0
+	local newD: BigInt = { table.unpack(d) }
 
 	for _ = 1, 168 do
 		if newD[1] % 2 == 1 then
 			t_len += 1
 			t[t_len] = mods(newD, w)
-			newD = sub(newD, { t[#t], 0, 0, 0, 0, 0, 0 })
+			newD = sub(newD, { t[t_len], 0, 0, 0, 0, 0, 0 })
 		else
 			t_len += 1
 			t[t_len] = 0

package/src/Shared/EllipticCurveCryptography/chacha20.lua

@@ -1,4 +1,4 @@
---!nonstrict
+--!strict
 --!native
 
 -- Chacha20 cipher in ComputerCraft
@@ -8,7 +8,7 @@
 -- http://www.computercraft.info/forums2/index.php?/user/12870-anavrins
 -- http://pastebin.com/GPzf9JSa
 -- Last update: April 17, 2017
-local twoPower = require(script.Parent.twoPower)
+local twoPower: any = require(script.Parent.twoPower)
 local util = require(script.Parent.util)
 
 local bxor = bit32.bxor
@@ -20,13 +20,13 @@ local mod = 2 ^ 32
 local tau = table.pack(string.byte("expand 16-byte k", 1, -1))
 local sigma = table.pack(string.byte("expand 32-byte k", 1, -1))
 
-local function rotl(n, b)
+local function rotl(n: number, b: number): number
 	local s = n / twoPower[32 - b]
 	local f = s % 1
 	return (s - f) + f * mod
 end
 
-local function quarterRound(s, a, b, c, d)
+local function quarterRound(s: { number }, a: number, b: number, c: number, d: number): { number }
 	s[a] = (s[a] + s[b]) % mod
 	s[d] = rotl(bxor(s[d], s[a]), 16)
 	s[c] = (s[c] + s[d]) % mod
@@ -38,8 +38,8 @@ local function quarterRound(s, a, b, c, d)
 	return s
 end
 
-local function hashBlock(state, rnd)
-	local s = { table.unpack(state) }
+local function hashBlock(state: { number }, rnd: number): { number }
+	local s: { number } = { table.unpack(state) }
 	for i = 1, rnd do
 		local r = i % 2 == 1
 		s = r and quarterRound(s, 1, 5, 9, 13) or quarterRound(s, 1, 6, 11, 16)
@@ -55,17 +55,17 @@ local function hashBlock(state, rnd)
 	return s
 end
 
-local function LE_toInt(bs, i)
+local function LE_toInt(bs: { number }, i: number): number
 	return (bs[i + 1] or 0)
 		+ blshift((bs[i + 2] or 0), 8)
 		+ blshift((bs[i + 3] or 0), 16)
 		+ blshift((bs[i + 4] or 0), 24)
 end
 
-local function initState(key, nonce, counter)
+local function initState(key: { number }, nonce: { number }, counter: number): { number }
 	local isKey256 = #key == 32
-	local const = isKey256 and sigma or tau
-	local state = table.create(16)
+	local const: { number } = isKey256 and sigma or tau
+	local state: { number } = table.create(16)
 
 	state[1] = LE_toInt(const, 0)
 	state[2] = LE_toInt(const, 4)
@@ -89,8 +89,9 @@ local function initState(key, nonce, counter)
 	return state
 end
 
-local function serialize(state)
-	local r, len_r = table.create(16), 0
+local function serialize(state: { number }): { number }
+	local r: { number } = table.create(16)
+	local len_r = 0
 	for i = 1, 16 do
 		r[len_r + 1] = band(state[i], 0xFF)
 		r[len_r + 2] = band(brshift(state[i], 8), 0xFF)
@@ -102,24 +103,34 @@ local function serialize(state)
 	return r
 end
 
-local function crypt(data, key, nonce, cntr, round)
+export type ByteTable = typeof(setmetatable({} :: { number }, {} :: typeof(util.byteTableMT)))
+
+local function crypt(
+	data: string | { number },
+	key: { number },
+	nonce: { number },
+	cntr: number?,
+	round: number?
+): ByteTable
 	assert(type(key) == "table", "ChaCha20: Invalid key format (" .. type(key) .. "), must be table")
 	assert(type(nonce) == "table", "ChaCha20: Invalid nonce format (" .. type(nonce) .. "), must be table")
 	assert(#key == 16 or #key == 32, "ChaCha20: Invalid key length (" .. #key .. "), must be 16 or 32")
 	assert(#nonce == 12, "ChaCha20: Invalid nonce length (" .. #nonce .. "), must be 12")
 
-	local newData = type(data) == "table" and { table.unpack(data) } or util.stringToByteArray(data)
-	cntr = tonumber(cntr) or 1
-	round = tonumber(round) or 20
+	local newData: { number } = type(data) == "table" and { table.unpack(data :: { number }) }
+		or util.stringToByteArray(data :: string)
+	local counter = tonumber(cntr) or 1
+	local rounds = tonumber(round) or 20
 
-	local out, out_len = {}, 0
-	local state = initState(key, nonce, cntr)
+	local out: { number } = {}
+	local out_len = 0
+	local state = initState(key, nonce, counter)
 	local blockAmt = math.floor(#newData / 64)
 	for i = 0, blockAmt do
-		local ks = serialize(hashBlock(state, round))
+		local ks = serialize(hashBlock(state, rounds))
 		state[13] = (state[13] + 1) % mod
 
-		local block = table.create(64)
+		local block: { number } = table.create(64)
 		for j = 1, 64 do
 			block[j] = newData[(i * 64) + j]
 		end

package/src/Shared/EllipticCurveCryptography/curve.lua

@@ -1,4 +1,4 @@
---!nonstrict
+--!strict
 --!native
 
 --[=[
@@ -49,7 +49,7 @@ local montgomeryModP = modp.montgomeryModP
 local expModP = modp.expModP
 local inverseMontgomeryModQ = modq.inverseMontgomeryModQ
 
-local pointMT
+local pointMT: any
 local ZERO = table.create(7, 0)
 local ONE = montgomeryModP({ 1, 0, 0, 0, 0, 0, 0 })
 
@@ -193,9 +193,9 @@ end
 local function scalarMult(multiplier, P1)
 	-- w = 5
 	local naf = NAF(multiplier, 5)
-	local PTable = { P1 }
+	local PTable: { any } = { P1 }
 	local P2 = pointDouble(P1)
-	local Q = { table.create(7, 0), { table.unpack(ONE) }, { table.unpack(ONE) } }
+	local Q: any = { table.create(7, 0), { table.unpack(ONE) }, { table.unpack(ONE) } }
 
 	for i = 3, 31, 2 do
 		PTable[i] = pointAdd(PTable[i - 2], P2)
@@ -215,14 +215,14 @@ end
 
 -- Lookup table 4-ary NAF method for scalar multiplication by G.
 -- Precomputations for the regular NAF method are done before the multiplication.
-local GTable = { G }
+local GTable: { any } = { G }
 for i = 2, 168 do
 	GTable[i] = pointDouble(GTable[i - 1])
 end
 
 local function scalarMultG(multiplier)
 	local naf = NAF(multiplier, 2)
-	local Q = { table.create(7, 0), { table.unpack(ONE) }, { table.unpack(ONE) } }
+	local Q: any = { table.create(7, 0), { table.unpack(ONE) }, { table.unpack(ONE) } }
 
 	for i = 1, 168 do
 		if naf[i] == 1 then
@@ -237,7 +237,7 @@ end
 
 -- Point compression and encoding.
 -- Compresses curve points to 22 bytes.
-local function pointEncode(P1)
+local function pointEncode(P1: any)
 	P1 = pointScale(P1)
 	local result = {}
 	local x, y = P1[1], P1[2]
@@ -321,7 +321,7 @@ pointMT = {
 		return pointIsEqual(P1, P2)
 	end,
 
-	__mul = function(P1, s)
+	__mul = function(P1: any, s: any)
 		if type(P1) == "number" then
 			return s * P1
 		end