Skip to content

The learning lab / No sign-up. No pressure.

Try it.
Then it clicks.

Sixteen hands-on lessons in computing, networking and cybersecurity. No accounts. No downloads. Just curiosity.

What are you curious about?

Pick a lesson. Change something. See what happens.

01 / How computers represent a number

Eight switches.
256 possibilities.

Each switch is one bit. Turn it on to add the number above it. Eight bits together make a byte.

Binary00000000
Decimal0

No switches are on, so the total is 0.

Build the number 42.

Turn on the switches that add up to 42.

Why this matters +

Binary uses powers of two instead of powers of ten. Here the smallest value is 0 and the largest is 255, giving 256 possible values. IPv4 addresses use four octets, each eight bits long. This experiment is a number representation, not encryption.

Reference: Internet Protocol (RFC 791) ↗

02 / How a packet reaches its destination

Shorter route.
Faster journey?

Not always. Compare three paths through this miniature network. The numbers are fixed, one-way link delays in milliseconds.

ADBCE80 ms12 ms22 ms8 ms7 ms9 ms

Choose a path to send a simulated packet.

What to notice +

The three-link path totals 24 ms, the two-link path 34 ms, and the direct link 80 ms. If C–E is offline, the lower path cannot deliver. A route must be usable before its delay matters. Real routers use configured metrics and policies; they do not simply use the model shown here.

03 / Give access for the task, not everything

Enough access.
Nothing extra.

Everyone needs public information. Only HR needs personnel files. Nobody in this group administers servers. Set the permissions, then check your design.

Choose who can access each resource
PersonPublic informationPersonnel filesServer administration
Team member
HR specialist
Visitor

Build a policy that permits the work without granting extra access.

The security idea +

Least privilege means granting only the access needed for an assigned task. Blocking everything can prevent useful work; allowing everything exposes information and capabilities unnecessarily. This is a simplified policy exercise, not a security assessment.

Reference: NIST, least privilege ↗

04 / Connected is more than a line on a screen

Build a network.
Make every link count.

Select two nodes to connect them. Join all twelve systems to Core. A separate cluster does not count until it can reach Core.

Local learning activity. No live network, visitor counter or leaderboard.
One more challenge +

Try connecting all twelve nodes using only eleven links. That is enough to make a connected tree. Extra links can create alternate paths; this exercise counts connectivity and does not simulate routing protocols, failures or security controls.

05 / Computing

A letter.
A few little numbers.

Type a short sample and see its UTF-8 bytes. A letter, an accented character and an emoji may take different amounts of space.

Why more than one byte?

ASCII characters fit in one UTF-8 byte. Other Unicode code points can take two, three or four bytes. Some visible symbols combine multiple code points, so the number of code points is not always the number of symbols you see. The values below each character are hexadecimal bytes.

UTF-8 specification ↗

06 / Computing

Three channels.
Your color.

Mix red, green and blue. Each channel ranges from 0 to 255, written as two hexadecimal digits.

#66B5EF

What does the code mean?

In #RRGGBB, each pair represents one color channel in base 16. Hexadecimal uses 0–9 and A–F. FF means 255; 00 means zero. This changes a screen color, not the brightness of your physical display.

CSS color notation ↗

07 / Computing

Your speed says Mbps.
Your file says MB.

There are eight bits in a byte. Adjust the file size and connection speed to see the ideal transfer time.

Ideal transfer time8 seconds

100 MB × 8 ÷ 100 Mbps = 8 seconds.

Why might a real download take longer?

This uses decimal MB and Mbps and assumes full, steady use of the stated rate. Protocol overhead, congestion, server limits and wireless conditions can make actual performance slower. The animation always lasts three seconds; the calculated time is shown above.

08 / Networking

One address block.
Smaller neighborhoods.

Split 192.0.2.0/24 into equal-size subnets. Select a block to inspect its addresses.

Network address, hosts and broadcast

For the ordinary /24 through /30 subnets here, the first address identifies the network and the last is the broadcast address. The other addresses are potential host addresses. Special /31 and /32 rules are outside this exercise. 192.0.2.0/24 is reserved for documentation.

Documentation address ranges ↗

09 / Networking

The name stays the same.
The address can change.

Look up portal.example.test, then change its address. Will a cached answer update immediately?

Your browserResolver cacheAuthoritative answer
Authoritative address
192.0.2.10
Simulation clock
0 seconds
Cached address
Empty
Cache time remaining
0 seconds

Run the first lookup to cache an answer for 60 simulated seconds.

