Decentralized storage with high availability and security has the problem of high repair bandwidth due to the same parameter low rate Reed-Solomon codes. Thus

a low repair bandwidth DHitchhiker based on credibility is proposed. Data nodes and some parity nodes in the first sub-stripe of Hitchhiker are piggybacked on the second sub-stripe of the remaining parity nodes. We classify the nodes

and let thehigh-credit nodes store the remaining parity nodes

the low-credit nodes store the data nodes and some parity nodes

and different types of nodes adopt different repair strategies. It is proved that the repair bandwidth can be reduced by about 25% at repairing low-credit nodes. And the repair bandwidth can be reduced by about 0.5% without classifying the nodes. What's more

the repair bandwidth can also be reduced by about 1% and the repair time can be reduced by about 2.5%~3.3% based on the credibility of the nodes.