diff --git a/text/0000-static-tables.md b/text/0000-static-tables.md
new file mode 100644
index 00000000..34567d04
--- /dev/null
+++ b/text/0000-static-tables.md
@@ -0,0 +1,65 @@
+- Feature Name: Static Arrays of Numbers
+- Start Date: 2023-04-24
+- RFC PR: (leave this empty)
+- Pony Issue: (leave this empty)
+
+# Summary
+
+This change adds the ability to define static tables of numbers in Pony programs.
+
+# Motivation
+
+The use case for this feature is to provide static tables of numeric data for use with algorithms like [Eisel-Lemire floating-point parsing](https://nigeltao.github.io/blog/2020/eisel-lemire.html) or [Ryu floating-point printing](https://github.com/ulfjack/ryu), both of which use large precalculated tables for performance.
+
+The Pony compiler already does this for string literals; they are deduplicated and stored as static data.
+
+# Detailed design
+
+A static table can be included in a Pony program by prefixing its opening square bracket with a `#` charater.  This borrows from `#` to denote compile-time expressions (e.g. `#(1+2)`) in [Luke Cheeseman's dependent type proposal](https://github.com/lukecheeseman/ponyta), which we intend to implement someday.  For example, in the following code:
+
+```pony
+  let table: Array[U32] val =
+    #[
+      123
+      456
+    ]
+```
+
+The array's internal pointer will point to a static table.
+
+The value of a static array literal can only be `Array[T] val`, where `T` is a floating-point or integral numeric type (that is, `T` must be one of { `F32`, `F64`, `ISize`, `ILong`, `I8`, `I16`, `I32`, `I64`, `I128`, `USize`, `ULong`, `U8`, `U16`, `U32`, `U64`, `U128` }).
+
+If you tried to do `let foo: Array[U32] ref = #[1;2]` the compiler would say "right side must be a subtype of left side; `Array[U32 val] val` is not a subtype of `Array[U32 val] ref^`".
+
+The `Array` object itself will also be a static global object, so as to avoid constructing a new object every time we need to access the table, for instance if we're trying to use a table via a method on a primitive.
+
+# How We Teach This
+
+We will add a mention of this functionality in the [Tutorial section on array literals](https://tutorial.ponylang.io/expressions/literals.html#array-literals).  The keyword `static` is typically used in C-derived languages to denote global constant data, but is not otherwise used by Pony. Perhaps we could call these "compile-time constant" tables to fit with Luke Cheeseman's work.
+
+No other Pony documentation needs to be changed for this RFC.
+
+# How We Test This
+
+This functionality will need unit tests to ensure that:
+
+- Static array literals may never be aliased by mutable references.
+- The emitted LLVM IR indeed stores and uses static data, instead of the current array literal implementation which constructs an `Array` object and then calls `add()` multiple times to add its contents.
+
+We must ensure that the array literal and associated `Array` object are not able to be garbage-collected.
+
+# Drawbacks
+
+This change introduces a bit of new syntax which might be confusing to existing users.  It will not break any existing code.
+
+# Alternatives
+
+- Instead of introducing new syntax, we could introduce a new type name, e.g. `StaticTable[T]` (with only `val` constructors) to which an array literal could be assigned; such array literals would be stored as static data, e.g. `let table: StaticTable[U32] = [ 123; 456 ]`.
+
+- We could modify the compiler to automatically store array literals assigned to `Array[T] val` variables as static data.  However this might be confusing to programmers as to what circumstances would result in a static array (stored at compile-time) vs the current array literal behaviour which constructs arrays at runtime by calling `add()` repeatedly.
+
+- If this RFC is not implemented, code that needs fast access to static data can currently use C FFI.
+
+# Unresolved questions
+
+Discussion is needed as to whether to use the `#` syntax or an alternative.