Block #528,705

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/6/2014, 7:25:05 PM · Difficulty 10.8880 · 6,280,715 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8aff52984b7b39355be793bace3d5f3b30db3c828a9ecb2f9f92945d6544facb

Height

#528,705

Difficulty

10.887959

Transactions

5

Size

1.80 KB

Version

2

Bits

0ae35148

Nonce

51,601,356

Timestamp

5/6/2014, 7:25:05 PM

Confirmations

6,280,715

Merkle Root

aa60e6a3d905e8361a7e4c4cb439b00c9d96fc19902734ee295219b2242c0f89
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.505 × 10¹⁰⁰(101-digit number)
35055754001148180632…12970743675044106239
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.505 × 10¹⁰⁰(101-digit number)
35055754001148180632…12970743675044106239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.011 × 10¹⁰⁰(101-digit number)
70111508002296361265…25941487350088212479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.402 × 10¹⁰¹(102-digit number)
14022301600459272253…51882974700176424959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.804 × 10¹⁰¹(102-digit number)
28044603200918544506…03765949400352849919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.608 × 10¹⁰¹(102-digit number)
56089206401837089012…07531898800705699839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.121 × 10¹⁰²(103-digit number)
11217841280367417802…15063797601411399679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.243 × 10¹⁰²(103-digit number)
22435682560734835604…30127595202822799359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.487 × 10¹⁰²(103-digit number)
44871365121469671209…60255190405645598719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.974 × 10¹⁰²(103-digit number)
89742730242939342419…20510380811291197439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.794 × 10¹⁰³(104-digit number)
17948546048587868483…41020761622582394879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.589 × 10¹⁰³(104-digit number)
35897092097175736967…82041523245164789759
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,719,429 XPM·at block #6,809,419 · 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