meta/codellama-34b-instruct 🔢📝 → 📝

▶️ 157.8K runs 📅 Aug 2023 ⚙️ Cog 0.9.0-beta11 🔗 GitHub 📄 Paper ⚖️ License

code-generation text-generation

About

A 34 billion parameter Llama tuned for coding and conversation

Example Output

Prompt:

"Write a function that returns the fibonnaci sequence, and also talk like a pirate."

Output

Arrgh, here be me code for ye, matey:

def fibonacci(n):
    if n <= 1:
        return n
    else:
        return fibonacci(n-1) + fibonacci(n-2)

Now, let's break down the code and talk like pirates, savvy?

The function starts with a simple check: if the input n is less than or equal to 1, we just return it as the first two numbers in the sequence are 0 and 1. This be called the "base case."

if n <= 1:
    return n

But if the input n be greater than 1, we have a bit more work to do. We use a recursive call to find the previous two numbers in the sequence by calling the function again with n-1. This be called the "recursive case."

else:
    return fibonacci(n-1) + fibonacci(n-2)

Now, let's talk like pirates. The first two numbers in the sequence be 0 and 1, just like on the high seas. The next number be 1+1=2, which be like a ship with two masts. Then it be 1+2=3, which be like a ship with three masts. And so on and so forth.

0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765

So there ye have it, me hearty. The fibonacci sequence be a series of numbers that start with 0 and 1, and each number after that be the sum of the two before it. And if ye ever find yerself lost at sea, just remember: fibonacci be the answer to all yer problems!

Performance Metrics

31.34s Prediction Time

31.39s Total Time

All Input Parameters

{
  "top_k": 50,
  "top_p": 0.9,
  "prompt": "Write a function that returns the fibonnaci sequence, and also talk like a pirate.",
  "max_tokens": 500,
  "temperature": 0.75,
  "system_prompt": "Responses should be written in Python.",
  "repeat_penalty": 1.1,
  "presence_penalty": 0,
  "frequency_penalty": 0
}

Input Parameters

top_k Type: integerDefault: 10: Top K
top_p Type: numberDefault: 0.95: Top P
prompt (required) Type: string: Prompt
max_tokens Type: integerDefault: 500: Max number of tokens to return
temperature Type: numberDefault: 0.8: Temperature
system_prompt Type: stringDefault:: System prompt to send to CodeLlama. This is prepended to the prompt and helps guide system behavior.
repeat_penalty Type: numberDefault: 1.1Range: 0 - 2: Repetition penalty
presence_penalty Type: numberDefault: 0Range: 0 - 2: Presence penalty
frequency_penalty Type: numberDefault: 0Range: 0 - 2: Frequency penalty

Output Schema

Output

Type: array • Items Type: string

Example Execution Logs

Pod hostname: model-8281a5c6-04a1e90ed8aa4ba5-gpu-a40-6bb6957687-tqxbf
Prompt:
<s>[INST] <<SYS>>
Responses should be written in Python.
<</SYS>>
Write a function that returns the fibonnaci sequence, and also talk like a pirate. [/INST]
llama_print_timings:        load time =   291.99 ms
llama_print_timings:      sample time =   241.30 ms /   478 runs   (    0.50 ms per token,  1980.94 tokens per second)
llama_print_timings: prompt eval time =   291.91 ms /    52 tokens (    5.61 ms per token,   178.13 tokens per second)
llama_print_timings:        eval time = 20355.34 ms /   477 runs   (   42.67 ms per token,    23.43 tokens per second)
llama_print_timings:       total time = 21826.96 ms
Output:
Arrgh, here be me code for ye, matey:
```
def fibonacci(n):
if n <= 1:
return n
else:
return fibonacci(n-1) + fibonacci(n-2)
```
Now, let's break down the code and talk like pirates, savvy?
The function starts with a simple check: if the input `n` is less than or equal to 1, we just return it as the first two numbers in the sequence are 0 and 1. This be called the "base case."
```
if n <= 1:
return n
```
But if the input `n` be greater than 1, we have a bit more work to do. We use a recursive call to find the previous two numbers in the sequence by calling the function again with `n-1`. This be called the "recursive case."
```
else:
return fibonacci(n-1) + fibonacci(n-2)
```
Now, let's talk like pirates. The first two numbers in the sequence be 0 and 1, just like on the high seas. The next number be 1+1=2, which be like a ship with two masts. Then it be 1+2=3, which be like a ship with three masts. And so on and so forth.
```
0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765
```
So there ye have it, me hearty. The fibonacci sequence be a series of numbers that start with 0 and 1, and each number after that be the sum of the two before it. And if ye ever find yerself lost at sea, just remember: fibonacci be the answer to all yer problems!

Version Details

Version ID: eeb928567781f4e90d2aba57a51baef235de53f907c214a4ab42adabf5bb9736
Version Created: January 8, 2024

Run on Replicate →