assertEquals(16, signingKey.length, "Should produce 16-byte key");
    }

    @Test
    @DisplayName("Should handle large session key")
    void testDeriveKeys_LargeSessionKey() {
        // Given
        byte[] largeSessionKey = new byte[256]; // Larger than typical 16-byte key
        new SecureRandom().nextBytes(largeSessionKey);
        int dialect = Smb2Constants.SMB2_DIALECT_0311;

        // When

      throw new ArithmeticException("ceilingPowerOfTwo(" + x + ") is not representable as a long");
    }
    return 1L << -Long.numberOfLeadingZeros(x - 1);
  }

  /**
   * Returns the largest power of two less than or equal to {@code x}. This is equivalent to {@code
   * checkedPow(2, log2(x, FLOOR))}.
   *
   * @throws IllegalArgumentException if {@code x <= 0}
   * @since 20.0
   */

	MOVQ 3395469782(R10), R8        // ERROR "offset too large"
	LEAQ 3395469782(AX), AX         // ERROR "offset too large"
	ADDQ 3395469782(AX), AX         // ERROR "offset too large"
	ADDL 3395469782(AX), AX         // ERROR "offset too large"
	ADDW 3395469782(AX), AX         // ERROR "offset too large"
	LEAQ 433954697820(AX), AX       // ERROR "offset too large"

// client may instead provide a custom split function.
//
// Scanning stops unrecoverably at EOF, the first I/O error, or a token too
// large to fit in the [Scanner.Buffer]. When a scan stops, the reader may have
// advanced arbitrarily far past the last token. Programs that need more
// control over error handling or large tokens, or must run sequential scans
// on a reader, should use [bufio.Reader] instead.
type Scanner struct {

        assertNotNull(responseWithNull);
    }

    @Test
    @DisplayName("Should handle large data offset value")
    void testReadBytesWireFormatLargeDataOffset() throws Exception {
        // Given
        byte[] buffer = new byte[512];
        int bodyStart = 0;
        int dataLength = 10;
        // Use a large but safe offset value that fits in signed byte range (120)
        int dataOffsetValue = 120;

  public int indexOf(long target) {
    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i - start;
      }
    }
    return -1;
  }

  /**
   * Returns the largest index for which {@link #get} returns {@code target}, or {@code -1} if no
   * such index exists. Equivalent to {@code asList().lastIndexOf(target)}.
   */
  public int lastIndexOf(long target) {

    }

    @Test
    @DisplayName("Should generate multiple unique nonces without collision")
    void testGenerateMultipleNoncesNoCollision() {
        // Given
        int count = 10000; // Test with larger number for collision detection
        Set<String> nonceSet = new HashSet<>();

        // When
        for (int i = 0; i < count; i++) {
            byte[] nonce = encryptionContext.generateNonce();

                "1000, 500, 600, 8, 512", // Typical configuration
                "1000, 500, 600, 64, 512", // Large allocation units
                "1000, 500, 600, 8, 4096", // 4K sectors
                "1000, 500, 600, 16, 4096", // Large sectors and allocation
                "1000, 0, 0, 8, 512", // No free space
                "1000, 1000, 1000, 8, 512" // All space free
        })

    byte[] key = fillByteArray(80, 0xaa);
    String data = "Test Using Larger Than Block-Size Key - Hash Key First";

    checkSha1("aa4ae5e15272d00e95705637ce8a3b55ed402112", key, data);
  }

  public void testRfc2202_hmacSha1_case7() {
    byte[] key = fillByteArray(80, 0xaa);
    String data = "Test Using Larger Than Block-Size Key and Larger Than One Block-Size Data";

// into the buffer in order to make n bytes available. If Peek returns fewer
// than n bytes, it also returns an error explaining why the read is short.
// The error is [ErrBufferFull] if n is larger than b's buffer size.
//
// Calling Peek prevents a [Reader.UnreadByte] or [Reader.UnreadRune] call from succeeding
// until the next read operation.
func (b *Reader) Peek(n int) ([]byte, error) {
	if n < 0 {