aptos-sdk 0.4.1

A user-friendly, idiomatic Rust SDK for the Aptos blockchain
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
//! Multi-Ed25519 signature scheme implementation.
//!
//! Multi-Ed25519 enables M-of-N threshold signatures where M signatures
//! out of N public keys are required to authorize a transaction.

use crate::crypto::ed25519::{
    ED25519_PUBLIC_KEY_LENGTH, ED25519_SIGNATURE_LENGTH, Ed25519PublicKey, Ed25519Signature,
};
use crate::crypto::traits::{PublicKey, Verifier};
use crate::error::{AptosError, AptosResult};
use serde::{Deserialize, Serialize};
use std::fmt;

/// Maximum number of keys in a multi-Ed25519 account.
pub const MAX_NUM_OF_KEYS: usize = 32;

// Compile-time assertion: MAX_NUM_OF_KEYS must fit in u8 for bitmap operations
const _: () = assert!(MAX_NUM_OF_KEYS <= u8::MAX as usize);

/// Minimum threshold (at least 1 signature required).
pub const MIN_THRESHOLD: u8 = 1;

/// A multi-Ed25519 public key.
///
/// This is a collection of Ed25519 public keys with a threshold value.
/// M-of-N signatures are required where M = threshold and N = number of keys.
///
/// # Example
///
/// ```rust,ignore
/// use aptos_sdk::crypto::{Ed25519PrivateKey, MultiEd25519PublicKey};
///
/// let keys: Vec<_> = (0..3).map(|_| Ed25519PrivateKey::generate().public_key()).collect();
/// let multi_pk = MultiEd25519PublicKey::new(keys, 2).unwrap(); // 2-of-3
/// ```
#[derive(Clone, PartialEq, Eq)]
pub struct MultiEd25519PublicKey {
    /// The individual public keys.
    public_keys: Vec<Ed25519PublicKey>,
    /// The required threshold (M in M-of-N).
    threshold: u8,
}

impl MultiEd25519PublicKey {
    /// Creates a new multi-Ed25519 public key.
    ///
    /// # Arguments
    ///
    /// * `public_keys` - The individual Ed25519 public keys
    /// * `threshold` - The number of signatures required (M in M-of-N)
    ///
    /// # Errors
    ///
    /// Returns an error if:
    /// - No public keys are provided
    /// - More than 32 public keys are provided
    /// - Threshold is 0
    /// - Threshold exceeds the number of keys
    pub fn new(public_keys: Vec<Ed25519PublicKey>, threshold: u8) -> AptosResult<Self> {
        if public_keys.is_empty() {
            return Err(AptosError::InvalidPublicKey(
                "multi-Ed25519 requires at least one public key".into(),
            ));
        }
        if public_keys.len() > MAX_NUM_OF_KEYS {
            return Err(AptosError::InvalidPublicKey(format!(
                "multi-Ed25519 supports at most {} keys, got {}",
                MAX_NUM_OF_KEYS,
                public_keys.len()
            )));
        }
        if threshold < MIN_THRESHOLD {
            return Err(AptosError::InvalidPublicKey(
                "threshold must be at least 1".into(),
            ));
        }
        if threshold as usize > public_keys.len() {
            return Err(AptosError::InvalidPublicKey(format!(
                "threshold {} exceeds number of keys {}",
                threshold,
                public_keys.len()
            )));
        }
        Ok(Self {
            public_keys,
            threshold,
        })
    }

    /// Returns the number of public keys.
    pub fn num_keys(&self) -> usize {
        self.public_keys.len()
    }

    /// Returns the threshold (M in M-of-N).
    pub fn threshold(&self) -> u8 {
        self.threshold
    }

    /// Returns the individual public keys.
    pub fn public_keys(&self) -> &[Ed25519PublicKey] {
        &self.public_keys
    }

    /// Serializes the public key to bytes.
    ///
    /// Format: `public_key_1` || `public_key_2` || ... || `public_key_n` || threshold
    pub fn to_bytes(&self) -> Vec<u8> {
        let mut bytes = Vec::with_capacity(self.public_keys.len() * ED25519_PUBLIC_KEY_LENGTH + 1);
        for pk in &self.public_keys {
            bytes.extend_from_slice(&pk.to_bytes());
        }
        bytes.push(self.threshold);
        bytes
    }

