Block #3,475,424

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2019, 11:51:26 AM · Difficulty 10.9790 · 3,366,433 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
21d77bccb3d16aa79b84d48238da1207574cb28cd90d41ea611d995af4c4283e

Height

#3,475,424

Difficulty

10.979049

Transactions

7

Size

3.17 KB

Version

2

Bits

0afaa2f6

Nonce

1,244,770,602

Timestamp

12/14/2019, 11:51:26 AM

Confirmations

3,366,433

Merkle Root

379f788c12156e2ceab0643fa62d87827f98ecd25d7fda09737409e28f37b9fc
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.

2.543 × 10⁹³(94-digit number)
25433211581452500083…31411523707861437159
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
2.543 × 10⁹³(94-digit number)
25433211581452500083…31411523707861437159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.086 × 10⁹³(94-digit number)
50866423162905000167…62823047415722874319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.017 × 10⁹⁴(95-digit number)
10173284632581000033…25646094831445748639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.034 × 10⁹⁴(95-digit number)
20346569265162000067…51292189662891497279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.069 × 10⁹⁴(95-digit number)
40693138530324000134…02584379325782994559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.138 × 10⁹⁴(95-digit number)
81386277060648000268…05168758651565989119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.627 × 10⁹⁵(96-digit number)
16277255412129600053…10337517303131978239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.255 × 10⁹⁵(96-digit number)
32554510824259200107…20675034606263956479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.510 × 10⁹⁵(96-digit number)
65109021648518400214…41350069212527912959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.302 × 10⁹⁶(97-digit number)
13021804329703680042…82700138425055825919
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,979,232 XPM·at block #6,841,856 · 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