Block #402,685

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/13/2014, 2:50:13 PM · Difficulty 10.4371 · 6,424,359 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b3b14ffadf1bf613a797d878bba4193eaa4282be07d7b3fac9b4bf1d46e0675d

Height

#402,685

Difficulty

10.437133

Transactions

2

Size

401 B

Version

2

Bits

0a6fe7f9

Nonce

1,172

Timestamp

2/13/2014, 2:50:13 PM

Confirmations

6,424,359

Merkle Root

9fbc19ef12c6d9e34f8f237babd1ba693699a5b3dd3ff9800057f8856612a113
Transactions (2)
1 in → 1 out9.1843 XPM116 B
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.

1.075 × 10¹⁰⁴(105-digit number)
10757972246647910599…77698202881816002559
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
1.075 × 10¹⁰⁴(105-digit number)
10757972246647910599…77698202881816002559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.151 × 10¹⁰⁴(105-digit number)
21515944493295821199…55396405763632005119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.303 × 10¹⁰⁴(105-digit number)
43031888986591642399…10792811527264010239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.606 × 10¹⁰⁴(105-digit number)
86063777973183284798…21585623054528020479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.721 × 10¹⁰⁵(106-digit number)
17212755594636656959…43171246109056040959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.442 × 10¹⁰⁵(106-digit number)
34425511189273313919…86342492218112081919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.885 × 10¹⁰⁵(106-digit number)
68851022378546627838…72684984436224163839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.377 × 10¹⁰⁶(107-digit number)
13770204475709325567…45369968872448327679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.754 × 10¹⁰⁶(107-digit number)
27540408951418651135…90739937744896655359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.508 × 10¹⁰⁶(107-digit number)
55080817902837302270…81479875489793310719
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,860,533 XPM·at block #6,827,043 · 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