Why do changes take time?

A DNS resolver may reuse a cached answer until its time to live, or TTL, expires. This small model uses one resolver and a 60-second TTL. Real DNS has multiple layers of caching and more involved resolution and failure behavior. No DNS requests leave this exercise.

DNS concepts ↗

10 / Networking

Hello.
Ready to connect?

Build the ordinary TCP three-way handshake. Choose the next message in the right order.

ClientServer

    The client starts. Which message goes first?

    Connection is not encryption

    The usual order is client SYN, server SYN-ACK, then client ACK. It synchronizes the connection before data exchange. TCP alone does not encrypt the data. TLS can add encryption and authentication above the transport connection.

    TCP specification ↗

    11 / Security

    Same rules.
    Different order.

    This firewall stops at the first matching rule. Move the website rule above the blanket block, then test a packet.

      The initial blanket block takes precedence over everything below it.

      First match wins

      In this simplified ordered rule set, the first matching rule decides the result. A broad block above a narrower allow prevents that allow from being reached. The default is block when nothing matches. Real products also differ in connection state, direction, object matching and evaluation behavior.

      NIST firewall guidance ↗

      12 / Security

      Two checks.
      But how many factors?

      Choose the checks in a sign-in process. A password and a PIN are both things you know.

      Select at least two checks to compare their factor types.

      More factors, not just more steps

      This counts different factor categories: knowledge, possession and inherence. Two of the same category do not create two distinct factors. Some real authenticators combine factors, and not all multi-factor methods resist phishing equally. A biometric is normally combined with an authenticator rather than used as a standalone remote secret.

      NIST authentication guidance ↗

      13 / Security

      Before you click,
      look closer.

      The school’s known domain is school.example. Inspect this fictional message and find four reasons to verify it through a separate, trusted channel.

      Your account needs attention

      Use the button below to keep your account.

      0 of 4 clues examined

      Select part of the message to inspect it. Nothing opens a website or sends mail.

      Verify through a known channel

      Urgency, a mismatched domain, a misleading destination and requests for secrets are reasons to stop and verify. A familiar logo or polished writing is not proof that a message is legitimate. Use a known bookmark or an independently verified contact, not the message’s link. All addresses in this exercise are examples.

      CISA phishing guidance ↗

      14 / Security

      One small edit.
      A different fingerprint.

      Compare the SHA-256 digests of two short messages. Start with identical text, then change a character.

      SHA-256 of APress Compare hashes.
      SHA-256 of BPress Compare hashes.

      Use sample sentences here, not passwords or private information.

      Hashing is not encryption

      A hash produces a fixed-size digest. It is not something you decrypt to recover the original message. Different inputs usually produce very different digests, but finite-size hashes can have collisions. A trusted comparison digest can help detect changes; a plain hash alone does not prove who created a file. These SHA-256 calculations run locally in your browser.

      Secure Hash Standard ↗

      15 / Security

      A copy exists.
      Can you restore it?

      It is 2:00 p.m. Pick an incident, then choose a recovery copy. In this scenario, ransomware reaches the working files and the synced folder, but not the isolated backup.

      Which copy remains usable after this incident?

      A recovery point has an age

      A usable noon backup restores the state from noon, leaving two hours of later changes to recover elsewhere or recreate. This is the recovery point, not the time needed to finish a restore. Real recovery also depends on backup integrity, access, isolation and testing. Syncing alone does not guarantee a protected backup.

      CISA ransomware recovery guidance ↗

      16 / Security

      Private. Accurate. Available.
      What needs protecting?

      For each scenario, identify the security property most directly affected.

      Scenario 1 of 6

      A private student record is viewed by someone without permission.

      Choose the property that best matches the scenario.

      Three different questions

      Confidentiality asks who can see information. Integrity asks whether it remains accurate and protected from unauthorized changes. Availability asks whether authorized people can access it when needed. One incident can affect more than one property; these scenarios focus on the most direct effect.

      NIST security objectives ↗

      Privacy

      This site does not run its own advertising or analytics. Your motion preference can be saved on your device.

      The profile guide uses prepared answers from the public information on this site. Questions remain in your browser and are cleared when you close it. It has no access to private emails, files or conversations.

      Embedded university pages, Facebook, YouTube and document previews may load as you browse their pages. Those providers handle the information sent to them under their own policies. The host may process ordinary access logs.

      Public-profile guide

      Ask about Eduardo.

      Prepared answers about my work, teaching and research. Please use sample questions, not sensitive information.

      What would you like to know?