Block #3,003,527

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2019, 12:20:38 PM · Difficulty 11.2056 · 3,833,400 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e425b75a30e844ae826e21e9aab050843817111d6944cc7a31350b1ff43930dd

Height

#3,003,527

Difficulty

11.205603

Transactions

8

Size

2.72 KB

Version

2

Bits

0b34a25f

Nonce

306,944,951

Timestamp

1/10/2019, 12:20:38 PM

Confirmations

3,833,400

Merkle Root

6456be8be04153018403a0354c1926d0e98e3a8f2dce2f61766fa1a54090a9d0
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.439 × 10⁹⁴(95-digit number)
24394862483328520863…66303906888233575039
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.439 × 10⁹⁴(95-digit number)
24394862483328520863…66303906888233575039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.878 × 10⁹⁴(95-digit number)
48789724966657041727…32607813776467150079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.757 × 10⁹⁴(95-digit number)
97579449933314083454…65215627552934300159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.951 × 10⁹⁵(96-digit number)
19515889986662816690…30431255105868600319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.903 × 10⁹⁵(96-digit number)
39031779973325633381…60862510211737200639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.806 × 10⁹⁵(96-digit number)
78063559946651266763…21725020423474401279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.561 × 10⁹⁶(97-digit number)
15612711989330253352…43450040846948802559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.122 × 10⁹⁶(97-digit number)
31225423978660506705…86900081693897605119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.245 × 10⁹⁶(97-digit number)
62450847957321013410…73800163387795210239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.249 × 10⁹⁷(98-digit number)
12490169591464202682…47600326775590420479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.498 × 10⁹⁷(98-digit number)
24980339182928405364…95200653551180840959
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,939,712 XPM·at block #6,836,926 · 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