Skip to content
This repository has been archived by the owner on Jul 27, 2022. It is now read-only.

Problem: (fix #1112) Unbounded Tree Depth #1476

Merged
merged 1 commit into from
Apr 24, 2020

Conversation

linfeng-crypto
Copy link
Contributor

solution: give a tree heigh limit, and calculate the amount of n choose m , if the amount is larger than the limit tree leaves number, return error.

@tomtau
Copy link
Contributor

tomtau commented Apr 24, 2020

bors r+

@bors
Copy link
Contributor

bors bot commented Apr 24, 2020

Build succeeded:

@bors bors bot merged commit 450b999 into crypto-com:master Apr 24, 2020
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants