A linear-time certifying algorithm for 3-edge-connectivity is presented. Given a connected undirected graph G, if G 3-edge-connected, the generates construction sequence as positive certificate G. Otherwise, decomposes into its 3-edge-connected components and each of them well bridges cactus representation cut-pairs in negative certificates. All these are done by making only one pass over using...