# Availability of Matrix Operations/Algorithms for Benchmarking Precision and CPU Performance for CKKS Bootstrapping

**URL:** https://openfhe.discourse.group/t/availability-of-matrix-operations-algorithms-for-benchmarking-precision-and-cpu-performance-for-ckks-bootstrapping/1117
**Category:** FHE Use Cases
**Created:** [March 10, 2024, 4:21pm UTC](https://openfhe.discourse.group/t/availability-of-matrix-operations-algorithms-for-benchmarking-precision-and-cpu-performance-for-ckks-bootstrapping/1117 "2024-03-10T16:21:23Z")
**Posts on this page:** 3
**Page:** 1

<div class="post-metadata">

### Author: ![moghit02](https://avatars.discourse-cdn.com/v4/letter/m/eb9ed0/32.png) [@moghit02](https://openfhe.discourse.group/u/moghit02)
#### Post date: [March 10, 2024, 4:21pm UTC](https://openfhe.discourse.group/t/availability-of-matrix-operations-algorithms-for-benchmarking-precision-and-cpu-performance-for-ckks-bootstrapping/1117/1 "2024-03-10T16:21:23Z")

</div>

Hello,  
I’m looking for a way to evaluate various matrix operations using the CKKS scheme with the use of bootstrapping. I’m interested to know if the library has such functionality since I’ve already come across a paper that explores this direction titled: [Cheap and Fast Iterative **Matrix** Inverse in Encrypted Domain](https://link.springer.com/chapter/10.1007/978-3-031-50594-2_17), unfortunaley i have no acces to this paper. It’s not crucial that they are super efficient; I just want to evaluate them in terms of time and precision for data assessment in my master’s thesis. If anyone has any tips for me, please let me know.

Thank you very much.

---

<div class="post-metadata">

### Author: ![iquah](https://yyz1.discourse-cdn.com/flex031/user_avatar/openfhe.discourse.group/iquah/32/8_2.png) [@iquah](https://openfhe.discourse.group/u/iquah)
#### Post date: [March 14, 2024, 6:09pm UTC](https://openfhe.discourse.group/t/availability-of-matrix-operations-algorithms-for-benchmarking-precision-and-cpu-performance-for-ckks-bootstrapping/1117/2 "2024-03-14T18:09:46Z")

</div>

I don’t think matrix operations have been released. See [Is there a built in method to perform vector - matrix multiplication? - #2 by Caesar](https://openfhe.discourse.group/t/is-there-a-built-in-method-to-perform-vector-matrix-multiplication/358/2)

---

<div class="post-metadata">

### Author: ![ypolyakov](https://yyz1.discourse-cdn.com/flex031/user_avatar/openfhe.discourse.group/ypolyakov/32/47_2.png) [@ypolyakov](https://openfhe.discourse.group/u/ypolyakov)
#### Post date: [March 28, 2024, 12:30am UTC](https://openfhe.discourse.group/t/availability-of-matrix-operations-algorithms-for-benchmarking-precision-and-cpu-performance-for-ckks-bootstrapping/1117/3 "2024-03-28T00:30:41Z")

</div>

The functions that are exposed in OpenFHE, such as `EvalSumRows` and `EvalSumCols`, can be used to build matrix capabilities, but there are no matrix-level capabilities exposed in OpenFHE itself. There is a separate effort [FHERMA](https://fherma.io/) that hosts FHE challenges for higher-level operations. Please see [GitHub - fairmath/polycircuit: Polycircuit - an FHE components library, build via FHERMA competitions](https://github.com/fairmath/polycircuit) to view the solutions for prior challenges. More matrix capabilities will be added there later.
