Block #452,491

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2014, 3:06:29 PM · Difficulty 10.3901 · 6,364,464 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d10bff6b06e1d5a6ee7cb0dd415e2aa24783610211576c5c11f69866f1ef1283

Height

#452,491

Difficulty

10.390096

Transactions

4

Size

6.52 KB

Version

2

Bits

0a63dd4f

Nonce

27,579

Timestamp

3/20/2014, 3:06:29 PM

Confirmations

6,364,464

Merkle Root

5927fcc34dd249d2b48a00ac2bffc3c7ee32b962c4e4077376c76f7d8351dccf
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.

3.409 × 10⁹⁴(95-digit number)
34094397611728442575…13708092887463102479
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
3.409 × 10⁹⁴(95-digit number)
34094397611728442575…13708092887463102479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.818 × 10⁹⁴(95-digit number)
68188795223456885150…27416185774926204959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.363 × 10⁹⁵(96-digit number)
13637759044691377030…54832371549852409919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.727 × 10⁹⁵(96-digit number)
27275518089382754060…09664743099704819839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.455 × 10⁹⁵(96-digit number)
54551036178765508120…19329486199409639679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.091 × 10⁹⁶(97-digit number)
10910207235753101624…38658972398819279359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.182 × 10⁹⁶(97-digit number)
21820414471506203248…77317944797638558719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.364 × 10⁹⁶(97-digit number)
43640828943012406496…54635889595277117439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.728 × 10⁹⁶(97-digit number)
87281657886024812993…09271779190554234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.745 × 10⁹⁷(98-digit number)
17456331577204962598…18543558381108469759
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,779,675 XPM·at block #6,816,954 · 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