    /// Creates a public key from bytes.
    ///
    /// # Errors
    ///
    /// Returns [`AptosError::InvalidPublicKey`] if:
    /// - The bytes are empty
    /// - The bytes are too short (less than 33 bytes for one key + threshold)
    /// - The key bytes length is not a multiple of 32 bytes
    /// - Any individual public key fails to parse
    /// - The threshold is invalid (0, exceeds number of keys, etc.)
    pub fn from_bytes(bytes: &[u8]) -> AptosResult<Self> {
        if bytes.is_empty() {
            return Err(AptosError::InvalidPublicKey("empty bytes".into()));
        }
        if bytes.len() < ED25519_PUBLIC_KEY_LENGTH + 1 {
            return Err(AptosError::InvalidPublicKey(format!(
                "bytes too short: {} bytes",
                bytes.len()
            )));
        }

        let threshold = bytes[bytes.len() - 1];
        let key_bytes = &bytes[..bytes.len() - 1];

        if !key_bytes.len().is_multiple_of(ED25519_PUBLIC_KEY_LENGTH) {
            return Err(AptosError::InvalidPublicKey(format!(
                "key bytes length {} is not a multiple of {}",
                key_bytes.len(),
                ED25519_PUBLIC_KEY_LENGTH
            )));
        }

        let num_keys = key_bytes.len() / ED25519_PUBLIC_KEY_LENGTH;
        let mut public_keys = Vec::with_capacity(num_keys);

        for i in 0..num_keys {
            let start = i * ED25519_PUBLIC_KEY_LENGTH;
            let end = start + ED25519_PUBLIC_KEY_LENGTH;
            let pk = Ed25519PublicKey::from_bytes(&key_bytes[start..end])?;
            public_keys.push(pk);
        }

        Self::new(public_keys, threshold)
    }

    /// Derives the account address for this multi-Ed25519 public key.
    pub fn to_address(&self) -> crate::types::AccountAddress {
        crate::crypto::derive_address(&self.to_bytes(), crate::crypto::MULTI_ED25519_SCHEME)
    }

    /// Derives the authentication key for this public key.
    pub fn to_authentication_key(&self) -> [u8; 32] {
        crate::crypto::derive_authentication_key(
            &self.to_bytes(),
            crate::crypto::MULTI_ED25519_SCHEME,
        )
    }

    /// Verifies a multi-Ed25519 signature against a message.
    ///
    /// # Errors
    ///
    /// This function will return an error if:
    /// - The number of signatures is less than the threshold
    /// - Any individual signature verification fails
    /// - A signer index is out of bounds
    pub fn verify(&self, message: &[u8], signature: &MultiEd25519Signature) -> AptosResult<()> {
        // Check that we have enough signatures
        if signature.num_signatures() < self.threshold as usize {
            return Err(AptosError::SignatureVerificationFailed);
        }

        // Verify each signature
        for (index, sig) in signature.signatures() {
            if *index as usize >= self.public_keys.len() {
                return Err(AptosError::InvalidSignature(format!(
                    "signer index {} out of bounds (max {})",
                    index,
                    self.public_keys.len() - 1
                )));
            }
            let pk = &self.public_keys[*index as usize];
            pk.verify(message, sig)?;
        }

        Ok(())
    }
}

impl PublicKey for MultiEd25519PublicKey {
    const LENGTH: usize = 0; // Variable length

    fn from_bytes(bytes: &[u8]) -> AptosResult<Self> {
        MultiEd25519PublicKey::from_bytes(bytes)
    }

    fn to_bytes(&self) -> Vec<u8> {
        MultiEd25519PublicKey::to_bytes(self)
    }
}

impl Verifier for MultiEd25519PublicKey {
    type Signature = MultiEd25519Signature;

    fn verify(&self, message: &[u8], signature: &MultiEd25519Signature) -> AptosResult<()> {
        MultiEd25519PublicKey::verify(self, message, signature)
    }
}

impl fmt::Debug for MultiEd25519PublicKey {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(
            f,
            "MultiEd25519PublicKey({}-of-{} keys)",
            self.threshold,
            self.public_keys.len()
        )
    }
}

impl fmt::Display for MultiEd25519PublicKey {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.write_str(&const_hex::encode_prefixed(self.to_bytes()))
    }
}

impl Serialize for MultiEd25519PublicKey {
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        if serializer.is_human_readable() {
            serializer.serialize_str(&const_hex::encode_prefixed(self.to_bytes()))
        } else {
            serializer.serialize_bytes(&self.to_bytes())
        }
    }
}

impl<'de> Deserialize<'de> for MultiEd25519PublicKey {
    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
    where
        D: serde::Deserializer<'de>,
    {
        if deserializer.is_human_readable() {
            let bytes: Vec<u8> = const_hex::deserialize(deserializer)?;
            Self::from_bytes(&bytes).map_err(serde::de::Error::custom)
        } else {
            let bytes = Vec::<u8>::deserialize(deserializer)?;
            Self::from_bytes(&bytes).map_err(serde::de::Error::custom)
        }
    }
}

/// A multi-Ed25519 signature.
///
/// This contains individual Ed25519 signatures along with a bitmap indicating
/// which signers provided signatures.
#[derive(Clone, PartialEq, Eq)]
pub struct MultiEd25519Signature {
    /// Individual signatures with their signer index.
    signatures: Vec<(u8, Ed25519Signature)>,
    /// Bitmap indicating which keys signed (little-endian).
    bitmap: [u8; 4],
}

impl MultiEd25519Signature {
    /// Creates a new multi-Ed25519 signature from individual signatures.
    ///
    /// # Arguments
    ///
    /// * `signatures` - Vec of (`signer_index`, signature) pairs
    ///
    /// The signer indices must be in ascending order and within bounds.
    ///
    /// # Errors
    ///
    /// Returns [`AptosError::InvalidSignature`] if:
    /// - No signatures are provided
    /// - More than 32 signatures are provided
    /// - A signer index is out of bounds (>= 32)
    /// - Duplicate signer indices are present
    pub fn new(mut signatures: Vec<(u8, Ed25519Signature)>) -> AptosResult<Self> {
        if signatures.is_empty() {
            return Err(AptosError::InvalidSignature(
                "multi-Ed25519 signature requires at least one signature".into(),
            ));
        }
        if signatures.len() > MAX_NUM_OF_KEYS {
            return Err(AptosError::InvalidSignature(format!(
                "too many signatures: {} (max {})",
                signatures.len(),
                MAX_NUM_OF_KEYS
            )));
        }

        // Sort by index
        signatures.sort_by_key(|(idx, _)| *idx);

        // Check for duplicates and bounds
        let mut bitmap = [0u8; 4];
        let mut last_index: Option<u8> = None;

        for (index, _) in &signatures {
            if *index as usize >= MAX_NUM_OF_KEYS {
                return Err(AptosError::InvalidSignature(format!(
                    "signer index {} out of bounds (max {})",
                    index,
                    MAX_NUM_OF_KEYS - 1
                )));
            }
            if last_index == Some(*index) {
                return Err(AptosError::InvalidSignature(format!(
                    "duplicate signer index {index}"
                )));
            }
            last_index = Some(*index);

            // Set bit in bitmap
            let byte_index = (index / 8) as usize;
            let bit_index = index % 8;
            bitmap[byte_index] |= 1 << bit_index;
        }

        Ok(Self { signatures, bitmap })
    }

    /// Creates a signature from bytes.
    ///
    /// Format: `signature_1` || `signature_2` || ... || `signature_m` || bitmap (4 bytes)
    ///
    /// # Errors
    ///
    /// Returns [`AptosError::InvalidSignature`] if:
    /// - The bytes are too short (less than 4 bytes for bitmap)
    /// - The signature bytes length doesn't match the expected number of signatures from the bitmap
    /// - Any individual signature fails to parse
    pub fn from_bytes(bytes: &[u8]) -> AptosResult<Self> {
        if bytes.len() < 4 {
            return Err(AptosError::InvalidSignature("bytes too short".into()));
        }

        let bitmap_start = bytes.len() - 4;
        let mut bitmap = [0u8; 4];
        bitmap.copy_from_slice(&bytes[bitmap_start..]);

        let sig_bytes = &bytes[..bitmap_start];

        // Count signatures from bitmap
        let num_sigs = bitmap.iter().map(|b| b.count_ones()).sum::<u32>() as usize;

        if sig_bytes.len() != num_sigs * ED25519_SIGNATURE_LENGTH {
            return Err(AptosError::InvalidSignature(format!(
                "signature bytes length {} doesn't match expected {} signatures",
                sig_bytes.len(),
                num_sigs
            )));
        }

        // Parse signatures (MAX_NUM_OF_KEYS is 32, which fits in u8)
        let mut signatures = Vec::with_capacity(num_sigs);
        let mut sig_idx = 0;

        #[allow(clippy::cast_possible_truncation)]
        for bit_pos in 0..(MAX_NUM_OF_KEYS as u8) {
            let byte_idx = (bit_pos / 8) as usize;
            let bit_idx = bit_pos % 8;

            if (bitmap[byte_idx] >> bit_idx) & 1 == 1 {
                let start = sig_idx * ED25519_SIGNATURE_LENGTH;
                let end = start + ED25519_SIGNATURE_LENGTH;
                let sig = Ed25519Signature::from_bytes(&sig_bytes[start..end])?;
                signatures.push((bit_pos, sig));
                sig_idx += 1;
            }
        }

        Ok(Self { signatures, bitmap })
    }

