Block #3,007,468

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2019, 5:54:33 AM · Difficulty 11.2071 · 3,834,323 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
51776277af5979ba864a155e515f033a104f1328f25afdd16615a5274e892a7c

Height

#3,007,468

Difficulty

11.207113

Transactions

25

Size

7.01 KB

Version

2

Bits

0b35055d

Nonce

1,937,864,685

Timestamp

1/13/2019, 5:54:33 AM

Confirmations

3,834,323

Merkle Root

897afe2ab32998c93b15b7c875419c7562d58e70841c3e0812a7d1233aa15470
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.

9.239 × 10⁹³(94-digit number)
92397879550881060368…29140727923935841279
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
9.239 × 10⁹³(94-digit number)
92397879550881060368…29140727923935841279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.847 × 10⁹⁴(95-digit number)
18479575910176212073…58281455847871682559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.695 × 10⁹⁴(95-digit number)
36959151820352424147…16562911695743365119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.391 × 10⁹⁴(95-digit number)
73918303640704848294…33125823391486730239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.478 × 10⁹⁵(96-digit number)
14783660728140969658…66251646782973460479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.956 × 10⁹⁵(96-digit number)
29567321456281939317…32503293565946920959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.913 × 10⁹⁵(96-digit number)
59134642912563878635…65006587131893841919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.182 × 10⁹⁶(97-digit number)
11826928582512775727…30013174263787683839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.365 × 10⁹⁶(97-digit number)
23653857165025551454…60026348527575367679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.730 × 10⁹⁶(97-digit number)
47307714330051102908…20052697055150735359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.461 × 10⁹⁶(97-digit number)
94615428660102205817…40105394110301470719
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:57,978,706 XPM·at block #6,841,790 · 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