diff --git a/qdrant-landing/content/blog/binary-quantization-andrey-vasnetsov-vector-space-talk-001.md b/qdrant-landing/content/blog/binary-quantization-andrey-vasnetsov-vector-space-talk-001.md
index 75c04355d..bc15c56a7 100644
--- a/qdrant-landing/content/blog/binary-quantization-andrey-vasnetsov-vector-space-talk-001.md
+++ b/qdrant-landing/content/blog/binary-quantization-andrey-vasnetsov-vector-space-talk-001.md
@@ -17,7 +17,7 @@ tags:
   - Qdrant
 ---
 
-> "Everything changed when we actually tried binary quantization with OpenAI model.”\
+> *"Everything changed when we actually tried binary quantization with OpenAI model.”*\
 > -- Andrey Vasnetsov
 
 Ever wonder why we need quantization for vector indexes? Andrey Vasnetsov explains the complexities and challenges of searching through proximity graphs. Binary quantization reduces storage size and boosts speed by 30x, but not all models are compatible. 
@@ -44,7 +44,7 @@ In this episode, Andrey shares invaluable insights into the world of binary quan
 4. Understanding the simplicity and effectiveness of binary quantization, especially when compared to more intricate quantization methods.
 5. The ongoing research and potential impact of binary quantization on future models.
 
-> *Fun Fact: Binary quantization can deliver processing speeds over 30 times faster than traditional quantization methods, which is a revolutionary advancement in vector space technology.*
+> Fun Fact: Binary quantization can deliver processing speeds over 30 times faster than traditional quantization methods, which is a revolutionary advancement in vector space technology.
 > 
 
 ## Show Notes:
@@ -58,13 +58,13 @@ In this episode, Andrey shares invaluable insights into the world of binary quan
 
 ## More Quotes from Andrey:
 
-"Inside Qdrant we use HNSW vector Index, which is essentially a proximity graph. You can imagine it as a number of vertices where each vertex is representing one vector and links between those vertices representing nearest neighbors.”\
+*"Inside Qdrant we use HNSW vector Index, which is essentially a proximity graph. You can imagine it as a number of vertices where each vertex is representing one vector and links between those vertices representing nearest neighbors.”*\
 -- Andrey Vasnetsov
 
-"The main idea is that we convert the float point elements of the vector into binary representation. So, it's either zero or one, depending if the original element is positive or negative.”\
+*"The main idea is that we convert the float point elements of the vector into binary representation. So, it's either zero or one, depending if the original element is positive or negative.”*\
 -- Andrey Vasnetsov
 
-"We tried most popular open source models, and unfortunately they are not as good compatible with binary quantization as OpenAI.”\
+*"We tried most popular open source models, and unfortunately they are not as good compatible with binary quantization as OpenAI.”*\
 -- Andrey Vasnetsov
 
 ## Transcript: