Hugging Face's logo

QuantFactory
/
UwU-7B-Instruct-GGUF

Text Generation
GGUF
English
Inference Endpoints
conversational
Model card Files Community
UwU-7B-Instruct-GGUF
File size: 2,430 Bytes 
33bb063
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
 

---

license: apache-2.0
datasets:
- qingy2024/FineQwQ-142k
language:
- en
base_model:
- Qwen/Qwen2.5-7B
pipeline_tag: text-generation

---

[![QuantFactory Banner](https://lh7-rt.googleusercontent.com/docsz/AD_4nXeiuCm7c8lEwEJuRey9kiVZsRn2W-b4pWlu3-X534V3YmVuVc2ZL-NXg2RkzSOOS2JXGHutDuyyNAUtdJI65jGTo8jT9Y99tMi4H4MqL44Uc5QKG77B0d6-JfIkZHFaUA71-RtjyYZWVIhqsNZcx8-OMaA?key=xt3VSDoCbmTY7o-cwwOFwQ)](https://hf.co/QuantFactory)


# QuantFactory/UwU-7B-Instruct-GGUF
This is quantized version of [qingy2024/UwU-7B-Instruct](https://huggingface.co/qingy2024/UwU-7B-Instruct) created using llama.cpp

# Original Model Card


## UwU 7B Instruct

Small QwQ, full-finetuned on FineQwQ-142K. Unlike my previous models, this one is a general-purpose reasoning machine!

Oh, and it also passes the strawberry test:

```
> How many 'r's are in the word strawberry?
Let's see. I have this word: "strawberry." I need to find out how many 'r's are in it. Okay, first, I should probably write down the word and look at each letter one by one.

So, "s-t-r-a-w-b-e-r-r-y."

Now, I need to count the 'r's. Let's go through each letter:

- The first letter is 's', which is not an 'r'.

- The second letter is 't', not an 'r'.

- The third letter is 'r', that's the first 'r'.

- The fourth letter is 'a', not an 'r'.

- The fifth letter is 'w', not an 'r'.

- The sixth letter is 'b', not an 'r'.

- The seventh letter is 'e', not an 'r'.

- The eighth letter is 'r', that's the second 'r'.

- The ninth letter is 'r', that's the third 'r'.

- The tenth letter is 'y', not an 'r'.

So, I have three 'r's in the word "strawberry." But wait, let me double-check. Maybe I missed one.

Let me count again:

1. 's'

2. 't'

3. 'r' (first 'r')

4. 'a'

5. 'w'

6. 'b'

7. 'e'

8. 'r' (second 'r')

9. 'r' (third 'r')

10. 'y'

Yes, that's three 'r's. I think that's correct.

Alternatively, maybe there's a smarter way to count them without listing out each letter. Let's see.

I know that the word "strawberry" has 10 letters, and I can recall that it has three 'r's. But to be sure, maybe I can look for patterns or something.

Another way is to use a tally mark or something similar. Let's try that.

First 'r': | (that's one)

Second 'r': | (that's two)

Third 'r': | (that's three)

Yes, that also gives me three 'r's.

I think I'm confident with that answer now. There are three 'r's in the word "strawberry."

**Final Answer**

\[ \boxed{3} \]
```