From b816e41ee40921d6c61964a850edceb0427bd0f2 Mon Sep 17 00:00:00 2001
From: Paul Buetow
-
Technical references
I didn't read them from the beginning to the end, but I am using them to look up things. The books are in random order:
-
Self-development and soft-skills books
In random order:
-
Here are notes of mine for some of the books
@@ -159,30 +159,30 @@
Some of these were in-person with exams; others were online learning lectures only. In random order:
-
Technical guides
These are not whole books, but guides (smaller or larger) which I found very useful. in random order:
-
Podcasts
@@ -192,48 +192,48 @@
In random order:
-
Podcasts I liked
I liked them but am not listening to them anymore. The podcasts have either "finished" (no more episodes) or I stopped listening to them due to time constraints or a shift in my interests.
-
Newsletters I like
This is a mix of tech and non-tech newsletters I am subscribed to. In random order:
-
Magazines I like(d)
@@ -241,10 +241,10 @@
This is a mix of tech I like(d). I may not be a current subscriber, but now and then, I buy an issue. In random order:
-
Formal education
diff --git a/gemfeed/2025-07-22-task-samurai.html b/gemfeed/2025-07-22-task-samurai.html
new file mode 100644
index 00000000..8ea20ccb
--- /dev/null
+++ b/gemfeed/2025-07-22-task-samurai.html
@@ -0,0 +1,141 @@
+
+
+
+
+Task Samurai
+
+Published at 2025-06-22T18:49:11+03:00
+
+
+
+Table of Contents
+
+
+
+Introduction
+
+Task Samurai is a fast terminal interface for Taskwarrior written in Go using the Bubble Tea framework. It displays your tasks in a table and allows you to manage them without leaving your keyboard.
+
+https://taskwarrior.org
+https://github.com/charmbracelet/bubbletea
+
+Why does this exist?
+
+
+
+Given the current industry trend and the rapid advancements in technology, it has become clear that experimenting with AI-assisted coding tools is almost a necessity to stay relevant. Embracing these new developments doesn't mean abandoning traditional coding; instead, it means integrating new capabilities into your workflow to stay ahead in a fast-evolving field.
+
+How it works
+
+Task Samurai invokes the task command to read and modify tasks. The tasks are displayed in a Bubble Tea table, where each row represents a task. Hotkeys trigger Taskwarrior commands such as starting, completing or annotating tasks. The UI refreshes automatically after each action, so the table is always up to date.
+
+
+
+Lessons Learned from Building Task Samurai with Agentic Coding
+
+If you've ever wanted to supercharge your dev speed—or just throw a fireworks display in your terminal—here's a peek behind the scenes of building Task Samurai. This terminal interface for Taskwarrior was developed entirely through agentic coding by me, leveraging OpenAI Codex to do all the heavy lifting (and sometimes some cleanup afterwards). The project name might be snappy, but it was the iterative, semi-automated workflow that made the impact.
+
+As a side note, I was trying out OpenAI Codex because I regularly run out of Claude Code CLI (another agentic coding tool I am trying out currently) credits (it still happens!), but Codex was still available to me. So, I seized the opportunity to push agentic coding a bit more.
+
+How It Went Down
+
+Task Samurai's codebase came together quickly: the entire Git history spans from June 19 to 22, 2025, culminating in 179 commits. Here are the broad strokes:
+
+
+
+Most big breakthroughs (and bug introductions) came during that middle day of intense iteration. The latter stages were all about smoothing out the rough edges.
+
+What Went Wrong
+
+Going agentic isn't all smooth sailing. Here are the hiccups I ran into, plus a few hard-earned lessons:
+
+
+
+Patterns That Helped
+
+Despite the chaos, a few strategies kept things moving:
+
+
+
+What I Learned Using Agentic Coding
+
+Stepping into agentic coding with Codex as my "pair programmer" was a genuine shift. I learned a ton—not just about automating code generation, but also about how you have to tightly steer, guide, and audit every line as things move at breakneck speed. I must admit, I sometimes lost track of what all the generated code was actually doing. But as the features seemed to work after a few iterations, I was satisfied.
+
+Discussing requirements with Codex forced me to clarify features and spot logical pitfalls earlier. All those fast iterations meant I was constantly coaxing more helpful, less ambiguous code out of the model—making me rethink how to break features into clear, testable steps. I now see agentic coding not just as a productivity tool but also as a learning accelerator.
+
+How Much Time Did I Save?
+
+Here's the million-dollar (or many hours saved) question: Did it buy me speed?
+
+Let's do some back-of-the-envelope math:
+
+
+
+Where and how to get it
+
+Go to:
+
+https://codeberg.org/snonux/tasksamurai
+
+And follow the README.md!
+
+Wrapping Up
+
+Building Task Samurai with agentic coding was a wild ride—rapid feature growth, plenty of churns, countless fast fixes, and more merge commits I'd expected. The big lessons? Keep the iterations short, keep tests and documentation concise, and review and refine for final polish at the end. Even with the bumps along the way, shipping a polished terminal UI in days instead of weeks is a testament to the raw power (and some hazards) of agentic development.
+
+While working on Task Samuray, there were times I genuinely missed manual coding and the satisfaction that comes from writing every line yourself, debugging issues through sheer logic, and crafting solutions from scratch. However, this is the direction in which the industry seems to be shifting, unfortunately. If applied correctly, AI will boost performance, and if you don't use AI, your next performance review may be awkward.
+
+If you're considering going agentic, be prepared for a sprint, keep your toolkit sharp, and be ready to learn a lot along the way.
+
+Personally, I am not sure whether I like where the industry is going with agentic coding. I love "traditional" coding, and with agentic coding you operate at a higher level and don't interact directly with code as often, which I would miss. I think that in the future, designing, reviewing, and being able to read and understand code will be more important than writing code by hand.
+
+Do you have any thoughts on that? I hope, I am partially wrong at least.
+
+E-Mail your comments to paul@nospam.buetow.org :-)
+
+Back to the main site
+
+
+
diff --git a/gemfeed/DRAFT-distributed-systems-simulator.html b/gemfeed/DRAFT-distributed-systems-simulator.html
new file mode 100644
index 00000000..d5327355
--- /dev/null
+++ b/gemfeed/DRAFT-distributed-systems-simulator.html
@@ -0,0 +1,320 @@
+
+
+
+
+Distributed Systems Simulator
+
+This blog explores the Java-based Distributed Simulator program I've created specifically for simulating distributed systems protocols, offering both built-in implementations of common algorithms and an extensible framework that allows researchers and practitioners to implement and test their own custom protocols within the simulation environment.
+
+Table of Contents
+
+
+
+Motivation
+
+Distributed systems are notoriously complex, with intricate interactions between multiple nodes, network partitions, and failure scenarios that can be difficult to understand and debug in production environments. A distributed systems simulator provides an invaluable learning tool that allows developers and students to experiment with different architectures, observe how systems behave under various failure conditions, and gain hands-on experience with concepts like consensus algorithms, replication strategies, and fault tolerance—all within a controlled, repeatable environment. By abstracting away the operational overhead of managing real distributed infrastructure, simulators enable focused exploration of system design principles and help bridge the gap between theoretical knowledge and practical understanding of how distributed systems actually work in the real world.
+
+In the literature, one can find many different definitions of a distributed system. Many of these definitions differ from each other, making it difficult to find a single definition that stands alone as the correct one. Andrew Tanenbaum and Maarten van Steen chose the following loose characterization for describing a distributed system:
+
+"A distributed system is a collection of independent computers that appears to its users as a single coherent system" - Andrew Tanenbaum
+
+The user only needs to interact with the local computer in front of them, while the software of the local computer ensures smooth communication with the other participating computers in the distributed system.
+
+This thesis aims to make it easier for users to view distributed systems from a different perspective. Here, the viewpoint of an end user is not adopted; instead, the functional methods of protocols and their processes in distributed systems should be made comprehensible, while simultaneously making all relevant events of a distributed system transparent.
+
+To achieve this goal, a simulator was developed, particularly for teaching and learning purposes at the University of Applied Sciences Aachen. With the simulator, protocols from distributed systems with their most important influencing factors can be replicated through simulations. At the same time, there is ample room for personal experiments, with no restriction to a fixed number of protocols. It is therefore important that users are enabled to design their own protocols.
+
+Fundamentals
+
+For basic understanding, some fundamentals are explained below. A deeper exploration will follow in later chapters.
+
+Client/Server Model
+
+
+┌─────────────────────────────────────────────┐
+│ │
+│ ┌────────┐ ┌────────┐ │
+│ │ Client │◄-------►│ Server │ │
+│ └────────┘ └────────┘ │
+│ │
+│ Sending of Messages │
+│ │
+└─────────────────────────────────────────────┘
+
+Figure 1.1: Client/Server Model
+
+
+The simulator is based on the client/server principle. Each simulation typically consists of a participating client and a server that communicate with each other via messages (see Fig. 1.1). In complex simulations, multiple clients and/or servers can also participate.
+
+Processes and Their Roles
+
+A distributed system is simulated using processes. Each process takes on one or more roles. For example, one process can take on the role of a client and another process the role of a server. The possibility of assigning both client and server roles to a process simultaneously is also provided. A process could also take on the roles of multiple servers and clients simultaneously. To identify a process, each one has a unique Process Identification Number (PID).
+
+Messages
+
+In a distributed system, it must be possible to send messages. A message can be sent by a client or server process and can have any number of recipients. The content of a message depends on the protocol used. What is meant by a protocol will be covered later. To identify a message, each message has a unique Message Identification Number (NID).
+
+Local and Global Clocks
+
+In a simulation, there is exactly one global clock. It represents the current and always correct time. A global clock never goes wrong.
+
+Additionally, each participating process has its own local clock. It represents the current time of the respective process. Unlike the global clock, local clocks can display an incorrect time. If the process time is not globally correct (not equal to the global time, or displays an incorrect time), then it was either reset during a simulation, or it is running incorrectly due to clock drift. The clock drift indicates by what factor the clock is running incorrectly. This will be discussed in more detail later.
+
+
+┌─────────────────────┐ ┌─────────────────────┐
+│ Process 1 │ │ Process 2 │
+│ │ │ │
+│ ┌─────────────────┐ │ │ ┌─────────────────┐ │
+│ │Server Protocol A│ │ │ │Client Protocol A│ │
+│ └─────────────────┘ │ │ └─────────────────┘ │
+│ │ │ │
+│ ┌─────────────────┐ │ └─────────────────────┘
+│ │Client Protocol B│ │
+│ └─────────────────┘ │ ┌─────────────────────┐
+│ │ │ Process 3 │
+└─────────────────────┘ │ │
+ │ ┌─────────────────┐ │
+ │ │Server Protocol B│ │
+ │ └─────────────────┘ │
+ │ │
+ └─────────────────────┘
+
+Figure 1.2: Client/Server Protocols
+
+
+In addition to normal clocks, vector timestamps and Lamport's logical clocks are also of interest. For vector and Lamport times, there are no global equivalents here, unlike normal time. Concrete examples of Lamport and vector times will be covered later in Chapter 3.11.1.
+
+Events
+
+A simulation consists of the sequential execution of finitely many events. For example, there can be an event that causes a process to send a message. A process crash event would also be conceivable. Each event occurs at a specific point in time. Events with the same occurrence time are executed directly one after another by the simulator. However, this does not hinder the simulator's users, as events are executed in parallel from their perspective.
+
+Protocols
+
+A simulation also consists of the application of protocols. It has already been mentioned that a process can take on the roles of servers and/or clients. For each server and client role, the associated protocol must also be specified. A protocol defines how a client and a server send messages, and how they react when a message arrives. A protocol also determines what data is contained in a message. A process only processes a received message if it understands the respective protocol.
+
+In Figure 1.2, 3 processes are shown. Process 1 supports protocol "A" on the server side and protocol "B" on the client side. Process 2 supports protocol "A" on the client side and Process 3 supports protocol "B" on the server side. This means that Process 1 can communicate with Process 2 via protocol "A" and with Process 3 via protocol "B". Processes 2 and 3 are incompatible with each other and cannot process messages received from each other.
+
+Clients cannot communicate with clients, and servers cannot communicate with servers. For communication, at least one client and one server are always required. However, this restriction can be circumvented by having processes support a given protocol on both the server and client sides (see Broadcast Protocol in Chapter 3.3).
+
+Graphical User Interface (GUI)
+
+Simple Mode
+
+![Figure 2.1: The simulator after first launch]
+
+The simulator requires JDK 21 and can be started with the command java -jar target/ds-sim-VERSION.jar
+
+The simulator then presents itself as shown in Figure 2.1. To create a new simulation, select "New Simulation" from the "File" menu (see Fig. 2.2), after which the settings window for the new simulation appears. The individual options will be discussed in more detail later, and for now, only the default settings will be used.
+
+By default, the simulator starts in "simple mode". There is also an "expert mode", which will be discussed later.
+
+The Menu Bar
+
+In the File menu (see Fig. 2.2), you can create new simulations or close the currently open simulation. New simulations open by default in a new tab. However, you can also open or close new simulation windows that have their own tabs. Each tab contains a simulation that is completely independent from the others. This allows any number of simulations to be run in parallel. The menu items "Open", "Save" and "Save As" are used for loading and saving simulations.
+
+![Figure 2.2: File Menu]
+
+Through the Edit menu, users can access the simulation settings, which will be discussed in more detail later. This menu also lists all participating processes for editing. If the user selects a process there, the corresponding process editor opens. This will also be discussed in more detail later. The Simulator menu offers the same options as the toolbar, which is described in the next section.
+
+Some menu items are only accessible when a simulation has already been created or loaded in the current window.
+
+![Figure 2.3: A new simulation]
+
+The Toolbar
+
+The toolbar is located at the top left of the simulator (see Fig. 2.4). The toolbar contains the functions most frequently needed by users.
+
+The toolbar offers four different functions:
+
+![Figure 2.4: The menu line including toolbar]
+
+
+
+The Visualization
+
+![Figure 2.5: Visualization of a simulation that has not yet been started]
+
+The graphical simulation visualization is located in the center right. The X-axis shows the time in milliseconds, and all participating processes are listed on the Y-axis. The demo simulation ends after exactly 15 seconds. Figure 2.5 shows 3 processes (with PIDs 1, 2, and 3), each with its own horizontal black bar. On these process bars, users can read the respective local process time. The vertical red line represents the global simulation time.
+
+![Figure 2.6: Right-click on a process bar]
+
+The process bars also serve as start and end points for messages. For example, if Process 1 sends a message to Process 2, a line is drawn from one process bar to the other. Messages that a process sends to itself are not visualized but are logged in the log window (more on this later).
+
+Another way to open a process editor is to left-click on the process bar belonging to the process. A right-click, on the other hand, opens a popup window with additional options (see Fig. 2.6). A process can only be forced to crash or be revived via the popup menu during a running simulation.
+
+In general, the number of processes can vary as desired. The simulation duration is at least 5 and at most 120 seconds. The simulation only ends when the global time reaches the specified simulation end time (here 15 seconds), not when a local process time reaches this end time.
+
+Color Differentiation
+
+Colors help to better interpret the processes of a simulation. By default, processes (process bars) and messages are displayed with the colors listed in Table 2.1. These are only the default colors, which can be changed via the settings.
+
+
+Table 2.1: Color differentiation of processes and messages
+
+| Process Color | Meaning |
+|---------------|---------------------------------------------------|
+| Black | The simulation is not currently running |
+| Orange | The mouse is over the process bar |
+| Red | The process has crashed |
+
+| Message Color | Meaning |
+|---------------|-------------------------------------------------------------------------|
+| Green | The message is still in transit and has not yet reached its destination |
+| Blue | The message has successfully reached its destination |
+| Red | The message was lost |
+
+
+The Sidebar
+
+![Figure 2.7: The sidebar with empty event editor]
+
+The sidebar is used to program process events. At the top of Figure 2.7, the process to be managed is selected (here with PID 1). In this process selection, there is also the option to select "All Processes", which displays all programmed events of all processes simultaneously. "Local events" are those events that occur when a certain local time of the associated process has been reached. The event table below lists all programmed events (none present here yet) along with their occurrence times and PIDs.
+
+![Figure 2.8: The event editor with 3 programmed events]
+
+To create a new event, the user can either right-click on a process bar (see Fig. 2.6) and select "Insert local event", or select an event below the event table (see Fig. 2.9), enter the event occurrence time in the text field below, and click "Apply". For example, in Figure 2.8, three events were added: crash after 123ms, revival after 321ms, and another crash after 3000ms of the process with ID 1.
+
+![Figure 2.9: Event selection via sidebar]
+
+Right-clicking on the event editor allows you to either copy or delete all selected events. Using the Ctrl key, multiple events can be selected simultaneously. The entries in the Time and PID columns can be edited afterwards. This provides a convenient way to move already programmed events to a different time or assign them to a different process. However, users should ensure that they press the Enter key after changing the event occurrence time, otherwise the change will be ineffective.
+
+In addition to the Events tab, the sidebar has another tab called "Variables". Behind this tab is the process editor of the currently selected process (see Fig. 2.13 left). There, all variables of the process can be edited, providing another way to access a process editor.
+
+The Log Window
+
+The log window (see Fig. 2.3, bottom) logs all occurring events in chronological order. Figure 2.10 shows the log window after creating the demo simulation with 3 participating processes. At the beginning of each log entry, the global time in milliseconds is always logged. For each process, its local times as well as the Lamport and vector timestamps are also listed. After the time information, additional details are provided, such as which message was sent with what content and which protocol it belongs to. This will be demonstrated later with examples.
+
+![Figure 2.10: The log window]
+
+
+000000ms: New Simulation
+000000ms: New Process; PID: 1; Local Time: 000000ms; Lamport time: 0; Vector time: (0,0,0)
+000000ms: New Process; PID: 2; Local Time: 000000ms; Lamport time: 0; Vector time: (0,0,0)
+000000ms: New Process; PID: 3; Local Time: 000000ms; Lamport time: 0; Vector time: (0,0,0)
+
+□ Expert mode ☑ Logging
+
+
+By deactivating the logging switch, message logging can be temporarily disabled. With logging deactivated, no new messages are written to the log window. After reactivating the switch, all omitted messages are subsequently written to the window. Deactivated logging can lead to improved simulator performance. This is due to the very slow Java implementation of the JTextArea class, which performs updates very sluggishly.
+
+Expert Mode
+
+The simulator can be operated in two different modes: simple mode and expert mode. The simulator starts in simple mode by default, so users don't have to deal with the simulator's full functionality all at once. Simple mode is clearer but offers fewer functions. Expert mode is more suitable for experienced users and accordingly offers more flexibility. Expert mode can be activated or deactivated via the switch of the same name below the log window or via the simulation settings. Figure 2.11 shows the simulator in expert mode. When comparing expert mode with simple mode, several differences are noticeable:
+
+![Figure 2.11: The Simulator in Expert Mode]
+
+New Functions in the Sidebar
+
+The first difference is visible in the sidebar (see Fig. 2.12). In addition to local events, global events can now also be edited. As already mentioned, local events are those events that occur when a specific local time of the associated process has been reached. Global events, on the other hand, are those events that occur when a specific global time has been reached. A global event takes the global simulation time and a local event takes the local process time as the entry criterion. Global events thus only make a difference when the local process times differ from the global time.
+
+Furthermore, the user can directly select the associated PID when programming a new event. In simple mode, the PID of the currently selected process (in the topmost ComboBox) was always used by default (here with PID 1).
+
+![Figure 2.12: The Sidebar in Expert Mode]
+
+Lamport Time, Vector Time, and Anti-Aliasing Switches
+
+Further differences are noticeable below the log window. Among other things, there are two new switches "Lamport time" and "Vector time". If the user activates one of these two switches, the Lamport or vector timestamps are displayed in the visualization. To maintain clarity, the user can only have one of these two switches activated at the same time.
+
+The anti-aliasing switch allows the user to activate or deactivate anti-aliasing. With anti-aliasing, all graphics in the visualization are displayed with rounded edges (see [Bra03]). For performance reasons, anti-aliasing is not active by default.
+
+The Log Filter
+
+As a simulation becomes more complex, the entries in the log window become increasingly confusing. Here it becomes increasingly difficult to keep track of all events. To counteract this, expert mode includes a log filter that makes it possible to filter only the essential data from the logs.
+
+The log filter is activated and deactivated using the associated "Filter" switch. A regular expression in Java syntax can be entered in the input line behind it. The use of regular expressions using Java is covered in [Fri06]. For example, with "PID: (1|2)" only log lines are displayed that contain either "PID: 1" or "PID: 2". All other lines that only contain "PID: 3", for example, are not displayed. With the log filter, only the log lines that match the specified regular expression are displayed. The log filter can also be activated retroactively, as already logged events are filtered again after each filter change.
+
+The log filter can also be used during a running simulation. When the filter is deactivated, all messages are displayed again. Log messages that have never been displayed due to the filter are then displayed retroactively.
+
+![Figure 2.13: The Process Editor in the Sidebar]
+
+Events
+
+Two main types of events are distinguished: programmable events and non-programmable events. Programmable events can be programmed and edited in the event editor, and their occurrence times depend on the local process clocks or the global clock. Non-programmable events, on the other hand, cannot be programmed in the event editor and do not occur because of a specific time, but due to other circumstances such as the arrival of a message or the execution of an action due to an alarm (more on this later).
+
+Key Features of Events:
+
+
+
+Event Types Available:
+
+
+
+The event editor allows users to:
+
+
+
+**Important**: Remember to press Enter after changing event occurrence times, otherwise the changes won't take effect.
+
+Summary
+
+The expert mode significantly extends the simulator's capabilities, providing:
+
+
+
+These features make the simulator more powerful for advanced distributed systems simulation while maintaining the option to work in simple mode for basic use cases.
+
+E-Mail your comments to paul@nospam.buetow.org
+
+Back to the main site
+
+
+
diff --git a/gemfeed/DRAFT-f3s-kubernetes-with-freebsd-part-6.html b/gemfeed/DRAFT-f3s-kubernetes-with-freebsd-part-6.html
index 16d93b1b..5c7c5fc3 100644
--- a/gemfeed/DRAFT-f3s-kubernetes-with-freebsd-part-6.html
+++ b/gemfeed/DRAFT-f3s-kubernetes-with-freebsd-part-6.html
@@ -30,10 +30,12 @@
Introduction
@@ -41,6 +43,10 @@
Some photos here, describe why there are 2 different models of SSD drives (replication etc)
+ZFS encryption keys
+
+UFS on USB keys
+
paul@f0:/ % doas camcontrol devlist
<512GB SSD D910R170> at scbus0 target 0 lun 0 (pass0,ada0)
@@ -57,8 +63,6 @@ paul@f1:/ % doas camcontrol devlist
paul@f1:/ %
-UFS Setup
-
-paul@f0:/dev % doas zpool create -m /data zdata /dev/ada1
-paul@f0:/dev % zpool list
-NAME SIZE ALLOC FREE CKPOINT EXPANDSZ FRAG CAP DEDUP HEALTH ALTROOT
-zdata 928G 432K 928G - - 0% 0% 1.00x ONLINE -
-zroot 472G 19.8G 452G - - 0% 4% 1.00x ONLINE -
-
+
paul@f0:/keys % doas zpool create -m /data zdata /dev/ada1
+paul@f0:/keys % doas zfs create -o encryption=on -o keyformat=raw -o keylocation=file:///keys/`hostname`:zdata.key zdata/enc
+paul@f0:/ % zfs list | grep zdata
+zdata 836K 899G 96K /data
+zdata/enc 200K 899G 200K /data/enc
+paul@f0:/keys % zfs get all zdata/enc | grep -E -i '(encryption|key)'
+zdata/enc encryption aes-256-gcm -
+zdata/enc keylocation file:///keys/f0.lan.buetow.org:zdata.key local
+zdata/enc keyformat raw -
+zdata/enc encryptionroot zdata/enc -
+zdata/enc keystatus available -
-Encryption
+Migrating Bhyve VMs to encrypted bhyve ZFS volume
-USB key for key location
+Run on all 3 nodes
-paul@f0:/keys % doas chown root *
-paul@f0:/keys % doas chmod 400 *
-paul@f0:/keys % ls -ltr
-total 24
--r-------- 1 root paul 16 May 25 11:56 f0.lan.buetow.org:zdata.key
--r-------- 1 root paul 16 May 25 11:56 f0.lan.buetow.org:bhyve.key
--r-------- 1 root paul 16 May 25 11:56 f1.lan.buetow.org:zdata.key
--r-------- 1 root paul 16 May 25 11:56 f1.lan.buetow.org:bhyve.key
--r-------- 1 root paul 16 May 25 11:57 f2.lan.buetow.org:zdata.key
--r-------- 1 root paul 16 May 25 11:57 f2.lan.buetow.org:bhyve.key
-
-
-
-paul@f0:/keys % doas vm init
+paul@f0:/keys % doas vm init
paul@f0:/keys % doas reboot
.
.
@@ -176,12 +175,6 @@ http://www.lorenzobettini.it
http://www.gnu.org/software/src-highlite -->
paul@f0:~ % doas zfs destroy -R zroot/bhyve_old
-paul@f0:~ % zfs get all zdata/enc | grep -E '(encryption|key)'
-zdata/enc encryption aes-256-gcm -
-zdata/enc keylocation file:///keys/f0.lan.buetow.org:zdata.key local
-zdata/enc keyformat raw -
-zdata/enc encryptionroot zdata/enc -
-zdata/enc keystatus available -
paul@f0:~ % zfs get all zroot/bhyve | grep -E '(encryption|key)'
zroot/bhyve encryption aes-256-gcm -
zroot/bhyve keylocation file:///keys/f0.lan.buetow.org:bhyve.key local
@@ -196,30 +189,59 @@ zroot/bhyve/rocky encryptionroot zroot/bhyve -
zroot/bhyve/rocky keystatus available -
-
- paul@f0:~ % zpool status
- pool: zdata
- state: ONLINE
-config:
-
- NAME STATE READ WRITE CKSUM
- zdata ONLINE 0 0 0
- ada1 ONLINE 0 0 0
-
-errors: No known data errors
-
- pool: zroot
- state: ONLINE
-config:
-
- NAME STATE READ WRITE CKSUM
- zroot ONLINE 0 0 0
- ada0p4 ONLINE 0 0 0
-
-errors: No known data errors
-
-HAST
+CARP
+
+adding to /etc/rc.conf on f0 and f1:
+ifconfig_re0_alias0="inet vhid 1 pass testpass alias 192.168.1.138/32"
+
+adding to /etc/hosts:
+
+192.168.1.138 f3s-storage-ha f3s-storage-ha.lan f3s-storage-ha.lan.buetow.org
+
+Adding on f0 and f1:
+
+paul@f0:~ % cat <<END | doas tee -a /etc/devd.conf
+notify 0 {
+ match "system" "CARP";
+ match "subsystem" "[0-9]+@[0-9a-z.]+";
+ match "type" "(MASTER|BACKUP)";
+ action "/usr/local/bin/carpcontrol.sh $subsystem $type";
+};
+END
+
+next, copied that script /usr/local/bin/carpcontrol.sh and adjusted the disk to storage
+
+/boot/loader.conf add carp_load="YES"
+reboot or run doas kldload carp0
+
+
+ZFS auto scrubbing....~?
+
+Backup of the keys on the key locations (all keys on all 3 USB keys)
+
+Other *BSD-related posts:
+
+2025-05-11 f3s: Kubernetes with FreeBSD - Part 5: WireGuard mesh network
+2025-04-05 f3s: Kubernetes with FreeBSD - Part 4: Rocky Linux Bhyve VMs
+2025-02-01 f3s: Kubernetes with FreeBSD - Part 3: Protecting from power cuts
+2024-12-03 f3s: Kubernetes with FreeBSD - Part 2: Hardware and base installation
+2024-11-17 f3s: Kubernetes with FreeBSD - Part 1: Setting the stage
+2024-04-01 KISS high-availability with OpenBSD
+2024-01-13 One reason why I love OpenBSD
+2022-10-30 Installing DTail on OpenBSD
+2022-07-30 Let's Encrypt with OpenBSD and Rex
+2016-04-09 Jails and ZFS with Puppet on FreeBSD
+
+E-Mail your comments to paul@nospam.buetow.org
+
+Back to the main site
+
+https://forums.freebsd.org/threads/hast-and-zfs-with-carp-failover.29639/
+
+
+E-Mail your comments to paul@nospam.buetow.org
+Back to the main site
Hello!
-This site was generated at 2025-06-07T10:30:12+03:00 by Gemtexter
+This site was generated at 2025-06-22T18:57:24+03:00 by Gemtexter
Welcome to the ...
@@ -51,6 +51,7 @@
Posts
+2025-07-22 - Task Samurai
2025-06-07 - 'A Monk's Guide to Happiness' book notes
2025-05-11 - f3s: Kubernetes with FreeBSD - Part 5: WireGuard mesh network
2025-05-02 - Terminal multiplexing with tmux - Fish edition
diff --git a/uptime-stats.html b/uptime-stats.html
index 1867eea5..27f90cba 100644
--- a/uptime-stats.html
+++ b/uptime-stats.html
@@ -13,7 +13,7 @@