What is Hackers' Pub?

Old Gods of Asgard - Herald of Darkness (Alan Wake 2 | Official Music Video)

Part of the 'Alan Wake 2' video game, developed by @RemedyGames, created by Sam Lake. Experience the unique interactive musical scene in the game: ➡️ https:/...

www.youtube.com · YouTube

MiniF2F in Rocq: Automatic Translation Between Proof Assistants -- A Case Study

In this work, we conduct an experiment using state-of-the-art LLMs to translate MiniF2F into Rocq. The translation task focuses on generating a Rocq theorem based on three sources: a natural language description, the Lean formalization, and the Isabelle formalization. We conducted our experiment in 3 stages of increasing complexity, from basic one-shot prompting to multi-turn conversations that incorporate feedback from unsuccessful attempts. At each stage, we perform multiple rounds of translation using increasingly advanced models: GPT-4o mini, Claude 3.5 Sonnet, o1 mini, and o1. We successfully translated 478 out of 488 theorems. The dataset is opensource: https://github.com/LLM4Rocq/miniF2F-rocq.

arxiv.org · arXiv.org

Reactie RDW naar aanleiding van oproep Tesla

Tesla, goedkeuring, Full Self Service Driving Supervised, FSD

www.rdw.nl

REAL-Prover: Retrieval Augmented Lean Prover for Mathematical Reasoning

Nowadays, formal theorem provers have made monumental progress on high-school and competition-level mathematics, but few of them generalize to more advanced mathematics. In this paper, we present REAL-Prover, a new open-source stepwise theorem prover for Lean 4 to push this boundary. This prover, based on our fine-tuned large language model (REAL-Prover-v1) and integrated with a retrieval system (Leansearch-PS), notably boosts performance on solving college-level mathematics problems. To train REAL-Prover-v1, we developed HERALD-AF, a data extraction pipeline that converts natural language math problems into formal statements, and a new open-source Lean 4 interactive environment (Jixia-interactive) to facilitate synthesis data collection. In our experiments, our prover using only supervised fine-tune achieves competitive results with a 23.7% success rate (Pass@64) on the ProofNet dataset-comparable to state-of-the-art (SOTA) models. To further evaluate our approach, we introduce FATE-M, a new benchmark focused on algebraic problems, where our prover achieves a SOTA success rate of 56.7% (Pass@64).

arxiv.org · arXiv.org

DWARF support for macOS and Linux by joelreymont · Pull Request #14369 · ocaml/ocaml

DWARF v5 Debugging Support for OCaml Native Compiler This PR adds DWARF v5 debug information to the OCaml native compiler, allowing proper source-level debugging in GDB and LLDB. What's Impleme...

github.com · GitHub

[단독] TV토론서 '성폭력성 발언' 이준석 무혐의‥"경찰이 면죄부"

지난 대선 후보 3차 TV 토론에서 여성의 신체와 관련해 노골적 발언을 해 물의를 빚은 개혁신당 이준석 대선 후보에 대해 경찰이 혐의없음 판단을 내린 것으로 MBC 취재 결과 확인...

imnews.imbc.com · MBC 뉴스

Formalizing Computational Paths and Fundamental Groups in Lean

Computational paths treat propositional equality as explicit paths built from labelled deduction steps and rewrite rules. This view originates in work by de Queiroz and collaborators and yields a weak groupoid structure for equality, together with a computational account of homotopy inspired by homotopy type theory. In this paper we present a complete mechanization of this framework in Lean 4 and show how it supports concrete homotopy theoretic computations. Our contributions are threefold. First, we formalize the theory of computational paths in Lean, including path formation, composition, inverses, and a rewrite system that identifies redundant or trivial paths. We prove that equality types with computational paths carry a weak groupoid structure in the sense of the original theory. Second, we organize this material into a reusable Lean library, ComputationalPathsLean, which exposes an interface for paths, rewrites, and loop spaces. This library allows later developments to treat computational paths as a drop-in replacement for propositional equality when reasoning about homotopical structure. Third, we apply the library to two canonical examples in algebraic topology. We give Lean proofs that the fundamental group of the circle is isomorphic to the integers and that the fundamental group of the torus is isomorphic to the product of two copies of the integers, both via computational paths. These case studies demonstrate that the computational paths approach scales to nontrivial homotopical computations in a modern proof assistant. All the definitions and proofs described here are available in an open-source Lean 4 repository.

arxiv.org · arXiv.org

[오늘 이 뉴스] "진짜 사고날듯 매우 위험".. 李 전한 남북관계 '충격' (2025.11.24/MBC뉴스)

#이재명대통령 #튀르키예순방 #기내간담회 #남북관계 #비핵화ㅤ#MBC #뉴스 #뉴스데스크 #MBC뉴스 #뉴스투데이 #뉴스ZIP #뉴스꾹 #오늘이뉴스 #자막뉴스ㅤⓒ MBC & iMBC 무단 전재, 재배포 및 이용(AI학습 포함)금지

www.youtube.com · YouTube

【2025年秋冬】流通という観点から見るファッショントレンドの実際

今回は2024年秋冬のファッショントレンドについてまとめてみました。他にもファッションについての動画を投稿しています。もしも気に入って頂ければチャンネル登録と高評価の程よろしくお願いいたします。本を出しました！https://amzn.to/3YQq1GG靴下を作りました！UNSUNG HERO■instagra...

www.youtube.com · YouTube

FOSDEM Local First devroom - CfP open until early december

For the first time this year, the FOSDEM conference will host a devroom for Local First, CRDTs and sync protocols and sync engines. FOSDEM is the biggest Free and Open Source conference in Europe. This is a great opportunity to show your work, and meet other developers interested in Local First software. The Call for Participation is now open and will be until early december. Don't delay and submit your talk, demo, keynote soon.

openlocalfirst.org

食事する哲学者の問題 - Wikipedia

ja.wikipedia.org