    /// Serializes the signature to bytes.
    pub fn to_bytes(&self) -> Vec<u8> {
        let mut bytes = Vec::with_capacity(self.signatures.len() * ED25519_SIGNATURE_LENGTH + 4);
        for (_, sig) in &self.signatures {
            bytes.extend_from_slice(&sig.to_bytes());
        }
        bytes.extend_from_slice(&self.bitmap);
        bytes
    }

    /// Returns the number of signatures.
    pub fn num_signatures(&self) -> usize {
        self.signatures.len()
    }

    /// Returns the individual signatures with their indices.
    pub fn signatures(&self) -> &[(u8, Ed25519Signature)] {
        &self.signatures
    }

    /// Returns the signer bitmap.
    pub fn bitmap(&self) -> &[u8; 4] {
        &self.bitmap
    }

    /// Checks if a particular index signed.
    pub fn has_signature(&self, index: u8) -> bool {
        if index as usize >= MAX_NUM_OF_KEYS {
            return false;
        }
        let byte_index = (index / 8) as usize;
        let bit_index = index % 8;
        (self.bitmap[byte_index] >> bit_index) & 1 == 1
    }
}

impl crate::crypto::traits::Signature for MultiEd25519Signature {
    type PublicKey = MultiEd25519PublicKey;
    const LENGTH: usize = 0; // Variable length

    fn from_bytes(bytes: &[u8]) -> AptosResult<Self> {
        MultiEd25519Signature::from_bytes(bytes)
    }

    fn to_bytes(&self) -> Vec<u8> {
        MultiEd25519Signature::to_bytes(self)
    }
}

impl fmt::Debug for MultiEd25519Signature {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(
            f,
            "MultiEd25519Signature({} signatures, bitmap={:?})",
            self.signatures.len(),
            self.bitmap
        )
    }
}

impl fmt::Display for MultiEd25519Signature {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.write_str(&const_hex::encode_prefixed(self.to_bytes()))
    }
}

impl Serialize for MultiEd25519Signature {
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: serde::Serializer,
    {
        if serializer.is_human_readable() {
            serializer.serialize_str(&const_hex::encode_prefixed(self.to_bytes()))
        } else {
            serializer.serialize_bytes(&self.to_bytes())
        }
    }
}

