~/notes

Notes

A collection of concise notes, an attempt to replicate Zettelkasten note taking system.

  • >>Nonlinearity

    Why a stack of matrix multiplications needs a nonlinear operation between the layers, or the depth buys nothing.

  • Rate of change, partial derivatives, and the composition rule that makes backpropagation possible.

  • Average and spread — and why controlling spread is most of what odd-looking constants in neural networks are for

  • An assignment of non-negative numbers summing to one over a set of outcomes, and the sampling it supports.

  • Dot products, matrix shapes, and the one rule that governs whether two arrays can multiply.

  • >>Logarithms

    The inverse of exponentiation: the power a base must be raised to in order to produce a number.

  • >>Power Laws

    Relationships of the form y = ax^k, which appear as straight lines on log-log axes.

  • Architecture patterns are structural choices evaluated against system constraints and expected change.

  • A request-response workflow where processing completes after the initiating call has returned.

  • Certificate validation links a peer identity to a configured trust anchor through signed certificates.

  • An opaque identifier used to associate messages and logs that belong to the same logical exchange.

  • A transaction groups database operations into a unit with defined atomicity, consistency, isolation, and durability guarantees.

  • Distributed commit protocols coordinate one commit-or-abort decision across transactional participants.

  • >>DNS

    The Domain Name System resolves names through delegated zones, recursive resolvers, authoritative servers, and caches.

  • Java wrapper equality depends on whether code compares primitive values, object identity, or object values.

  • >>MVCC

    Multi-Version Concurrency Control serves row versions according to transaction visibility rules.

  • A comparison of pull-based polling and push-based webhooks for asynchronous result delivery.

  • RabbitMQ request-reply options using explicit callback queues or Direct Reply-To.

  • >>Saga Pattern

    A saga coordinates committed local transactions and compensating actions across a long-running workflow.

  • >>TLS

    Transport Layer Security protects application data in transit and authenticates one or both peers.

  • Operational practices for deploying TLS with verifiable identities, automated renewal, and tested policy.

  • >>TLS Handshake

    The TLS handshake negotiates security parameters, authenticates peers, and derives traffic keys.

  • A write-ahead log records changes durably before related data pages may reach permanent storage.

  • >>Durability

    A transaction must transform the database from one consistent state to another consistent state.

  • >>Consistency

    A transaction must transform the database from one consistent state to another consistent state.

  • >>Isolation

    Isolation is the "I" in ACID - it governs how concurrent transactions interact with each other in a database.

  • >>Atomicity

    Atomicity ensures the All-or-Nothing behavior of a transaction.

  • >>mTLS

    mTLS (Mutual Transport Layer Security) is a security process that ensures traffic is secure and trusted in both directions between a client and a server.

  • Cyclomatic complexity is used to measure the complexity of a program

  • >>Active Object

    Design pattern to facilitate asynchronous programming

  • >>Active Record

    Design pattern to manage the data model

  • >>HTTP

    Explains HyperText Transfer Protocol (HTTP)

  • >>gRPC

    Explains Google Remote Procedure Call

  • Explains Protocol Buffers

  • >>rpc

    Explains remote procedural call

  • >>epoll

    Explains Kernel epoll interface

  • Explains Linux File Descriptor