Block #473,714

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2014, 2:44:06 AM · Difficulty 10.4461 · 6,333,476 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ed6ce46c2fa3f05fa26979bb4b4312d4608f710d3635626144a07f3463612620

Height

#473,714

Difficulty

10.446112

Transactions

4

Size

1.44 KB

Version

2

Bits

0a723467

Nonce

8,580

Timestamp

4/4/2014, 2:44:06 AM

Confirmations

6,333,476

Merkle Root

040a38994e52be20eeec7ea4f765b550078d6de4d67856b5eac44eac3580a460
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.591 × 10¹⁰⁰(101-digit number)
35915380174505823548…88406771203911586559
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.591 × 10¹⁰⁰(101-digit number)
35915380174505823548…88406771203911586559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.183 × 10¹⁰⁰(101-digit number)
71830760349011647096…76813542407823173119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.436 × 10¹⁰¹(102-digit number)
14366152069802329419…53627084815646346239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.873 × 10¹⁰¹(102-digit number)
28732304139604658838…07254169631292692479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.746 × 10¹⁰¹(102-digit number)
57464608279209317677…14508339262585384959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.149 × 10¹⁰²(103-digit number)
11492921655841863535…29016678525170769919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.298 × 10¹⁰²(103-digit number)
22985843311683727070…58033357050341539839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.597 × 10¹⁰²(103-digit number)
45971686623367454141…16066714100683079679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.194 × 10¹⁰²(103-digit number)
91943373246734908283…32133428201366159359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.838 × 10¹⁰³(104-digit number)
18388674649346981656…64266856402732318719
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,701,532 XPM·at block #6,807,189 · 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