diff --git a/Cubical/Codata/Conat.agda b/Cubical/Codata/Conat.agda
new file mode 100644
index 0000000000..b8fb936b8c
--- /dev/null
+++ b/Cubical/Codata/Conat.agda
@@ -0,0 +1,6 @@
+{-# OPTIONS --cubical #-}
+module Cubical.Codata.Conat where
+
+open import Cubical.Codata.Conat.Base public
+
+open import Cubical.Codata.Conat.Properties public
diff --git a/Cubical/Codata/Conat/Base.agda b/Cubical/Codata/Conat/Base.agda
new file mode 100644
index 0000000000..294bb92e6a
--- /dev/null
+++ b/Cubical/Codata/Conat/Base.agda
@@ -0,0 +1,55 @@
+{- Conatural numbers (Tesla Ice Zhang, Feb. 2019)
+
+This file defines:
+
+- A coinductive natural number representation which is dual to
+  the inductive version (zero | suc Nat → Nat) of natural numbers.
+
+- Trivial operations (succ, pred) and the pattern synonyms on conaturals.
+
+While this definition can be seen as a coinductive wrapper of an inductive
+datatype, another way of definition is to define an inductive datatype that
+wraps a coinductive thunk of Nat.
+The standard library uses the second approach:
+
+https://github.com/agda/agda-stdlib/blob/master/src/Codata/Conat.agda
+
+The first approach is chosen to exploit guarded recursion and to avoid the use
+of Sized Types.
+-}
+
+{-# OPTIONS --cubical --safe --guardedness #-}
+module Cubical.Codata.Conat.Base where
+
+open import Cubical.Data.Unit
+open import Cubical.Data.Sum
+
+open import Cubical.Core.Everything
+
+record Conat : Set
+Conat′ = Unit ⊎ Conat
+record Conat where
+  coinductive
+  constructor conat′
+  field force : Conat′
+open Conat public
+
+pattern zero  = inl tt
+pattern suc n = inr n
+
+conat : Conat′ → Conat
+force (conat a) = a
+
+succ : Conat → Conat
+force (succ a) = suc a
+
+succ′ : Conat′ → Conat′
+succ′ n = suc λ where .force → n
+
+pred′ : Conat′ → Conat′
+pred′  zero   = zero
+pred′ (suc x) = force x
+
+pred′′ : Conat′ → Conat
+force (pred′′ zero) = zero
+pred′′ (suc x) = x
diff --git a/Cubical/Codata/Conat/Properties.agda b/Cubical/Codata/Conat/Properties.agda
new file mode 100644
index 0000000000..fadb58742f
--- /dev/null
+++ b/Cubical/Codata/Conat/Properties.agda
@@ -0,0 +1,152 @@
+{- Conatural number properties (Tesla Ice Zhang et al., Feb. 2019)
+
+This file defines operations and properties on conatural numbers:
+
+- Infinity (∞).
+
+- Proof that ∞ + 1 is equivalent to ∞.
+
+- Proof that conatural is an hSet.
+
+- Bisimulation on conatural
+
+- Proof that bisimulation is equivalent to equivalence (Coinductive Proof
+  Principle).
+
+- Proof that this bisimulation is prop valued
+
+The standard library also defines bisimulation on conaturals:
+
+https://github.com/agda/agda-stdlib/blob/master/src/Codata/Conat/Bisimilarity.agda
+-}
+
+{-# OPTIONS --cubical --safe --guardedness #-}
+module Cubical.Codata.Conat.Properties where
+
+open import Cubical.Data.Unit
+open import Cubical.Data.Sum
+open import Cubical.Data.Empty
+
+open import Cubical.Core.Everything
+open import Cubical.Foundations.Equiv
+open import Cubical.Foundations.Path
+
+open import Cubical.Relation.Nullary
+open import Cubical.Relation.Nullary.DecidableEq
+open import Cubical.Codata.Conat.Base
+
+Unwrap-prev : Conat′ -> Set
+Unwrap-prev  zero   = Unit
+Unwrap-prev (suc _) = Conat
+
+unwrap-prev : (n : Conat′) -> Unwrap-prev n
+unwrap-prev  zero   = _
+unwrap-prev (suc x) = x
+
+private -- tests
+  𝟘 = conat zero
+  one  = succ 𝟘
+  two  = succ one
+
+  succOne≡two : succ one ≡ two
+  succOne≡two i = two
+
+  predTwo≡one : unwrap-prev (force two) ≡ one
+  predTwo≡one i = one
+
+∞ : Conat
+force ∞ = suc ∞
+
+∞+1≡∞ : succ ∞ ≡ ∞
+force (∞+1≡∞ _) = suc ∞
+
+∞+2≡∞ : succ (succ ∞) ≡ ∞
+∞+2≡∞ = compPath (cong succ ∞+1≡∞) ∞+1≡∞
+
+-- TODO: plus for conat, ∞ + ∞ ≡ ∞
+
+conat-absurd : ∀ {y : Conat} {ℓ} {Whatever : Set ℓ} → zero ≡ suc y → Whatever
+conat-absurd eq = ⊥-elim (transport (cong diag eq) tt)
+  where
+  diag : Conat′ → Set
+  diag zero = Unit
+  diag (suc _) = ⊥
+
+module IsSet where
+  ≡-stable  : {x y : Conat} → Stable (x ≡ y)
+  ≡′-stable : {x y : Conat′} → Stable (x ≡ y)
+
+  force (≡-stable ¬¬p i) = ≡′-stable (λ ¬p → ¬¬p (λ p → ¬p (cong force p))) i
+  ≡′-stable {zero}  {zero}  ¬¬p′ = refl
+  ≡′-stable {suc x} {suc y} ¬¬p′ =
+     cong′ suc (≡-stable λ ¬p → ¬¬p′ λ p → ¬p (cong pred′′ p))
+  ≡′-stable {zero}  {suc y} ¬¬p′ = ⊥-elim (¬¬p′ conat-absurd)
+  ≡′-stable {suc x} {zero}  ¬¬p′ = ⊥-elim (¬¬p′ λ p → conat-absurd (sym p))
+
+  isSetConat : isSet Conat
+  isSetConat _ _ = Stable≡→isSet (λ _ _ → ≡-stable) _ _
+
+  isSetConat′ : isSet Conat′
+  isSetConat′ m n p′ q′ = cong (cong force) (isSetConat (conat m) (conat n) p q)
+    where p = λ where i .force → p′ i
+          q = λ where i .force → q′ i
+
+module Bisimulation where
+  open IsSet using (isSetConat)
+
+  record _≈_ (x y : Conat) : Set
+  data _≈′_ (x y : Conat′) : Set
+  _≈′′_ : Conat′ → Conat′ → Set
+  zero  ≈′′ zero  = Unit
+  suc x ≈′′ suc y = x ≈ y
+  -- So impossible proofs are preserved
+  x ≈′′ y = ⊥
+
+  record _≈_ x y where
+    coinductive
+    field prove : force x ≈′ force y
+
+  data _≈′_  x y where
+    con : x ≈′′ y → x ≈′ y
+
+  open _≈_ public
+
+  bisim : ∀ {x y} → x ≈ y → x ≡ y
+  bisim′ : ∀ {x y} → x ≈′ y → x ≡ y
+
+  bisim′ {zero} {zero} (con tt) = refl
+  bisim′ {zero} {suc x} (con ())
+  bisim′ {suc x} {zero} (con ())
+  bisim′ {suc x} {suc y} (con eq) i = suc (bisim eq i)
+  force (bisim eq i) = bisim′ (prove eq) i
+
+  misib : ∀ {x y} → x ≡ y → x ≈ y
+  misib′ : ∀ {x y} → x ≡ y → x ≈′ y
+
+  misib′ {zero} {zero} _ = con tt
+  misib′ {zero} {suc x} = conat-absurd
+  misib′ {suc x} {zero} p = conat-absurd (sym p)
+  -- misib′ {suc x} {suc y} p = con λ where .prove → misib′ (cong pred′ p)
+  misib′ {suc x} {suc y} p = con (misib (cong pred′′ p))
+  prove (misib x≡y) = misib′ (cong force x≡y)
+
+  iso : ∀ {x y} → (p : x ≈ y) → misib (bisim p) ≡ p
+  iso′ : ∀ {x y} → (p : x ≈′ y) → misib′ (bisim′ p) ≡ p
+
+  iso′ {zero} {zero} (con p) = refl
+  iso′ {zero} {suc x} (con ())
+  iso′ {suc x} {zero} (con ())
+  iso′ {suc x} {suc y} (con p) = cong con (iso p)
+  prove (iso p i) = iso′ (prove p) i
+
+  osi : ∀ {x y} → (p : x ≡ y) → bisim (misib p) ≡ p
+  osi p = isSetConat _ _ _ p
+
+  path≃bisim : ∀ {x y} → (x ≡ y) ≃ (x ≈ y)
+  path≃bisim = isoToEquiv misib bisim iso osi
+
+  path≡bisim : ∀ {x y} → (x ≡ y) ≡ (x ≈ y)
+  path≡bisim = ua path≃bisim
+
+  isProp≈ : ∀ {x y} → isProp (x ≈ y)
+  isProp≈ = subst isProp path≡bisim (isSetConat _ _)
diff --git a/Cubical/Codata/Everything.agda b/Cubical/Codata/Everything.agda
index 45da24802f..581941ca85 100644
--- a/Cubical/Codata/Everything.agda
+++ b/Cubical/Codata/Everything.agda
@@ -8,3 +8,5 @@ open import Cubical.Codata.EverythingSafe public
 
 -- Assumes --guardedness
 open import Cubical.Codata.Stream public
+
+open import Cubical.Codata.Conat public
diff --git a/Cubical/Codata/Stream/Base.agda b/Cubical/Codata/Stream/Base.agda
index cbfba04ac2..38cd673788 100644
--- a/Cubical/Codata/Stream/Base.agda
+++ b/Cubical/Codata/Stream/Base.agda
@@ -3,8 +3,6 @@ module Cubical.Codata.Stream.Base where
 
 open import Cubical.Core.Everything
 
-open import Cubical.Data.Nat
-
 record Stream (A : Set) : Set where
   coinductive
   constructor _,_
diff --git a/Cubical/Foundations/Everything.agda b/Cubical/Foundations/Everything.agda
index 6596bd3ce0..64c13a265c 100644
--- a/Cubical/Foundations/Everything.agda
+++ b/Cubical/Foundations/Everything.agda
@@ -5,5 +5,6 @@ open import Cubical.Foundations.CartesianKanOps public
 open import Cubical.Foundations.Equiv public
 open import Cubical.Foundations.FunExtEquiv public
 open import Cubical.Foundations.HLevels public
+open import Cubical.Foundations.Path public
 open import Cubical.Foundations.Univalence public
 open import Cubical.Foundations.UnivalenceId public
diff --git a/Cubical/Foundations/Path.agda b/Cubical/Foundations/Path.agda
new file mode 100644
index 0000000000..0ee4323434
--- /dev/null
+++ b/Cubical/Foundations/Path.agda
@@ -0,0 +1,14 @@
+{-# OPTIONS --cubical --safe #-}
+module Cubical.Foundations.Path where
+
+open import Cubical.Core.Everything
+
+private
+  variable
+    ℓ ℓ' : Level
+    A : Set ℓ
+
+-- Less polymorphic version of `cong`, to avoid some unresolved metas
+cong′ : ∀ {B : Set ℓ'} (f : A → B) {x y : A} (p : x ≡ y)
+      → Path B (f x) (f y)
+cong′ f = cong f