Block #2,474,702

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2018, 9:13:37 PM · Difficulty 10.9635 · 4,370,662 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5b3896ca9168b23c3a73cb6d8425d89f0e28cc3ce91b0fffe75cf7075cb84c6b

Height

#2,474,702

Difficulty

10.963508

Transactions

58

Size

14.41 KB

Version

2

Bits

0af6a86f

Nonce

265,243,196

Timestamp

1/15/2018, 9:13:37 PM

Confirmations

4,370,662

Merkle Root

b9d58ed6198f29ac61d16c65bf7d847c3c949ec624bc7a802a783dd0f33b5075
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.911 × 10⁹⁴(95-digit number)
29116368395931392233…42259520519202705919
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.911 × 10⁹⁴(95-digit number)
29116368395931392233…42259520519202705919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.823 × 10⁹⁴(95-digit number)
58232736791862784466…84519041038405411839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.164 × 10⁹⁵(96-digit number)
11646547358372556893…69038082076810823679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.329 × 10⁹⁵(96-digit number)
23293094716745113786…38076164153621647359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.658 × 10⁹⁵(96-digit number)
46586189433490227572…76152328307243294719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.317 × 10⁹⁵(96-digit number)
93172378866980455145…52304656614486589439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.863 × 10⁹⁶(97-digit number)
18634475773396091029…04609313228973178879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.726 × 10⁹⁶(97-digit number)
37268951546792182058…09218626457946357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.453 × 10⁹⁶(97-digit number)
74537903093584364116…18437252915892715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.490 × 10⁹⁷(98-digit number)
14907580618716872823…36874505831785431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.981 × 10⁹⁷(98-digit number)
29815161237433745646…73749011663570862079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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:58,007,356 XPM·at block #6,845,363 · 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