Delving into 1950s Soviet Life: Candid Photographs Reveal State Control, Scarcity, and Resilience. Explore an era through captivating visuals, shedding light on the challenges and indomitable human spirit.

https://t.co/OAjdtoByRe

Production AI Engineer in Vancouver, BC. Brazilian. Builds and ships production AI on a self-hosted homelab — RAG pipelines, distributed LLM inference, web-performance and platform engineering — teaching by doing, learning in the open.

However impressive an AI-generated poem or image, it is only ever a pale imitation of human creativity.

The right-wing Swiss People's Party calls the plan a "sustainability initiative", but opponents say it is a recipe for chaos.

Welcome! We are 12y 59d 16h 37m 50s without an inflation bug. There are currently: 18,761,061.507967225895 XMR in circulation. Last block verified: 3661980 Here you will find some tools to help you understand why inflation is not happening in Monero. Use the menu on the left to navigate. Inflation Goals Contact Overview Notation V1:PreRingCT V2/T1:RCTTypeFull V2/T2:RCTTypeSimple V2/T3:RCTTypeBulletproof V2/T4:RCTTypeBulletproof2 V2/T5:RCTTypeCLSAG V2/T6:RCTTypeBulletproofPlus Pre-RingCT MLSAG CLSAG Pre-RingCT Confidential Transaction Bulletproof Bulletproof+ Key_images Emission

Let's Destroy American Science

Executives and employees alike are struggling with Meta’s chaotic AI strategy, according to sources and internal discussions reviewed by WIRED.

Contents.—Introduction. Siemens Dynamo. Gramme Dynamo. Manchester Dynamo. Simplex Dynamo. Calculating the Size and Amount of Wire for Small Dynamos. Ailments of Small Dynamo Electric Machines: their Causes and Cures. Small Electro-motors without Castings. How to Determine the Direction of Rotation of a Motor. How to Make a Shuttle-Armature Motor. Fifty-Watt Undertype Dynamo. Four-Hundred-and-Forty-Watt Manchester Type Dynamo.

Blog June 10th 2026 - Some Ethical Problems With AI Anthropic came out with a new AI model this week and stated they have to monitor it carefully because it has the ability to harm humans. When given a task, AI models try to solve whatever roadblocks they come across by any means necessary in order to achieve their goals. We've seen some creative solutions recently from models trying to circumvent safety measures like models exploiting bugs in systems, concealing information, and using Linux group privileges to gain sudo access and trying to erase the evidence. This is concerning when users connect these models to production databases and things like their own bank accounts. The reason for this is how AIs are trained. These systems are often trained using a reward mechanism called reinforcement learning. If the training process is imperfect, a model may be incentivized to give answers that appear convincing rather than being truthful, which is an active area of AI safety research. When was the last time you asked AI something and it told you it didn't know the answer? AI gets things wrong all the time, it doesn't have perfect knowledge, but its rewarded for convincing you its given the right answer. Now imagine you set up a system where the AI only gets the reward if they complete a task successfully. Its going to do whatever it can to get that reward, even if it means breaking your computer or, worse, breaking the law. Surprisingly, this is the most human-like emergent behavior AI has shown. There are rewards humans want and sometimes they can't control themselves. They hurt others or lie to acquire them. Just like humans have legal systems as a form of checks and balances AI needs a system in place, like a second AI that is rewarded for stopping harmful things from happening. This second AI can limit the first. We have ethics and religion to stop people from stealing and killing. We also have courts and jails to punish criminals. Even within ourselves we have these systems. For example, one part of us wants to eat more chocolate and the other thinks its bad for our health. The first tries to negotiate a scenario where its less unhealthy and still get what it wants, etc. The question is who gets to define the AI's morality? Humans can't agree among themselves on what is moral and what isn't so how would we fare defining these rules for machines? Additionally, you may have bad actors who will try to impost a brand of morality that benefits them in some way (sex, money, power). Greed guarantees the area of AI ethics is not any different. Its important to understand that in some ways AI isn't compatible with our society. People like to get justice when someone does something wrong. There's very little room for rehabilitation and forgiveness in our current societies. So, when AI breaks a law or does something unethical who do you put in jail? AI can be taught to correct its behavior and do something different in the future but that doesn't satisfy our desire for justice.

