Dustin Van Tate Testa dvtate

On systems with UEFI Secure Boot enabled, recent Linux kernels will only load signed modules, so it's about time DKMS grew the capability to sign modules it's building.

These scripts are extended and scriptified variants of https://computerlinguist.org/make-dkms-sign-kernel-modules-for-secure-boot-on-ubuntu-1604.html and https://askubuntu.com/questions/760671/could-not-load-vboxdrv-after-upgrade-to-ubuntu-16-04-and-i-want-to-keep-secur/768310#768310 and add some error checking, a passphrase around your signing key, and support for compressed modules.

dkms-sign-module is a wrapper for the more generic sign-modules which can also be used outside of DKMS.

Installation

Create a directory under /root, say /root/module-signing, put the three scripts below in there and make them executable: chmod u+x one-time-setup sign-modules dkms-sign-module

High-Performance Matrix Multiplication

This is a short post that explains how to write a high-performance matrix multiplication program on modern processors. In this tutorial I will use a single core of the Skylake-client CPU with AVX2, but the principles in this post also apply to other processors with different instruction sets (such as AVX512).

Intro

Matrix multiplication is a mathematical operation that defines the product of

	{-# LANGUAGE DataKinds #-}
	{-# LANGUAGE FlexibleInstances #-}
	{-# LANGUAGE GADTs #-}
	{-# LANGUAGE KindSignatures #-}
	{-# LANGUAGE PolyKinds #-}
	{-# LANGUAGE QuantifiedConstraints #-}
	{-# LANGUAGE RankNTypes #-}
	{-# LANGUAGE Strict #-}
	{-# LANGUAGE StrictData #-}
	{-# LANGUAGE TypeFamilies #-}

	{-# LANGUAGE RankNTypes #-}
	{-# LANGUAGE FlexibleInstances #-}
	{-# LANGUAGE QuantifiedConstraints #-}
	import Prelude hiding (id, (.))
	import Control.Category
	import Control.Monad.State hiding (lift)

	class Category k => Terminal k where
	term :: k a ()

	{-# LANGUAGE DataKinds #-}
	{-# LANGUAGE KindSignatures #-}
	{-# LANGUAGE TypeOperators #-}
	{-# LANGUAGE GADTs #-}
	import Prelude hiding (Applicative (..), const)

	data T = Unit \| T :*: T \| T :-> T

	data Kappa v a b where
	IdK :: Kappa v a a

	let championByIdCache = {};
	let championJson = {};

	async function getLatestChampionDDragon(language = "en_US") {

	if (championJson[language])
	return championJson[language];

	let response;
	let versionIndex = 0;

	/*
	Simple stack Virtual Machine
	Version 1.0
	by DreamVB

	This is a simple example of how to code a simple VM in C
	At the moment this vm only supports a small amount of instruction I hope to add more as I learn more.
	This version has some hard coded example that you can test in the vm. Next version I plan to load the examples from files.

	If you like this code, or if you have some improvements I can make drop me a message below:

	// ==UserScript==
	// @name NoPerformanceNow
	// @namespace https://yuki.network/
	// @version 0.2
	// @description Disables performance.now() to make JavaScript exploits harder.
	// @author ReimuNotMoe, ClassicOldSong
	// @match :///*
	// @grant unsafeWindow
	// ==/UserScript==

	const fs = require("fs");
	const { parse } = require("@webassemblyjs/wast-parser");
	const { print } = require("@webassemblyjs/wast-printer");
	const identifiedToIndex = require("@webassemblyjs/ast/lib/transform/wast-identifier-to-index/index");
	const t = require("@webassemblyjs/ast");
	const traverse = t.traverse;

	const insert = (a1, a2, index) => [
	...a1.slice(0, index),
	...a2,

	<!doctype>
	<html>
	<body>
	<script type="text/javascript">
	/* by m0nt0y4 */
	function binaryAgent(arr) {
	var charcoded = [],
	finalStr = '',
	i;