Channel
@jenkov_com
On this record: Growth · Engagement · What this channel posts · Posts · Telegram's recommendations · Cite this entry
528subscribers
Risers and fallers across the register · movement among entries of Under 1,000.
| Telegram ID | -1001396366086 |
|---|---|
| Type | Channel |
| Username | @jenkov_com |
| Description | This channel contains news from Jenkov.com - such as new and updated tech arcticles, videos, tools etc. |
| Created | Between 1 June 2018 and 31 July 2021 — estimated from Telegram’s id allocation, not measured. How this range is calculated. |
| First recorded | 26 September 2026 |
| Last confirmed live | 26 September 2026 |
| Measurements held | 1 |
| On Telegram | t.me/jenkov_com |
Growth history is still building. We hold one measurement for this entry. A trend needs at least two, taken days apart — so this will fill in on its own rather than being estimated. We do not publish numbers we have not measured.
| Measured (UTC) | Subscribers | Change |
|---|---|---|
| 26 Sept 2026, 00:22 | 528 | first reading |
20 posts held, back to 5 August 2024 — the reader has not yet reached the start of this channel’s public history, so older posts may sit further back, unread. Read across 1 page of Telegram’s post history, 20 posts per page.
Nothing published in the last 30 days. ERR and ER are rolling 30-day measures, so there is nothing to compute — we hold 20 posts for this entry, the most recent from 21 June 2026. An engagement rate over an empty window would be a number about nothing.
Lifetime counters from Telegram’s own channel header, read 26 September 2026 — not the date at the top of this page, which is when the subscriber count was last read. Below Telegram’s rounding threshold, so these counts are exact.
I have updated my book about peer-to-peer networks. I have added a section about "consistent hashing" in the chapter about Distributed Hashtables - and I have added a few more diagrams to this chapter too 😊 https://leanpub.com/p2p-networks #P2P #P2PNetworks #PeerToPeer #PeerToPeerNetworks
I have published a short book about Polymorph Data Language (PDL) on Leanpub. You can find it here: https://leanpub.com/polymorph-data-language Thought it would be nice to make the information about PDL available in PDF-form 😊 Payment is optional...
I have finally released a video about my Polymorph Data Language (PDL), a more versatile, compact and fast alternative to JSON, YAML, XML, CSV etc. The video explains what PDL is, and why I made it. Basically, it removes some annoying limitations in the other data formats, and enables you to represent certain data structures more compactly than in JSON. PDL is also quite easy to tokenize and parse, and performance i…
I have published a video about what I call Access Scoping - a very simple design technique which brings benefits similar to method chaining (my previous video). https://youtu.be/MHkmgQT7Rxo Access scoping is a bit more verbose than method chaining - but you don't have to explicitly design your classes to support access scoping - like you do with method chaining. Also, access scoping gives you full up-reach and sel…
I have published a short video about Method Chaining - that simple technique which enables us to express creation, configuration and assignment of objects more concisely. I know most of you already know method chaining - but I needed this video as a prelude to my next video about Access Scoping - which is a technique that provides about the same benefits as method chaining- but which does not require you to design y…
I have updated my book about P2P Networks with more details about the P2P topology I have invented - called the Polymorph Polyring P2P topology. More specifically, I have added details about: - Alternative GUID schemes (strings instead of numbers) - Ring leaders - Broadcast - Multicast The Polymorph Polyring P2P topology has better support for shaping the topology - e.g. according to the geographical locat…
Here is my video about Compositional Software Design ! This video explains what I mean by compositional design, and explains the SCIFI principles that can guide you when designing for composition. It also explains concepts such designing for replaceability and two-way reusability. It also discusses when to use an interface, and when not. I have been working on the content of this video for more than 1.5 years - and…
Your software design choices matter. In 2006 I released a version of my dependency injection container called Butterfly DI Container - which was feature-wise about on par with the Spring Container and Google Guice. However, the size of the code bases were quite different: - Spring Container: 1,000 KB JAR file - Google Guice: 500 KB JAR file - Butterfly DI Container: 100 KB JAR file That is a factor 5 and …
Imagine a desktop platform that: * Comes with multiple smaller apps embedded. * Lets you script which apps to open in which Windows, on which screens, and which data to load in those apps. * Lets you create your own apps and plug in. * Can connect all the world's users of this platform into a single global P2P Network, made up of lots of smaller, local P2P Networks connected together in a P2P polyring topology. …
When being serious about Compositional Software Design (designing your code base for composability) - you will often experience these two phenomena impact your code base size: 1) Decompositional Expansion 2) Compositional Contraction First, your code base will expand because you are breaking your code base into many smaller pieces that can be composed together to form solutions. This phenomenon (phase) is what I c…
I have released the first drafts of writer and reader code in Java for writing and reading raw, binary Polymorph Data Encoding (PDE). It's located in this GitHub repository :-) https://github.com/jjenkov/polymorph-fabric-java Now PDE is no longer just an idea - no longer just speculative 😊 Now you can see how to actually work with it 😊 More details will come in the future, of course 😊
I have improved my Polymorph Data Encoding specification significantly, so it is now easier to understand. The specification is hosted in a GitHub repo (see link below). I will now proceed to provide a proof-of-concept implementation of a reader and writer utility in Java - for anyone to use - or just to see how to implement reader and writer functionality in other languages. If you are on the lookout for a data en…
Showing the 12 most recent of 20 posts we hold for @jenkov_com. View and reaction counts are the latest single reading for each post, not a live figure, and a recent post is still accumulating both. A view count marked ≈ was rounded by Telegram before we ever saw it — t.me prints views in full below 1,000 and to three significant figures above, so ≈1,200,000 means somewhere between 1,150,000 and 1,249,999. Unmarked counts are exact. Text is reproduced from the public post preview and truncated for length.
The reverse of the list above, and a different kind of signal. This does not require this channel to have ever been asked about directly — each row below is a channel we DID ask Telegram about, whose Telegram-generated list happened to include this one. A channel can appear here with an empty list above it, because being named by someone else’s query is independent of having been queried itself.
This channel appears in 1 seed channel's Telegram-generated recommendation list in total. Each is Telegram’s list for THAT channel, not this one — see how this is measured.
A live page changes as we take new readings, so a citation should name the measurement it is based on, not just the URL. The line below cites the subscriber count as measured 26 September 2026 — this entry's latest reading, not the date you are reading this.
“Jenkov.com” (@jenkov_com), 528 subscribers as measured 26 September 2026. Telegram Register, tgregister.com/channel/jenkov_com.
Full measurement history, CC BY 4.0. Every reading this register holds for this entry, not just the latest one, as a dated, downloadable record: CSV · JSON. Free to use with attribution to tgregister.com. Each file carries its own generation timestamp, which is the figure to cite for exactly when the data was retrieved.