Orply.
Archive

October 2026

Article · Oct 9, 2026 · Perplexity
The Volume Product of General Convex Bodies Is Minimized by Simplices

An OpenAI preprint on the Mahler conjecture claims a sharp lower bound for the volume product of every convex body, without requiring symmetry or a smooth boundary. The bound is \((n+1)^{n+1}/(n!)^2\), attained exactly by simplices. The manuscript reduces the geometric claim to an inequality for weighted cone integrals and outlines Gaussian projection estimates for proving it, while noting that the full estimates and technical arguments are not reproduced.

Article · Oct 9, 2026 · Perplexity
Every Four-Dimensional Kakeya Set Has Hausdorff Dimension Four

An OpenAI preprint claims that every Kakeya set in four-dimensional space has Hausdorff dimension four, even when the set is nonmeasurable and no measurable rule selects a line segment in each direction. The result rules out sets of dimension below four; it does not establish positive volume or the stronger four-dimensional maximal estimate. The proof turns a hypothetical dimension deficit into a problem about finite, populated charts, then seeks improvements in each of three regimes to contradict an extremal choice.

Article · Oct 9, 2026 · Perplexity
Fourier Extension on the Sphere Is Bounded for Every p Above Three

An OpenAI preprint establishes an \(L^p\) bound for the Fourier extension of bounded complex data on the three-dimensional unit sphere when \(p>3\). A constant-data example shows that the estimate fails at and below the cubic threshold. For the positive result, the manuscript controls wave-packet concentration through elliptic-capacity estimates and a selection argument that retains more than any fixed negative power of the scale, asymptotically, without assuming velocity and position are independent.

Article · Oct 9, 2026 · Perplexity
Every Convex Body Has a Lattice Covering of Density O(n log n)

An OpenAI preprint proves that every compact convex body in dimension \(n \ge 2\) can be covered by copies arranged on a single lattice with density at most \(C n \log n\), for an absolute constant \(C\). The bound applies even to bodies that are neither symmetric nor smooth; it limits the worst case rather than describing the density needed for every shape. The proof coordinates weighted choices across many sections, then uses one global shear to keep the construction within a single lattice.

Article · Oct 9, 2026 · Perplexity
Some Hyperbolicity Cones Admit No Exact Finite Semidefinite Lift

An OpenAI preprint argues that some hyperbolicity cones cannot be represented exactly as projections of finite-dimensional semidefinite constraints, even with auxiliary variables and arbitrary real coefficients. The paper’s counterexample is designed to rule out every finite lift, not just a particular matrix representation; its conclusion concerns exact representation, not approximation.

Article · Oct 9, 2026 · Perplexity
A Compact Doubling Metric Space Can Defy Every Finite-Dimensional Embedding

An OpenAI manuscript constructs a compact subset of Hilbert space that is doubling—every ball can be covered by a uniformly bounded number of smaller balls—but cannot be embedded into any finite-dimensional Euclidean space with bounded distortion. The authors’ result shows that uniform control of local covering complexity alone does not ensure that distances can be represented in finitely many coordinates.

Article · Oct 9, 2026 · Perplexity
Optimal L1 Distortion for Edit Distance Grows as exp(Θ(√(log d log log d)))

An OpenAI preprint argues that edit distance on strings of length at most \(d\) requires exponentially growing distortion when represented in real \(L_1\), even if the embedding’s dimension and computation time are unrestricted. For every finite alphabet with at least two symbols, it bounds the best possible distortion above and below by \(\exp(\Theta(\sqrt{\log d\,\log\log d}))\), with the constants in the exponent unspecified; the lower bound already holds for binary strings of a common length.

Article · Oct 9, 2026 · Perplexity
A Fixed-Slope Trilinear Hilbert Transform Maps Three L³ Inputs to L¹

An OpenAI preprint proves an \(L^3\times L^3\times L^3\to L^1\) bound for the trilinear Hilbert transform at the fixed slopes 1, 2 and 3. The result is specific: it does not settle every exponent or version of the transform. The paper’s proof tackles the multiscale interactions that defeat direct estimates, using quadratic structure to obtain bounds uniform across dyadic depths.

