Block #478,760

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/7/2014, 7:06:02 AM · Difficulty 10.4964 · 6,328,852 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e59279678646aa237673c66306a8d5bd90078af4f225797d8d3045aa3563385

Height

#478,760

Difficulty

10.496434

Transactions

1

Size

869 B

Version

2

Bits

0a7f164d

Nonce

24,479

Timestamp

4/7/2014, 7:06:02 AM

Confirmations

6,328,852

Merkle Root

482656e467d08d3d44123235acaacfdfff5b27ef0c74467f207c6185a9275a95
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.700 × 10⁹⁹(100-digit number)
87005448838323648828…71346619177630857279
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.700 × 10⁹⁹(100-digit number)
87005448838323648828…71346619177630857279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.740 × 10¹⁰⁰(101-digit number)
17401089767664729765…42693238355261714559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.480 × 10¹⁰⁰(101-digit number)
34802179535329459531…85386476710523429119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.960 × 10¹⁰⁰(101-digit number)
69604359070658919062…70772953421046858239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.392 × 10¹⁰¹(102-digit number)
13920871814131783812…41545906842093716479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.784 × 10¹⁰¹(102-digit number)
27841743628263567625…83091813684187432959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.568 × 10¹⁰¹(102-digit number)
55683487256527135250…66183627368374865919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.113 × 10¹⁰²(103-digit number)
11136697451305427050…32367254736749731839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.227 × 10¹⁰²(103-digit number)
22273394902610854100…64734509473499463679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.454 × 10¹⁰²(103-digit number)
44546789805221708200…29469018946998927359
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,704,927 XPM·at block #6,807,611 · 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