StepFun-Prover-Preview-32B is a 32 billion parameter theorem proving model developed by the StepFun Team. This model is specifically designed to iteratively refine proof sketches by interacting with Lean4. It achieves a 70.0% accuracy with Pass@1 on the MiniF2F-test benchmark, making it highly effective for formal theorem proving tasks. Its primary strength lies in its ability to generate and validate mathematical proofs.
Loading preview...
Model tree for
stepfun-ai/StepFun-Prover-Preview-32BMost commonly used values from Featherless users
temperature
This setting influences the sampling randomness. Lower values make the model more deterministic; higher values introduce randomness. Zero is greedy sampling.
top_p
This setting controls the cumulative probability of considered top tokens. Must be in (0, 1]. Set to 1 to consider all tokens.
top_k
This limits the number of top tokens to consider. Set to -1 to consider all tokens.
frequency_penalty
This setting penalizes new tokens based on their frequency in the generated text. Values > 0 encourage new tokens; < 0 encourages repetition.
presence_penalty
This setting penalizes new tokens based on their presence in the generated text so far. Values > 0 encourage new tokens; < 0 encourages repetition.
repetition_penalty
This setting penalizes new tokens based on their appearance in the prompt and generated text. Values > 1 encourage new tokens; < 1 encourages repetition.
min_p
This setting representing the minimum probability for a token to be considered relative to the most likely token. Must be in [0, 1]. Set to 0 to disable.