Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Verifiable Random Function | Statement: [Algorand blockchain protocol, uses, Verifiable Random Function]

Target entity: Verifiable Random Function
Context triple: [Algorand blockchain protocol, uses, Verifiable Random Function]

• A. Blum–Blum–Shub pseudorandom number generator
  The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
• B. Blum–Micali pseudorandom number generator
  The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
• C. Merkle–Damgård construction
  The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
• D. Merkle puzzles
  Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
• E. Modern Cryptography, Probabilistic Proofs and Pseudorandomness
  "Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Verifiable Random Function
Triple: [Algorand blockchain protocol, uses, Verifiable Random Function]

A Verifiable Random Function (VRF) is a cryptographic primitive that produces pseudo-random outputs along with proofs that anyone can verify to confirm the outputs were correctly generated from a given input and secret key.

Target entity: Verifiable Random Function
Target entity description: A Verifiable Random Function (VRF) is a cryptographic primitive that produces pseudo-random outputs along with proofs that anyone can verify to confirm the outputs were correctly generated from a given input and secret key.

• A. Blum–Blum–Shub pseudorandom number generator
  The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
• B. Blum–Micali pseudorandom number generator
  The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
• C. Merkle–Damgård construction
  The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
• D. Merkle puzzles
  Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
• E. Modern Cryptography, Probabilistic Proofs and Pseudorandomness
  "Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
• F. None of above. chosen