remove non ascii whitespaces

technology/internet/NTP.md

@@ -55,24 +55,24 @@ The 64-bit binary fixed-point timestamps used by NTP consist of a 32-bit part fo
 NTPv4 introduces a 128-bit date format: 64 bits for the second and 64 bits for the fractional-second. The most-significant 32-bits of this format is the Era Number which resolves rollover ambiguity in most cases. According to Mills, "The 64-bit value for the fraction is enough to resolve the amount of time it takes a photon to pass an electron at the speed of light. The 64-bit second value is enough to provide unambiguous time representation until the universe goes dim."
 
 ## Clock synchronization algorithm
-A typical NTP client regularly polls one or more NTP servers. The client must compute its time offset and round-trip delay. Time offset _θ_ is positive or negative (client time > server time) difference in absolute time between the two clocks. It is defined by:
+A typical NTP client regularly polls one or more NTP servers. The client must compute its time offset and round-trip delay. Time offset _θ_ is positive or negative (client time > server time) difference in absolute time between the two clocks. It is defined by:
 ${\displaystyle \theta ={\frac {(t_{1}-t_{0})+(t_{2}-t_{3})}{2}},}$
 
-and the round-trip delay _δ_ by:
+and the round-trip delay _δ_ by:
 ${\displaystyle \delta ={(t_{3}-t_{0})-(t_{2}-t_{1})},}$
 
 where
-- $t_{0}$ is the client's timestamp of the request packet transmission,
-- $t_{1}$ is the server's timestamp of the request packet reception,
-- $t_{2}$ is the server's timestamp of the response packet transmission and
-- $t_{3}$ is the client's timestamp of the response packet reception.
+- $t_{0}$ is the client's timestamp of the request packet transmission,
+- $t_{1}$ is the server's timestamp of the request packet reception,
+- $t_{2}$ is the server's timestamp of the response packet transmission and
+- $t_{3}$ is the client's timestamp of the response packet reception.
 
 To derive the expression for the offset, note that for the request packet,
 ${\displaystyle t_{0}+\theta +\delta /2=t_{1}}$
 and for the response packet,
 ${\displaystyle t_{3}+\theta -\delta /2=t_{2}}$
 
-Solving for _θ_ yields the definition of the time offset.
+Solving for _θ_ yields the definition of the time offset.
 
 The values for θ and δ are passed through filters and subjected to statistical analysis ("mitigation"). Outliers are discarded and an estimate of time offset is derived from the best three remaining candidates. The clock frequency is then adjusted to reduce the offset gradually ("discipline"), creating a feedback loop.