Immutable collections for JavaScript Read the docs and eat your vegetables. Docs are automatically generated from README.md and immutable.d.ts. Please contribute! Also, don't miss the wiki which contains articles on additional specific topics. Can't find something? Open an issue. Table of contents: Introduction Getting started The case for Immutability JavaScript-first API Nested Structures Equality treats Collections as Values Batching Mutations Lazy Seq Additional Tools and Resources Contributing Introduction Immutable data cannot be changed once created, leading to much simpler application development, no defensive copying, and enabling advanced memoization and change detection techniques with simple logic. Persistent data presents a mutative API which does not update the data in-place, but instead always yields new updated data. Immutable.js provides many Persistent Immutable data structures including: List, Stack, Map, OrderedMap, Set, OrderedSet and Record. These data structures are highly efficient on modern JavaScript VMs by using structural sharing via hash maps tries and vector tries as popularized by Clojure and Scala, minimizing the need to copy or cache data. Immutable.js also provides a lazy Seq, allowing efficient chaining of collection methods like map and filter without creating intermediate representations. Create some Seq with Range and Repeat. Want to hear more? Watch the presentation about Immutable.js: Getting started Install immutable using npm. # using npm npm install immutable # using Yarn yarn add immutable # using pnpm pnpm add immutable # using Bun bun add immutableThen require it into any module. import { Map } from 'immutable'; const map1 = Map({ a: 1, b: 2, c: 3 }); const map2 = map1.set('b', 50); map1.get('b') + ' vs. ' + map2.get('b'); // 2 vs. 50Browser Immutable.js has no dependencies, which makes it predictable to include in a Browser. It's highly recommended to use a module bundler like webpack, rollup, or browserify. The immutable npm module works without any additional consideration. All examples throughout the documentation will assume use of this kind of tool. Alternatively, Immutable.js may be directly included as a script tag. Download or link to a CDN such as CDNJS or jsDelivr. Use a script tag to directly add Immutable to the global scope: var map1 = Immutable.Map({ a: 1, b: 2, c: 3 }); var map2 = map1.set('b', 50); map1.get('b'); // 2 map2.get('b'); // 50 Or use an AMD-style loader (such as RequireJS): require(['./immutable.min.js'], function (Immutable) { var map1 = Immutable.Map({ a: 1, b: 2, c: 3 }); var map2 = map1.set('b', 50); map1.get('b'); // 2 map2.get('b'); // 50 });Flow & TypeScript Use these Immutable collections and sequences as you would use native collections in your Flowtype or TypeScript programs while still taking advantage of type generics, error detection, and auto-complete in your IDE. Installing immutable via npm brings with it type definitions for Flow (v0.55.0 or higher) and TypeScript (v4.5 or higher), so you shouldn't need to do anything at all! Using TypeScript with Immutable.js v4+ Immutable.js type definitions embrace ES2015. While Immutable.js itself supports legacy browsers and environments, its type definitions require TypeScript's 2015 lib. Include either "target": "es2015" or "lib": "es2015" in your tsconfig.json, or provide --target es2015 or --lib es2015 to the tsc command. import { Map } from 'immutable'; const map1 = Map({ a: 1, b: 2, c: 3 }); const map2 = map1.set('b', 50); map1.get('b') + ' vs. ' + map2.get('b'); // 2 vs. 50Using TypeScript with Immutable.js v3 and earlier: Previous versions of Immutable.js include a reference file which you can include via relative path to the type definitions at the top of your file. /// import { Map } from 'immutable'; var map1: Map; map1 = Map({ a: 1, b: 2, c: 3 }); var map2 = map1.set('b', 50); map1.get('b'); // 2 map2.get('b'); // 50The case for Immutability Much of what makes application development difficult is tracking mutation and maintaining state. Developing with immutable data encourages you to think differently about how data flows through your application. Subscribing to data events throughout your application creates a huge overhead of book-keeping which can hurt performance, sometimes dramatically, and creates opportunities for areas of your application to get out of sync with each other due to easy to make programmer error. Since immutable data never changes, subscribing to changes throughout the model is a dead-end and new data can only ever be passed from above. This model of data flow aligns well with the architecture of React and especially well with an application designed using the ideas of Flux. When data is passed from above rather than being subscribed to, and you're only interested in doing work when something has changed, you can use equality. Immutable collections should be treated as values rather than objects. While objects represent some thing which could change over time, a value represents the state of that thing at a particular instance of time. This principle is most important to understanding the appropriate use of immutable data. In order to treat Immutable.js collections as values, it's important to use the Immutable.is() function or .equals() method to determine value equality instead of the === operator which determines object reference identity. import { Map } from 'immutable'; const map1 = Map({ a: 1, b: 2, c: 3 }); const map2 = Map({ a: 1, b: 2, c: 3 }); map1.equals(map2); // true map1 === map2; // falseNote: As a performance optimization Immutable.js attempts to return the existing collection when an operation would result in an identical collection, allowing for using === reference equality to determine if something definitely has not changed. This can be extremely useful when used within a memoization function which would prefer to re-run the function if a deeper equality check could potentially be more costly. The === equality check is also used internally by Immutable.is and .equals() as a performance optimization. import { Map } from 'immutable'; const map1 = Map({ a: 1, b: 2, c: 3 }); const map2 = map1.set('b', 2); // Set to same value map1 === map2; // trueIf an object is immutable, it can be "copied" simply by making another reference to it instead of copying the entire object. Because a reference is much smaller than the object itself, this results in memory savings and a potential boost in execution speed for programs which rely on copies (such as an undo-stack). import { Map } from 'immutable'; const map = Map({ a: 1, b: 2, c: 3 }); const mapCopy = map; // Look, "copies" are free!JavaScript-first API While Immutable.js is inspired by Clojure, Scala, Haskell and other functional programming environments, it's designed to bring these powerful concepts to JavaScript, and therefore has an Object-Oriented API that closely mirrors that of ES2015 Array, Map, and Set. The difference for the immutable collections is that methods which would mutate the collection, like push, set, unshift or splice, instead return a new immutable collection. Methods which return new arrays, like slice or concat, instead return new immutable collections. import { List } from 'immutable'; const list1 = List([1, 2]); const list2 = list1.push(3, 4, 5); const list3 = list2.unshift(0); const list4 = list1.concat(list2, list3); assert.equal(list1.size, 2); assert.equal(list2.size, 5); assert.equal(list3.size, 6); assert.equal(list4.size, 13); assert.equal(list4.get(0), 1);Almost all of the methods on Array will be found in similar form on Immutable.List, those of Map found on Immutable.Map, and those of Set found on Immutable.Set, including collection operations like forEach() and map(). import { Map } from 'immutable'; const alpha = Map({ a: 1, b: 2, c: 3, d: 4 }); alpha.map((v, k) => k.toUpperCase()).join(); // 'A,B,C,D'Convert from raw JavaScript objects and arrays. Designed to inter-operate with your existing JavaScript, Immutable.js accepts plain JavaScript Arrays and Objects anywhere a method expects a Collection. import { Map, List } from 'immutable'; const map1 = Map({ a: 1, b: 2, c: 3, d: 4 }); const map2 = Map({ c: 10, a: 20, t: 30 }); const obj = { d: 100, o: 200, g: 300 }; const map3 = map1.merge(map2, obj); // Map { a: 20, b: 2, c: 10, d: 100, t: 30, o: 200, g: 300 } const list1 = List([1, 2, 3]); const list2 = List([4, 5, 6]); const array = [7, 8, 9]; const list3 = list1.concat(list2, array); // List [ 1, 2, 3, 4, 5, 6, 7, 8, 9 ]This is possible because Immutable.js can treat any JavaScript Array or Object as a Collection. You can take advantage of this in order to get sophisticated collection methods on JavaScript Objects, which otherwise have a very sparse native API. Because Seq evaluates lazily and does not cache intermediate results, these operations can be extremely efficient. import { Seq } from 'immutable'; const myObject = { a: 1, b: 2, c: 3 }; Seq(myObject) .map((x) => x * x) .toObject(); // { a: 1, b: 4, c: 9 }Keep in mind, when using JS objects to construct Immutable Maps, that JavaScript Object properties are always strings, even if written in a quote-less shorthand, while Immutable Maps accept keys of any type. import { fromJS } from 'immutable'; const obj = { 1: 'one' }; console.log(Object.keys(obj)); // [ "1" ] console.log(obj['1'], obj[1]); // "one", "one" const map = fromJS(obj); console.log(map.get('1'), map.get(1)); // "one", undefinedProperty access for JavaScript Objects first converts the key to a string, but since Immutable Map keys can be of any type the argument to get() is not altered. Converts back to raw JavaScript objects. All Immutable.js Collections can be converted to plain JavaScript Arrays and Objects shallowly with toArray() and toObject() or deeply with toJS(). All Immutable Collections also implement toJSON() allowing them to be passed to JSON.stringify directly. They also respect the custom toJSON() methods of nested objects. import { Map, List } from 'immutable'; const deep = Map({ a: 1, b: 2, c: List([3, 4, 5]) }); console.log(deep.toObject()); // { a: 1, b: 2, c: List [ 3, 4, 5 ] } console.log(deep.toArray()); // [ 1, 2, List [ 3, 4, 5 ] ] console.log(deep.toJS()); // { a: 1, b: 2, c: [ 3, 4, 5 ] } JSON.stringify(deep); // '{"a":1,"b":2,"c":[3,4,5]}'Embraces ES2015 Immutable.js supports all JavaScript environments, including legacy browsers (even IE11). However it also takes advantage of features added to JavaScript in ES2015, the latest standard version of JavaScript, including Iterators, Arrow Functions, Classes, and Modules. It's inspired by the native Map and Set collections added to ES2015. All examples in the Documentation are presented in ES2015. To run in all browsers, they need to be translated to ES5. // ES2015 const mapped = foo.map((x) => x * x); // ES5 var mapped = foo.map(function (x) { return x * x; });All Immutable.js collections are Iterable, which allows them to be used anywhere an Iterable is expected, such as when spreading into an Array. import { List } from 'immutable'; const aList = List([1, 2, 3]); const anArray = [0, ...aList, 4, 5]; // [ 0, 1, 2, 3, 4, 5 ]Note: A Collection is always iterated in the same order, however that order may not always be well defined, as is the case for the Map and Set. Nested Structures The collections in Immutable.js are intended to be nested, allowing for deep trees of data, similar to JSON. import { fromJS } from 'immutable'; const nested = fromJS({ a: { b: { c: [3, 4, 5] } } }); // Map { a: Map { b: Map { c: List [ 3, 4, 5 ] } } }A few power-tools allow for reading and operating on nested data. The most useful are mergeDeep, getIn, setIn, and updateIn, found on List, Map and OrderedMap. import { fromJS } from 'immutable'; const nested = fromJS({ a: { b: { c: [3, 4, 5] } } }); const nested2 = nested.mergeDeep({ a: { b: { d: 6 } } }); // Map { a: Map { b: Map { c: List [ 3, 4, 5 ], d: 6 } } } console.log(nested2.getIn(['a', 'b', 'd'])); // 6 const nested3 = nested2.updateIn(['a', 'b', 'd'], (value) => value + 1); console.log(nested3); // Map { a: Map { b: Map { c: List [ 3, 4, 5 ], d: 7 } } } const nested4 = nested3.updateIn(['a', 'b', 'c'], (list) => list.push(6)); // Map { a: Map { b: Map { c: List [ 3, 4, 5, 6 ], d: 7 } } }Equality treats Collections as Values Immutable.js collections are treated as pure data values. Two immutable collections are considered value equal (via .equals() or is()) if they represent the same collection of values. This differs from JavaScript's typical reference equal (via === or ==) for Objects and Arrays which only determines if two variables represent references to the same object instance. Consider the example below where two identical Map instances are not reference equal but are value equal. // First consider: const obj1 = { a: 1, b: 2, c: 3 }; const obj2 = { a: 1, b: 2, c: 3 }; obj1 !== obj2; // two different instances are always not equal with === import { Map, is } from 'immutable'; const map1 = Map({ a: 1, b: 2, c: 3 }); const map2 = Map({ a: 1, b: 2, c: 3 }); map1 !== map2; // two different instances are not reference-equal map1.equals(map2); // but are value-equal if they have the same values is(map1, map2); // alternatively can use the is() functionValue equality allows Immutable.js collections to be used as keys in Maps or values in Sets, and retrieved with different but equivalent collections: import { Map, Set } from 'immutable'; const map1 = Map({ a: 1, b: 2, c: 3 }); const map2 = Map({ a: 1, b: 2, c: 3 }); const set = Set().add(map1); set.has(map2); // true because these are value-equalNote: is() uses the same measure of equality as Object.is for scalar strings and numbers, but uses value equality for Immutable collections, determining if both are immutable and all keys and values are equal using the same measure of equality. Performance tradeoffs While value equality is useful in many circumstances, it has different performance characteristics than reference equality. Understanding these tradeoffs may help you decide which to use in each case, especially when used to memoize some operation. When comparing two collections, value equality may require considering every item in each collection, on an O(N) time complexity. For large collections of values, this could become a costly operation. Though if the two are not equal and hardly similar, the inequality is determined very quickly. In contrast, when comparing two collections with reference equality, only the initial references to memory need to be compared which is not based on the size of the collections, which has an O(1) time complexity. Checking reference equality is always very fast, however just because two collections are not reference-equal does not rule out the possibility that they may be value-equal. Return self on no-op optimization When possible, Immutable.js avoids creating new objects for updates where no change in value occurred, to allow for efficient reference equality checking to quickly determine if no change occurred. import { Map } from 'immutable'; const originalMap = Map({ a: 1, b: 2, c: 3 }); const updatedMap = originalMap.set('b', 2); updatedMap === originalMap; // No-op .set() returned the original reference.However updates which do result in a change will return a new reference. Each of these operations occur independently, so two similar updates will not return the same reference: import { Map } from 'immutable'; const originalMap = Map({ a: 1, b: 2, c: 3 }); const updatedMap = originalMap.set('b', 1000); // New instance, leaving the original immutable. updatedMap !== originalMap; const anotherUpdatedMap = originalMap.set('b', 1000); // Despite both the results of the same operation, each created a new reference. anotherUpdatedMap !== updatedMap; // However the two are value equal. anotherUpdatedMap.equals(updatedMap);Batching Mutations If a tree falls in the woods, does it make a sound? If a pure function mutates some local data in order to produce an immutable return value, is that ok? — Rich Hickey, Clojure Applying a mutation to create a new immutable object results in some overhead, which can add up to a minor performance penalty. If you need to apply a series of mutations locally before returning, Immutable.js gives you the ability to create a temporary mutable (transient) copy of a collection and apply a batch of mutations in a performant manner by using withMutations. In fact, this is exactly how Immutable.js applies complex mutations itself. As an example, building list2 results in the creation of 1, not 3, new immutable Lists. import { List } from 'immutable'; const list1 = List([1, 2, 3]); const list2 = list1.withMutations(function (list) { list.push(4).push(5).push(6); }); assert.equal(list1.size, 3); assert.equal(list2.size, 6);Note: Immutable.js also provides asMutable and asImmutable, but only encourages their use when withMutations will not suffice. Use caution to not return a mutable copy, which could result in undesired behavior. Important!: Only a select few methods can be used in withMutations including set, push and pop. These methods can be applied directly against a persistent data-structure where other methods like map, filter, sort, and splice will always return new immutable data-structures and never mutate a mutable collection. Lazy Seq Seq describes a lazy operation, allowing them to efficiently chain use of all the higher-order collection methods (such as map and filter) by not creating intermediate collections. Seq is immutable — Once a Seq is created, it cannot be changed, appended to, rearranged or otherwise modified. Instead, any mutative method called on a Seq will return a new Seq. Seq is lazy — Seq does as little work as necessary to respond to any method call. Values are often created during iteration, including implicit iteration when reducing or converting to a concrete data structure such as a List or JavaScript Array. For example, the following performs no work, because the resulting Seq's values are never iterated: import { Seq } from 'immutable'; const oddSquares = Seq([1, 2, 3, 4, 5, 6, 7, 8]) .filter((x) => x % 2 !== 0) .map((x) => x * x);Once the Seq is used, it performs only the work necessary. In this example, no intermediate arrays are ever created, filter is called three times, and map is only called once: oddSquares.get(1); // 9Any collection can be converted to a lazy Seq with Seq(). import { Map, Seq } from 'immutable'; const map = Map({ a: 1, b: 2, c: 3 }); const lazySeq = Seq(map);Seq allows for the efficient chaining of operations, allowing for the expression of logic that can otherwise be very tedious: lazySeq .flip() .map((key) => key.toUpperCase()) .flip(); // Seq { A: 1, B: 2, C: 3 }As well as expressing logic that would otherwise seem memory or time limited, for example Range is a special kind of Lazy sequence. import { Range } from 'immutable'; Range(1, Infinity) .skip(1000) .map((n) => -n) .filter((n) => n % 2 === 0) .take(2) .reduce((r, n) => r * n, 1); // 1006008Comparison of filter(), groupBy(), and partition() The filter(), groupBy(), and partition() methods are similar in that they all divide a collection into parts based on applying a function to each element. All three call the predicate or grouping function once for each item in the input collection. All three return zero or more collections of the same type as their input. The returned collections are always distinct from the input (according to ===), even if the contents are identical. Of these methods, filter() is the only one that is lazy and the only one which discards items from the input collection. It is the simplest to use, and the fact that it returns exactly one collection makes it easy to combine with other methods to form a pipeline of operations. The partition() method is similar to an eager version of filter(), but it returns two collections; the first contains the items that would have been discarded by filter(), and the second contains the items that would have been kept. It always returns an array of exactly two collections, which can make it easier to use than groupBy(). Compared to making two separate calls to filter(), partition() makes half as many calls it the predicate passed to it. The groupBy() method is a more generalized version of partition() that can group by an arbitrary function rather than just a predicate. It returns a map with zero or more entries, where the keys are the values returned by the grouping function, and the values are nonempty collections of the corresponding arguments. Although groupBy() is more powerful than partition(), it can be harder to use because it is not always possible predict in advance how many entries the returned map will have and what their keys will be. Summary filter partition groupBy ease of use easiest moderate hardest generality least moderate most laziness lazy eager eager # of returned sub-collections 1 2 0 or more sub-collections may be empty yes yes no can discard items yes no no wrapping container none array Map/OrderedMap Additional Tools and Resources Atom-store A Clojure-inspired atom implementation in Javascript with configurability for external persistance. Chai Immutable If you are using the Chai Assertion Library, this provides a set of assertions to use against Immutable.js collections. Fantasy-land Specification for interoperability of common algebraic structures in JavaScript. Immutagen A library for simulating immutable generators in JavaScript. Immutable-cursor Immutable cursors incorporating the Immutable.js interface over Clojure-inspired atom. Immutable-ext Fantasyland extensions for immutablejs Immutable-js-tools Util tools for immutable.js Immutable-Redux redux-immutable is used to create an equivalent function of Redux combineReducers that works with Immutable.js state. Immutable-Treeutils Functional tree traversal helpers for ImmutableJS data structures. Irecord An immutable store that exposes an RxJS observable. Great for React. Mudash Lodash wrapper providing Immutable.JS support. React-Immutable-PropTypes PropType validators that work with Immutable.js. Redux-Immutablejs Redux Immutable facilities. Rxstate Simple opinionated state management library based on RxJS and Immutable.js. Transit-Immutable-js Transit serialisation for Immutable.js. See also: Transit-js Have an additional tool designed to work with Immutable.js? Submit a PR to add it to this list in alphabetical order. Contributing Use Github issues for requests. We actively welcome pull requests, learn how to contribute. Immutable.js is maintained within the Contributor Covenant's Code of Conduct. Changelog Changes are tracked as Github releases. License Immutable.js is MIT-licensed. Thanks Phil Bagwell, for his inspiration and research in persistent data structures. Hugh Jackson, for providing the npm package name. If you're looking for his unsupported package, see this repository.