morrowind

authentic content my hat

Can the vps provider not read everything on your server, unless it's explicitly encrypted?

I'm asking because I'm interested in self-hosting mainly as a way to get privacy respecting services where good hosted ones don't exist. I'm not sure I really want to deal with running my own hardware

Dear Framework enthusiasts,

After several days of intense development exclusively for my Patreon supporters, I'm thrilled to announce the release of Framework Hub in C#! This complete rewrite brings enhanced performance, stability, and a beautiful modern interface to help you get the most out of your Framework laptop.

✨ What's New?

The C# version has been rebuilt from the ground up with:

• A sleek, modern UI using Avalonia framework

• Enhanced performance and reliability

• Full Windows 11 integration

• Professional installer with automatic driver setup

• Improved AMD CPU management

• Show/hide window with F12

r/framework - [W11]🎉 Framework Hub: The Ultimate Framework Laptop Control Center - Now in C#! 🎉 🛠️ Key Features:

Advanced Power Management

• Fine-tuned AMD Ryzen processor control

• Custom power profiles for different use cases

• Real-time monitoring of CPU parameters

• Temperature and power limit adjustments

r/framework - [W11]🎉 Framework Hub: The Ultimate Framework Laptop Control Center - Now in C#! 🎉 2. Windows Package Manager Integration

• Seamless updates for your applications

• Direct access to Intel, AMD, and Framework drivers

• One-click updates for system components

• Integrated CTT Winutils for system optimization

r/framework - [W11]🎉 Framework Hub: The Ultimate Framework Laptop Control Center - Now in C#! 🎉 3. Hardware Monitoring

• Real-time system statistics

• Temperature monitoring

• Power consumption tracking

• Performance metrics

r/framework - [W11]🎉 Framework Hub: The Ultimate Framework Laptop Control Center - Now in C#! 🎉 4. User Interface

• Modern Fluent Design

• Dark mode support

• Smooth animations

• Intuitive controls

• High DPI support

🔒 Exclusive Benefits for Patreon Supporters:

• Immediate access to the full installer

• Priority support

• Early access to new features

• Direct input on future development

A debug version will be available later on GitHub, but Patreon supporters get immediate access to the complete, polished experience.

💡 Coming Soon:

• Intel support ! Thanks to Nirav Patel

• Enhanced monitoring capabilities

• More battery optimization features

• And more based on your feedback!

🙏 Thank You!

Your support makes this development possible. By being a Patreon supporter, you're not just getting early access - you're helping shape the future of Framework laptop utilities.

Download Instructions:

I was unable to upload even the shortest video because it was too long for my instance. Therefore, please enjoy the following:

1. Partial visualization of test data. I cut this short because it took 40 seconds to do just a few (out of 81) paths: https://youtube.com/shorts/7UvzgSsMQNA
2. Partial visualization of full data. I cut this short because I didn't want to wait 40 minutes. It's sped up 2x by making it 60fps (each step is approximately one frame) https://youtu.be/cv9qSdrV2Z4
3. Full visualization, but it only shows the end paths, not individual steps: https://youtube.com/shorts/ozQ77ikI7JI

Unfortunately youtube is forcing my videos to be shorts due to aspect ratio and length, I don't know if I can force them to a regular video

Full input link (it's kinda cool ngl): https://youtu.be/Jw3CXcaHZ0Q

I thought about it for 15 mins, but couldn't think of any mathematical tricks. I thought of lots of minor tricks, like comparing the number to the result and not adding any more multiplications if it's over, things that would cut 10%-20% here and there, but nothing which fundamentally changes big O running time.

For reference, here's my solution for part 2 in smalltalk. I just generated every possible permutation and tested it. Part 1 is similar, mainly I just used bit magic to avoid generating permutations.

(even if you haven't used it, smalltalk is fairly readable, everything is left to right, except in parens)

day7p2: in
	| input | 
	
	input := in lines collect: [ :l | (l splitOn: '\:|\s' asRegex) reject: #isEmpty thenCollect: #asInteger ].
	
	^ (input select: [ :line |
		(#(1 2 3) permutationsWithRepetitionsOfSize: line size - 2) 
			anySatisfy: [ :num | (self d7addmulcat: line ops: num) = (line at: 1)]
	]) sum: #first.

d7addmulcat: nums ops: ops
	| final |
	
	final := nums at: 2.
	ops withIndexDo: [ :op :i |
		op = 1 ifTrue: [ final := final * (nums at: i + 2) ].
		op = 2 ifTrue: [ final := final + (nums at: i + 2) ].
		op = 3 ifTrue: [ final := (final asString, (nums at: i+2) asString) asInteger ]
	].

	^ final

Full input version here: https://youtu.be/itc7_HZmewQ

This poor guard must the fittest person in 1518. Man's doing a marathon every day