Run by volunteers from the London Perl & Raku community, LPW will have talks about Perl, Raku, and other languages, technologies, and topics.

YAPC::Tokyo 2026 is a technical conference organized by the Japan Perl Association, marking its 10th anniversary.

by Flávio Glock (FGLOCK)

PerlOnJava 5.44.1 is released. This is a big milestone, with the regex implementation, ithreads, taint mode, and async/await now complete.

by Ron Savage (RSAVAGE)

by John Napiorkowski (JJNAPIORK)

John the contract of connection management in PAGI. The article explains how both send and receive futures can be resolved without exceptions when the client has disconnected thus avoiding the complexity of manual exception handling and allowing for predictable and consistent transition states.

by John Napiorkowski (JJNAPIORK)

A full explanation of the conformance pass has been provided by John Napiorkowski, aimed at making transport protocols invisible to applications. The release bounds the scope of event validation to an unconditional validation of events at all outgoing paths, harmonises flow-control mechanisms, and defines a uniform token for indicating the reason for disconnection to provide complete reliability for error messages.

by Robert Acock (LNATION)

Using Template::Stencil, a template is parsed once into packed bytecode in a single memory arena, and rendered by a threaded C interpreter that writes straight into an SV-backed buffer. I don't think any other template engine does this.

by haj

For all emacs users, CPerl is now available on

by Richard C. Jelinek

Introducing ReJIT, a secondary compiler designed to bridge the performance gap with V8’s Irregexp on regex-intensive benchmarks like regex-redux.

by Mohammad Sajid Anwar (MANWAR)

Part of short post series on PAGI::FastAPI, this post talk about how we can create and use API Gateway with the help of PAGI::FastAPI.

by Mohammad Sajid Anwar (MANWAR)

This post helps you create message queue facade, a very simple easy to follow demo application using PAGI::FastAPI.

by Mohammad Sajid Anwar (MANWAR)

One of my favourite features, Webhook. You cam work with Webhook using PAGI::FastAPI.

by Mohammad Sajid Anwar (MANWAR)

My attempt to explore Bloom filter. In this post, I share my experiment.

by Mohammad Sajid Anwar (MANWAR)

This post is all about the latest features added to v1.7.0. Of all, you can now expose per-route OpenAPI Metadata.

by Mohammad Sajid Anwar (MANWAR)

Welcome to a new week with a couple of fun tasks "Reorder Notes" and "ZigZag Subarray". If you are new to the weekly challenge then why not join us and have fun every week. For more information, please read the FAQ.

by Mohammad Sajid Anwar (MANWAR)

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Dyck Words" and "Secret Santa" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

by Ali Moradi

The blog by Ali presents straightforward and practical approaches to both assignments. For example, to solve Dyck Words, it builds a stack state machine to avoid overhead while traveling through the recursion of the algorithm. A memoized recursion is also used for generating cleanly the results for the Secret Santa derangements without producing huge permutations.

by Arne Sommer

In this blog post, Arne provides an excellent description of various complicated concepts like replacement of recursion by using a queue state-machine in the case of Dyck words, as well as offers detailed explanations of the code with thorough testing output.

by Bob Lied

Bob's article showcases an elegant and effective way of solving the Dyck Words problem recursively in the Perl programming language. By keeping a careful watch on several parameters, such as depth, number of remaining characters, and prefixes used in the solution, the program generates correct sequences in a simple and efficient manner while maintaining clear code.

by Jaldhar H. Vyas

The blog by Jaldhar provides a detailed rundown of the execution of both of the exercises in Raku and Perl. He shows how one can apply recursive depth-first search approach to generate Dyck words and how to utilise the advanced features of Raku language—like .permutations(), the Z== zip operator, and junctions—to succinctly write declarative array-matching code in the Secret Santa derangements case.

by Jorg Sommrey

In this interesting article, Jorg provides a thorough math-heavy analysis of Perl Weekly Challenge #388. The post contains a great dose of engineering thinking since it shows how to reach an 8-times speedup through optimising the code, what is the Dyck prefix generation benchmarking, and also cleverly applying the floor formula for computing the Secret Santa derangements in Perl and J.

by W Luis Mochan

W. Luis Mochan's post features a clear and concise Perl implementation for Challenge 388. He utilizes idiomatic Perl techniques while employing functional pipelines such as grep and map, in addition to recursion, in order to efficiently tackle both Dyck words and derangements.

by Matthias Muth

Matthias gives a neat and clear account of both algorithmic tasks in providing the sounding mathematical context. In the case of the first approach, he makes use of constrained recursive state tracking for the generation of Dyck words which lets him get rid of invalid paths at the early stage. Having thus approached the above task, he does not stop there and goes further using the recursive/DP method of solving the problem with derangements which excludes the time-consuming permutations generation.

by Packy Anderson (PACKY)

Packy’s article presents an interesting and insightful analysis of the Dyck word generation problem and Secret Santa derangement in Perl, Raku, Python, and Elixir. The value of the article lies in his straightforward approach in Task 1, where he shows the use of inductive structural decomposition (splitting and enveloping sub-words) in the process of generating correct Dyck word sequences and at the same time avoiding faulty paths in all programming languages used.

by Peter Campbell Smith

The article by Peter provides a clear and practical explanation of the process of generating Dyck words using depth-first recursive backtracking techniques. He explains how effective he was in switching from an ineffective brute force method to a selective tree-search algorithm that monitors the number of symbols on an ongoing basis.

by Robbie Hatley

The blog by Robbie showcases the efficacious use of the integer binary encoding method for the purpose of generating Dyck words as well as CPAN modules. The article describes how nicely he thought of generating candidate numbers in binary form as that enabled him to produce Dyck words in order without having to perform additional sorting.

by Roger Bell West (FIREDRAKE)

Roger takes an elegant multilingual approach to the Weekly Challenge 388, combining pragmatic graph traversal techniques with clear math. For Task 1, he utilises a breadth-first search (BFS) queue that eliminates invalid Dyck word branches early, while he uses techniques from pattern matching in languages such as Scala and Typst to calculate derangements through the OEIS A000166 recurrence relation.

by Simon Green (SGREEN)

Simon presents a clear, easily understandable answer to Challenge 388 by utilising a combination of language-specific primitives and an explicit algorithmic solution. His method of counting word frequencies with hash mappings also maintains an intuitive set intersection process, making it quick and effective to implement in Perl and Python.

by Elizabeth Mattijsen (ELIZABETH)

by Miguel Prz (NICEPERL)

Great CPAN modules released last week;
MetaCPAN weekly report.

September 01, 2026

September 7, 2026

September 9, 2026

October 06, 2026

October 21, 2026

November 16, 2026

November 21, 2026

November 27, 2026

April 14-16, 2027