Block #3,545,920

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/5/2020, 1:54:07 PM · Difficulty 10.9350 · 3,287,953 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
d16b96e896852bd08611c97567b978c39eb207271826a2a1d12ae251cfaa1872

Height

#3,545,920

Difficulty

10.934957

Transactions

2

Size

541 B

Version

2

Bits

0aef5955

Nonce

1,383,010,610

Timestamp

2/5/2020, 1:54:07 PM

Confirmations

3,287,953

Merkle Root

3c1b3ee6fcbfc57cf65f1ec5637574f7d120e12a577185f216e0bef04e6df874
Transactions (2)
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

4.856 × 10⁹⁶(97-digit number)
48561858801170913910…91757143334808221439
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
4.856 × 10⁹⁶(97-digit number)
48561858801170913910…91757143334808221439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.712 × 10⁹⁶(97-digit number)
97123717602341827821…83514286669616442879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.942 × 10⁹⁷(98-digit number)
19424743520468365564…67028573339232885759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.884 × 10⁹⁷(98-digit number)
38849487040936731128…34057146678465771519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.769 × 10⁹⁷(98-digit number)
77698974081873462257…68114293356931543039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.553 × 10⁹⁸(99-digit number)
15539794816374692451…36228586713863086079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.107 × 10⁹⁸(99-digit number)
31079589632749384902…72457173427726172159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.215 × 10⁹⁸(99-digit number)
62159179265498769805…44914346855452344319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.243 × 10⁹⁹(100-digit number)
12431835853099753961…89828693710904688639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.486 × 10⁹⁹(100-digit number)
24863671706199507922…79657387421809377279
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,915,216 XPM·at block #6,833,872 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy