Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

The algorithm used in DivSqrtRecF64_mulAddZ31 to calculate square-root

Open
  • Is something wrong?
#55 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
2/5
Estimated time
1-3 hours
Newbie friendliness
42/100
Issue type
Documentation
Clarity
Mostly clear
Activity status
Stale
Tech stack
scala
Domain
tooling

Research direction

Start by reading DivSqrtRecF64_mulAddZ31.scala and tracing the square-root calculation. Determine whether the implementation follows Goldschmidt, Newton-Raphson, or another algorithm, then provide references supporting that identification; the issue is done when the algorithm and references are documented.

Written by the indexing model from the issue text.

Description

What is the algorithm used to calculate square-root in DivSqrtRecF64_mulAddZ31.scala? Dose it use Goldschmidt or Newton-Raphson algorithm, and can you provide some references about the algorithm it used?
Thank you.

Dominant language
Scala
Stars
393
Forks
110
No merged PRs in 30d

Getting set up

This project ships no dev container, Dockerfile or contributing guide, so setting up is up to you: start from its README, and see our first-contribution guide for the general steps.

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from ucb-bar/berkeley-hardfloat

All issues in ucb-bar/berkeley-hardfloat

Similar issues

More Scala issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.