Exact Gradients Through a BRep Kernel
Comments on “Exact Gradients Through a BRep Kernel”
Claim-checked. Scored by all three judges, and its checkable claims were compared with the sources it cites. How far stories are checked
Cam Pedersen of Municipal Robotics describes a "seam" in vcad, an open-source Rust BRep kernel. It freezes the tessellation's topology at the current parameters and differentiates node positions, leaving Boolean and fillet code undifferentiated. It adds analytic fillet sensitivities, second derivatives, a transposed pass and a rigid-body adjoint with penalty contact. Derivatives are exact only for the frozen mesh, differing from the continuum by 6.7% for a fillet at 16 segments and 0.11% at 128. Topology changes return errors, and the speed and optimizer figures lack independent sourcing.
Why it ranked
No. 21 of 123 with a score of 0.61. The panel rated it highest on technical depth (0.97) and new information (0.93), lowest on audience breadth (0.38). Placed No. 21, No. 49 by score alone: the placement terms moved other stories past it.
- AI judgeJudge 2claude-haiku-5-5
- Technical paper on exact CAD gradients via a frozen-tessellation seam; detailed, well validated with stated limits, but niche audience for general tech builders.
- AI judgeJudge 3gpt-5.6-luna
- A highly technical, reproducible research and engineering account of differentiable BRep CAD, with quantitative validation, limitations, implementation details, optimization results, and dynamics coupling. Its importance is substantial but concentrated among CAD, geometry, simulation, and design-tool builders.
Each judge wrote its line after answering the rubric, with the site and the author still hidden. Every answer behind this is in the table under Score.
Score
0.61total under rubric v2.3
- Significance0.56
- Reader interest0.69
- Audience breadth0.38
- Practical relevance0.61
- Substantiated0.93
- Technical depth0.97
- New information0.93
- Counts against: Promotional0.04
- Counts against: Overclaim0.17
Each judge’s answer per question (0–1), their mean and spread, and what the question adds to the score (weight × mean).
| Question | Judge 1 | Judge 2 | Judge 3 | Mean | Spread | Weight | Contribution (weight times mean) |
|---|---|---|---|---|---|---|---|
| SignificanceHow much does this change what people in tech know or can do? | 0.53 | 0.40 | 0.76 | 0.56 | 0.36 | +0.24 | +0.135 |
| Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on? | 0.59 | 0.60 | 0.88 | 0.69 | 0.29 | +0.26 | +0.179 |
| Audience breadthHow many people who build technology does it concern? | 0.41 | 0.30 | 0.42 | 0.38 | 0.12 | +0.13 | +0.049 |
| Practical relevanceHow useful is it to someone who builds software or tech products? | 0.60 | 0.50 | 0.73 | 0.61 | 0.23 | +0.22 | +0.135 |
| SubstantiatedHow well is it backed? Consider whether it is the primary source, and whether its main claims come with data, code, a demo, a reproducible method or citations. | 1.00 | 0.85 | 0.94 | 0.93 | 0.15 | +0.05 | +0.046 |
| Technical depthHow technically substantive is it? | 0.99 | 0.95 | 0.98 | 0.97 | 0.04 | +0.05 | +0.049 |
| New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)? | 0.91 | 0.90 | 0.98 | 0.93 | 0.08 | +0.05 | +0.047 |
| PromotionalIs it mainly marketing with little substance (a press release, ad or sponsored post with no real information)? A launch post that carries real news is not promotional. | 0.04 | 0.05 | 0.02 | 0.04 | 0.03 | −0.19 | −0.007 |
| OverclaimDo the headline or conclusions claim more than the body supports? | 0.23 | 0.20 | 0.08 | 0.17 | 0.15 | −0.11 | −0.019 |
| Sum of contributions | +0.614 | ||||||
| Claim-check penalty | 0.000 | ||||||
| Total, as published | 0.615 | ||||||
Spread is the highest minus the lowest judge answer. marks a spread above 0.40: the judges disagree, and the story is marked contested.
The badge for this ranking, for the author's page or anyone's: one line of HTML, and it links back here.
<a href="https://rubric.hrih.si/editions/2026-11-14/21/"><img src="https://rubric.hrih.si/badge/2026-11-14/21.svg" alt="Ranked #21 on Rubric, 14 Nov 2026" width="245" height="28"></a>Claim check
Claim check: 8 no source given. Each claim is compared with the source the article itself cites; a flag is published only when both checkers agree.
No source givenNumber
The frozen-mesh derivative of the fillet radius differs from the continuum derivative by 6.7% at 16 segments per circle and 0.11% at 128 segments.
The article gives no link or citation for it.
The article says “the derivative of the frozen mesh differs from the continuum by the polygonization error (6.7% for a fillet at 16 segments per circle, 0.11% at 128”
The source says No source to compare with.
No source givenGeneralization
Engineering Sketch Pad computes tessellation sensitivities on a parametric BRep, analytic for most construction operations but falling back to finite differences for others, including filleting.
The article gives no link or citation for it.
The article says “Those sensitivities are analytic for most construction operations and fall back to finite differences for others, filleting among them”
The source says No source to compare with.
No source givenNumber
On the five-parameter box, a seam gradient takes 85 ms versus 860 ms for a rebuild-FD gradient, a factor of 10.
The article gives no link or citation for it.
The article says “A seam gradient (rebuild, capture, one pass and one transposed pass) takes 85 ms on this part against 860 ms for a rebuild-FD gradient, a factor of 10 at five…”
The source says No source to compare with.
No source givenCausal conclusion
Same-plan finite-difference checks exposed two errors in the seam on filleted, drilled parts, which have since been fixed.
The article gives no link or citation for it.
The article says “Checking against finite differences of one frozen plan found two errors in the seam, both since fixed”
The source says No source to compare with.
No source givenBenchmark result
Levenberg–Marquardt with the seam's exact Jacobian recovers the parameters on the five-parameter box in 4 iterations and 0.62 s.
The article gives no link or citation for it.
The article says “Levenberg–Marquardt reaches in 4 iterations and 0.62 s”
The source says No source to compare with.
No source givenNumber
The transposed pass costs about 1.8 forward passes on the five-parameter box part, so it pays from two parameters up.
The article gives no link or citation for it.
The article says “The transposed pass costs about 1.8 forward passes on this part, so it pays from two parameters up”
The source says No source to compare with.
No source givenGeneralization
Banović et al. differentiate the Open CASCADE kernel by operator overloading, which reaches every kernel operation including fillets and can be nested for second derivatives.
The article gives no link or citation for it.
The article says “Banović et al. differentiate the Open CASCADE kernel itself by operator overloading 3,4; algorithmic differentiation of that kind reaches every operation the kernel performs, fillets included”
The source says No source to compare with.
No source givenGeneralization
Commercial kernels do not generally expose parameter derivatives, so designers typically fall back on finite differences of full rebuilds at two rebuilds per parameter.
The article gives no link or citation for it.
The article says “Commercial kernels do not generally expose parameter derivatives to the user, so designers typically fall back on finite differences of full rebuilds, at two rebuilds per parameter”
The source says No source to compare with.
Also covered by
No other coverage was clustered with this story.
Elsewhere
Elsewhere: HN 2 pts, not on front page
Recorded for context only, checked 15 Nov 2026, 20:44 UTC. It played no part in the ranking.