Article · Oct 9, 2026 · Perplexity
Uniform Sub-Gaussian Projection Tails Yield Dimension-Free Log-Sobolev Bounds

An OpenAI manuscript argues that a centered, log-concave distribution has a dimension-free logarithmic Sobolev inequality when every one-dimensional projection has uniformly controlled sub-Gaussian tails at a common scale. The claimed bound applies to all smooth, compactly supported functions, with an entropy-to-gradient-energy coefficient set by that scale rather than by the ambient dimension; the authors’ proof uses a contradiction argument based on bounds on mutual information.

Article · Oct 9, 2026 · Perplexity
Some Convex Bodies Require Translative Covering Density Of Order n log n

An OpenAI manuscript claims that, in every sufficiently large dimension, some centrally symmetric convex body requires translative covering density of at least \(c n \log n\), for an absolute constant \(c>0\). The result identifies the worst-case order, matching the known \(O(n \log n)\) upper bound for all convex bodies; it does not say that every body is this difficult. The proof constructs a random body and aims to rule out every sufficiently low-density covering, including arrangements chosen after the body is known.

Article · Oct 9, 2026 · Perplexity
OpenAI Paper Claims a Fixed Zero-Free Boundary at Re s = 7/8

OpenAI’s September 2026 paper claims that the Riemann zeta function and every Dirichlet L-function have no nontrivial zeros to the right of Re s = 7/8, a fixed boundary inside the critical strip. The result is weaker than the Riemann hypothesis, which places every nontrivial zero on Re s = 1/2, but would improve on zero-free regions whose width shrinks with height. Lean has accepted a formalized version of the zeta statement; the 199-page paper itself had not received public expert review.

Article · Oct 9, 2026 · AI Engineer
AI-Generated Pull Requests Shift the Bottleneck to Validation

Ali-Reza Adl-Tabatabai, co-founder of Gitar, now part of Sonar, argues that AI-generated code is shifting the bottleneck in software delivery from writing code to validating it. More and larger pull requests put pressure on CI and code review, leaving teams to slow delivery or risk rubber-stamping defects, he says. His proposed response is agentic validation: software that reviews pull requests, diagnoses and fixes CI failures, and can approve and merge changes under rules set by the team.

Article · Oct 9, 2026 · TBPN
Crypto Faces an AI Security Risk Without a Known Attack

AI-driven advances in mathematics could threaten the cryptography that protects crypto wallets, but the risk is harder to define than the quantum threat the industry has spent years preparing for. On Diet TBPN, host John Coogan relayed warnings from Vitalik Buterin and cryptographer Matthew Green, while arguing that crypto has time to strengthen its defenses rather than rush funds into new wallets. Coogan and co-host Jordi Hays also questioned whether the open-source tools that could expose vulnerabilities should be restricted.

Article · Oct 8, 2026 · Hoover Institution
U.S. Energy Exports Could Strengthen Allies and Advance National Interests

John Deutch argues that U.S. energy resources and technology can advance national interests by helping allies meet their energy needs through supply and cooperation. He points to the shift from expectations of U.S. gas imports to major LNG exports as evidence that energy markets can change quickly, altering the assumptions behind energy planning. India is a central example of how he believes U.S. energy trade and nuclear cooperation could benefit both countries.

Article · Oct 8, 2026 · Bloomberg Technology
Crew-12 Returns After 237 Days as Dragon’s Future Beyond the ISS Remains Unclear

SpaceX’s Crew Dragon returned four astronauts from the International Space Station with a Pacific splashdown off California, completing a 237-day mission. Bloomberg space reporter Loren Grush said Dragon has at least four operational NASA crew flights remaining before the station’s planned retirement, but its future beyond that is uncertain as SpaceX shifts resources toward Starship, which still requires substantial work before it can carry astronauts to the moon.

Article · Oct 8, 2026 · Bloomberg Technology
Union Square Ventures Raises $900 Million to Lead Larger Seed and Series A Rounds

