//     ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0].
    //     (All indices taken mod n.) If d and n are mutually prime, all elements will have been
    //     moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc,
    //     then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles

Usar contenedores de Linux tiene varias ventajas, incluyendo **seguridad**, **replicabilidad**, **simplicidad**, y otras.

/// tip | Consejo

¿Tienes prisa y ya conoces esto? Salta al [`Dockerfile` más abajo 👇](#build-a-docker-image-for-fastapi).

///

<details>
<summary>Vista previa del Dockerfile 👀</summary>

```Dockerfile
FROM python:3.9

WORKDIR /code

SetBytesWithClamping returns nil and an error, and the receiver is unchanged. // // Note that since Scalar values are always reduced modulo the prime order of // the curve, the resulting value will not preserve any of the cofactor-clearing // properties that clamping is meant to provide. It will however work as // expected as long as it is applied to points on the prime order subgroup, like // in Ed25519. In fact, it is lost to history why RFC 8032 adopted the // irrelevant RFC 7748 clamping, but it is now...

	for i := range src {  // Loop over values received from 'src'.
		if i%prime != 0 {
			dst <- i  // Send 'i' to channel 'dst'.
		}
	}
}

// The prime sieve: Daisy-chain filter processes together.
func sieve() {
	ch := make(chan int)  // Create a new channel.
	go generate(ch)       // Start generate() as a subprocess.
	for {
		prime := <-ch
		fmt.Print(prime, "\n")

SetBytesWithClamping returns nil and an error, and the receiver is unchanged. // // Note that since Scalar values are always reduced modulo the prime order of // the curve, the resulting value will not preserve any of the cofactor-clearing // properties that clamping is meant to provide. It will however work as // expected as long as it is applied to points on the prime order subgroup, like // in Ed25519. In fact, it is lost to history why RFC 8032 adopted the // irrelevant RFC 7748 clamping, but it is now...

			return
		}
	}
}

func createTestInput(n int) []byte {
	input := make([]byte, n)
	for i := range input {
		// 101 and 251 are arbitrary prime numbers.
		// The idea is to create an input sequence
		// which doesn't repeat too frequently.
		input[i] = byte(i % 251)
		if i%101 == 0 {
			input[i] ^= byte(i / 101)
		}
	}
	return input
}

2030..2032    ; valid                  ;      ; NV8    # 1.1  PER MILLE SIGN..PRIME
2033          ; mapped                 ; 2032 2032     # 1.1  DOUBLE PRIME
2034          ; mapped                 ; 2032 2032 2032 #1.1  TRIPLE PRIME
2035          ; valid                  ;      ; NV8    # 1.1  REVERSED PRIME
2036          ; mapped                 ; 2035 2035     # 1.1  REVERSED DOUBLE PRIME

// https://www.iana.org/domains/root/db/praxi.html
praxi

// press : Radix Technologies Inc.
// https://www.iana.org/domains/root/db/press.html
press

// prime : Amazon Registry Services, Inc.
// https://www.iana.org/domains/root/db/prime.html
prime

// prod : Charleston Road Registry Inc.
// https://www.iana.org/domains/root/db/prod.html
prod

// productions : Binky Moon, LLC

praxi
prd.fr
prd.km
prd.mg
prequalifyme.today
prerelease.replit.dev
press
press.aero
press.cy
press.ma
press.se
presse.km
presse.ml
preview.csb.app
pri.ee
prime
primetel.cloud
principe.st
priv.at
priv.hu
priv.instances.scw.cloud
priv.me
priv.no
priv.pl
privatizehealthinsurance.net
pro
pro.az
pro.br
pro.cy
pro.ec

praxi
prd.fr
prd.km
prd.mg
prequalifyme.today
prerelease.replit.dev
press
press.aero
press.cy
press.ma
press.se
presse.km
presse.ml
preview.csb.app
pri.ee
prime
primetel.cloud
principe.st
priv.at
priv.hu
priv.instances.scw.cloud
priv.me
priv.no
priv.pl
privatizehealthinsurance.net
pro
pro.az
pro.br
pro.cy
pro.ec