We use pre-parsed treasury corpus documents from databricks, build a faiss and bm25 index over it. We use query reformulation for bm25 retrieval. We then setup a verifier agent, that looks at the output answer to identify whether the answer looks correct and finally we do a retry for n times if answer wasn't found. We use gemini-3-flash-preview model, and allow it access to web search and its internal python and math tools.