Block #474,711

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2014, 6:00:13 PM · Difficulty 10.4540 · 6,350,757 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c0997adf35b5c635da55ef5a856a5709b46500e7594a3bbebb44e940fd0a7290

Height

#474,711

Difficulty

10.453960

Transactions

1

Size

936 B

Version

2

Bits

0a7436bc

Nonce

80,048

Timestamp

4/4/2014, 6:00:13 PM

Confirmations

6,350,757

Merkle Root

2d00e526c3a262086c3fd48ad8d26e6546cbe49d5a1960c44d5506a2fdc17585
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.819 × 10⁹⁶(97-digit number)
38197861786775797165…87934805195095516839
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.819 × 10⁹⁶(97-digit number)
38197861786775797165…87934805195095516839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.639 × 10⁹⁶(97-digit number)
76395723573551594330…75869610390191033679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.527 × 10⁹⁷(98-digit number)
15279144714710318866…51739220780382067359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.055 × 10⁹⁷(98-digit number)
30558289429420637732…03478441560764134719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.111 × 10⁹⁷(98-digit number)
61116578858841275464…06956883121528269439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.222 × 10⁹⁸(99-digit number)
12223315771768255092…13913766243056538879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.444 × 10⁹⁸(99-digit number)
24446631543536510185…27827532486113077759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.889 × 10⁹⁸(99-digit number)
48893263087073020371…55655064972226155519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.778 × 10⁹⁸(99-digit number)
97786526174146040743…11310129944452311039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.955 × 10⁹⁹(100-digit number)
19557305234829208148…22620259888904622079
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,847,836 XPM·at block #6,825,467 · 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