Block #3,454,561

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/29/2019, 9:15:55 PM · Difficulty 10.9791 · 3,372,594 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9dd3edf57bd9cb774edaee1443bedbbbcb173ddb5917964363256c94c4ef89c6

Height

#3,454,561

Difficulty

10.979146

Transactions

2

Size

1.24 KB

Version

2

Bits

0afaa94e

Nonce

1,234,588,805

Timestamp

11/29/2019, 9:15:55 PM

Confirmations

3,372,594

Merkle Root

2ad7ced1398f28efd2c4983cb24f4e204c00f23dbb3d30bc001f09572489e398
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.

1.722 × 10⁹⁴(95-digit number)
17222997371196711770…60891575638561360321
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
1.722 × 10⁹⁴(95-digit number)
17222997371196711770…60891575638561360321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.444 × 10⁹⁴(95-digit number)
34445994742393423541…21783151277122720641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.889 × 10⁹⁴(95-digit number)
68891989484786847083…43566302554245441281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.377 × 10⁹⁵(96-digit number)
13778397896957369416…87132605108490882561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.755 × 10⁹⁵(96-digit number)
27556795793914738833…74265210216981765121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.511 × 10⁹⁵(96-digit number)
55113591587829477666…48530420433963530241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.102 × 10⁹⁶(97-digit number)
11022718317565895533…97060840867927060481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.204 × 10⁹⁶(97-digit number)
22045436635131791066…94121681735854120961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.409 × 10⁹⁶(97-digit number)
44090873270263582133…88243363471708241921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.818 × 10⁹⁶(97-digit number)
88181746540527164266…76486726943416483841
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,861,424 XPM·at block #6,827,154 · 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