The fast Tamari transform (FTT), which is suitable to obtain some properties ofp-valued digital functions and networks (pbeing the power of a prime) is presented. A systematic procedure to calculate the FTT is defined, and an expression for the complexity of calculation, and flow-graphs and networks for the calculation of the FTT are also presented. All aspects are illustrated with several examples.