Block #478,023

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/6/2014, 7:53:02 PM · Difficulty 10.4893 · 6,332,955 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8aaf2bcbb5a8405ee8f098d952c593270b443b569cf5339653b4539c25828cd5

Height

#478,023

Difficulty

10.489328

Transactions

4

Size

885 B

Version

2

Bits

0a7d44a0

Nonce

273,433,157

Timestamp

4/6/2014, 7:53:02 PM

Confirmations

6,332,955

Merkle Root

5525aee780eac76211e19bfcc06219f3f74ac265ce5df24331a650d6a1325ff0
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.

8.003 × 10⁹⁸(99-digit number)
80038775495883014652…44458242309501947519
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
8.003 × 10⁹⁸(99-digit number)
80038775495883014652…44458242309501947519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.600 × 10⁹⁹(100-digit number)
16007755099176602930…88916484619003895039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.201 × 10⁹⁹(100-digit number)
32015510198353205860…77832969238007790079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.403 × 10⁹⁹(100-digit number)
64031020396706411721…55665938476015580159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.280 × 10¹⁰⁰(101-digit number)
12806204079341282344…11331876952031160319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.561 × 10¹⁰⁰(101-digit number)
25612408158682564688…22663753904062320639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.122 × 10¹⁰⁰(101-digit number)
51224816317365129377…45327507808124641279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.024 × 10¹⁰¹(102-digit number)
10244963263473025875…90655015616249282559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.048 × 10¹⁰¹(102-digit number)
20489926526946051750…81310031232498565119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.097 × 10¹⁰¹(102-digit number)
40979853053892103501…62620062464997130239
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,731,927 XPM·at block #6,810,977 · 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.

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