Block #437,557

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2014, 9:27:01 AM · Difficulty 10.3571 · 6,377,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
e4a7f22b527d21e54c3763b883af725a98caf56f146db97ae6737b9878b3ab3a

Height

#437,557

Difficulty

10.357061

Transactions

1

Size

935 B

Version

2

Bits

0a5b685f

Nonce

59,147

Timestamp

3/10/2014, 9:27:01 AM

Confirmations

6,377,433

Merkle Root

0c0bd7af2b7511cd9498cbcc0d9f66ddeefa4690dbb0eb08070e142a1102b0fd
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.110 × 10⁹⁵(96-digit number)
41106056084722272968…10058329788715985919
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.110 × 10⁹⁵(96-digit number)
41106056084722272968…10058329788715985919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.221 × 10⁹⁵(96-digit number)
82212112169444545937…20116659577431971839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.644 × 10⁹⁶(97-digit number)
16442422433888909187…40233319154863943679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.288 × 10⁹⁶(97-digit number)
32884844867777818374…80466638309727887359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.576 × 10⁹⁶(97-digit number)
65769689735555636749…60933276619455774719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.315 × 10⁹⁷(98-digit number)
13153937947111127349…21866553238911549439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.630 × 10⁹⁷(98-digit number)
26307875894222254699…43733106477823098879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.261 × 10⁹⁷(98-digit number)
52615751788444509399…87466212955646197759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.052 × 10⁹⁸(99-digit number)
10523150357688901879…74932425911292395519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.104 × 10⁹⁸(99-digit number)
21046300715377803759…49864851822584791039
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,764,005 XPM·at block #6,814,989 · 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