Random　walks　are　basic　mechanism　for　many　dynamic　processes　on　the　network.　In　this　paper,　we　study　the　global　mean　first-passage　time　(GMFPT)　of　random　walks　on　the　n-dimensional　folded　hypercube　FQn.　FQn　is　a　variation　of　the　hypercube　Qn　by　adding　complementary　edges,　and　characterized　with　the　superiorities　of　smaller　diameter　and　higher　connectivity　than　the　hypercube.　We　initiate　a　more　concise　formula　to　the　Kirchhoff　index　by　using　the　spectra　of　the　Laplace　matrix　of　FQn.　We　also　obtain　the　explicit　formula　to　GMFPT,　and　the　exponent　of　scaling　efficiency　characterizing　the　random　walks　is　further　determined,　finding　that　it　takes　less　time　when　random　walks　on　FQn　than　on　Qn.　Moreover,　we　explore　random　walks　on　the　FQn　considering　a　given　trap.　Finally,　we　make　some　comparison　with　Qn　in　Kirchhoff　index,　noticing　a　more　effective　traffic　on　FQn.　©　2019　Taiwan　Academic　Network　Management　Committee.　All　rights　reserved.