ITG Advisory Services
Non-Public Advisory Cell • By Referral
Ledger: ITG/AS-19 Visibility: Limited Surface Protocol: Silent First Contact

Decisions Before Disclosure.

We advise teams operating in high-noise environments where timing, inference, and institutional discretion are inseparable. Most engagements remain unattributed.

Practice Areas

We work where technical architecture and institutional strategy must move in lockstep.

HFT

Latency-sensitive architecture reviews, execution stack hardening, and risk-control design for ultra-competitive market environments.

Labs

Operational frameworks for advanced research programs transitioning from experiment to production-grade systems.

Special

Advisory support for high-complexity programs, including select government and defense-adjacent technical initiatives.

Offices

  • Chicago
  • New York City
  • London
  • Hong Kong
  • São Paulo
  • Palo Alto, CA

About

ITG Advisory Services is an independent boutique consultancy focused on high-consequence technical decision-making. We keep a low profile by design.

Contact

Initial inquiries are reviewed discreetly.

secure-channel@itg-advisory.com

Referral or institutional introduction preferred.

Careers

We do not post open roles. We occasionally invite one candidate at a time, by referral, when a mandate requires uncommon technical judgment.

One entry vector exists below. Most readers stop there.

Phase key prompt: CHI, NYC, LON, HKG, SAO, PAO
Convert each city to UTC offset at 12:00 local, then serialize in office order as signed HHMM.
Prefix subject with PHASE-1 followed by that sequence.

Gate Problem 0x17 // Clock Drift Triangulation

Stage Alpha must be solved before any packet is read.

You are given three timestamped event streams generated by one latent sequence. Each stream is transformed by an unknown affine clock, then partially corrupted.

  • Observed timestamp model: t_j(i) = a_j * tau(i) + b_j + eps_j(i), with unknown a_j, b_j for j in {1,2,3}
  • Noise eps_j(i) is sub-Gaussian, but 3 percent of events are adversarial inserts and up to 7 percent are missing
  • Recover a deterministic global ordering and estimate all clock transforms in O(n log n) expected time
  • Provide a confidence bound proving p99 ordering error below 2e-6 seconds under the stated corruption model
seed = SHA256(\"itg/gate/0x17\")
digest = SHA256(canonical_order || round(a1,12) || round(a2,12) || round(a3,12))
submit: digest[0:32] + proof sketch + runtime profile

If you can solve it cleanly, send your packet to secure-channel@itg-advisory.com with subject line PHASE-1/<key> :: GATE 0x17 Submission.