Identifying fixed bits of a bitstring format

A method for identifying fixed bits of a bitstring format, the method performed by a computing system and comprising:

• generating a first bitstring having, for a first set of bits of the first bitstring, respective first bit values that have a first satisfiability state for requirements of the bitstring format;
• generating a second bitstring having, for a second set of bits of the second bitstring, respective second bit values that have a second satisfiability state for the requirements of the bitstring format, the second satisfiability state different than the first satisfiability state;
• identifying first potential free bits having respective first common values in the first set of bits and in the second set of bits;
• generating a third bitstring having, for a third set of bits of the third bitstring, the first potential free bits with the respective first common values and third remaining bits, the third set of bits having respective third bit values that have the second satisfiability state for the requirements of the bitstring format;
• identifying second potential free bits in the first set of bits and in the third set of bits having respective second common values;
• identifying a fixed bit that is not included in the first potential free bits and is not included in the second potential free bits;
• and
• outputting an indication of the fixed bit and a fixed bit value of the fixed bit, the fixed bit value being a corresponding value for the fixed bit that satisfies the requirements of the bitstring format.

A system comprising:

• a first node;
• a second node that exchanges data with the first node using first protocol messages that conform to a first bitstring format for a first protocol, the first bitstring format having one or more first fixed bits with respective bit values required to satisfy requirements of the first protocol and also having one or more first free bits;
• and
• a third node that exchanges data with the second node using protocol messages that conform to a second bitstring format for a second protocol, the second bitstring format having one or more second fixed bits with respective bit values required to satisfy requirements of the second protocol and also having one or more second free bits.

A non-transitory computer-readable medium comprising instructions for identifying fixed bits of a bitstring format, the instructions configured to cause processing circuitry to:

• generate a first bitstring having, for a first set of bits of the first bitstring, respective first bit values that have a first satisfiability state for requirements of the bitstring format;
• generate a second bitstring having, for a second set of bits of the second bitstring, respective second bit values that have a second satisfiability state for the requirements of the bitstring format, the second satisfiability state different than the first satisfiability state;
• identify first potential free bits having respective first common values in the first set of bits and in the second set of bits;
• generate a third bitstring having, for a third set of bits of the third bitstring, the first potential free bits with the respective first common values and third remaining bits, the third set of bits having respective third bit values that have the second satisfiability state for the requirements of the bitstring format;
• identify second potential free bits in the first set of bits and in the third set of bits having respective second common values;
• identify a fixed bit that is not included in the first potential free bits and is not included in the second potential free bits;
• output an indication of the fixed bit and a fixed bit value of the fixed bit, the fixed bit value being a corresponding value for the fixed bit that satisfies the requirements of the bitstring format.