impl<'de> Deserialize<'de> for MultiEd25519Signature {
    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
    where
        D: serde::Deserializer<'de>,
    {
        if deserializer.is_human_readable() {
            let bytes: Vec<u8> = const_hex::deserialize(deserializer)?;
            Self::from_bytes(&bytes).map_err(serde::de::Error::custom)
        } else {
            let bytes = Vec::<u8>::deserialize(deserializer)?;
            Self::from_bytes(&bytes).map_err(serde::de::Error::custom)
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::crypto::Ed25519PrivateKey;

    #[test]
    fn test_multi_ed25519_public_key_creation() {
        let keys: Vec<_> = (0..3)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();

        // Valid 2-of-3
        let multi_pk = MultiEd25519PublicKey::new(keys.clone(), 2).unwrap();
        assert_eq!(multi_pk.num_keys(), 3);
        assert_eq!(multi_pk.threshold(), 2);

        // Valid 3-of-3
        let multi_pk = MultiEd25519PublicKey::new(keys.clone(), 3).unwrap();
        assert_eq!(multi_pk.threshold(), 3);

        // Invalid: threshold > num_keys
        assert!(MultiEd25519PublicKey::new(keys.clone(), 4).is_err());

        // Invalid: threshold = 0
        assert!(MultiEd25519PublicKey::new(keys.clone(), 0).is_err());

        // Invalid: empty keys
        assert!(MultiEd25519PublicKey::new(vec![], 1).is_err());
    }

    #[test]
    fn test_multi_ed25519_sign_verify() {
        let private_keys: Vec<_> = (0..3).map(|_| Ed25519PrivateKey::generate()).collect();
        let public_keys: Vec<_> = private_keys
            .iter()
            .map(Ed25519PrivateKey::public_key)
            .collect();

        let multi_pk = MultiEd25519PublicKey::new(public_keys, 2).unwrap();
        let message = b"test message";

        // Sign with keys 0 and 2 (2-of-3)
        let sig0 = private_keys[0].sign(message);
        let sig2 = private_keys[2].sign(message);

        let multi_sig = MultiEd25519Signature::new(vec![(0, sig0), (2, sig2)]).unwrap();

        // Verify should succeed
        assert!(multi_pk.verify(message, &multi_sig).is_ok());

        // Wrong message should fail
        assert!(multi_pk.verify(b"wrong message", &multi_sig).is_err());
    }

    #[test]
    fn test_multi_ed25519_insufficient_signatures() {
        let private_keys: Vec<_> = (0..3).map(|_| Ed25519PrivateKey::generate()).collect();
        let public_keys: Vec<_> = private_keys
            .iter()
            .map(Ed25519PrivateKey::public_key)
            .collect();

        let multi_pk = MultiEd25519PublicKey::new(public_keys, 2).unwrap();
        let message = b"test message";

        // Only 1 signature (need 2)
        let sig0 = private_keys[0].sign(message);
        let multi_sig = MultiEd25519Signature::new(vec![(0, sig0)]).unwrap();

        // Should fail due to insufficient signatures
        assert!(multi_pk.verify(message, &multi_sig).is_err());
    }

    #[test]
    fn test_multi_ed25519_bytes_roundtrip() {
        let keys: Vec<_> = (0..3)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys, 2).unwrap();

        let bytes = multi_pk.to_bytes();
        let restored = MultiEd25519PublicKey::from_bytes(&bytes).unwrap();

        assert_eq!(multi_pk.threshold(), restored.threshold());
        assert_eq!(multi_pk.num_keys(), restored.num_keys());
        assert_eq!(multi_pk.to_bytes(), restored.to_bytes());
    }

    #[test]
    fn test_multi_ed25519_signature_bytes_roundtrip() {
        let private_keys: Vec<_> = (0..3).map(|_| Ed25519PrivateKey::generate()).collect();
        let message = b"test";

        let sig0 = private_keys[0].sign(message);
        let sig2 = private_keys[2].sign(message);

        let multi_sig = MultiEd25519Signature::new(vec![(0, sig0), (2, sig2)]).unwrap();

        let bytes = multi_sig.to_bytes();
        let restored = MultiEd25519Signature::from_bytes(&bytes).unwrap();

        assert_eq!(multi_sig.num_signatures(), restored.num_signatures());
        assert_eq!(multi_sig.bitmap(), restored.bitmap());
    }

    #[test]
    fn test_multi_ed25519_address_derivation() {
        let keys: Vec<_> = (0..3)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys, 2).unwrap();

        let address = multi_pk.to_address();
        assert!(!address.is_zero());

        // Same keys should produce same address
        let address2 = multi_pk.to_address();
        assert_eq!(address, address2);
    }

    #[test]
    fn test_signature_bitmap() {
        let private_keys: Vec<_> = (0..5).map(|_| Ed25519PrivateKey::generate()).collect();
        let message = b"test";

        // Sign with indices 1, 3, 4
        let signatures: Vec<_> = [1, 3, 4]
            .iter()
            .map(|&i| (i, private_keys[i as usize].sign(message)))
            .collect();

        let multi_sig = MultiEd25519Signature::new(signatures).unwrap();

        assert!(!multi_sig.has_signature(0));
        assert!(multi_sig.has_signature(1));
        assert!(!multi_sig.has_signature(2));
        assert!(multi_sig.has_signature(3));
        assert!(multi_sig.has_signature(4));
        assert!(!multi_sig.has_signature(5));
    }

