Block #474,758

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2014, 6:34:16 PM · Difficulty 10.4562 · 6,363,818 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
00913ee53a3286a79f89597337db85a10157176d3031de7a96c1f2a988d26a5d

Height

#474,758

Difficulty

10.456250

Transactions

4

Size

1.48 KB

Version

2

Bits

0a74ccc5

Nonce

7,586

Timestamp

4/4/2014, 6:34:16 PM

Confirmations

6,363,818

Merkle Root

6d071ac2c30bd1b79eb6887e82ac4365c0f17666b4d376cf3c559ddeb371445e
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.264 × 10⁹³(94-digit number)
22645513293847621072…14052521760745939779
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.264 × 10⁹³(94-digit number)
22645513293847621072…14052521760745939779
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.529 × 10⁹³(94-digit number)
45291026587695242144…28105043521491879559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.058 × 10⁹³(94-digit number)
90582053175390484289…56210087042983759119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.811 × 10⁹⁴(95-digit number)
18116410635078096857…12420174085967518239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.623 × 10⁹⁴(95-digit number)
36232821270156193715…24840348171935036479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.246 × 10⁹⁴(95-digit number)
72465642540312387431…49680696343870072959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.449 × 10⁹⁵(96-digit number)
14493128508062477486…99361392687740145919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.898 × 10⁹⁵(96-digit number)
28986257016124954972…98722785375480291839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.797 × 10⁹⁵(96-digit number)
57972514032249909945…97445570750960583679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.159 × 10⁹⁶(97-digit number)
11594502806449981989…94891141501921167359
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,952,894 XPM·at block #6,838,575 · 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