nyrikki

18 ms·

151.
by nyrikki 11mo ago
There is a bit of a problem with polysemy here. While the input for qemu is called a "pve-cpuset" for affinity [0], it is using explicitly the taskset [1][3] command. This is different than cpuset[2], or how libvirt allows the c
152.
by nyrikki 11mo ago
Correct sorry I don't use the web-ui's and was confusing oVirt, I forgot that you are using perl modules to call qemu/lxc. I would strongly suggest more work on your NUMA/cpuset limitations. I know people have been worki
153.
by nyrikki 11mo ago
Thus why libvirt was added, it works with KVM, Xen, VMware ESXi, QEMU etc... but yes most of the tools like ansible only support libvirt_lxc and libvirt_qemu today but it isn't too hard to use for any modern admin with automation exper
154.
by nyrikki 11mo ago
> The one thing I couldn't make work was the OEM installation, where you put everything down onto the system unattended then put the user through the Ubuntu OOBE process. Did you try chain booting into iPXE and using SYSLINUX? I use
155.
by nyrikki 11mo ago
HPE VM Essentials and Proxmox are just UI/wrappers/+ on top of kvm/virsh/libvirt for the virtualization side. You can grow out of either by just moving to self hosted, or you can avoid both for the virtualization part
156.
by nyrikki 1y ago
Even in the old days we were horizontal at the app layer, the persistence layer is what is hard. Unless you have some very specific need, I was horizontally scaling the app layer in 1996 even in true monoliths. K8s can be too much, but even
157.
by nyrikki 1y ago
The problem being, most people are in the cloud, and ‘basic 1+1 redundancy’ simply doesn’t work well in that distributed model and scaled up instances are expensive. The tooling is good enough to scale out, but micro services are mostly ben
158.
by nyrikki 1y ago
You are correct, the problem is that Decimal64 has 16 digits of significand, while items like apportioned per call taxes need to be calculated with six digits past the decimal before rounding which requires about 20 digits. Other calculatio
159.
by nyrikki 1y ago
Decimal128 has exact rounding of decimal rules and preserves trailing zeros. I don’t think Decimal64 has the same features, but it has been a while. But unless you hit the limits of 34 decimal digits of significand, Decimal128 will work for
160.
by nyrikki 1y ago
While I don’t disagree with his argument for preferred conventions in an era of accumulators/gp registers, I am surprised he didn’t call out why Fortran used 1, The IBM 704's index registers were decrementing, subtracting their co
161.
by nyrikki 1y ago
When you try to compress highly compressed or random data the size expands. At least on the LTO tape drives I have used, will disable compression if the size is larger in an adaptive way. As tape read and write speeds depend on data size, i
162.
by nyrikki 1y ago
It is not a nit it is fundamental, a•b•c is associativity, specifically operator associativity . Rounding and eventual underflow in IEEE means an expression X•Y for any algebraic operation • produces, if finite, a result (X•Y)·( 1 + ß )
163.
by nyrikki 1y ago
IEEE 754 floating-point addition and multiplication are commutative in practice, even if there are exceptions with NaNs etc.. But remember that commutative is on the operations (+,x) which are binary operations, a+b=b+a and a b=b a, you can
164.
by nyrikki 1y ago
Saving the seed in the build artifacts/logs has saved a lot of time for me even with tools like faker.
165.
by nyrikki 1y ago
John McCarthy‘s qualification problem[0] relates to this. While one can and will add invariants, as they are discovered, they cannot all be found. Entscheidungsproblem and Trakhtenbrot's theorem apply here, counterintuitively that the
166.
by nyrikki 1y ago
That was only the proximate cause, the ultimate cause was cultural. As complex systems and efforts run into problems, it is trivial to blame the unit conversion when they had been ignoring people for months who had concerns [0] > ... gr
167.
by nyrikki 1y ago
In a perfect world, in my opinion is that they are incompatibles, and the equality operation should return False in both cases. But equality is a very complicated concept. I guess if the values are incomparable != preserves PEM But Boolean
168.
by nyrikki 1y ago
> The claim isn’t that Postgres is functionally equivalent to any of these specialized systems. The claim is that it handles 80%+ of their use cases with 20% of the development effort. (Pareto Principle) Lots of us that built systems whe
169.
by nyrikki 1y ago
While I fully support your efforts to make better tooling, UML is the poster child for this. I highly encourage people working in this space to revisit those lessons. Obviously if you find a new way to work around the limitations please run
170.
by nyrikki 1y ago
Due to rising power densities, and constrained power and costs of that power, modern data centers tend to use free air cooling vs the older always compressor cooling. When the temperatures are right they basically just use fans to bring
171.
by nyrikki 1y ago
> That is not at all what it says. Gödel's incompleteness theorems demonstrate that any computable system that is sufficiently powerful, cannot be both consistent and syntactically complete. Godel's second proved, a formula Con
172.
by nyrikki 1y ago
Most of these happen at most scales, but is more to do with the classic laws of classic logic that we accept A priori because they are useful. * PNC: at most one is true; both can be false * PEM, at least one is true; both can be true *
173.
by nyrikki 1y ago
A polyhedron has the Rupert property if a polyhedron of the same or larger size and the same shape as can pass through a hole in the original polyhedron. A sphere is a surface of constant width, which the polyhedron approximation is not. &g
174.
by nyrikki 1y ago
LLMs and Lean are orthogonal, neither subsumes either. They both can be useful or harmful, do to their respective strengths and trade offs. PAC/statistical learning is good at needles in the haystack problems assuming that the tail los
175.
by nyrikki 1y ago
> Finding such a scaling amounts to solving a trigonometric Diophantine equation, and the solution applies to any physical system governed by SO(3) or SU(2), such as magnetic spins or qubits. Can anyone comment on the difficulty of solvi
176.
by nyrikki 1y ago
For those who are frustrated with the lack of a fleshed out limitations section, it seems well covered under the peer review which is in the link above or directly below [0] To me the paper is still very interesting, but concerns about comp
177.
by nyrikki 1y ago
There are multiple reasons. 1) A large segment of people make purchase decisions based on payment schedules rather than the total cost of driving or even residual value. 2) Today 2/3 of car loans are are 72 months, meaning that even fo
178.
by nyrikki 1y ago
They are in most spreadsheets and many databases now. Even Sheets and Numbers and Oracle SQL etc... maybe just without the same UI. Microsoft copied the basic concept from Lotus, and Borland also copied it etc...
179.
by nyrikki 1y ago
I should add that “connectedness” is a local property that has to be everywhere. The antipode pairs don’t have unique identities they are identified together, but IIRC they are never close enough to break that local condition of connectivit
180.
by nyrikki 1y ago
No, the belt trick is about the fundamental group of SO(n) where n>2 is Z_2and the fact that a 4pi rotation is homotopic to the identity. It is often introduced as RP^3 being isomorphic to SO(3) and as RP^3 is not simply being connected

More ›