    #[test]
    fn test_multi_ed25519_public_key_too_many_keys() {
        let keys: Vec<_> = (0..33) // MAX_NUM_OF_KEYS is 32
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();

        let result = MultiEd25519PublicKey::new(keys, 2);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_public_keys_accessor() {
        let keys: Vec<_> = (0..3)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys.clone(), 2).unwrap();

        assert_eq!(multi_pk.public_keys().len(), 3);
    }

    #[test]
    fn test_multi_ed25519_signature_num_signatures() {
        let private_keys: Vec<_> = (0..3).map(|_| Ed25519PrivateKey::generate()).collect();
        let message = b"test";

        let sig0 = private_keys[0].sign(message);
        let sig2 = private_keys[2].sign(message);

        let multi_sig = MultiEd25519Signature::new(vec![(0, sig0), (2, sig2)]).unwrap();

        assert_eq!(multi_sig.num_signatures(), 2);
        // Check bitmap has bits 0 and 2 set (little-endian 4 bytes)
        let bitmap_bytes = multi_sig.bitmap();
        // Bit 0 and bit 2 set means first byte should be 0b00000101 = 5
        assert_eq!(bitmap_bytes[0], 5);
    }

    #[test]
    fn test_multi_ed25519_signature_empty() {
        let result = MultiEd25519Signature::new(vec![]);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_signature_index_out_of_bounds() {
        let private_key = Ed25519PrivateKey::generate();
        let sig = private_key.sign(b"test");

        // Index 33 is out of bounds (MAX_NUM_OF_KEYS is 32)
        let result = MultiEd25519Signature::new(vec![(33, sig)]);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_signature_duplicate_index() {
        let private_key = Ed25519PrivateKey::generate();
        let sig1 = private_key.sign(b"test1");
        let sig2 = private_key.sign(b"test2");

        // Duplicate index 0
        let result = MultiEd25519Signature::new(vec![(0, sig1), (0, sig2)]);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_public_key_from_bytes_invalid() {
        // Too short - not even a threshold byte
        let result = MultiEd25519PublicKey::from_bytes(&[]);
        assert!(result.is_err());

        // Just a threshold, no keys
        let result = MultiEd25519PublicKey::from_bytes(&[2]);
        assert!(result.is_err());

        // Invalid length - not a multiple of 32 + 1
        let result = MultiEd25519PublicKey::from_bytes(&[1, 2, 3, 4, 5]);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_signature_from_bytes_invalid() {
        // Too short
        let result = MultiEd25519Signature::from_bytes(&[]);
        assert!(result.is_err());

        // Just bitmap, no signatures
        let result = MultiEd25519Signature::from_bytes(&[0, 0, 0, 1]);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_verify_invalid_signature_index() {
        let private_keys: Vec<_> = (0..3).map(|_| Ed25519PrivateKey::generate()).collect();
        let public_keys: Vec<_> = private_keys
            .iter()
            .map(Ed25519PrivateKey::public_key)
            .collect();

        let multi_pk = MultiEd25519PublicKey::new(public_keys, 2).unwrap();
        let message = b"test message";

        // Sign with indices 0 and 5 (5 is out of bounds for 3 keys)
        let sig0 = private_keys[0].sign(message);
        let sig5 = private_keys[0].sign(message); // Use same key, doesn't matter for this test

        // Create bitmap with bit 5 set
        let bitmap = (1u32 << 0) | (1u32 << 5);
        let mut bytes = Vec::new();
        bytes.extend_from_slice(&sig0.to_bytes());
        bytes.extend_from_slice(&sig5.to_bytes());
        bytes.extend_from_slice(&bitmap.to_le_bytes());

        let multi_sig = MultiEd25519Signature::from_bytes(&bytes).unwrap();

        // Verification should fail because index 5 is out of bounds
        let result = multi_pk.verify(message, &multi_sig);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_verify_wrong_signature() {
        let private_keys: Vec<_> = (0..3).map(|_| Ed25519PrivateKey::generate()).collect();
        let public_keys: Vec<_> = private_keys
            .iter()
            .map(Ed25519PrivateKey::public_key)
            .collect();

        let multi_pk = MultiEd25519PublicKey::new(public_keys, 2).unwrap();
        let message = b"test message";

        // Sign with key 0 but claim it's from key 1
        let sig0 = private_keys[0].sign(message);
        let sig1 = private_keys[0].sign(message); // Wrong key for index 1

        let multi_sig = MultiEd25519Signature::new(vec![(0, sig0), (1, sig1)]).unwrap();

        // Verification should fail because sig at index 1 doesn't match key 1
        let result = multi_pk.verify(message, &multi_sig);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_public_key_debug() {
        let keys: Vec<_> = (0..2)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys, 2).unwrap();
        let debug = format!("{multi_pk:?}");
        assert!(debug.contains("MultiEd25519PublicKey"));
        assert!(debug.contains("2-of-2"));
    }

    #[test]
    fn test_multi_ed25519_signature_debug() {
        let private_key = Ed25519PrivateKey::generate();
        let sig = private_key.sign(b"test");
        let multi_sig = MultiEd25519Signature::new(vec![(0, sig)]).unwrap();

        let debug = format!("{multi_sig:?}");
        assert!(debug.contains("MultiEd25519Signature"));
    }

    #[test]
    fn test_multi_ed25519_json_serialization() {
        let keys: Vec<_> = (0..3)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys, 2).unwrap();

        let json = serde_json::to_string(&multi_pk).unwrap();
        let parsed: MultiEd25519PublicKey = serde_json::from_str(&json).unwrap();

        assert_eq!(multi_pk.threshold(), parsed.threshold());
        assert_eq!(multi_pk.num_keys(), parsed.num_keys());
    }

    #[test]
    fn test_multi_ed25519_signature_json_serialization() {
        let private_keys: Vec<_> = (0..3).map(|_| Ed25519PrivateKey::generate()).collect();
        let message = b"test";

        let sig0 = private_keys[0].sign(message);
        let sig2 = private_keys[2].sign(message);

        let multi_sig = MultiEd25519Signature::new(vec![(0, sig0), (2, sig2)]).unwrap();

        let json = serde_json::to_string(&multi_sig).unwrap();
        let parsed: MultiEd25519Signature = serde_json::from_str(&json).unwrap();

        assert_eq!(multi_sig.num_signatures(), parsed.num_signatures());
        assert_eq!(multi_sig.bitmap(), parsed.bitmap());
    }

    #[test]
    fn test_multi_ed25519_signature_from_bytes_too_short() {
        let bytes = vec![0u8; 3]; // Less than 4 bytes (bitmap)
        let result = MultiEd25519Signature::from_bytes(&bytes);
        assert!(result.is_err());
        assert!(result.unwrap_err().to_string().contains("too short"));
    }

    #[test]
    fn test_multi_ed25519_signature_from_bytes_invalid_length() {
        // Create bytes with bitmap indicating 1 signature but wrong number of bytes
        let mut bytes = vec![0u8; 10]; // Not a multiple of signature length
        // Set bitmap to indicate 1 signature (bit 0 set)
        bytes.extend_from_slice(&[0x01, 0x00, 0x00, 0x00]);

        let result = MultiEd25519Signature::from_bytes(&bytes);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_signature_has_signature() {
        let private_key = Ed25519PrivateKey::generate();
        let sig0 = private_key.sign(b"test");
        let sig2 = private_key.sign(b"test");

        let multi_sig = MultiEd25519Signature::new(vec![(0, sig0), (2, sig2)]).unwrap();

        assert!(multi_sig.has_signature(0));
        assert!(!multi_sig.has_signature(1));
        assert!(multi_sig.has_signature(2));
        assert!(!multi_sig.has_signature(3));
        assert!(!multi_sig.has_signature(32)); // Out of bounds
    }

    #[test]
    fn test_multi_ed25519_signature_signatures_accessor() {
        let private_key = Ed25519PrivateKey::generate();
        let sig0 = private_key.sign(b"test");
        let sig1 = private_key.sign(b"test");

        let multi_sig = MultiEd25519Signature::new(vec![(0, sig0), (1, sig1)]).unwrap();

        let signatures = multi_sig.signatures();
        assert_eq!(signatures.len(), 2);
        assert_eq!(signatures[0].0, 0);
        assert_eq!(signatures[1].0, 1);
    }

    #[test]
    fn test_multi_ed25519_public_key_public_keys_accessor() {
        let keys: Vec<_> = (0..3)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys.clone(), 2).unwrap();

        let pks = multi_pk.public_keys();
        assert_eq!(pks.len(), 3);
    }

    #[test]
    fn test_multi_ed25519_signature_display() {
        let private_key = Ed25519PrivateKey::generate();
        let sig = private_key.sign(b"test");
        let multi_sig = MultiEd25519Signature::new(vec![(0, sig)]).unwrap();

        let display = format!("{multi_sig}");
        assert!(display.starts_with("0x"));
    }

    #[test]
    fn test_multi_ed25519_public_key_display() {
        let keys: Vec<_> = (0..2)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys, 2).unwrap();

        let display = format!("{multi_pk}");
        assert!(display.starts_with("0x"));
    }

    #[test]
    fn test_multi_ed25519_signature_roundtrip() {
        let private_key = Ed25519PrivateKey::generate();
        let sig0 = private_key.sign(b"test");
        let sig1 = private_key.sign(b"test");

        let multi_sig = MultiEd25519Signature::new(vec![(0, sig0), (1, sig1)]).unwrap();
        let bytes = multi_sig.to_bytes();
        let restored = MultiEd25519Signature::from_bytes(&bytes).unwrap();

        assert_eq!(multi_sig.num_signatures(), restored.num_signatures());
        assert_eq!(multi_sig.bitmap(), restored.bitmap());
    }

    #[test]
    fn test_multi_ed25519_public_key_roundtrip() {
        let keys: Vec<_> = (0..3)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys, 2).unwrap();
        let bytes = multi_pk.to_bytes();
        let restored = MultiEd25519PublicKey::from_bytes(&bytes).unwrap();

        assert_eq!(multi_pk.threshold(), restored.threshold());
        assert_eq!(multi_pk.num_keys(), restored.num_keys());
    }

    #[test]
    fn test_multi_ed25519_signature_new_empty() {
        let result = MultiEd25519Signature::new(vec![]);
        assert!(result.is_err());
        assert!(result.unwrap_err().to_string().contains("at least one"));
    }

    #[test]
    fn test_multi_ed25519_signature_new_duplicate_index() {
        let private_key = Ed25519PrivateKey::generate();
        let first_sig = private_key.sign(b"test");
        let second_sig = private_key.sign(b"test");

        let result = MultiEd25519Signature::new(vec![(0, first_sig), (0, second_sig)]);
        assert!(result.is_err());
        assert!(result.unwrap_err().to_string().contains("duplicate"));
    }

    #[test]
    fn test_multi_ed25519_signature_new_index_out_of_bounds() {
        let private_key = Ed25519PrivateKey::generate();
        let sig = private_key.sign(b"test");

        let result = MultiEd25519Signature::new(vec![(32, sig)]); // Index 32 is out of bounds
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_public_key_to_address() {
        let keys: Vec<_> = (0..3)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys, 2).unwrap();

        let address = multi_pk.to_address();
        assert!(!address.is_zero());
    }

    #[test]
    fn test_multi_ed25519_public_key_from_bytes_invalid_length() {
        // Invalid length (not a multiple of ED25519_PUBLIC_KEY_LENGTH + 1 for threshold)
        let bytes = vec![0u8; 10];
        let result = MultiEd25519PublicKey::from_bytes(&bytes);
        assert!(result.is_err());
    }

    #[test]
    fn test_multi_ed25519_bcs_roundtrip_public_key() {
        let keys: Vec<_> = (0..3)
            .map(|_| Ed25519PrivateKey::generate().public_key())
            .collect();
        let multi_pk = MultiEd25519PublicKey::new(keys, 2).unwrap();

        let bcs_bytes = aptos_bcs::to_bytes(&multi_pk).unwrap();
        let restored: MultiEd25519PublicKey = aptos_bcs::from_bytes(&bcs_bytes).unwrap();

        assert_eq!(multi_pk.threshold(), restored.threshold());
        assert_eq!(multi_pk.num_keys(), restored.num_keys());
    }

    #[test]
    fn test_multi_ed25519_bcs_roundtrip_signature() {
        let private_key = Ed25519PrivateKey::generate();
        let sig = private_key.sign(b"test");
        let multi_sig = MultiEd25519Signature::new(vec![(0, sig)]).unwrap();

        let bcs_bytes = aptos_bcs::to_bytes(&multi_sig).unwrap();
        let restored: MultiEd25519Signature = aptos_bcs::from_bytes(&bcs_bytes).unwrap();

        assert_eq!(multi_sig.num_signatures(), restored.num_signatures());
    }
}