Union Square Ventures has raised $900 million across a $500 million early-stage fund and a $400 million opportunity fund, expanding its capacity as some startups require larger rounds. General partner Nick Grossman said the early-stage fund will still invest at inception but can also lead selected Series A rounds of $20 million to $30 million; the firm is not aiming to become a broad-market investor. The fundraising coincides with a transition to a four-partner core, which Grossman described as a gradual handoff rather than a change in USV’s collaborative approach.

Article · Oct 8, 2026 · Bloomberg Technology
Crew-12 Returns to Earth After Seven and a Half Months on the ISS

SpaceX’s Dragon Freedom splashed down off California, returning four astronauts to Earth after a seven-and-a-half-month stay aboard the International Space Station. Drogue and main parachutes slowed the capsule in stages, while mission control coordinated a landing it described as involving many teams.

Article · Oct 8, 2026 · Hoover Institution
Peru’s Security Crisis Requires Targeted Enforcement, Not a Military Crackdown

Former Peruvian president Francisco Sagasti argues that governing requires preparation, a clear program and leaders who understand both the limits and obligations of power. In a discussion with Hoover fellow H.R. McMaster, he says Peru’s mineral-led stability rests on external prices and coexists with illegal mining, while organized crime demands more than a show of force. Sagasti also contends that democratic governments can rebuild trust only by responding to people’s needs and working effectively within the law.

Article · Oct 8, 2026 · Bloomberg Technology
Hyperscaler Spending Can Slow While Still Outpacing Economic Growth

Goldman Sachs Wealth Management’s Matt Weir argues that the market’s reliance on a handful of large technology stocks does not, on its own, signal that the bull market is ending. He expects hyperscalers’ capital-spending growth to slow sharply from its extraordinary pace, but remain far faster than economic growth. For Weir, earnings—not short-term market concentration or macroeconomic distractions—will ultimately determine where stocks go next.

Article · Oct 8, 2026 · Bloomberg Technology
OpenAI Will Delay Its IPO While It Adjusts to New AI Capabilities

OpenAI is selling its new Dots agent as a premium tool for people with substantial work to do, while CEO Sam Altman says the company will delay an IPO as it adjusts to more capable models and their safety requirements. In an interview with Bloomberg’s Ed Ludlow, Altman said OpenAI would slow training or releases if that helped advance safety, monitoring or security, and argued that going public during this transition would add investor demands at the wrong time.

Article · Oct 8, 2026 · Bloomberg Technology
Apple’s Stores Build Customer Relationships That Online Shopping Cannot Replace

Ron Johnson argues that retail can adapt to online shopping and AI without losing the customer relationships that physical stores help build and sustain. He sees AI improving shopping across channels, but says human service still matters in stores; his failed effort to change J.C. Penney’s offer shows the risk of moving faster than customers’ values allow.

Article · Oct 8, 2026 · Bloomberg Technology
Samsung’s Record Profit Trails Estimates as Memory Demand Outpaces Supply

Samsung reported record operating profit of 107.4 trillion won for the three months through September, as rising memory-chip prices and AI infrastructure spending lifted earnings. CLSA Korea Research Head Sanjeev Rana said the result was broadly in line with his expectations, despite falling short of the analyst estimate shown with the figures. He remains bullish on the memory cycle, citing demand that exceeds supply and expecting a sharp rise in high-bandwidth memory pricing in 2025.

Article · Oct 8, 2026 · Bloomberg Technology
SpaceX’s Chip Financing Talks Put AI Debt Appetite to the Test

SpaceX is in early-stage talks to raise $40 billion to buy Nvidia chips, Bloomberg Tech reporter Ed Ludlow said, in a financing that could include $10 billion in loans and $30 billion in investment-grade credit. Ludlow said the proposal highlights questions about how investors will finance the AI buildout, including how debt fits the useful economic life of GPUs and whether companies may borrow heavily after going public.

Article · Oct 8, 2026 · Financial Times
The Hormuz Shock Is Raising the Cost of Energy Security

The Financial Times’ analysis of the Iran war argues that the disruption to energy supplies through the Strait of Hormuz has exposed how quickly a regional conflict can raise prices and strain economies. Its contributors differ on whether the shock marks a new normal, but several warn that governments may need to pay more for backup supplies, diversified energy sources and greater resilience, even if the conflict ends.