Our examples are located under nodejs/next:
- nodejs/next/hello-world: a hello world. There's an in-tree one at: github.com/vercel/next.js/tree/e75361fd03872b097e817634c049b3185f24cf56/examples/hello-world, but ours is truly minimal
- nodejs/next/hoc: shows how to use a higher order component (HOC) to factor out
getStaticPropsacross two pages: nodejs/next/hoc/pages/index.js and nodejs/next/hoc/pages/notindex.js - nodejs/next/typescript: simple TypeScript example, minimized from: github.com/vercel/next.js/tree/d61b0761efae09bd9cb1201ff134ed8950d9deca/examples/with-typescriptNotably, that shows how
requireerrors are avoided in that case as mentioned at: stackoverflow.com/questions/64926174/module-not-found-cant-resolve-fs-in-next-js-application/70363153#70363153 - nodejs/next/localStorage: a counter that is persistent across page reloads by using
localStorage. Used in: stackoverflow.com/questions/54819721/next-js-access-localstorage-before-rendering-page/68136224#68136224
Solved ones:
- solved by preview mode in Next.js 12:
- ISR was basically unusable for CRUD websites because you can't force a one-off immediate page update:
For Ciro Santilli's campaign for freedom of speech in China: Section "github.com/cirosantilli/china-dictatorship".
Ciro has the radical opinion that absolute freedom of speech must be guaranteed by law for anyone to talk about absolutely anything, anonymously if they wish, with the exception only of copyright-related infringement.
And Ciro believes that there should be no age restriction of access to any information.
People should be only be punished for actions that they actually do in the real world. Not even purportedly planning those actions must be punished. Access and ability to publish information must be completely and totally free.
If you don't like someone, you should just block them, or start your own campaign to prepare a counter for whatever it is that they are want to do.
This freedom does not need to apply to citizens and organizations of other countries, only to citizens of the country in question, since foreign governments can create influence campaigns to affect the rights of your citizens. More info at: cirosantilli.com/china-dictatorship/mark-government-controlled-social-media
Limiting foreign influence therefore requires some kind of nationality check, which could harm anonymity. But Ciro believes that almost certainly such checks can be carried out in anonymous blockchain consensus based mechanisms. Governments would issues nationality tokens, and tokens are used for anonymous confirmations of rights in a way that only the token owner, not even the government, can determine who used the token. E.g. something a bit like what Monero does. Rights could be checked on a once per account basis, or yearly basis, so transaction costs should not be a big issue. Maybe expensive proof-of-work systems can be completely bypassed to the existence of this central token authority?
Some people believe that freedom of speech means "freedom of speech that I agree with". Those people should move to China or some other dictatorship.
Then come the most important symbols:
Num: Value Size Type Bind Vis Ndx Name
4: 0000000000000000 0 NOTYPE LOCAL DEFAULT 1 hello_world
5: 000000000000000d 0 NOTYPE LOCAL DEFAULT ABS hello_world_len
6: 0000000000000000 0 NOTYPE GLOBAL DEFAULT 2 _starthello_world string is in the .data section (index 1). It's value is 0: it points to the first byte of that section._start is marked with GLOBAL visibility since we wrote:global _startin NASM. This is necessary since it must be seen as the entry point. Unlike in C, by default NASM labels are local.
Single level paging scheme numerical translation example Updated 2025-03-28 +Created 1970-01-01
Suppose that the OS has setup the following page tables for process 1:and for process 2:
entry index entry address page address present
----------- ------------------ ------------ -------
0 CR3_1 + 0 * 4 0x00001 1
1 CR3_1 + 1 * 4 0x00000 1
2 CR3_1 + 2 * 4 0x00003 1
3 CR3_1 + 3 * 4 0
...
2^20-1 CR3_1 + 2^20-1 * 4 0x00005 1entry index entry address page address present
----------- ----------------- ------------ -------
0 CR3_2 + 0 * 4 0x0000A 1
1 CR3_2 + 1 * 4 0x12345 1
2 CR3_2 + 2 * 4 0
3 CR3_2 + 3 * 4 0x00003 1
...
2^20-1 CR3_2 + 2^20-1 * 4 0xFFFFF 1Before process 1 starts running, the OS sets its
cr3 to point to the page table 1 at CR3_1.When process 1 tries to access a linear address, this is the physical addresses that will be actually accessed:
linear physical
--------- ---------
00000 001 00001 001
00000 002 00001 002
00000 003 00001 003
00000 FFF 00001 FFF
00001 000 00000 000
00001 001 00000 001
00001 FFF 00000 FFF
00002 000 00003 000
FFFFF 000 00005 000To switch to process 2, the OS simply sets
cr3 to CR3_2, and now the following translations would happen:linear physical
--------- ---------
00000 002 0000A 002
00000 003 0000A 003
00000 FFF 0000A FFF
00001 000 12345 000
00001 001 12345 001
00001 FFF 12345 FFF
00004 000 00003 000
FFFFF 000 FFFFF 000Step-by-step translation for process 1 of logical address
0x00000001 to physical address 0x00001001:- split the linear address into two parts:
| page (20 bits) | offset (12 bits) |So in this case we would have:
*page = 0x00000. This part must be translated to a physical location.
*offset = 0x001. This part is added directly to the page address, and is not translated: it contains the position _within_ the page. - look into Page table 1 because
cr3points to it. - The hardware knows that this entry is located at RAM address
CR3 + 0x00000 * 4 = CR3:
*0x00000because the page part of the logical address is0x00000
*4because that is the fixed size in bytes of every page table entry - since it is present, the access is valid
- by the page table, the location of page number
0x00000is at0x00001 * 4K = 0x00001000. - to find the final physical address we just need to add the offset:
00001 000 + 00000 001 --------- 00001 001because00001is the physical address of the page looked up on the table and001is the offset.We shift00001by 12 bits because the pages are always aligned to 4KiB.The offset is always simply added the physical address of the page. - the hardware then gets the memory at that physical location and puts it in a register.
Another example: for logical address
0x00001001:- the page part is
00001, and the offset part is001 - the hardware knows that its page table entry is located at RAM address:
CR3 + 1 * 4(1because of the page part), and that is where it will look for it - it finds the page address
0x00000there - so the final address is
0x00000 * 4k + 0x001 = 0x00000001
Ciro Santilli has some good related articles listed under: the best articles by Ciro Santillis.
Some people from them contacted Ciro Santilli after Ciro's initial publishing of CIA 2010 covert communication websites.
After a quick Discord chat with them, it was apparent that these people were really cool and knowledgeable.
Also many of them seem to think university is broken and just go hack straigh away.
A perfect example of a dojo learning model.
Also they don't seem to need sleep. Go figure!
With pepole like this, there's hope for Brazil: Section "What poor countries have to do to get richer".
Spacetime diagram illustrating how faster-than-light travel implies time travel
. Legend an explanation are shown in this answer.Bibliography:
- physics.stackexchange.com/questions/13001/does-superluminal-travel-imply-travelling-back-in-time/615079#615079
- physics.stackexchange.com/questions/574395/why-would-ftl-imply-time-travel
- physics.stackexchange.com/questions/516767/how-does-a-tachyonic-antitelephone-work
- www.physicsmatt.com/blog/2016/8/25/why-ftl-implies-time-travel shows the causality violation on a Spacetime diagram
Focal length
Each side is a sphere section. They don't have to have the same radius, they are still simple to understand with different radiuses.
The two things you have to have in mind that this does are:
- This is for example why you can use lenses to burn things with Sun rays, which are basically parallel.Conversely, if the input is a point light source at the focal length, it gets converted into parallel light.
- image formation: it converges all rays coming from a given source point to a single point image. This amplifies the signal, and forms an image at a plane.The source image can be far away, and the virtual image can be close to the lens. This is exactly what we need for a camera.For each distance on one side, it only works for another distance on the other side. So when we set the distance between the lens and the detector, this sets the distance of the source object, i.e. the focus. The equation is:where and are the two distances.
There are six, three in each sense, depending on where you start modulo-3.
There are unlisted articles, also show them or only show them.