Block #3,505,135

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2020, 9:49:09 AM · Difficulty 10.9307 · 3,338,060 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
40bfb6104705e70723d9999189ffbcff8c50515bb54427189e0ccc3b200afe6c

Height

#3,505,135

Difficulty

10.930733

Transactions

3

Size

14.73 KB

Version

2

Bits

0aee4488

Nonce

242,785,142

Timestamp

1/8/2020, 9:49:09 AM

Confirmations

3,338,060

Merkle Root

d8db2e5bbe04a3121c55cd5b0331db86fba5627bce620921e9991600f9d55b99
Transactions (3)
1 in → 1 out8.5200 XPM109 B
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
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.318 × 10⁹⁶(97-digit number)
43184753945915825171…71699854684957450239
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.318 × 10⁹⁶(97-digit number)
43184753945915825171…71699854684957450239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.636 × 10⁹⁶(97-digit number)
86369507891831650343…43399709369914900479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.727 × 10⁹⁷(98-digit number)
17273901578366330068…86799418739829800959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.454 × 10⁹⁷(98-digit number)
34547803156732660137…73598837479659601919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.909 × 10⁹⁷(98-digit number)
69095606313465320274…47197674959319203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.381 × 10⁹⁸(99-digit number)
13819121262693064054…94395349918638407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.763 × 10⁹⁸(99-digit number)
27638242525386128109…88790699837276815359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.527 × 10⁹⁸(99-digit number)
55276485050772256219…77581399674553630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.105 × 10⁹⁹(100-digit number)
11055297010154451243…55162799349107261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.211 × 10⁹⁹(100-digit number)
22110594020308902487…10325598698214522879
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,989,930 XPM·at block #6,843,194 · 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